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 /* In what follows, we slightly generalize the rules given in [expr] so
264 as to deal with `long long' and `complex'. First, merge the
266 attributes = (*targetm.merge_type_attributes) (t1, t2);
268 if (SCOPED_ENUM_P (t1) || SCOPED_ENUM_P (t2))
270 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
271 return build_type_attribute_variant (t1, attributes);
276 /* FIXME: Attributes. */
277 gcc_assert (ARITHMETIC_TYPE_P (t1)
278 || TREE_CODE (t1) == VECTOR_TYPE
279 || UNSCOPED_ENUM_P (t1));
280 gcc_assert (ARITHMETIC_TYPE_P (t2)
281 || TREE_CODE (t2) == VECTOR_TYPE
282 || UNSCOPED_ENUM_P (t2));
284 /* If one type is complex, form the common type of the non-complex
285 components, then make that complex. Use T1 or T2 if it is the
287 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
289 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
290 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
292 = type_after_usual_arithmetic_conversions (subtype1, subtype2);
294 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
295 return build_type_attribute_variant (t1, attributes);
296 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
297 return build_type_attribute_variant (t2, attributes);
299 return build_type_attribute_variant (build_complex_type (subtype),
303 if (code1 == VECTOR_TYPE)
305 /* When we get here we should have two vectors of the same size.
306 Just prefer the unsigned one if present. */
307 if (TYPE_UNSIGNED (t1))
308 return build_type_attribute_variant (t1, attributes);
310 return build_type_attribute_variant (t2, attributes);
313 /* If only one is real, use it as the result. */
314 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
315 return build_type_attribute_variant (t1, attributes);
316 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
317 return build_type_attribute_variant (t2, attributes);
319 /* Both real or both integers; use the one with greater precision. */
320 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
321 return build_type_attribute_variant (t1, attributes);
322 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
323 return build_type_attribute_variant (t2, attributes);
325 /* The types are the same; no need to do anything fancy. */
326 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
327 return build_type_attribute_variant (t1, attributes);
329 if (code1 != REAL_TYPE)
331 /* If one is unsigned long long, then convert the other to unsigned
333 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_unsigned_type_node)
334 || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_unsigned_type_node))
335 return build_type_attribute_variant (long_long_unsigned_type_node,
337 /* If one is a long long, and the other is an unsigned long, and
338 long long can represent all the values of an unsigned long, then
339 convert to a long long. Otherwise, convert to an unsigned long
340 long. Otherwise, if either operand is long long, convert the
343 Since we're here, we know the TYPE_PRECISION is the same;
344 therefore converting to long long cannot represent all the values
345 of an unsigned long, so we choose unsigned long long in that
347 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_integer_type_node)
348 || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_integer_type_node))
350 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
351 ? long_long_unsigned_type_node
352 : long_long_integer_type_node);
353 return build_type_attribute_variant (t, attributes);
356 /* Go through the same procedure, but for longs. */
357 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_unsigned_type_node)
358 || same_type_p (TYPE_MAIN_VARIANT (t2), long_unsigned_type_node))
359 return build_type_attribute_variant (long_unsigned_type_node,
361 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_integer_type_node)
362 || same_type_p (TYPE_MAIN_VARIANT (t2), long_integer_type_node))
364 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
365 ? long_unsigned_type_node : long_integer_type_node);
366 return build_type_attribute_variant (t, attributes);
368 /* Otherwise prefer the unsigned one. */
369 if (TYPE_UNSIGNED (t1))
370 return build_type_attribute_variant (t1, attributes);
372 return build_type_attribute_variant (t2, attributes);
376 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_double_type_node)
377 || same_type_p (TYPE_MAIN_VARIANT (t2), long_double_type_node))
378 return build_type_attribute_variant (long_double_type_node,
380 if (same_type_p (TYPE_MAIN_VARIANT (t1), double_type_node)
381 || same_type_p (TYPE_MAIN_VARIANT (t2), double_type_node))
382 return build_type_attribute_variant (double_type_node,
384 if (same_type_p (TYPE_MAIN_VARIANT (t1), float_type_node)
385 || same_type_p (TYPE_MAIN_VARIANT (t2), float_type_node))
386 return build_type_attribute_variant (float_type_node,
389 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
390 the standard C++ floating-point types. Logic earlier in this
391 function has already eliminated the possibility that
392 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
393 compelling reason to choose one or the other. */
394 return build_type_attribute_variant (t1, attributes);
398 /* T1 and T2 are arithmetic or enumeration types. Return the type
399 that will result from the "usual arithmetic conversions" on T1 and
400 T2 as described in [expr]. */
403 type_after_usual_arithmetic_conversions (tree t1, tree t2)
405 gcc_assert (ARITHMETIC_TYPE_P (t1)
406 || TREE_CODE (t1) == VECTOR_TYPE
407 || UNSCOPED_ENUM_P (t1));
408 gcc_assert (ARITHMETIC_TYPE_P (t2)
409 || TREE_CODE (t2) == VECTOR_TYPE
410 || UNSCOPED_ENUM_P (t2));
412 /* Perform the integral promotions. We do not promote real types here. */
413 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1)
414 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2))
416 t1 = type_promotes_to (t1);
417 t2 = type_promotes_to (t2);
420 return cp_common_type (t1, t2);
423 /* Subroutine of composite_pointer_type to implement the recursive
424 case. See that function for documentation fo the parameters. */
427 composite_pointer_type_r (tree t1, tree t2, const char* location,
428 tsubst_flags_t complain)
435 /* Determine the types pointed to by T1 and T2. */
436 if (TREE_CODE (t1) == POINTER_TYPE)
438 pointee1 = TREE_TYPE (t1);
439 pointee2 = TREE_TYPE (t2);
443 pointee1 = TYPE_PTRMEM_POINTED_TO_TYPE (t1);
444 pointee2 = TYPE_PTRMEM_POINTED_TO_TYPE (t2);
449 Otherwise, the composite pointer type is a pointer type
450 similar (_conv.qual_) to the type of one of the operands,
451 with a cv-qualification signature (_conv.qual_) that is the
452 union of the cv-qualification signatures of the operand
454 if (same_type_ignoring_top_level_qualifiers_p (pointee1, pointee2))
455 result_type = pointee1;
456 else if ((TREE_CODE (pointee1) == POINTER_TYPE
457 && TREE_CODE (pointee2) == POINTER_TYPE)
458 || (TYPE_PTR_TO_MEMBER_P (pointee1)
459 && TYPE_PTR_TO_MEMBER_P (pointee2)))
460 result_type = composite_pointer_type_r (pointee1, pointee2, location,
464 if (complain & tf_error)
465 permerror (input_location, "%s between distinct pointer types %qT and %qT "
468 result_type = void_type_node;
470 result_type = cp_build_qualified_type (result_type,
471 (cp_type_quals (pointee1)
472 | cp_type_quals (pointee2)));
473 /* If the original types were pointers to members, so is the
475 if (TYPE_PTR_TO_MEMBER_P (t1))
477 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
478 TYPE_PTRMEM_CLASS_TYPE (t2))
479 && (complain & tf_error))
480 permerror (input_location, "%s between distinct pointer types %qT and %qT "
483 result_type = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
487 result_type = build_pointer_type (result_type);
489 /* Merge the attributes. */
490 attributes = (*targetm.merge_type_attributes) (t1, t2);
491 return build_type_attribute_variant (result_type, attributes);
494 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
495 ARG1 and ARG2 are the values with those types. The LOCATION is a
496 string describing the current location, in case an error occurs.
498 This routine also implements the computation of a common type for
499 pointers-to-members as per [expr.eq]. */
502 composite_pointer_type (tree t1, tree t2, tree arg1, tree arg2,
503 const char* location, tsubst_flags_t complain)
510 If one operand is a null pointer constant, the composite pointer
511 type is the type of the other operand. */
512 if (null_ptr_cst_p (arg1))
514 if (null_ptr_cst_p (arg2))
521 If one of the operands has type "pointer to cv1 void*", then
522 the other has type "pointer to cv2T", and the composite pointer
523 type is "pointer to cv12 void", where cv12 is the union of cv1
526 If either type is a pointer to void, make sure it is T1. */
527 if (TREE_CODE (t2) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t2)))
535 /* Now, if T1 is a pointer to void, merge the qualifiers. */
536 if (TREE_CODE (t1) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t1)))
541 if (TYPE_PTRFN_P (t2) && (complain & tf_error))
542 pedwarn (input_location, OPT_pedantic, "ISO C++ forbids %s "
543 "between pointer of type %<void *%> and pointer-to-function",
546 = cp_build_qualified_type (void_type_node,
547 (cp_type_quals (TREE_TYPE (t1))
548 | cp_type_quals (TREE_TYPE (t2))));
549 result_type = build_pointer_type (result_type);
550 /* Merge the attributes. */
551 attributes = (*targetm.merge_type_attributes) (t1, t2);
552 return build_type_attribute_variant (result_type, attributes);
555 if (c_dialect_objc () && TREE_CODE (t1) == POINTER_TYPE
556 && TREE_CODE (t2) == POINTER_TYPE)
558 if (objc_compare_types (t1, t2, -3, NULL_TREE))
562 /* [expr.eq] permits the application of a pointer conversion to
563 bring the pointers to a common type. */
564 if (TREE_CODE (t1) == POINTER_TYPE && TREE_CODE (t2) == POINTER_TYPE
565 && CLASS_TYPE_P (TREE_TYPE (t1))
566 && CLASS_TYPE_P (TREE_TYPE (t2))
567 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1),
570 class1 = TREE_TYPE (t1);
571 class2 = TREE_TYPE (t2);
573 if (DERIVED_FROM_P (class1, class2))
574 t2 = (build_pointer_type
575 (cp_build_qualified_type (class1, TYPE_QUALS (class2))));
576 else if (DERIVED_FROM_P (class2, class1))
577 t1 = (build_pointer_type
578 (cp_build_qualified_type (class2, TYPE_QUALS (class1))));
581 if (complain & tf_error)
582 error ("%s between distinct pointer types %qT and %qT "
583 "lacks a cast", location, t1, t2);
584 return error_mark_node;
587 /* [expr.eq] permits the application of a pointer-to-member
588 conversion to change the class type of one of the types. */
589 else if (TYPE_PTR_TO_MEMBER_P (t1)
590 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
591 TYPE_PTRMEM_CLASS_TYPE (t2)))
593 class1 = TYPE_PTRMEM_CLASS_TYPE (t1);
594 class2 = TYPE_PTRMEM_CLASS_TYPE (t2);
596 if (DERIVED_FROM_P (class1, class2))
597 t1 = build_ptrmem_type (class2, TYPE_PTRMEM_POINTED_TO_TYPE (t1));
598 else if (DERIVED_FROM_P (class2, class1))
599 t2 = build_ptrmem_type (class1, TYPE_PTRMEM_POINTED_TO_TYPE (t2));
602 if (complain & tf_error)
603 error ("%s between distinct pointer-to-member types %qT and %qT "
604 "lacks a cast", location, t1, t2);
605 return error_mark_node;
609 return composite_pointer_type_r (t1, t2, location, complain);
612 /* Return the merged type of two types.
613 We assume that comptypes has already been done and returned 1;
614 if that isn't so, this may crash.
616 This just combines attributes and default arguments; any other
617 differences would cause the two types to compare unalike. */
620 merge_types (tree t1, tree t2)
622 enum tree_code code1;
623 enum tree_code code2;
626 /* Save time if the two types are the same. */
629 if (original_type (t1) == original_type (t2))
632 /* If one type is nonsense, use the other. */
633 if (t1 == error_mark_node)
635 if (t2 == error_mark_node)
638 /* Merge the attributes. */
639 attributes = (*targetm.merge_type_attributes) (t1, t2);
641 if (TYPE_PTRMEMFUNC_P (t1))
642 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
643 if (TYPE_PTRMEMFUNC_P (t2))
644 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
646 code1 = TREE_CODE (t1);
647 code2 = TREE_CODE (t2);
650 gcc_assert (code1 == TYPENAME_TYPE || code2 == TYPENAME_TYPE);
651 if (code1 == TYPENAME_TYPE)
653 t1 = resolve_typename_type (t1, /*only_current_p=*/true);
654 code1 = TREE_CODE (t1);
658 t2 = resolve_typename_type (t2, /*only_current_p=*/true);
659 code2 = TREE_CODE (t2);
667 /* For two pointers, do this recursively on the target type. */
669 tree target = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
670 int quals = cp_type_quals (t1);
672 if (code1 == POINTER_TYPE)
673 t1 = build_pointer_type (target);
675 t1 = cp_build_reference_type (target, TYPE_REF_IS_RVALUE (t1));
676 t1 = build_type_attribute_variant (t1, attributes);
677 t1 = cp_build_qualified_type (t1, quals);
679 if (TREE_CODE (target) == METHOD_TYPE)
680 t1 = build_ptrmemfunc_type (t1);
689 quals = cp_type_quals (t1);
690 pointee = merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1),
691 TYPE_PTRMEM_POINTED_TO_TYPE (t2));
692 t1 = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
694 t1 = cp_build_qualified_type (t1, quals);
700 tree elt = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
701 /* Save space: see if the result is identical to one of the args. */
702 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
703 return build_type_attribute_variant (t1, attributes);
704 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
705 return build_type_attribute_variant (t2, attributes);
706 /* Merge the element types, and have a size if either arg has one. */
707 t1 = build_cplus_array_type
708 (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
713 /* Function types: prefer the one that specified arg types.
714 If both do, merge the arg types. Also merge the return types. */
716 tree valtype = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
717 tree p1 = TYPE_ARG_TYPES (t1);
718 tree p2 = TYPE_ARG_TYPES (t2);
721 /* Save space: see if the result is identical to one of the args. */
722 if (valtype == TREE_TYPE (t1) && ! p2)
723 return cp_build_type_attribute_variant (t1, attributes);
724 if (valtype == TREE_TYPE (t2) && ! p1)
725 return cp_build_type_attribute_variant (t2, attributes);
727 /* Simple way if one arg fails to specify argument types. */
728 if (p1 == NULL_TREE || TREE_VALUE (p1) == void_type_node)
730 rval = build_function_type (valtype, p2);
731 if ((raises = TYPE_RAISES_EXCEPTIONS (t2)))
732 rval = build_exception_variant (rval, raises);
733 return cp_build_type_attribute_variant (rval, attributes);
735 raises = TYPE_RAISES_EXCEPTIONS (t1);
736 if (p2 == NULL_TREE || TREE_VALUE (p2) == void_type_node)
738 rval = build_function_type (valtype, p1);
740 rval = build_exception_variant (rval, raises);
741 return cp_build_type_attribute_variant (rval, attributes);
744 rval = build_function_type (valtype, commonparms (p1, p2));
745 t1 = build_exception_variant (rval, raises);
751 /* Get this value the long way, since TYPE_METHOD_BASETYPE
752 is just the main variant of this. */
753 tree basetype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2)));
754 tree raises = TYPE_RAISES_EXCEPTIONS (t1);
757 /* If this was a member function type, get back to the
758 original type of type member function (i.e., without
759 the class instance variable up front. */
760 t1 = build_function_type (TREE_TYPE (t1),
761 TREE_CHAIN (TYPE_ARG_TYPES (t1)));
762 t2 = build_function_type (TREE_TYPE (t2),
763 TREE_CHAIN (TYPE_ARG_TYPES (t2)));
764 t3 = merge_types (t1, t2);
765 t3 = build_method_type_directly (basetype, TREE_TYPE (t3),
766 TYPE_ARG_TYPES (t3));
767 t1 = build_exception_variant (t3, raises);
772 /* There is no need to merge attributes into a TYPENAME_TYPE.
773 When the type is instantiated it will have whatever
774 attributes result from the instantiation. */
780 if (attribute_list_equal (TYPE_ATTRIBUTES (t1), attributes))
782 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2), attributes))
785 return cp_build_type_attribute_variant (t1, attributes);
788 /* Wrapper around cp_common_type that is used by c-common.c and other
789 front end optimizations that remove promotions.
791 Return the common type for two arithmetic types T1 and T2 under the
792 usual arithmetic conversions. The default conversions have already
793 been applied, and enumerated types converted to their compatible
797 common_type (tree t1, tree t2)
799 /* If one type is nonsense, use the other */
800 if (t1 == error_mark_node)
802 if (t2 == error_mark_node)
805 return cp_common_type (t1, t2);
808 /* Return the common type of two pointer types T1 and T2. This is the
809 type for the result of most arithmetic operations if the operands
810 have the given two types.
812 We assume that comp_target_types has already been done and returned
813 nonzero; if that isn't so, this may crash. */
816 common_pointer_type (tree t1, tree t2)
818 gcc_assert ((TYPE_PTR_P (t1) && TYPE_PTR_P (t2))
819 || (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2))
820 || (TYPE_PTRMEMFUNC_P (t1) && TYPE_PTRMEMFUNC_P (t2)));
822 return composite_pointer_type (t1, t2, error_mark_node, error_mark_node,
823 "conversion", tf_warning_or_error);
826 /* Compare two exception specifier types for exactness or subsetness, if
827 allowed. Returns false for mismatch, true for match (same, or
830 [except.spec] "If a class X ... objects of class X or any class publicly
831 and unambiguously derived from X. Similarly, if a pointer type Y * ...
832 exceptions of type Y * or that are pointers to any type publicly and
833 unambiguously derived from Y. Otherwise a function only allows exceptions
834 that have the same type ..."
835 This does not mention cv qualifiers and is different to what throw
836 [except.throw] and catch [except.catch] will do. They will ignore the
837 top level cv qualifiers, and allow qualifiers in the pointer to class
840 We implement the letter of the standard. */
843 comp_except_types (tree a, tree b, bool exact)
845 if (same_type_p (a, b))
849 if (cp_type_quals (a) || cp_type_quals (b))
852 if (TREE_CODE (a) == POINTER_TYPE
853 && TREE_CODE (b) == POINTER_TYPE)
857 if (cp_type_quals (a) || cp_type_quals (b))
861 if (TREE_CODE (a) != RECORD_TYPE
862 || TREE_CODE (b) != RECORD_TYPE)
865 if (PUBLICLY_UNIQUELY_DERIVED_P (a, b))
871 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
872 If EXACT is false, T2 can be stricter than T1 (according to 15.4/7),
873 otherwise it must be exact. Exception lists are unordered, but
874 we've already filtered out duplicates. Most lists will be in order,
875 we should try to make use of that. */
878 comp_except_specs (const_tree t1, const_tree t2, bool exact)
887 if (t1 == NULL_TREE) /* T1 is ... */
888 return t2 == NULL_TREE || !exact;
889 if (!TREE_VALUE (t1)) /* t1 is EMPTY */
890 return t2 != NULL_TREE && !TREE_VALUE (t2);
891 if (t2 == NULL_TREE) /* T2 is ... */
893 if (TREE_VALUE (t1) && !TREE_VALUE (t2)) /* T2 is EMPTY, T1 is not */
896 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
897 Count how many we find, to determine exactness. For exact matching and
898 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
900 for (base = t1; t2 != NULL_TREE; t2 = TREE_CHAIN (t2))
902 for (probe = base; probe != NULL_TREE; probe = TREE_CHAIN (probe))
904 tree a = TREE_VALUE (probe);
905 tree b = TREE_VALUE (t2);
907 if (comp_except_types (a, b, exact))
909 if (probe == base && exact)
910 base = TREE_CHAIN (probe);
915 if (probe == NULL_TREE)
918 return !exact || base == NULL_TREE || length == list_length (t1);
921 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
922 [] can match [size]. */
925 comp_array_types (const_tree t1, const_tree t2, bool allow_redeclaration)
934 /* The type of the array elements must be the same. */
935 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
938 d1 = TYPE_DOMAIN (t1);
939 d2 = TYPE_DOMAIN (t2);
944 /* If one of the arrays is dimensionless, and the other has a
945 dimension, they are of different types. However, it is valid to
953 declarations for an array object can specify
954 array types that differ by the presence or absence of a major
955 array bound (_dcl.array_). */
957 return allow_redeclaration;
959 /* Check that the dimensions are the same. */
961 if (!cp_tree_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2)))
963 max1 = TYPE_MAX_VALUE (d1);
964 max2 = TYPE_MAX_VALUE (d2);
965 if (processing_template_decl && !abi_version_at_least (2)
966 && !value_dependent_expression_p (max1)
967 && !value_dependent_expression_p (max2))
969 /* With abi-1 we do not fold non-dependent array bounds, (and
970 consequently mangle them incorrectly). We must therefore
971 fold them here, to verify the domains have the same
977 if (!cp_tree_equal (max1, max2))
983 /* Subroutine in comptypes. */
986 structural_comptypes (tree t1, tree t2, int strict)
991 /* Suppress errors caused by previously reported errors. */
992 if (t1 == error_mark_node || t2 == error_mark_node)
995 gcc_assert (TYPE_P (t1) && TYPE_P (t2));
997 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
998 current instantiation. */
999 if (TREE_CODE (t1) == TYPENAME_TYPE)
1000 t1 = resolve_typename_type (t1, /*only_current_p=*/true);
1002 if (TREE_CODE (t2) == TYPENAME_TYPE)
1003 t2 = resolve_typename_type (t2, /*only_current_p=*/true);
1005 if (TYPE_PTRMEMFUNC_P (t1))
1006 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
1007 if (TYPE_PTRMEMFUNC_P (t2))
1008 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
1010 /* Different classes of types can't be compatible. */
1011 if (TREE_CODE (t1) != TREE_CODE (t2))
1014 /* Qualifiers must match. For array types, we will check when we
1015 recur on the array element types. */
1016 if (TREE_CODE (t1) != ARRAY_TYPE
1017 && TYPE_QUALS (t1) != TYPE_QUALS (t2))
1019 if (TYPE_FOR_JAVA (t1) != TYPE_FOR_JAVA (t2))
1022 /* Allow for two different type nodes which have essentially the same
1023 definition. Note that we already checked for equality of the type
1024 qualifiers (just above). */
1026 if (TREE_CODE (t1) != ARRAY_TYPE
1027 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
1030 /* Compare the types. Break out if they could be the same. */
1031 switch (TREE_CODE (t1))
1035 /* All void and bool types are the same. */
1039 case FIXED_POINT_TYPE:
1041 /* With these nodes, we can't determine type equivalence by
1042 looking at what is stored in the nodes themselves, because
1043 two nodes might have different TYPE_MAIN_VARIANTs but still
1044 represent the same type. For example, wchar_t and int could
1045 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1046 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1047 and are distinct types. On the other hand, int and the
1050 typedef int INT __attribute((may_alias));
1052 have identical properties, different TYPE_MAIN_VARIANTs, but
1053 represent the same type. The canonical type system keeps
1054 track of equivalence in this case, so we fall back on it. */
1055 return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
1057 case TEMPLATE_TEMPLATE_PARM:
1058 case BOUND_TEMPLATE_TEMPLATE_PARM:
1059 if (TEMPLATE_TYPE_IDX (t1) != TEMPLATE_TYPE_IDX (t2)
1060 || TEMPLATE_TYPE_LEVEL (t1) != TEMPLATE_TYPE_LEVEL (t2)
1061 || (TEMPLATE_TYPE_PARAMETER_PACK (t1)
1062 != TEMPLATE_TYPE_PARAMETER_PACK (t2)))
1064 if (!comp_template_parms
1065 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1)),
1066 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2))))
1068 if (TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM)
1070 /* Don't check inheritance. */
1071 strict = COMPARE_STRICT;
1076 if (TYPE_TEMPLATE_INFO (t1) && TYPE_TEMPLATE_INFO (t2)
1077 && (TYPE_TI_TEMPLATE (t1) == TYPE_TI_TEMPLATE (t2)
1078 || TREE_CODE (t1) == BOUND_TEMPLATE_TEMPLATE_PARM)
1079 && comp_template_args (TYPE_TI_ARGS (t1), TYPE_TI_ARGS (t2)))
1082 if ((strict & COMPARE_BASE) && DERIVED_FROM_P (t1, t2))
1084 else if ((strict & COMPARE_DERIVED) && DERIVED_FROM_P (t2, t1))
1090 if (!comptypes (TYPE_OFFSET_BASETYPE (t1), TYPE_OFFSET_BASETYPE (t2),
1091 strict & ~COMPARE_REDECLARATION))
1093 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1097 case REFERENCE_TYPE:
1098 if (TYPE_REF_IS_RVALUE (t1) != TYPE_REF_IS_RVALUE (t2))
1100 /* fall through to checks for pointer types */
1103 if (TYPE_MODE (t1) != TYPE_MODE (t2)
1104 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2)
1105 || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1111 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1113 if (!compparms (TYPE_ARG_TYPES (t1), TYPE_ARG_TYPES (t2)))
1118 /* Target types must match incl. qualifiers. */
1119 if (!comp_array_types (t1, t2, !!(strict & COMPARE_REDECLARATION)))
1123 case TEMPLATE_TYPE_PARM:
1124 if (TEMPLATE_TYPE_IDX (t1) != TEMPLATE_TYPE_IDX (t2)
1125 || TEMPLATE_TYPE_LEVEL (t1) != TEMPLATE_TYPE_LEVEL (t2)
1126 || (TEMPLATE_TYPE_PARAMETER_PACK (t1)
1127 != TEMPLATE_TYPE_PARAMETER_PACK (t2)))
1132 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1),
1133 TYPENAME_TYPE_FULLNAME (t2)))
1135 if (!same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)))
1139 case UNBOUND_CLASS_TEMPLATE:
1140 if (!cp_tree_equal (TYPE_IDENTIFIER (t1), TYPE_IDENTIFIER (t2)))
1142 if (!same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)))
1147 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1152 if (TYPE_VECTOR_SUBPARTS (t1) != TYPE_VECTOR_SUBPARTS (t2)
1153 || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1157 case TYPE_PACK_EXPANSION:
1158 return same_type_p (PACK_EXPANSION_PATTERN (t1),
1159 PACK_EXPANSION_PATTERN (t2));
1162 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1)
1163 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2)
1164 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1),
1165 DECLTYPE_TYPE_EXPR (t2)))
1173 /* If we get here, we know that from a target independent POV the
1174 types are the same. Make sure the target attributes are also
1176 return targetm.comp_type_attributes (t1, t2);
1179 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1180 is a bitwise-or of the COMPARE_* flags. */
1183 comptypes (tree t1, tree t2, int strict)
1185 if (strict == COMPARE_STRICT)
1190 if (t1 == error_mark_node || t2 == error_mark_node)
1193 if (TYPE_STRUCTURAL_EQUALITY_P (t1) || TYPE_STRUCTURAL_EQUALITY_P (t2))
1194 /* At least one of the types requires structural equality, so
1195 perform a deep check. */
1196 return structural_comptypes (t1, t2, strict);
1198 #ifdef ENABLE_CHECKING
1199 if (USE_CANONICAL_TYPES)
1201 bool result = structural_comptypes (t1, t2, strict);
1203 if (result && TYPE_CANONICAL (t1) != TYPE_CANONICAL (t2))
1204 /* The two types are structurally equivalent, but their
1205 canonical types were different. This is a failure of the
1206 canonical type propagation code.*/
1208 ("canonical types differ for identical types %T and %T",
1210 else if (!result && TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2))
1211 /* Two types are structurally different, but the canonical
1212 types are the same. This means we were over-eager in
1213 assigning canonical types. */
1215 ("same canonical type node for different types %T and %T",
1221 if (USE_CANONICAL_TYPES)
1222 return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
1225 return structural_comptypes (t1, t2, strict);
1227 else if (strict == COMPARE_STRUCTURAL)
1228 return structural_comptypes (t1, t2, COMPARE_STRICT);
1230 return structural_comptypes (t1, t2, strict);
1233 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1236 at_least_as_qualified_p (const_tree type1, const_tree type2)
1238 int q1 = cp_type_quals (type1);
1239 int q2 = cp_type_quals (type2);
1241 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1242 return (q1 & q2) == q2;
1245 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1246 more cv-qualified that TYPE1, and 0 otherwise. */
1249 comp_cv_qualification (const_tree type1, const_tree type2)
1251 int q1 = cp_type_quals (type1);
1252 int q2 = cp_type_quals (type2);
1257 if ((q1 & q2) == q2)
1259 else if ((q1 & q2) == q1)
1265 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1266 subset of the cv-qualification signature of TYPE2, and the types
1267 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1270 comp_cv_qual_signature (tree type1, tree type2)
1272 if (comp_ptr_ttypes_real (type2, type1, -1))
1274 else if (comp_ptr_ttypes_real (type1, type2, -1))
1280 /* Subroutines of `comptypes'. */
1282 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1283 equivalent in the sense that functions with those parameter types
1284 can have equivalent types. The two lists must be equivalent,
1285 element by element. */
1288 compparms (const_tree parms1, const_tree parms2)
1292 /* An unspecified parmlist matches any specified parmlist
1293 whose argument types don't need default promotions. */
1295 for (t1 = parms1, t2 = parms2;
1297 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
1299 /* If one parmlist is shorter than the other,
1300 they fail to match. */
1303 if (!same_type_p (TREE_VALUE (t1), TREE_VALUE (t2)))
1310 /* Process a sizeof or alignof expression where the operand is a
1314 cxx_sizeof_or_alignof_type (tree type, enum tree_code op, bool complain)
1319 gcc_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR);
1320 if (type == error_mark_node)
1321 return error_mark_node;
1323 type = non_reference (type);
1324 if (TREE_CODE (type) == METHOD_TYPE)
1327 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
1328 "invalid application of %qs to a member function",
1329 operator_name_info[(int) op].name);
1330 value = size_one_node;
1333 dependent_p = dependent_type_p (type);
1335 complete_type (type);
1337 /* VLA types will have a non-constant size. In the body of an
1338 uninstantiated template, we don't need to try to compute the
1339 value, because the sizeof expression is not an integral
1340 constant expression in that case. And, if we do try to
1341 compute the value, we'll likely end up with SAVE_EXPRs, which
1342 the template substitution machinery does not expect to see. */
1343 || (processing_template_decl
1344 && COMPLETE_TYPE_P (type)
1345 && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST))
1347 value = build_min (op, size_type_node, type);
1348 TREE_READONLY (value) = 1;
1352 return c_sizeof_or_alignof_type (complete_type (type),
1357 /* Return the size of the type, without producing any warnings for
1358 types whose size cannot be taken. This routine should be used only
1359 in some other routine that has already produced a diagnostic about
1360 using the size of such a type. */
1362 cxx_sizeof_nowarn (tree type)
1364 if (TREE_CODE (type) == FUNCTION_TYPE
1365 || TREE_CODE (type) == VOID_TYPE
1366 || TREE_CODE (type) == ERROR_MARK)
1367 return size_one_node;
1368 else if (!COMPLETE_TYPE_P (type))
1369 return size_zero_node;
1371 return cxx_sizeof_or_alignof_type (type, SIZEOF_EXPR, false);
1374 /* Process a sizeof expression where the operand is an expression. */
1377 cxx_sizeof_expr (tree e, tsubst_flags_t complain)
1379 if (e == error_mark_node)
1380 return error_mark_node;
1382 if (processing_template_decl)
1384 e = build_min (SIZEOF_EXPR, size_type_node, e);
1385 TREE_SIDE_EFFECTS (e) = 0;
1386 TREE_READONLY (e) = 1;
1391 if (TREE_CODE (e) == COMPONENT_REF
1392 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1393 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1395 if (complain & tf_error)
1396 error ("invalid application of %<sizeof%> to a bit-field");
1398 return error_mark_node;
1401 else if (is_overloaded_fn (e))
1403 if (complain & tf_error)
1404 permerror (input_location, "ISO C++ forbids applying %<sizeof%> to an expression of "
1407 return error_mark_node;
1410 else if (type_unknown_p (e))
1412 if (complain & tf_error)
1413 cxx_incomplete_type_error (e, TREE_TYPE (e));
1415 return error_mark_node;
1421 return cxx_sizeof_or_alignof_type (e, SIZEOF_EXPR, complain & tf_error);
1424 /* Implement the __alignof keyword: Return the minimum required
1425 alignment of E, measured in bytes. For VAR_DECL's and
1426 FIELD_DECL's return DECL_ALIGN (which can be set from an
1427 "aligned" __attribute__ specification). */
1430 cxx_alignof_expr (tree e, tsubst_flags_t complain)
1434 if (e == error_mark_node)
1435 return error_mark_node;
1437 if (processing_template_decl)
1439 e = build_min (ALIGNOF_EXPR, size_type_node, e);
1440 TREE_SIDE_EFFECTS (e) = 0;
1441 TREE_READONLY (e) = 1;
1446 if (TREE_CODE (e) == VAR_DECL)
1447 t = size_int (DECL_ALIGN_UNIT (e));
1448 else if (TREE_CODE (e) == COMPONENT_REF
1449 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1450 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1452 if (complain & tf_error)
1453 error ("invalid application of %<__alignof%> to a bit-field");
1455 return error_mark_node;
1458 else if (TREE_CODE (e) == COMPONENT_REF
1459 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL)
1460 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e, 1)));
1461 else if (is_overloaded_fn (e))
1463 if (complain & tf_error)
1464 permerror (input_location, "ISO C++ forbids applying %<__alignof%> to an expression of "
1467 return error_mark_node;
1468 if (TREE_CODE (e) == FUNCTION_DECL)
1469 t = size_int (DECL_ALIGN_UNIT (e));
1473 else if (type_unknown_p (e))
1475 if (complain & tf_error)
1476 cxx_incomplete_type_error (e, TREE_TYPE (e));
1478 return error_mark_node;
1482 return cxx_sizeof_or_alignof_type (TREE_TYPE (e), ALIGNOF_EXPR,
1483 complain & tf_error);
1485 return fold_convert (size_type_node, t);
1488 /* Process a sizeof or alignof expression E with code OP where the operand
1489 is an expression. */
1492 cxx_sizeof_or_alignof_expr (tree e, enum tree_code op, bool complain)
1494 if (op == SIZEOF_EXPR)
1495 return cxx_sizeof_expr (e, complain? tf_warning_or_error : tf_none);
1497 return cxx_alignof_expr (e, complain? tf_warning_or_error : tf_none);
1500 /* EXPR is being used in a context that is not a function call.
1505 The expression can be used only as the left-hand operand of a
1506 member function call.
1508 [expr.mptr.operator]
1510 If the result of .* or ->* is a function, then that result can be
1511 used only as the operand for the function call operator ().
1513 by issuing an error message if appropriate. Returns true iff EXPR
1514 violates these rules. */
1517 invalid_nonstatic_memfn_p (const_tree expr, tsubst_flags_t complain)
1519 if (expr && DECL_NONSTATIC_MEMBER_FUNCTION_P (expr))
1521 if (complain & tf_error)
1522 error ("invalid use of non-static member function");
1528 /* If EXP is a reference to a bitfield, and the type of EXP does not
1529 match the declared type of the bitfield, return the declared type
1530 of the bitfield. Otherwise, return NULL_TREE. */
1533 is_bitfield_expr_with_lowered_type (const_tree exp)
1535 switch (TREE_CODE (exp))
1538 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1)
1539 ? TREE_OPERAND (exp, 1)
1540 : TREE_OPERAND (exp, 0)))
1542 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 2));
1545 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1));
1549 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
1555 field = TREE_OPERAND (exp, 1);
1556 if (TREE_CODE (field) != FIELD_DECL || !DECL_BIT_FIELD_TYPE (field))
1558 if (same_type_ignoring_top_level_qualifiers_p
1559 (TREE_TYPE (exp), DECL_BIT_FIELD_TYPE (field)))
1561 return DECL_BIT_FIELD_TYPE (field);
1565 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp, 0)))
1566 == TYPE_MAIN_VARIANT (TREE_TYPE (exp)))
1567 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
1575 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1576 bitfield with a lowered type, the type of EXP is returned, rather
1580 unlowered_expr_type (const_tree exp)
1584 type = is_bitfield_expr_with_lowered_type (exp);
1586 type = TREE_TYPE (exp);
1591 /* Perform the conversions in [expr] that apply when an lvalue appears
1592 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1593 function-to-pointer conversions. In addition, manifest constants
1594 are replaced by their values, and bitfield references are converted
1595 to their declared types.
1597 Although the returned value is being used as an rvalue, this
1598 function does not wrap the returned expression in a
1599 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1600 that the return value is no longer an lvalue. */
1603 decay_conversion (tree exp)
1606 enum tree_code code;
1608 type = TREE_TYPE (exp);
1609 if (type == error_mark_node)
1610 return error_mark_node;
1612 if (type_unknown_p (exp))
1614 cxx_incomplete_type_error (exp, TREE_TYPE (exp));
1615 return error_mark_node;
1618 exp = decl_constant_value (exp);
1619 if (error_operand_p (exp))
1620 return error_mark_node;
1622 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1623 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1624 code = TREE_CODE (type);
1625 if (code == VOID_TYPE)
1627 error ("void value not ignored as it ought to be");
1628 return error_mark_node;
1630 if (invalid_nonstatic_memfn_p (exp, tf_warning_or_error))
1631 return error_mark_node;
1632 if (code == FUNCTION_TYPE || is_overloaded_fn (exp))
1633 return cp_build_unary_op (ADDR_EXPR, exp, 0, tf_warning_or_error);
1634 if (code == ARRAY_TYPE)
1639 if (TREE_CODE (exp) == INDIRECT_REF)
1640 return build_nop (build_pointer_type (TREE_TYPE (type)),
1641 TREE_OPERAND (exp, 0));
1643 if (TREE_CODE (exp) == COMPOUND_EXPR)
1645 tree op1 = decay_conversion (TREE_OPERAND (exp, 1));
1646 return build2 (COMPOUND_EXPR, TREE_TYPE (op1),
1647 TREE_OPERAND (exp, 0), op1);
1651 && ! (TREE_CODE (exp) == CONSTRUCTOR && TREE_STATIC (exp)))
1653 error ("invalid use of non-lvalue array");
1654 return error_mark_node;
1657 ptrtype = build_pointer_type (TREE_TYPE (type));
1659 if (TREE_CODE (exp) == VAR_DECL)
1661 if (!cxx_mark_addressable (exp))
1662 return error_mark_node;
1663 adr = build_nop (ptrtype, build_address (exp));
1666 /* This way is better for a COMPONENT_REF since it can
1667 simplify the offset for a component. */
1668 adr = cp_build_unary_op (ADDR_EXPR, exp, 1, tf_warning_or_error);
1669 return cp_convert (ptrtype, adr);
1672 /* If a bitfield is used in a context where integral promotion
1673 applies, then the caller is expected to have used
1674 default_conversion. That function promotes bitfields correctly
1675 before calling this function. At this point, if we have a
1676 bitfield referenced, we may assume that is not subject to
1677 promotion, and that, therefore, the type of the resulting rvalue
1678 is the declared type of the bitfield. */
1679 exp = convert_bitfield_to_declared_type (exp);
1681 /* We do not call rvalue() here because we do not want to wrap EXP
1682 in a NON_LVALUE_EXPR. */
1686 Non-class rvalues always have cv-unqualified types. */
1687 type = TREE_TYPE (exp);
1688 if (!CLASS_TYPE_P (type) && cp_type_quals (type))
1689 exp = build_nop (TYPE_MAIN_VARIANT (type), exp);
1694 /* Perform preparatory conversions, as part of the "usual arithmetic
1695 conversions". In particular, as per [expr]:
1697 Whenever an lvalue expression appears as an operand of an
1698 operator that expects the rvalue for that operand, the
1699 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1700 standard conversions are applied to convert the expression to an
1703 In addition, we perform integral promotions here, as those are
1704 applied to both operands to a binary operator before determining
1705 what additional conversions should apply. */
1708 default_conversion (tree exp)
1710 /* Perform the integral promotions first so that bitfield
1711 expressions (which may promote to "int", even if the bitfield is
1712 declared "unsigned") are promoted correctly. */
1713 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp)))
1714 exp = perform_integral_promotions (exp);
1715 /* Perform the other conversions. */
1716 exp = decay_conversion (exp);
1721 /* EXPR is an expression with an integral or enumeration type.
1722 Perform the integral promotions in [conv.prom], and return the
1726 perform_integral_promotions (tree expr)
1733 If the bitfield has an enumerated type, it is treated as any
1734 other value of that type for promotion purposes. */
1735 type = is_bitfield_expr_with_lowered_type (expr);
1736 if (!type || TREE_CODE (type) != ENUMERAL_TYPE)
1737 type = TREE_TYPE (expr);
1738 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
1739 promoted_type = type_promotes_to (type);
1740 if (type != promoted_type)
1741 expr = cp_convert (promoted_type, expr);
1745 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1746 decay_conversion to one. */
1749 string_conv_p (const_tree totype, const_tree exp, int warn)
1753 if (TREE_CODE (totype) != POINTER_TYPE)
1756 t = TREE_TYPE (totype);
1757 if (!same_type_p (t, char_type_node)
1758 && !same_type_p (t, char16_type_node)
1759 && !same_type_p (t, char32_type_node)
1760 && !same_type_p (t, wchar_type_node))
1763 if (TREE_CODE (exp) == STRING_CST)
1765 /* Make sure that we don't try to convert between char and wide chars. */
1766 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp))), t))
1771 /* Is this a string constant which has decayed to 'const char *'? */
1772 t = build_pointer_type (build_qualified_type (t, TYPE_QUAL_CONST));
1773 if (!same_type_p (TREE_TYPE (exp), t))
1776 if (TREE_CODE (exp) != ADDR_EXPR
1777 || TREE_CODE (TREE_OPERAND (exp, 0)) != STRING_CST)
1781 /* This warning is not very useful, as it complains about printf. */
1783 warning (OPT_Wwrite_strings,
1784 "deprecated conversion from string constant to %qT",
1790 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
1791 can, for example, use as an lvalue. This code used to be in
1792 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
1793 expressions, where we're dealing with aggregates. But now it's again only
1794 called from unary_complex_lvalue. The case (in particular) that led to
1795 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
1799 rationalize_conditional_expr (enum tree_code code, tree t,
1800 tsubst_flags_t complain)
1802 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
1803 the first operand is always the one to be used if both operands
1804 are equal, so we know what conditional expression this used to be. */
1805 if (TREE_CODE (t) == MIN_EXPR || TREE_CODE (t) == MAX_EXPR)
1807 tree op0 = TREE_OPERAND (t, 0);
1808 tree op1 = TREE_OPERAND (t, 1);
1810 /* The following code is incorrect if either operand side-effects. */
1811 gcc_assert (!TREE_SIDE_EFFECTS (op0)
1812 && !TREE_SIDE_EFFECTS (op1));
1814 build_conditional_expr (build_x_binary_op ((TREE_CODE (t) == MIN_EXPR
1815 ? LE_EXPR : GE_EXPR),
1816 op0, TREE_CODE (op0),
1817 op1, TREE_CODE (op1),
1818 /*overloaded_p=*/NULL,
1820 cp_build_unary_op (code, op0, 0, complain),
1821 cp_build_unary_op (code, op1, 0, complain),
1826 build_conditional_expr (TREE_OPERAND (t, 0),
1827 cp_build_unary_op (code, TREE_OPERAND (t, 1), 0,
1829 cp_build_unary_op (code, TREE_OPERAND (t, 2), 0,
1834 /* Given the TYPE of an anonymous union field inside T, return the
1835 FIELD_DECL for the field. If not found return NULL_TREE. Because
1836 anonymous unions can nest, we must also search all anonymous unions
1837 that are directly reachable. */
1840 lookup_anon_field (tree t, tree type)
1844 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
1846 if (TREE_STATIC (field))
1848 if (TREE_CODE (field) != FIELD_DECL || DECL_ARTIFICIAL (field))
1851 /* If we find it directly, return the field. */
1852 if (DECL_NAME (field) == NULL_TREE
1853 && type == TYPE_MAIN_VARIANT (TREE_TYPE (field)))
1858 /* Otherwise, it could be nested, search harder. */
1859 if (DECL_NAME (field) == NULL_TREE
1860 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
1862 tree subfield = lookup_anon_field (TREE_TYPE (field), type);
1870 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
1871 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
1872 non-NULL, it indicates the path to the base used to name MEMBER.
1873 If PRESERVE_REFERENCE is true, the expression returned will have
1874 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
1875 returned will have the type referred to by the reference.
1877 This function does not perform access control; that is either done
1878 earlier by the parser when the name of MEMBER is resolved to MEMBER
1879 itself, or later when overload resolution selects one of the
1880 functions indicated by MEMBER. */
1883 build_class_member_access_expr (tree object, tree member,
1884 tree access_path, bool preserve_reference,
1885 tsubst_flags_t complain)
1889 tree result = NULL_TREE;
1891 if (error_operand_p (object) || error_operand_p (member))
1892 return error_mark_node;
1894 gcc_assert (DECL_P (member) || BASELINK_P (member));
1898 The type of the first expression shall be "class object" (of a
1900 object_type = TREE_TYPE (object);
1901 if (!currently_open_class (object_type)
1902 && !complete_type_or_else (object_type, object))
1903 return error_mark_node;
1904 if (!CLASS_TYPE_P (object_type))
1906 if (complain & tf_error)
1907 error ("request for member %qD in %qE, which is of non-class type %qT",
1908 member, object, object_type);
1909 return error_mark_node;
1912 /* The standard does not seem to actually say that MEMBER must be a
1913 member of OBJECT_TYPE. However, that is clearly what is
1915 if (DECL_P (member))
1917 member_scope = DECL_CLASS_CONTEXT (member);
1919 if (TREE_DEPRECATED (member))
1920 warn_deprecated_use (member);
1923 member_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (member));
1924 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
1925 presently be the anonymous union. Go outwards until we find a
1926 type related to OBJECT_TYPE. */
1927 while (ANON_AGGR_TYPE_P (member_scope)
1928 && !same_type_ignoring_top_level_qualifiers_p (member_scope,
1930 member_scope = TYPE_CONTEXT (member_scope);
1931 if (!member_scope || !DERIVED_FROM_P (member_scope, object_type))
1933 if (complain & tf_error)
1935 if (TREE_CODE (member) == FIELD_DECL)
1936 error ("invalid use of nonstatic data member %qE", member);
1938 error ("%qD is not a member of %qT", member, object_type);
1940 return error_mark_node;
1943 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
1944 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
1945 in the front end; only _DECLs and _REFs are lvalues in the back end. */
1947 tree temp = unary_complex_lvalue (ADDR_EXPR, object);
1949 object = cp_build_indirect_ref (temp, NULL, complain);
1952 /* In [expr.ref], there is an explicit list of the valid choices for
1953 MEMBER. We check for each of those cases here. */
1954 if (TREE_CODE (member) == VAR_DECL)
1956 /* A static data member. */
1958 /* If OBJECT has side-effects, they are supposed to occur. */
1959 if (TREE_SIDE_EFFECTS (object))
1960 result = build2 (COMPOUND_EXPR, TREE_TYPE (result), object, result);
1962 else if (TREE_CODE (member) == FIELD_DECL)
1964 /* A non-static data member. */
1969 null_object_p = (TREE_CODE (object) == INDIRECT_REF
1970 && integer_zerop (TREE_OPERAND (object, 0)));
1972 /* Convert OBJECT to the type of MEMBER. */
1973 if (!same_type_p (TYPE_MAIN_VARIANT (object_type),
1974 TYPE_MAIN_VARIANT (member_scope)))
1979 binfo = lookup_base (access_path ? access_path : object_type,
1980 member_scope, ba_unique, &kind);
1981 if (binfo == error_mark_node)
1982 return error_mark_node;
1984 /* It is invalid to try to get to a virtual base of a
1985 NULL object. The most common cause is invalid use of
1987 if (null_object_p && kind == bk_via_virtual)
1989 if (complain & tf_error)
1991 error ("invalid access to non-static data member %qD of "
1994 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
1996 return error_mark_node;
1999 /* Convert to the base. */
2000 object = build_base_path (PLUS_EXPR, object, binfo,
2002 /* If we found the base successfully then we should be able
2003 to convert to it successfully. */
2004 gcc_assert (object != error_mark_node);
2007 /* Complain about other invalid uses of offsetof, even though they will
2008 give the right answer. Note that we complain whether or not they
2009 actually used the offsetof macro, since there's no way to know at this
2010 point. So we just give a warning, instead of a pedwarn. */
2011 /* Do not produce this warning for base class field references, because
2012 we know for a fact that didn't come from offsetof. This does occur
2013 in various testsuite cases where a null object is passed where a
2014 vtable access is required. */
2015 if (null_object_p && warn_invalid_offsetof
2016 && CLASSTYPE_NON_POD_P (object_type)
2017 && !DECL_FIELD_IS_BASE (member)
2019 && (complain & tf_warning))
2021 warning (OPT_Winvalid_offsetof,
2022 "invalid access to non-static data member %qD "
2023 " of NULL object", member);
2024 warning (OPT_Winvalid_offsetof,
2025 "(perhaps the %<offsetof%> macro was used incorrectly)");
2028 /* If MEMBER is from an anonymous aggregate, we have converted
2029 OBJECT so that it refers to the class containing the
2030 anonymous union. Generate a reference to the anonymous union
2031 itself, and recur to find MEMBER. */
2032 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member))
2033 /* When this code is called from build_field_call, the
2034 object already has the type of the anonymous union.
2035 That is because the COMPONENT_REF was already
2036 constructed, and was then disassembled before calling
2037 build_field_call. After the function-call code is
2038 cleaned up, this waste can be eliminated. */
2039 && (!same_type_ignoring_top_level_qualifiers_p
2040 (TREE_TYPE (object), DECL_CONTEXT (member))))
2042 tree anonymous_union;
2044 anonymous_union = lookup_anon_field (TREE_TYPE (object),
2045 DECL_CONTEXT (member));
2046 object = build_class_member_access_expr (object,
2048 /*access_path=*/NULL_TREE,
2053 /* Compute the type of the field, as described in [expr.ref]. */
2054 type_quals = TYPE_UNQUALIFIED;
2055 member_type = TREE_TYPE (member);
2056 if (TREE_CODE (member_type) != REFERENCE_TYPE)
2058 type_quals = (cp_type_quals (member_type)
2059 | cp_type_quals (object_type));
2061 /* A field is const (volatile) if the enclosing object, or the
2062 field itself, is const (volatile). But, a mutable field is
2063 not const, even within a const object. */
2064 if (DECL_MUTABLE_P (member))
2065 type_quals &= ~TYPE_QUAL_CONST;
2066 member_type = cp_build_qualified_type (member_type, type_quals);
2069 result = build3 (COMPONENT_REF, member_type, object, member,
2071 result = fold_if_not_in_template (result);
2073 /* Mark the expression const or volatile, as appropriate. Even
2074 though we've dealt with the type above, we still have to mark the
2075 expression itself. */
2076 if (type_quals & TYPE_QUAL_CONST)
2077 TREE_READONLY (result) = 1;
2078 if (type_quals & TYPE_QUAL_VOLATILE)
2079 TREE_THIS_VOLATILE (result) = 1;
2081 else if (BASELINK_P (member))
2083 /* The member is a (possibly overloaded) member function. */
2087 /* If the MEMBER is exactly one static member function, then we
2088 know the type of the expression. Otherwise, we must wait
2089 until overload resolution has been performed. */
2090 functions = BASELINK_FUNCTIONS (member);
2091 if (TREE_CODE (functions) == FUNCTION_DECL
2092 && DECL_STATIC_FUNCTION_P (functions))
2093 type = TREE_TYPE (functions);
2095 type = unknown_type_node;
2096 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2097 base. That will happen when the function is called. */
2098 result = build3 (COMPONENT_REF, type, object, member, NULL_TREE);
2100 else if (TREE_CODE (member) == CONST_DECL)
2102 /* The member is an enumerator. */
2104 /* If OBJECT has side-effects, they are supposed to occur. */
2105 if (TREE_SIDE_EFFECTS (object))
2106 result = build2 (COMPOUND_EXPR, TREE_TYPE (result),
2111 if (complain & tf_error)
2112 error ("invalid use of %qD", member);
2113 return error_mark_node;
2116 if (!preserve_reference)
2119 If E2 is declared to have type "reference to T", then ... the
2120 type of E1.E2 is T. */
2121 result = convert_from_reference (result);
2126 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2127 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2130 lookup_destructor (tree object, tree scope, tree dtor_name)
2132 tree object_type = TREE_TYPE (object);
2133 tree dtor_type = TREE_OPERAND (dtor_name, 0);
2136 if (scope && !check_dtor_name (scope, dtor_type))
2138 error ("qualified type %qT does not match destructor name ~%qT",
2140 return error_mark_node;
2142 if (TREE_CODE (dtor_type) == IDENTIFIER_NODE)
2144 /* In a template, names we can't find a match for are still accepted
2145 destructor names, and we check them here. */
2146 if (check_dtor_name (object_type, dtor_type))
2147 dtor_type = object_type;
2150 error ("object type %qT does not match destructor name ~%qT",
2151 object_type, dtor_type);
2152 return error_mark_node;
2156 else if (!DERIVED_FROM_P (dtor_type, TYPE_MAIN_VARIANT (object_type)))
2158 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2159 TYPE_MAIN_VARIANT (object_type), dtor_type);
2160 return error_mark_node;
2162 expr = lookup_member (dtor_type, complete_dtor_identifier,
2163 /*protect=*/1, /*want_type=*/false);
2164 expr = (adjust_result_of_qualified_name_lookup
2165 (expr, dtor_type, object_type));
2169 /* An expression of the form "A::template B" has been resolved to
2170 DECL. Issue a diagnostic if B is not a template or template
2174 check_template_keyword (tree decl)
2176 /* The standard says:
2180 If a name prefixed by the keyword template is not a member
2181 template, the program is ill-formed.
2183 DR 228 removed the restriction that the template be a member
2186 DR 96, if accepted would add the further restriction that explicit
2187 template arguments must be provided if the template keyword is
2188 used, but, as of 2005-10-16, that DR is still in "drafting". If
2189 this DR is accepted, then the semantic checks here can be
2190 simplified, as the entity named must in fact be a template
2191 specialization, rather than, as at present, a set of overloaded
2192 functions containing at least one template function. */
2193 if (TREE_CODE (decl) != TEMPLATE_DECL
2194 && TREE_CODE (decl) != TEMPLATE_ID_EXPR)
2196 if (!is_overloaded_fn (decl))
2197 permerror (input_location, "%qD is not a template", decl);
2202 if (BASELINK_P (fns))
2203 fns = BASELINK_FUNCTIONS (fns);
2206 tree fn = OVL_CURRENT (fns);
2207 if (TREE_CODE (fn) == TEMPLATE_DECL
2208 || TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2210 if (TREE_CODE (fn) == FUNCTION_DECL
2211 && DECL_USE_TEMPLATE (fn)
2212 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
2214 fns = OVL_NEXT (fns);
2217 permerror (input_location, "%qD is not a template", decl);
2222 /* This function is called by the parser to process a class member
2223 access expression of the form OBJECT.NAME. NAME is a node used by
2224 the parser to represent a name; it is not yet a DECL. It may,
2225 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2226 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2227 there is no reason to do the lookup twice, so the parser keeps the
2228 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2229 be a template via the use of the "A::template B" syntax. */
2232 finish_class_member_access_expr (tree object, tree name, bool template_p,
2233 tsubst_flags_t complain)
2238 tree access_path = NULL_TREE;
2239 tree orig_object = object;
2240 tree orig_name = name;
2242 if (object == error_mark_node || name == error_mark_node)
2243 return error_mark_node;
2245 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2246 if (!objc_is_public (object, name))
2247 return error_mark_node;
2249 object_type = TREE_TYPE (object);
2251 if (processing_template_decl)
2253 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2254 dependent_type_p (object_type)
2255 /* If NAME is just an IDENTIFIER_NODE, then the expression
2257 || TREE_CODE (object) == IDENTIFIER_NODE
2258 /* If NAME is "f<args>", where either 'f' or 'args' is
2259 dependent, then the expression is dependent. */
2260 || (TREE_CODE (name) == TEMPLATE_ID_EXPR
2261 && dependent_template_id_p (TREE_OPERAND (name, 0),
2262 TREE_OPERAND (name, 1)))
2263 /* If NAME is "T::X" where "T" is dependent, then the
2264 expression is dependent. */
2265 || (TREE_CODE (name) == SCOPE_REF
2266 && TYPE_P (TREE_OPERAND (name, 0))
2267 && dependent_type_p (TREE_OPERAND (name, 0))))
2268 return build_min_nt (COMPONENT_REF, object, name, NULL_TREE);
2269 object = build_non_dependent_expr (object);
2274 The type of the first expression shall be "class object" (of a
2276 if (!currently_open_class (object_type)
2277 && !complete_type_or_else (object_type, object))
2278 return error_mark_node;
2279 if (!CLASS_TYPE_P (object_type))
2281 if (complain & tf_error)
2282 error ("request for member %qD in %qE, which is of non-class type %qT",
2283 name, object, object_type);
2284 return error_mark_node;
2287 if (BASELINK_P (name))
2288 /* A member function that has already been looked up. */
2292 bool is_template_id = false;
2293 tree template_args = NULL_TREE;
2296 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
2298 is_template_id = true;
2299 template_args = TREE_OPERAND (name, 1);
2300 name = TREE_OPERAND (name, 0);
2302 if (TREE_CODE (name) == OVERLOAD)
2303 name = DECL_NAME (get_first_fn (name));
2304 else if (DECL_P (name))
2305 name = DECL_NAME (name);
2308 if (TREE_CODE (name) == SCOPE_REF)
2310 /* A qualified name. The qualifying class or namespace `S'
2311 has already been looked up; it is either a TYPE or a
2313 scope = TREE_OPERAND (name, 0);
2314 name = TREE_OPERAND (name, 1);
2316 /* If SCOPE is a namespace, then the qualified name does not
2317 name a member of OBJECT_TYPE. */
2318 if (TREE_CODE (scope) == NAMESPACE_DECL)
2320 if (complain & tf_error)
2321 error ("%<%D::%D%> is not a member of %qT",
2322 scope, name, object_type);
2323 return error_mark_node;
2326 gcc_assert (CLASS_TYPE_P (scope));
2327 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE
2328 || TREE_CODE (name) == BIT_NOT_EXPR);
2330 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2331 access_path = lookup_base (object_type, scope, ba_check, NULL);
2332 if (access_path == error_mark_node)
2333 return error_mark_node;
2336 if (complain & tf_error)
2337 error ("%qT is not a base of %qT", scope, object_type);
2338 return error_mark_node;
2344 access_path = object_type;
2347 if (TREE_CODE (name) == BIT_NOT_EXPR)
2348 member = lookup_destructor (object, scope, name);
2351 /* Look up the member. */
2352 member = lookup_member (access_path, name, /*protect=*/1,
2353 /*want_type=*/false);
2354 if (member == NULL_TREE)
2356 if (complain & tf_error)
2357 error ("%qD has no member named %qE", object_type, name);
2358 return error_mark_node;
2360 if (member == error_mark_node)
2361 return error_mark_node;
2366 tree templ = member;
2368 if (BASELINK_P (templ))
2369 templ = lookup_template_function (templ, template_args);
2372 if (complain & tf_error)
2373 error ("%qD is not a member template function", name);
2374 return error_mark_node;
2379 if (TREE_DEPRECATED (member))
2380 warn_deprecated_use (member);
2383 check_template_keyword (member);
2385 expr = build_class_member_access_expr (object, member, access_path,
2386 /*preserve_reference=*/false,
2388 if (processing_template_decl && expr != error_mark_node)
2390 if (BASELINK_P (member))
2392 if (TREE_CODE (orig_name) == SCOPE_REF)
2393 BASELINK_QUALIFIED_P (member) = 1;
2396 return build_min_non_dep (COMPONENT_REF, expr,
2397 orig_object, orig_name,
2404 /* Return an expression for the MEMBER_NAME field in the internal
2405 representation of PTRMEM, a pointer-to-member function. (Each
2406 pointer-to-member function type gets its own RECORD_TYPE so it is
2407 more convenient to access the fields by name than by FIELD_DECL.)
2408 This routine converts the NAME to a FIELD_DECL and then creates the
2409 node for the complete expression. */
2412 build_ptrmemfunc_access_expr (tree ptrmem, tree member_name)
2418 /* This code is a stripped down version of
2419 build_class_member_access_expr. It does not work to use that
2420 routine directly because it expects the object to be of class
2422 ptrmem_type = TREE_TYPE (ptrmem);
2423 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type));
2424 member = lookup_member (ptrmem_type, member_name, /*protect=*/0,
2425 /*want_type=*/false);
2426 member_type = cp_build_qualified_type (TREE_TYPE (member),
2427 cp_type_quals (ptrmem_type));
2428 return fold_build3 (COMPONENT_REF, member_type,
2429 ptrmem, member, NULL_TREE);
2432 /* Given an expression PTR for a pointer, return an expression
2433 for the value pointed to.
2434 ERRORSTRING is the name of the operator to appear in error messages.
2436 This function may need to overload OPERATOR_FNNAME.
2437 Must also handle REFERENCE_TYPEs for C++. */
2440 build_x_indirect_ref (tree expr, const char *errorstring,
2441 tsubst_flags_t complain)
2443 tree orig_expr = expr;
2446 if (processing_template_decl)
2448 /* Retain the type if we know the operand is a pointer so that
2449 describable_type doesn't make auto deduction break. */
2450 if (TREE_TYPE (expr) && POINTER_TYPE_P (TREE_TYPE (expr)))
2451 return build_min (INDIRECT_REF, TREE_TYPE (TREE_TYPE (expr)), expr);
2452 if (type_dependent_expression_p (expr))
2453 return build_min_nt (INDIRECT_REF, expr);
2454 expr = build_non_dependent_expr (expr);
2457 rval = build_new_op (INDIRECT_REF, LOOKUP_NORMAL, expr, NULL_TREE,
2458 NULL_TREE, /*overloaded_p=*/NULL, complain);
2460 rval = cp_build_indirect_ref (expr, errorstring, complain);
2462 if (processing_template_decl && rval != error_mark_node)
2463 return build_min_non_dep (INDIRECT_REF, rval, orig_expr);
2468 /* Helper function called from c-common. */
2470 build_indirect_ref (location_t loc __attribute__ ((__unused__)),
2471 tree ptr, const char *errorstring)
2473 return cp_build_indirect_ref (ptr, errorstring, tf_warning_or_error);
2477 cp_build_indirect_ref (tree ptr, const char *errorstring,
2478 tsubst_flags_t complain)
2482 if (ptr == error_mark_node)
2483 return error_mark_node;
2485 if (ptr == current_class_ptr)
2486 return current_class_ref;
2488 pointer = (TREE_CODE (TREE_TYPE (ptr)) == REFERENCE_TYPE
2489 ? ptr : decay_conversion (ptr));
2490 type = TREE_TYPE (pointer);
2492 if (POINTER_TYPE_P (type))
2496 If the type of the expression is "pointer to T," the type
2497 of the result is "T."
2499 We must use the canonical variant because certain parts of
2500 the back end, like fold, do pointer comparisons between
2502 tree t = canonical_type_variant (TREE_TYPE (type));
2504 if (CONVERT_EXPR_P (ptr)
2505 || TREE_CODE (ptr) == VIEW_CONVERT_EXPR)
2507 /* If a warning is issued, mark it to avoid duplicates from
2508 the backend. This only needs to be done at
2509 warn_strict_aliasing > 2. */
2510 if (warn_strict_aliasing > 2)
2511 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr, 0)),
2512 type, TREE_OPERAND (ptr, 0)))
2513 TREE_NO_WARNING (ptr) = 1;
2516 if (VOID_TYPE_P (t))
2518 /* A pointer to incomplete type (other than cv void) can be
2519 dereferenced [expr.unary.op]/1 */
2520 if (complain & tf_error)
2521 error ("%qT is not a pointer-to-object type", type);
2522 return error_mark_node;
2524 else if (TREE_CODE (pointer) == ADDR_EXPR
2525 && same_type_p (t, TREE_TYPE (TREE_OPERAND (pointer, 0))))
2526 /* The POINTER was something like `&x'. We simplify `*&x' to
2528 return TREE_OPERAND (pointer, 0);
2531 tree ref = build1 (INDIRECT_REF, t, pointer);
2533 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2534 so that we get the proper error message if the result is used
2535 to assign to. Also, &* is supposed to be a no-op. */
2536 TREE_READONLY (ref) = CP_TYPE_CONST_P (t);
2537 TREE_THIS_VOLATILE (ref) = CP_TYPE_VOLATILE_P (t);
2538 TREE_SIDE_EFFECTS (ref)
2539 = (TREE_THIS_VOLATILE (ref) || TREE_SIDE_EFFECTS (pointer));
2543 else if (!(complain & tf_error))
2544 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2546 /* `pointer' won't be an error_mark_node if we were given a
2547 pointer to member, so it's cool to check for this here. */
2548 else if (TYPE_PTR_TO_MEMBER_P (type))
2549 error ("invalid use of %qs on pointer to member", errorstring);
2550 else if (pointer != error_mark_node)
2553 error ("invalid type argument of %qs", errorstring);
2555 error ("invalid type argument");
2557 return error_mark_node;
2560 /* This handles expressions of the form "a[i]", which denotes
2563 This is logically equivalent in C to *(a+i), but we may do it differently.
2564 If A is a variable or a member, we generate a primitive ARRAY_REF.
2565 This avoids forcing the array out of registers, and can work on
2566 arrays that are not lvalues (for example, members of structures returned
2569 If INDEX is of some user-defined type, it must be converted to
2570 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2571 will inherit the type of the array, which will be some pointer type.
2573 LOC is the location to use in building the array reference. */
2576 build_array_ref (tree array, tree idx, location_t loc)
2582 error_at (loc, "subscript missing in array reference");
2583 return error_mark_node;
2586 if (TREE_TYPE (array) == error_mark_node
2587 || TREE_TYPE (idx) == error_mark_node)
2588 return error_mark_node;
2590 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2592 switch (TREE_CODE (array))
2596 tree value = build_array_ref (TREE_OPERAND (array, 1), idx, loc);
2597 ret = build2 (COMPOUND_EXPR, TREE_TYPE (value),
2598 TREE_OPERAND (array, 0), value);
2599 SET_EXPR_LOCATION (ret, loc);
2604 ret = build_conditional_expr
2605 (TREE_OPERAND (array, 0),
2606 build_array_ref (TREE_OPERAND (array, 1), idx, loc),
2607 build_array_ref (TREE_OPERAND (array, 2), idx, loc),
2608 tf_warning_or_error);
2609 protected_set_expr_location (ret, loc);
2616 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
2620 warn_array_subscript_with_type_char (idx);
2622 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx)))
2624 error_at (loc, "array subscript is not an integer");
2625 return error_mark_node;
2628 /* Apply integral promotions *after* noticing character types.
2629 (It is unclear why we do these promotions -- the standard
2630 does not say that we should. In fact, the natural thing would
2631 seem to be to convert IDX to ptrdiff_t; we're performing
2632 pointer arithmetic.) */
2633 idx = perform_integral_promotions (idx);
2635 /* An array that is indexed by a non-constant
2636 cannot be stored in a register; we must be able to do
2637 address arithmetic on its address.
2638 Likewise an array of elements of variable size. */
2639 if (TREE_CODE (idx) != INTEGER_CST
2640 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
2641 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array))))
2644 if (!cxx_mark_addressable (array))
2645 return error_mark_node;
2648 /* An array that is indexed by a constant value which is not within
2649 the array bounds cannot be stored in a register either; because we
2650 would get a crash in store_bit_field/extract_bit_field when trying
2651 to access a non-existent part of the register. */
2652 if (TREE_CODE (idx) == INTEGER_CST
2653 && TYPE_DOMAIN (TREE_TYPE (array))
2654 && ! int_fits_type_p (idx, TYPE_DOMAIN (TREE_TYPE (array))))
2656 if (!cxx_mark_addressable (array))
2657 return error_mark_node;
2660 if (!lvalue_p (array))
2661 pedwarn (loc, OPT_pedantic,
2662 "ISO C++ forbids subscripting non-lvalue array");
2664 /* Note in C++ it is valid to subscript a `register' array, since
2665 it is valid to take the address of something with that
2666 storage specification. */
2670 while (TREE_CODE (foo) == COMPONENT_REF)
2671 foo = TREE_OPERAND (foo, 0);
2672 if (TREE_CODE (foo) == VAR_DECL && DECL_REGISTER (foo))
2673 warning_at (loc, OPT_Wextra,
2674 "subscripting array declared %<register%>");
2677 type = TREE_TYPE (TREE_TYPE (array));
2678 rval = build4 (ARRAY_REF, type, array, idx, NULL_TREE, NULL_TREE);
2679 /* Array ref is const/volatile if the array elements are
2680 or if the array is.. */
2681 TREE_READONLY (rval)
2682 |= (CP_TYPE_CONST_P (type) | TREE_READONLY (array));
2683 TREE_SIDE_EFFECTS (rval)
2684 |= (CP_TYPE_VOLATILE_P (type) | TREE_SIDE_EFFECTS (array));
2685 TREE_THIS_VOLATILE (rval)
2686 |= (CP_TYPE_VOLATILE_P (type) | TREE_THIS_VOLATILE (array));
2687 ret = require_complete_type (fold_if_not_in_template (rval));
2688 protected_set_expr_location (ret, loc);
2693 tree ar = default_conversion (array);
2694 tree ind = default_conversion (idx);
2696 /* Put the integer in IND to simplify error checking. */
2697 if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
2704 if (ar == error_mark_node)
2707 if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE)
2709 error_at (loc, "subscripted value is neither array nor pointer");
2710 return error_mark_node;
2712 if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
2714 error_at (loc, "array subscript is not an integer");
2715 return error_mark_node;
2718 warn_array_subscript_with_type_char (idx);
2720 ret = cp_build_indirect_ref (cp_build_binary_op (input_location,
2722 tf_warning_or_error),
2724 tf_warning_or_error);
2725 protected_set_expr_location (ret, loc);
2730 /* Resolve a pointer to member function. INSTANCE is the object
2731 instance to use, if the member points to a virtual member.
2733 This used to avoid checking for virtual functions if basetype
2734 has no virtual functions, according to an earlier ANSI draft.
2735 With the final ISO C++ rules, such an optimization is
2736 incorrect: A pointer to a derived member can be static_cast
2737 to pointer-to-base-member, as long as the dynamic object
2738 later has the right member. */
2741 get_member_function_from_ptrfunc (tree *instance_ptrptr, tree function)
2743 if (TREE_CODE (function) == OFFSET_REF)
2744 function = TREE_OPERAND (function, 1);
2746 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function)))
2748 tree idx, delta, e1, e2, e3, vtbl, basetype;
2749 tree fntype = TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function));
2751 tree instance_ptr = *instance_ptrptr;
2752 tree instance_save_expr = 0;
2753 if (instance_ptr == error_mark_node)
2755 if (TREE_CODE (function) == PTRMEM_CST)
2757 /* Extracting the function address from a pmf is only
2758 allowed with -Wno-pmf-conversions. It only works for
2760 e1 = build_addr_func (PTRMEM_CST_MEMBER (function));
2761 e1 = convert (fntype, e1);
2766 error ("object missing in use of %qE", function);
2767 return error_mark_node;
2771 if (TREE_SIDE_EFFECTS (instance_ptr))
2772 instance_ptr = instance_save_expr = save_expr (instance_ptr);
2774 if (TREE_SIDE_EFFECTS (function))
2775 function = save_expr (function);
2777 /* Start by extracting all the information from the PMF itself. */
2778 e3 = pfn_from_ptrmemfunc (function);
2779 delta = delta_from_ptrmemfunc (function);
2780 idx = build1 (NOP_EXPR, vtable_index_type, e3);
2781 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
2783 case ptrmemfunc_vbit_in_pfn:
2784 e1 = cp_build_binary_op (input_location,
2785 BIT_AND_EXPR, idx, integer_one_node,
2786 tf_warning_or_error);
2787 idx = cp_build_binary_op (input_location,
2788 MINUS_EXPR, idx, integer_one_node,
2789 tf_warning_or_error);
2792 case ptrmemfunc_vbit_in_delta:
2793 e1 = cp_build_binary_op (input_location,
2794 BIT_AND_EXPR, delta, integer_one_node,
2795 tf_warning_or_error);
2796 delta = cp_build_binary_op (input_location,
2797 RSHIFT_EXPR, delta, integer_one_node,
2798 tf_warning_or_error);
2805 /* Convert down to the right base before using the instance. A
2806 special case is that in a pointer to member of class C, C may
2807 be incomplete. In that case, the function will of course be
2808 a member of C, and no conversion is required. In fact,
2809 lookup_base will fail in that case, because incomplete
2810 classes do not have BINFOs. */
2811 basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (fntype));
2812 if (!same_type_ignoring_top_level_qualifiers_p
2813 (basetype, TREE_TYPE (TREE_TYPE (instance_ptr))))
2815 basetype = lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr)),
2816 basetype, ba_check, NULL);
2817 instance_ptr = build_base_path (PLUS_EXPR, instance_ptr, basetype,
2819 if (instance_ptr == error_mark_node)
2820 return error_mark_node;
2822 /* ...and then the delta in the PMF. */
2823 instance_ptr = build2 (POINTER_PLUS_EXPR, TREE_TYPE (instance_ptr),
2824 instance_ptr, fold_convert (sizetype, delta));
2826 /* Hand back the adjusted 'this' argument to our caller. */
2827 *instance_ptrptr = instance_ptr;
2829 /* Next extract the vtable pointer from the object. */
2830 vtbl = build1 (NOP_EXPR, build_pointer_type (vtbl_ptr_type_node),
2832 vtbl = cp_build_indirect_ref (vtbl, NULL, tf_warning_or_error);
2833 /* If the object is not dynamic the access invokes undefined
2834 behavior. As it is not executed in this case silence the
2835 spurious warnings it may provoke. */
2836 TREE_NO_WARNING (vtbl) = 1;
2838 /* Finally, extract the function pointer from the vtable. */
2839 e2 = fold_build2 (POINTER_PLUS_EXPR, TREE_TYPE (vtbl), vtbl,
2840 fold_convert (sizetype, idx));
2841 e2 = cp_build_indirect_ref (e2, NULL, tf_warning_or_error);
2842 TREE_CONSTANT (e2) = 1;
2844 /* When using function descriptors, the address of the
2845 vtable entry is treated as a function pointer. */
2846 if (TARGET_VTABLE_USES_DESCRIPTORS)
2847 e2 = build1 (NOP_EXPR, TREE_TYPE (e2),
2848 cp_build_unary_op (ADDR_EXPR, e2, /*noconvert=*/1,
2849 tf_warning_or_error));
2851 e2 = fold_convert (TREE_TYPE (e3), e2);
2852 e1 = build_conditional_expr (e1, e2, e3, tf_warning_or_error);
2854 /* Make sure this doesn't get evaluated first inside one of the
2855 branches of the COND_EXPR. */
2856 if (instance_save_expr)
2857 e1 = build2 (COMPOUND_EXPR, TREE_TYPE (e1),
2858 instance_save_expr, e1);
2865 /* Used by the C-common bits. */
2867 build_function_call (tree function, tree params)
2869 return cp_build_function_call (function, params, tf_warning_or_error);
2873 cp_build_function_call (tree function, tree params, tsubst_flags_t complain)
2875 tree fntype, fndecl;
2876 tree name = NULL_TREE;
2878 tree original = function;
2879 int nargs, parm_types_len;
2883 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2884 expressions, like those used for ObjC messenger dispatches. */
2885 function = objc_rewrite_function_call (function, params);
2887 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2888 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
2889 if (TREE_CODE (function) == NOP_EXPR
2890 && TREE_TYPE (function) == TREE_TYPE (TREE_OPERAND (function, 0)))
2891 function = TREE_OPERAND (function, 0);
2893 if (TREE_CODE (function) == FUNCTION_DECL)
2895 name = DECL_NAME (function);
2897 mark_used (function);
2900 /* Convert anything with function type to a pointer-to-function. */
2901 if (DECL_MAIN_P (function) && (complain & tf_error))
2902 pedwarn (input_location, OPT_pedantic,
2903 "ISO C++ forbids calling %<::main%> from within program");
2905 function = build_addr_func (function);
2911 function = build_addr_func (function);
2914 if (function == error_mark_node)
2915 return error_mark_node;
2917 fntype = TREE_TYPE (function);
2919 if (TYPE_PTRMEMFUNC_P (fntype))
2921 if (complain & tf_error)
2922 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
2923 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
2924 original, original);
2925 return error_mark_node;
2928 is_method = (TREE_CODE (fntype) == POINTER_TYPE
2929 && TREE_CODE (TREE_TYPE (fntype)) == METHOD_TYPE);
2931 if (!((TREE_CODE (fntype) == POINTER_TYPE
2932 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE)
2934 || TREE_CODE (function) == TEMPLATE_ID_EXPR))
2936 if (complain & tf_error)
2937 error ("%qE cannot be used as a function", original);
2938 return error_mark_node;
2941 /* fntype now gets the type of function pointed to. */
2942 fntype = TREE_TYPE (fntype);
2943 parm_types = TYPE_ARG_TYPES (fntype);
2945 /* Allocate storage for converted arguments. */
2946 parm_types_len = list_length (parm_types);
2947 nargs = list_length (params);
2948 if (parm_types_len > nargs)
2949 nargs = parm_types_len;
2950 argarray = (tree *) alloca (nargs * sizeof (tree));
2952 /* Convert the parameters to the types declared in the
2953 function prototype, or apply default promotions. */
2954 nargs = convert_arguments (nargs, argarray, parm_types,
2955 params, fndecl, LOOKUP_NORMAL,
2958 return error_mark_node;
2960 /* Check for errors in format strings and inappropriately
2962 check_function_arguments (TYPE_ATTRIBUTES (fntype), nargs, argarray,
2965 return build_cxx_call (function, nargs, argarray);
2968 /* Convert the actual parameter expressions in the list VALUES
2969 to the types in the list TYPELIST.
2970 If parmdecls is exhausted, or when an element has NULL as its type,
2971 perform the default conversions.
2973 Store the converted arguments in ARGARRAY. NARGS is the size of this array.
2975 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
2977 This is also where warnings about wrong number of args are generated.
2979 Returns the actual number of arguments processed (which might be less
2980 than NARGS), or -1 on error.
2982 VALUES is a chain of TREE_LIST nodes with the elements of the list
2983 in the TREE_VALUE slots of those nodes.
2985 In C++, unspecified trailing parameters can be filled in with their
2986 default arguments, if such were specified. Do so here. */
2989 convert_arguments (int nargs, tree *argarray,
2990 tree typelist, tree values, tree fndecl, int flags,
2991 tsubst_flags_t complain)
2993 tree typetail, valtail;
2994 const char *called_thing = 0;
2997 /* Argument passing is always copy-initialization. */
2998 flags |= LOOKUP_ONLYCONVERTING;
3002 if (TREE_CODE (TREE_TYPE (fndecl)) == METHOD_TYPE)
3004 if (DECL_NAME (fndecl) == NULL_TREE
3005 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl)))
3006 called_thing = "constructor";
3008 called_thing = "member function";
3011 called_thing = "function";
3014 for (valtail = values, typetail = typelist;
3016 valtail = TREE_CHAIN (valtail), i++)
3018 tree type = typetail ? TREE_VALUE (typetail) : 0;
3019 tree val = TREE_VALUE (valtail);
3021 if (val == error_mark_node || type == error_mark_node)
3024 if (type == void_type_node)
3026 if (complain & tf_error)
3030 error ("too many arguments to %s %q+#D",
3031 called_thing, fndecl);
3032 error ("at this point in file");
3035 error ("too many arguments to function");
3042 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3043 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3044 if (TREE_CODE (val) == NOP_EXPR
3045 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0))
3046 && (type == 0 || TREE_CODE (type) != REFERENCE_TYPE))
3047 val = TREE_OPERAND (val, 0);
3049 if (type == 0 || TREE_CODE (type) != REFERENCE_TYPE)
3051 if (TREE_CODE (TREE_TYPE (val)) == ARRAY_TYPE
3052 || TREE_CODE (TREE_TYPE (val)) == FUNCTION_TYPE
3053 || TREE_CODE (TREE_TYPE (val)) == METHOD_TYPE)
3054 val = decay_conversion (val);
3057 if (val == error_mark_node)
3062 /* Formal parm type is specified by a function prototype. */
3065 if (!COMPLETE_TYPE_P (complete_type (type)))
3067 if (complain & tf_error)
3070 error ("parameter %P of %qD has incomplete type %qT",
3073 error ("parameter %P has incomplete type %qT", i, type);
3075 parmval = error_mark_node;
3079 parmval = convert_for_initialization
3080 (NULL_TREE, type, val, flags,
3081 "argument passing", fndecl, i, complain);
3082 parmval = convert_for_arg_passing (type, parmval);
3085 if (parmval == error_mark_node)
3088 argarray[i] = parmval;
3092 if (fndecl && DECL_BUILT_IN (fndecl)
3093 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CONSTANT_P)
3094 /* Don't do ellipsis conversion for __built_in_constant_p
3095 as this will result in spurious warnings for non-POD
3097 val = require_complete_type (val);
3099 val = convert_arg_to_ellipsis (val);
3105 typetail = TREE_CHAIN (typetail);
3108 if (typetail != 0 && typetail != void_list_node)
3110 /* See if there are default arguments that can be used. Because
3111 we hold default arguments in the FUNCTION_TYPE (which is so
3112 wrong), we can see default parameters here from deduced
3113 contexts (and via typeof) for indirect function calls.
3114 Fortunately we know whether we have a function decl to
3115 provide default arguments in a language conformant
3117 if (fndecl && TREE_PURPOSE (typetail)
3118 && TREE_CODE (TREE_PURPOSE (typetail)) != DEFAULT_ARG)
3120 for (; typetail != void_list_node; ++i)
3123 = convert_default_arg (TREE_VALUE (typetail),
3124 TREE_PURPOSE (typetail),
3127 if (parmval == error_mark_node)
3130 argarray[i] = parmval;
3131 typetail = TREE_CHAIN (typetail);
3132 /* ends with `...'. */
3133 if (typetail == NULL_TREE)
3139 if (complain & tf_error)
3143 error ("too few arguments to %s %q+#D",
3144 called_thing, fndecl);
3145 error ("at this point in file");
3148 error ("too few arguments to function");
3154 gcc_assert (i <= nargs);
3158 /* Build a binary-operation expression, after performing default
3159 conversions on the operands. CODE is the kind of expression to
3160 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3161 are the tree codes which correspond to ARG1 and ARG2 when issuing
3162 warnings about possibly misplaced parentheses. They may differ
3163 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3164 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3165 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3166 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3167 ARG2_CODE as ERROR_MARK. */
3170 build_x_binary_op (enum tree_code code, tree arg1, enum tree_code arg1_code,
3171 tree arg2, enum tree_code arg2_code, bool *overloaded_p,
3172 tsubst_flags_t complain)
3181 if (processing_template_decl)
3183 if (type_dependent_expression_p (arg1)
3184 || type_dependent_expression_p (arg2))
3185 return build_min_nt (code, arg1, arg2);
3186 arg1 = build_non_dependent_expr (arg1);
3187 arg2 = build_non_dependent_expr (arg2);
3190 if (code == DOTSTAR_EXPR)
3191 expr = build_m_component_ref (arg1, arg2);
3193 expr = build_new_op (code, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
3194 overloaded_p, complain);
3196 /* Check for cases such as x+y<<z which users are likely to
3197 misinterpret. But don't warn about obj << x + y, since that is a
3198 common idiom for I/O. */
3199 if (warn_parentheses
3200 && !processing_template_decl
3201 && !error_operand_p (arg1)
3202 && !error_operand_p (arg2)
3203 && (code != LSHIFT_EXPR
3204 || !CLASS_TYPE_P (TREE_TYPE (arg1))))
3205 warn_about_parentheses (code, arg1_code, orig_arg1, arg2_code, orig_arg2);
3207 if (processing_template_decl && expr != error_mark_node)
3208 return build_min_non_dep (code, expr, orig_arg1, orig_arg2);
3213 /* Build and return an ARRAY_REF expression. */
3216 build_x_array_ref (tree arg1, tree arg2, tsubst_flags_t complain)
3218 tree orig_arg1 = arg1;
3219 tree orig_arg2 = arg2;
3222 if (processing_template_decl)
3224 if (type_dependent_expression_p (arg1)
3225 || type_dependent_expression_p (arg2))
3226 return build_min_nt (ARRAY_REF, arg1, arg2,
3227 NULL_TREE, NULL_TREE);
3228 arg1 = build_non_dependent_expr (arg1);
3229 arg2 = build_non_dependent_expr (arg2);
3232 expr = build_new_op (ARRAY_REF, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
3233 /*overloaded_p=*/NULL, complain);
3235 if (processing_template_decl && expr != error_mark_node)
3236 return build_min_non_dep (ARRAY_REF, expr, orig_arg1, orig_arg2,
3237 NULL_TREE, NULL_TREE);
3241 /* For the c-common bits. */
3243 build_binary_op (location_t location, enum tree_code code, tree op0, tree op1,
3244 int convert_p ATTRIBUTE_UNUSED)
3246 return cp_build_binary_op (location, code, op0, op1, tf_warning_or_error);
3250 /* Build a binary-operation expression without default conversions.
3251 CODE is the kind of expression to build.
3252 LOCATION is the location_t of the operator in the source code.
3253 This function differs from `build' in several ways:
3254 the data type of the result is computed and recorded in it,
3255 warnings are generated if arg data types are invalid,
3256 special handling for addition and subtraction of pointers is known,
3257 and some optimization is done (operations on narrow ints
3258 are done in the narrower type when that gives the same result).
3259 Constant folding is also done before the result is returned.
3261 Note that the operands will never have enumeral types
3262 because either they have just had the default conversions performed
3263 or they have both just been converted to some other type in which
3264 the arithmetic is to be done.
3266 C++: must do special pointer arithmetic when implementing
3267 multiple inheritance, and deal with pointer to member functions. */
3270 cp_build_binary_op (location_t location,
3271 enum tree_code code, tree orig_op0, tree orig_op1,
3272 tsubst_flags_t complain)
3275 enum tree_code code0, code1;
3277 const char *invalid_op_diag;
3279 /* Expression code to give to the expression when it is built.
3280 Normally this is CODE, which is what the caller asked for,
3281 but in some special cases we change it. */
3282 enum tree_code resultcode = code;
3284 /* Data type in which the computation is to be performed.
3285 In the simplest cases this is the common type of the arguments. */
3286 tree result_type = NULL;
3288 /* Nonzero means operands have already been type-converted
3289 in whatever way is necessary.
3290 Zero means they need to be converted to RESULT_TYPE. */
3293 /* Nonzero means create the expression with this type, rather than
3295 tree build_type = 0;
3297 /* Nonzero means after finally constructing the expression
3298 convert it to this type. */
3299 tree final_type = 0;
3303 /* Nonzero if this is an operation like MIN or MAX which can
3304 safely be computed in short if both args are promoted shorts.
3305 Also implies COMMON.
3306 -1 indicates a bitwise operation; this makes a difference
3307 in the exact conditions for when it is safe to do the operation
3308 in a narrower mode. */
3311 /* Nonzero if this is a comparison operation;
3312 if both args are promoted shorts, compare the original shorts.
3313 Also implies COMMON. */
3314 int short_compare = 0;
3316 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3319 /* True if both operands have arithmetic type. */
3320 bool arithmetic_types_p;
3322 /* Apply default conversions. */
3326 if (code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
3327 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
3328 || code == TRUTH_XOR_EXPR)
3330 if (!really_overloaded_fn (op0))
3331 op0 = decay_conversion (op0);
3332 if (!really_overloaded_fn (op1))
3333 op1 = decay_conversion (op1);
3337 if (!really_overloaded_fn (op0))
3338 op0 = default_conversion (op0);
3339 if (!really_overloaded_fn (op1))
3340 op1 = default_conversion (op1);
3343 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3344 STRIP_TYPE_NOPS (op0);
3345 STRIP_TYPE_NOPS (op1);
3347 /* DTRT if one side is an overloaded function, but complain about it. */
3348 if (type_unknown_p (op0))
3350 tree t = instantiate_type (TREE_TYPE (op1), op0, tf_none);
3351 if (t != error_mark_node)
3353 if (complain & tf_error)
3354 permerror (input_location, "assuming cast to type %qT from overloaded function",
3359 if (type_unknown_p (op1))
3361 tree t = instantiate_type (TREE_TYPE (op0), op1, 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",
3371 type0 = TREE_TYPE (op0);
3372 type1 = TREE_TYPE (op1);
3374 /* The expression codes of the data types of the arguments tell us
3375 whether the arguments are integers, floating, pointers, etc. */
3376 code0 = TREE_CODE (type0);
3377 code1 = TREE_CODE (type1);
3379 /* If an error was already reported for one of the arguments,
3380 avoid reporting another error. */
3382 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
3383 return error_mark_node;
3385 if ((invalid_op_diag
3386 = targetm.invalid_binary_op (code, type0, type1)))
3388 error (invalid_op_diag);
3389 return error_mark_node;
3395 /* Subtraction of two similar pointers.
3396 We must subtract them as integers, then divide by object size. */
3397 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
3398 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0),
3400 return pointer_diff (op0, op1, common_pointer_type (type0, type1));
3401 /* In all other cases except pointer - int, the usual arithmetic
3403 else if (!(code0 == POINTER_TYPE && code1 == INTEGER_TYPE))
3408 /* The pointer - int case is just like pointer + int; fall
3411 if ((code0 == POINTER_TYPE || code1 == POINTER_TYPE)
3412 && (code0 == INTEGER_TYPE || code1 == INTEGER_TYPE))
3416 ptr_operand = ((code0 == POINTER_TYPE) ? op0 : op1);
3417 int_operand = ((code0 == INTEGER_TYPE) ? op0 : op1);
3418 if (processing_template_decl)
3420 result_type = TREE_TYPE (ptr_operand);
3423 return cp_pointer_int_sum (code,
3434 case TRUNC_DIV_EXPR:
3436 case FLOOR_DIV_EXPR:
3437 case ROUND_DIV_EXPR:
3438 case EXACT_DIV_EXPR:
3439 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
3440 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
3441 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3442 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
3444 enum tree_code tcode0 = code0, tcode1 = code1;
3446 warn_for_div_by_zero (location, op1);
3448 if (tcode0 == COMPLEX_TYPE || tcode0 == VECTOR_TYPE)
3449 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
3450 if (tcode1 == COMPLEX_TYPE || tcode1 == VECTOR_TYPE)
3451 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
3453 if (!(tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE))
3454 resultcode = RDIV_EXPR;
3456 /* When dividing two signed integers, we have to promote to int.
3457 unless we divide by a constant != -1. Note that default
3458 conversion will have been performed on the operands at this
3459 point, so we have to dig out the original type to find out if
3461 shorten = ((TREE_CODE (op0) == NOP_EXPR
3462 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3463 || (TREE_CODE (op1) == INTEGER_CST
3464 && ! integer_all_onesp (op1)));
3473 if ((code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3474 || (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
3475 && !VECTOR_FLOAT_TYPE_P (type0)
3476 && !VECTOR_FLOAT_TYPE_P (type1)))
3480 case TRUNC_MOD_EXPR:
3481 case FLOOR_MOD_EXPR:
3482 warn_for_div_by_zero (location, op1);
3484 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3486 /* Although it would be tempting to shorten always here, that loses
3487 on some targets, since the modulo instruction is undefined if the
3488 quotient can't be represented in the computation mode. We shorten
3489 only if unsigned or if dividing by something we know != -1. */
3490 shorten = ((TREE_CODE (op0) == NOP_EXPR
3491 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3492 || (TREE_CODE (op1) == INTEGER_CST
3493 && ! integer_all_onesp (op1)));
3498 case TRUTH_ANDIF_EXPR:
3499 case TRUTH_ORIF_EXPR:
3500 case TRUTH_AND_EXPR:
3502 result_type = boolean_type_node;
3505 /* Shift operations: result has same type as first operand;
3506 always convert second operand to int.
3507 Also set SHORT_SHIFT if shifting rightward. */
3510 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3512 result_type = type0;
3513 if (TREE_CODE (op1) == INTEGER_CST)
3515 if (tree_int_cst_lt (op1, integer_zero_node))
3517 if (complain & tf_warning)
3518 warning (0, "right shift count is negative");
3522 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0
3523 && (complain & tf_warning))
3524 warning (0, "right shift count >= width of type");
3527 /* Convert the shift-count to an integer, regardless of
3528 size of value being shifted. */
3529 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3530 op1 = cp_convert (integer_type_node, op1);
3531 /* Avoid converting op1 to result_type later. */
3537 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3539 result_type = type0;
3540 if (TREE_CODE (op1) == INTEGER_CST)
3542 if (tree_int_cst_lt (op1, integer_zero_node))
3544 if (complain & tf_warning)
3545 warning (0, "left shift count is negative");
3547 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3549 if (complain & tf_warning)
3550 warning (0, "left shift count >= width of type");
3553 /* Convert the shift-count to an integer, regardless of
3554 size of value being shifted. */
3555 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3556 op1 = cp_convert (integer_type_node, op1);
3557 /* Avoid converting op1 to result_type later. */
3564 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3566 result_type = type0;
3567 if (TREE_CODE (op1) == INTEGER_CST)
3569 if (tree_int_cst_lt (op1, integer_zero_node))
3571 if (complain & tf_warning)
3572 warning (0, (code == LROTATE_EXPR)
3573 ? G_("left rotate count is negative")
3574 : G_("right rotate count is negative"));
3576 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3578 if (complain & tf_warning)
3579 warning (0, (code == LROTATE_EXPR)
3580 ? G_("left rotate count >= width of type")
3581 : G_("right rotate count >= width of type"));
3584 /* Convert the shift-count to an integer, regardless of
3585 size of value being shifted. */
3586 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3587 op1 = cp_convert (integer_type_node, op1);
3593 if ((complain & tf_warning)
3594 && (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1)))
3595 warning (OPT_Wfloat_equal,
3596 "comparing floating point with == or != is unsafe");
3597 if ((complain & tf_warning)
3598 && ((TREE_CODE (orig_op0) == STRING_CST && !integer_zerop (op1))
3599 || (TREE_CODE (orig_op1) == STRING_CST && !integer_zerop (op0))))
3600 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
3602 build_type = boolean_type_node;
3603 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
3604 || code0 == COMPLEX_TYPE || code0 == ENUMERAL_TYPE)
3605 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3606 || code1 == COMPLEX_TYPE || code1 == ENUMERAL_TYPE))
3608 else if ((code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3609 || (TYPE_PTRMEM_P (type0) && TYPE_PTRMEM_P (type1)))
3610 result_type = composite_pointer_type (type0, type1, op0, op1,
3611 "comparison", complain);
3612 else if ((code0 == POINTER_TYPE || TYPE_PTRMEM_P (type0))
3613 && null_ptr_cst_p (op1))
3615 if (TREE_CODE (op0) == ADDR_EXPR
3616 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
3618 if (complain & tf_warning)
3619 warning (OPT_Waddress, "the address of %qD will never be NULL",
3620 TREE_OPERAND (op0, 0));
3622 result_type = type0;
3624 else if ((code1 == POINTER_TYPE || TYPE_PTRMEM_P (type1))
3625 && null_ptr_cst_p (op0))
3627 if (TREE_CODE (op1) == ADDR_EXPR
3628 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
3630 if (complain & tf_warning)
3631 warning (OPT_Waddress, "the address of %qD will never be NULL",
3632 TREE_OPERAND (op1, 0));
3634 result_type = type1;
3636 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
3638 result_type = type0;
3639 if (complain & tf_error)
3640 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
3642 return error_mark_node;
3644 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
3646 result_type = type1;
3647 if (complain & tf_error)
3648 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
3650 return error_mark_node;
3652 else if (TYPE_PTRMEMFUNC_P (type0) && null_ptr_cst_p (op1))
3654 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
3655 == ptrmemfunc_vbit_in_delta)
3657 tree pfn0 = pfn_from_ptrmemfunc (op0);
3658 tree delta0 = delta_from_ptrmemfunc (op0);
3659 tree e1 = cp_build_binary_op (location,
3662 fold_convert (TREE_TYPE (pfn0),
3665 tree e2 = cp_build_binary_op (location,
3670 e2 = cp_build_binary_op (location,
3671 EQ_EXPR, e2, integer_zero_node,
3673 op0 = cp_build_binary_op (location,
3674 TRUTH_ANDIF_EXPR, e1, e2,
3676 op1 = cp_convert (TREE_TYPE (op0), integer_one_node);
3680 op0 = build_ptrmemfunc_access_expr (op0, pfn_identifier);
3681 op1 = cp_convert (TREE_TYPE (op0), integer_zero_node);
3683 result_type = TREE_TYPE (op0);
3685 else if (TYPE_PTRMEMFUNC_P (type1) && null_ptr_cst_p (op0))
3686 return cp_build_binary_op (location, code, op1, op0, complain);
3687 else if (TYPE_PTRMEMFUNC_P (type0) && TYPE_PTRMEMFUNC_P (type1))
3690 /* E will be the final comparison. */
3692 /* E1 and E2 are for scratch. */
3700 type = composite_pointer_type (type0, type1, op0, op1, "comparison",
3703 if (!same_type_p (TREE_TYPE (op0), type))
3704 op0 = cp_convert_and_check (type, op0);
3705 if (!same_type_p (TREE_TYPE (op1), type))
3706 op1 = cp_convert_and_check (type, op1);
3708 if (op0 == error_mark_node || op1 == error_mark_node)
3709 return error_mark_node;
3711 if (TREE_SIDE_EFFECTS (op0))
3712 op0 = save_expr (op0);
3713 if (TREE_SIDE_EFFECTS (op1))
3714 op1 = save_expr (op1);
3716 pfn0 = pfn_from_ptrmemfunc (op0);
3717 pfn1 = pfn_from_ptrmemfunc (op1);
3718 delta0 = delta_from_ptrmemfunc (op0);
3719 delta1 = delta_from_ptrmemfunc (op1);
3720 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
3721 == ptrmemfunc_vbit_in_delta)
3726 && ((op0.delta == op1.delta)
3727 || (!op0.pfn && op0.delta & 1 == 0
3728 && op1.delta & 1 == 0))
3730 The reason for the `!op0.pfn' bit is that a NULL
3731 pointer-to-member is any member with a zero PFN and
3732 LSB of the DELTA field is 0. */
3734 e1 = cp_build_binary_op (location, BIT_AND_EXPR,
3738 e1 = cp_build_binary_op (location,
3739 EQ_EXPR, e1, integer_zero_node,
3741 e2 = cp_build_binary_op (location, BIT_AND_EXPR,
3745 e2 = cp_build_binary_op (location,
3746 EQ_EXPR, e2, integer_zero_node,
3748 e1 = cp_build_binary_op (location,
3749 TRUTH_ANDIF_EXPR, e2, e1,
3751 e2 = cp_build_binary_op (location, EQ_EXPR,
3753 fold_convert (TREE_TYPE (pfn0),
3756 e2 = cp_build_binary_op (location,
3757 TRUTH_ANDIF_EXPR, e2, e1, complain);
3758 e1 = cp_build_binary_op (location,
3759 EQ_EXPR, delta0, delta1, complain);
3760 e1 = cp_build_binary_op (location,
3761 TRUTH_ORIF_EXPR, e1, e2, complain);
3768 && (!op0.pfn || op0.delta == op1.delta))
3770 The reason for the `!op0.pfn' bit is that a NULL
3771 pointer-to-member is any member with a zero PFN; the
3772 DELTA field is unspecified. */
3774 e1 = cp_build_binary_op (location,
3775 EQ_EXPR, delta0, delta1, complain);
3776 e2 = cp_build_binary_op (location,
3779 fold_convert (TREE_TYPE (pfn0),
3782 e1 = cp_build_binary_op (location,
3783 TRUTH_ORIF_EXPR, e1, e2, complain);
3785 e2 = build2 (EQ_EXPR, boolean_type_node, pfn0, pfn1);
3786 e = cp_build_binary_op (location,
3787 TRUTH_ANDIF_EXPR, e2, e1, complain);
3788 if (code == EQ_EXPR)
3790 return cp_build_binary_op (location,
3791 EQ_EXPR, e, integer_zero_node, complain);
3795 gcc_assert (!TYPE_PTRMEMFUNC_P (type0)
3796 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0),
3798 gcc_assert (!TYPE_PTRMEMFUNC_P (type1)
3799 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1),
3807 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3808 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3810 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3811 result_type = composite_pointer_type (type0, type1, op0, op1,
3812 "comparison", complain);
3819 if (TREE_CODE (orig_op0) == STRING_CST
3820 || TREE_CODE (orig_op1) == STRING_CST)
3822 if (complain & tf_warning)
3823 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
3826 build_type = boolean_type_node;
3827 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3828 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3830 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3831 result_type = composite_pointer_type (type0, type1, op0, op1,
3832 "comparison", complain);
3833 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
3834 && integer_zerop (op1))
3835 result_type = type0;
3836 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
3837 && integer_zerop (op0))
3838 result_type = type1;
3839 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
3841 result_type = type0;
3842 if (complain & tf_error)
3843 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
3845 return error_mark_node;
3847 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
3849 result_type = type1;
3850 if (complain & tf_error)
3851 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
3853 return error_mark_node;
3857 case UNORDERED_EXPR:
3864 build_type = integer_type_node;
3865 if (code0 != REAL_TYPE || code1 != REAL_TYPE)
3867 if (complain & tf_error)
3868 error ("unordered comparison on non-floating point argument");
3869 return error_mark_node;
3878 if (((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
3879 || code0 == ENUMERAL_TYPE)
3880 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3881 || code1 == COMPLEX_TYPE || code1 == ENUMERAL_TYPE)))
3882 arithmetic_types_p = 1;
3885 arithmetic_types_p = 0;
3886 /* Vector arithmetic is only allowed when both sides are vectors. */
3887 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
3889 if (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
3890 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
3893 binary_op_error (location, code, type0, type1);
3894 return error_mark_node;
3896 arithmetic_types_p = 1;
3899 /* Determine the RESULT_TYPE, if it is not already known. */
3901 && arithmetic_types_p
3902 && (shorten || common || short_compare))
3903 result_type = cp_common_type (type0, type1);
3907 if (complain & tf_error)
3908 error ("invalid operands of types %qT and %qT to binary %qO",
3909 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1), code);
3910 return error_mark_node;
3913 /* If we're in a template, the only thing we need to know is the
3915 if (processing_template_decl)
3917 /* Since the middle-end checks the type when doing a build2, we
3918 need to build the tree in pieces. This built tree will never
3919 get out of the front-end as we replace it when instantiating
3921 tree tmp = build2 (resultcode,
3922 build_type ? build_type : result_type,
3924 TREE_OPERAND (tmp, 0) = op0;
3928 if (arithmetic_types_p)
3930 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
3932 /* For certain operations (which identify themselves by shorten != 0)
3933 if both args were extended from the same smaller type,
3934 do the arithmetic in that type and then extend.
3936 shorten !=0 and !=1 indicates a bitwise operation.
3937 For them, this optimization is safe only if
3938 both args are zero-extended or both are sign-extended.
3939 Otherwise, we might change the result.
3940 E.g., (short)-1 | (unsigned short)-1 is (int)-1
3941 but calculated in (unsigned short) it would be (unsigned short)-1. */
3943 if (shorten && none_complex)
3945 final_type = result_type;
3946 result_type = shorten_binary_op (result_type, op0, op1,
3950 /* Comparison operations are shortened too but differently.
3951 They identify themselves by setting short_compare = 1. */
3955 /* Don't write &op0, etc., because that would prevent op0
3956 from being kept in a register.
3957 Instead, make copies of the our local variables and
3958 pass the copies by reference, then copy them back afterward. */
3959 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
3960 enum tree_code xresultcode = resultcode;
3962 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
3964 return cp_convert (boolean_type_node, val);
3965 op0 = xop0, op1 = xop1;
3967 resultcode = xresultcode;
3970 if ((short_compare || code == MIN_EXPR || code == MAX_EXPR)
3971 && warn_sign_compare
3972 /* Do not warn until the template is instantiated; we cannot
3973 bound the ranges of the arguments until that point. */
3974 && !processing_template_decl
3975 && (complain & tf_warning))
3977 warn_for_sign_compare (location, orig_op0, orig_op1, op0, op1,
3978 result_type, resultcode);
3982 /* Issue warnings about peculiar, but valid, uses of NULL. */
3983 if ((orig_op0 == null_node || orig_op1 == null_node)
3984 /* It's reasonable to use pointer values as operands of &&
3985 and ||, so NULL is no exception. */
3986 && code != TRUTH_ANDIF_EXPR && code != TRUTH_ORIF_EXPR
3987 && ( /* Both are NULL (or 0) and the operation was not a comparison. */
3988 (null_ptr_cst_p (orig_op0) && null_ptr_cst_p (orig_op1)
3989 && code != EQ_EXPR && code != NE_EXPR)
3990 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3991 || (!null_ptr_cst_p (orig_op0) && TREE_CODE (TREE_TYPE (op0)) != POINTER_TYPE)
3992 || (!null_ptr_cst_p (orig_op1) && TREE_CODE (TREE_TYPE (op1)) != POINTER_TYPE))
3993 && (complain & tf_warning))
3994 /* Some sort of arithmetic operation involving NULL was
3995 performed. Note that pointer-difference and pointer-addition
3996 have already been handled above, and so we don't end up here in
3998 warning (OPT_Wpointer_arith, "NULL used in arithmetic");
4001 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4002 Then the expression will be built.
4003 It will be given type FINAL_TYPE if that is nonzero;
4004 otherwise, it will be given type RESULT_TYPE. */
4007 if (TREE_TYPE (op0) != result_type)
4008 op0 = cp_convert_and_check (result_type, op0);
4009 if (TREE_TYPE (op1) != result_type)
4010 op1 = cp_convert_and_check (result_type, op1);
4012 if (op0 == error_mark_node || op1 == error_mark_node)
4013 return error_mark_node;
4016 if (build_type == NULL_TREE)
4017 build_type = result_type;
4019 result = build2 (resultcode, build_type, op0, op1);
4020 result = fold_if_not_in_template (result);
4021 if (final_type != 0)
4022 result = cp_convert (final_type, result);
4024 if (TREE_OVERFLOW_P (result)
4025 && !TREE_OVERFLOW_P (op0)
4026 && !TREE_OVERFLOW_P (op1))
4027 overflow_warning (result);
4032 /* Return a tree for the sum or difference (RESULTCODE says which)
4033 of pointer PTROP and integer INTOP. */
4036 cp_pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
4038 tree res_type = TREE_TYPE (ptrop);
4040 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4041 in certain circumstance (when it's valid to do so). So we need
4042 to make sure it's complete. We don't need to check here, if we
4043 can actually complete it at all, as those checks will be done in
4044 pointer_int_sum() anyway. */
4045 complete_type (TREE_TYPE (res_type));
4047 return pointer_int_sum (resultcode, ptrop,
4048 fold_if_not_in_template (intop));
4051 /* Return a tree for the difference of pointers OP0 and OP1.
4052 The resulting tree has type int. */
4055 pointer_diff (tree op0, tree op1, tree ptrtype)
4058 tree restype = ptrdiff_type_node;
4059 tree target_type = TREE_TYPE (ptrtype);
4061 if (!complete_type_or_else (target_type, NULL_TREE))
4062 return error_mark_node;
4064 if (TREE_CODE (target_type) == VOID_TYPE)
4065 permerror (input_location, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4066 if (TREE_CODE (target_type) == FUNCTION_TYPE)
4067 permerror (input_location, "ISO C++ forbids using pointer to a function in subtraction");
4068 if (TREE_CODE (target_type) == METHOD_TYPE)
4069 permerror (input_location, "ISO C++ forbids using pointer to a method in subtraction");
4071 /* First do the subtraction as integers;
4072 then drop through to build the divide operator. */
4074 op0 = cp_build_binary_op (input_location,
4076 cp_convert (restype, op0),
4077 cp_convert (restype, op1),
4078 tf_warning_or_error);
4080 /* This generates an error if op1 is a pointer to an incomplete type. */
4081 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1))))
4082 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4084 op1 = (TYPE_PTROB_P (ptrtype)
4085 ? size_in_bytes (target_type)
4086 : integer_one_node);
4088 /* Do the division. */
4090 result = build2 (EXACT_DIV_EXPR, restype, op0, cp_convert (restype, op1));
4091 return fold_if_not_in_template (result);
4094 /* Construct and perhaps optimize a tree representation
4095 for a unary operation. CODE, a tree_code, specifies the operation
4096 and XARG is the operand. */
4099 build_x_unary_op (enum tree_code code, tree xarg, tsubst_flags_t complain)
4101 tree orig_expr = xarg;
4105 if (processing_template_decl)
4107 if (type_dependent_expression_p (xarg))
4108 return build_min_nt (code, xarg, NULL_TREE);
4110 xarg = build_non_dependent_expr (xarg);
4115 /* [expr.unary.op] says:
4117 The address of an object of incomplete type can be taken.
4119 (And is just the ordinary address operator, not an overloaded
4120 "operator &".) However, if the type is a template
4121 specialization, we must complete the type at this point so that
4122 an overloaded "operator &" will be available if required. */
4123 if (code == ADDR_EXPR
4124 && TREE_CODE (xarg) != TEMPLATE_ID_EXPR
4125 && ((CLASS_TYPE_P (TREE_TYPE (xarg))
4126 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg))))
4127 || (TREE_CODE (xarg) == OFFSET_REF)))
4128 /* Don't look for a function. */;
4130 exp = build_new_op (code, LOOKUP_NORMAL, xarg, NULL_TREE, NULL_TREE,
4131 /*overloaded_p=*/NULL, complain);
4132 if (!exp && code == ADDR_EXPR)
4134 /* A pointer to member-function can be formed only by saying
4136 if (!flag_ms_extensions && TREE_CODE (TREE_TYPE (xarg)) == METHOD_TYPE
4137 && (TREE_CODE (xarg) != OFFSET_REF || !PTRMEM_OK_P (xarg)))
4139 if (TREE_CODE (xarg) != OFFSET_REF
4140 || !TYPE_P (TREE_OPERAND (xarg, 0)))
4142 error ("invalid use of %qE to form a pointer-to-member-function",
4144 if (TREE_CODE (xarg) != OFFSET_REF)
4145 inform (input_location, " a qualified-id is required");
4146 return error_mark_node;
4150 error ("parentheses around %qE cannot be used to form a"
4151 " pointer-to-member-function",
4153 PTRMEM_OK_P (xarg) = 1;
4157 if (TREE_CODE (xarg) == OFFSET_REF)
4159 ptrmem = PTRMEM_OK_P (xarg);
4161 if (!ptrmem && !flag_ms_extensions
4162 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg, 1))) == METHOD_TYPE)
4164 /* A single non-static member, make sure we don't allow a
4165 pointer-to-member. */
4166 xarg = build2 (OFFSET_REF, TREE_TYPE (xarg),
4167 TREE_OPERAND (xarg, 0),
4168 ovl_cons (TREE_OPERAND (xarg, 1), NULL_TREE));
4169 PTRMEM_OK_P (xarg) = ptrmem;
4172 else if (TREE_CODE (xarg) == TARGET_EXPR && (complain & tf_warning))
4173 warning (0, "taking address of temporary");
4174 exp = cp_build_unary_op (ADDR_EXPR, xarg, 0, complain);
4177 if (processing_template_decl && exp != error_mark_node)
4178 exp = build_min_non_dep (code, exp, orig_expr,
4179 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE);
4180 if (TREE_CODE (exp) == ADDR_EXPR)
4181 PTRMEM_OK_P (exp) = ptrmem;
4185 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4186 constants, where a null value is represented by an INTEGER_CST of
4190 cp_truthvalue_conversion (tree expr)
4192 tree type = TREE_TYPE (expr);
4193 if (TYPE_PTRMEM_P (type))
4194 return build_binary_op (EXPR_LOCATION (expr),
4195 NE_EXPR, expr, integer_zero_node, 1);
4197 return c_common_truthvalue_conversion (input_location, expr);
4200 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4203 condition_conversion (tree expr)
4206 if (processing_template_decl)
4208 t = perform_implicit_conversion (boolean_type_node, expr,
4209 tf_warning_or_error);
4210 t = fold_build_cleanup_point_expr (boolean_type_node, t);
4214 /* Return an ADDR_EXPR giving the address of T. This function
4215 attempts no optimizations or simplifications; it is a low-level
4219 build_address (tree t)
4223 if (error_operand_p (t) || !cxx_mark_addressable (t))
4224 return error_mark_node;
4226 addr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (t)), t);
4231 /* Return a NOP_EXPR converting EXPR to TYPE. */
4234 build_nop (tree type, tree expr)
4236 if (type == error_mark_node || error_operand_p (expr))
4238 return build1 (NOP_EXPR, type, expr);
4241 /* C++: Must handle pointers to members.
4243 Perhaps type instantiation should be extended to handle conversion
4244 from aggregates to types we don't yet know we want? (Or are those
4245 cases typically errors which should be reported?)
4247 NOCONVERT nonzero suppresses the default promotions
4248 (such as from short to int). */
4251 cp_build_unary_op (enum tree_code code, tree xarg, int noconvert,
4252 tsubst_flags_t complain)
4254 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4257 const char *errstring = NULL;
4259 const char *invalid_op_diag;
4261 if (error_operand_p (arg))
4262 return error_mark_node;
4264 if ((invalid_op_diag
4265 = targetm.invalid_unary_op ((code == UNARY_PLUS_EXPR
4270 error (invalid_op_diag);
4271 return error_mark_node;
4276 case UNARY_PLUS_EXPR:
4279 int flags = WANT_ARITH | WANT_ENUM;
4280 /* Unary plus (but not unary minus) is allowed on pointers. */
4281 if (code == UNARY_PLUS_EXPR)
4282 flags |= WANT_POINTER;
4283 arg = build_expr_type_conversion (flags, arg, true);
4285 errstring = (code == NEGATE_EXPR
4286 ? "wrong type argument to unary minus"
4287 : "wrong type argument to unary plus");
4290 if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
4291 arg = perform_integral_promotions (arg);
4293 /* Make sure the result is not an lvalue: a unary plus or minus
4294 expression is always a rvalue. */
4301 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4305 arg = default_conversion (arg);
4307 else if (!(arg = build_expr_type_conversion (WANT_INT | WANT_ENUM
4310 errstring = "wrong type argument to bit-complement";
4311 else if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
4312 arg = perform_integral_promotions (arg);
4316 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
4317 errstring = "wrong type argument to abs";
4318 else if (!noconvert)
4319 arg = default_conversion (arg);
4323 /* Conjugating a real value is a no-op, but allow it anyway. */
4324 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
4325 errstring = "wrong type argument to conjugation";
4326 else if (!noconvert)
4327 arg = default_conversion (arg);
4330 case TRUTH_NOT_EXPR:
4331 arg = perform_implicit_conversion (boolean_type_node, arg,
4333 val = invert_truthvalue (arg);
4334 if (arg != error_mark_node)
4336 errstring = "in argument to unary !";
4343 if (TREE_CODE (arg) == COMPLEX_CST)
4344 return TREE_REALPART (arg);
4345 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4347 arg = build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
4348 return fold_if_not_in_template (arg);
4354 if (TREE_CODE (arg) == COMPLEX_CST)
4355 return TREE_IMAGPART (arg);
4356 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4358 arg = build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
4359 return fold_if_not_in_template (arg);
4362 return cp_convert (TREE_TYPE (arg), integer_zero_node);
4364 case PREINCREMENT_EXPR:
4365 case POSTINCREMENT_EXPR:
4366 case PREDECREMENT_EXPR:
4367 case POSTDECREMENT_EXPR:
4368 /* Handle complex lvalues (when permitted)
4369 by reduction to simpler cases. */
4371 val = unary_complex_lvalue (code, arg);
4375 /* Increment or decrement the real part of the value,
4376 and don't change the imaginary part. */
4377 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4381 arg = stabilize_reference (arg);
4382 real = cp_build_unary_op (REALPART_EXPR, arg, 1, complain);
4383 imag = cp_build_unary_op (IMAGPART_EXPR, arg, 1, complain);
4384 real = cp_build_unary_op (code, real, 1, complain);
4385 if (real == error_mark_node || imag == error_mark_node)
4386 return error_mark_node;
4387 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
4391 /* Report invalid types. */
4393 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_POINTER,
4396 if (code == PREINCREMENT_EXPR)
4397 errstring ="no pre-increment operator for type";
4398 else if (code == POSTINCREMENT_EXPR)
4399 errstring ="no post-increment operator for type";
4400 else if (code == PREDECREMENT_EXPR)
4401 errstring ="no pre-decrement operator for type";
4403 errstring ="no post-decrement operator for type";
4406 else if (arg == error_mark_node)
4407 return error_mark_node;
4409 /* Report something read-only. */
4411 if (CP_TYPE_CONST_P (TREE_TYPE (arg))
4412 || TREE_READONLY (arg))
4414 if (complain & tf_error)
4415 readonly_error (arg, ((code == PREINCREMENT_EXPR
4416 || code == POSTINCREMENT_EXPR)
4417 ? "increment" : "decrement"));
4419 return error_mark_node;
4424 tree declared_type = unlowered_expr_type (arg);
4426 argtype = TREE_TYPE (arg);
4428 /* ARM $5.2.5 last annotation says this should be forbidden. */
4429 if (TREE_CODE (argtype) == ENUMERAL_TYPE)
4431 if (complain & tf_error)
4432 permerror (input_location, (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
4433 ? G_("ISO C++ forbids incrementing an enum")
4434 : G_("ISO C++ forbids decrementing an enum"));
4436 return error_mark_node;
4439 /* Compute the increment. */
4441 if (TREE_CODE (argtype) == POINTER_TYPE)
4443 tree type = complete_type (TREE_TYPE (argtype));
4445 if (!COMPLETE_OR_VOID_TYPE_P (type))
4447 if (complain & tf_error)
4448 error (((code == PREINCREMENT_EXPR
4449 || code == POSTINCREMENT_EXPR))
4450 ? G_("cannot increment a pointer to incomplete type %qT")
4451 : G_("cannot decrement a pointer to incomplete type %qT"),
4452 TREE_TYPE (argtype));
4454 return error_mark_node;
4456 else if ((pedantic || warn_pointer_arith)
4457 && !TYPE_PTROB_P (argtype))
4459 if (complain & tf_error)
4460 permerror (input_location, (code == PREINCREMENT_EXPR
4461 || code == POSTINCREMENT_EXPR)
4462 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
4463 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
4466 return error_mark_node;
4469 inc = cxx_sizeof_nowarn (TREE_TYPE (argtype));
4472 inc = integer_one_node;
4474 inc = cp_convert (argtype, inc);
4476 /* Complain about anything else that is not a true lvalue. */
4477 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
4478 || code == POSTINCREMENT_EXPR)
4479 ? lv_increment : lv_decrement),
4481 return error_mark_node;
4483 /* Forbid using -- on `bool'. */
4484 if (same_type_p (declared_type, boolean_type_node))
4486 if (code == POSTDECREMENT_EXPR || code == PREDECREMENT_EXPR)
4488 if (complain & tf_error)
4489 error ("invalid use of Boolean expression as operand "
4490 "to %<operator--%>");
4491 return error_mark_node;
4493 val = boolean_increment (code, arg);
4496 val = build2 (code, TREE_TYPE (arg), arg, inc);
4498 TREE_SIDE_EFFECTS (val) = 1;
4503 /* Note that this operation never does default_conversion
4504 regardless of NOCONVERT. */
4506 argtype = lvalue_type (arg);
4508 if (TREE_CODE (arg) == OFFSET_REF)
4511 if (TREE_CODE (argtype) == REFERENCE_TYPE)
4513 tree type = build_pointer_type (TREE_TYPE (argtype));
4514 arg = build1 (CONVERT_EXPR, type, arg);
4517 else if (pedantic && DECL_MAIN_P (arg))
4520 /* Apparently a lot of autoconf scripts for C++ packages do this,
4521 so only complain if -pedantic. */
4522 if (complain & (flag_pedantic_errors ? tf_error : tf_warning))
4523 pedwarn (input_location, OPT_pedantic,
4524 "ISO C++ forbids taking address of function %<::main%>");
4525 else if (flag_pedantic_errors)
4526 return error_mark_node;
4529 /* Let &* cancel out to simplify resulting code. */
4530 if (TREE_CODE (arg) == INDIRECT_REF)
4532 /* We don't need to have `current_class_ptr' wrapped in a
4533 NON_LVALUE_EXPR node. */
4534 if (arg == current_class_ref)
4535 return current_class_ptr;
4537 arg = TREE_OPERAND (arg, 0);
4538 if (TREE_CODE (TREE_TYPE (arg)) == REFERENCE_TYPE)
4540 tree type = build_pointer_type (TREE_TYPE (TREE_TYPE (arg)));
4541 arg = build1 (CONVERT_EXPR, type, arg);
4544 /* Don't let this be an lvalue. */
4549 /* Uninstantiated types are all functions. Taking the
4550 address of a function is a no-op, so just return the
4553 gcc_assert (TREE_CODE (arg) != IDENTIFIER_NODE
4554 || !IDENTIFIER_OPNAME_P (arg));
4556 if (TREE_CODE (arg) == COMPONENT_REF && type_unknown_p (arg)
4557 && !really_overloaded_fn (TREE_OPERAND (arg, 1)))
4559 /* They're trying to take the address of a unique non-static
4560 member function. This is ill-formed (except in MS-land),
4561 but let's try to DTRT.
4562 Note: We only handle unique functions here because we don't
4563 want to complain if there's a static overload; non-unique
4564 cases will be handled by instantiate_type. But we need to
4565 handle this case here to allow casts on the resulting PMF.
4566 We could defer this in non-MS mode, but it's easier to give
4567 a useful error here. */
4569 /* Inside constant member functions, the `this' pointer
4570 contains an extra const qualifier. TYPE_MAIN_VARIANT
4571 is used here to remove this const from the diagnostics
4572 and the created OFFSET_REF. */
4573 tree base = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg, 0)));
4574 tree fn = get_first_fn (TREE_OPERAND (arg, 1));
4577 if (! flag_ms_extensions)
4579 tree name = DECL_NAME (fn);
4580 if (!(complain & tf_error))
4581 return error_mark_node;
4582 else if (current_class_type
4583 && TREE_OPERAND (arg, 0) == current_class_ref)
4584 /* An expression like &memfn. */
4585 permerror (input_location, "ISO C++ forbids taking the address of an unqualified"
4586 " or parenthesized non-static member function to form"
4587 " a pointer to member function. Say %<&%T::%D%>",
4590 permerror (input_location, "ISO C++ forbids taking the address of a bound member"
4591 " function to form a pointer to member function."
4595 arg = build_offset_ref (base, fn, /*address_p=*/true);
4599 if (type_unknown_p (arg))
4600 return build1 (ADDR_EXPR, unknown_type_node, arg);
4602 /* Handle complex lvalues (when permitted)
4603 by reduction to simpler cases. */
4604 val = unary_complex_lvalue (code, arg);
4608 switch (TREE_CODE (arg))
4612 case FIX_TRUNC_EXPR:
4613 /* Even if we're not being pedantic, we cannot allow this
4614 extension when we're instantiating in a SFINAE
4616 if (! lvalue_p (arg) && complain == tf_none)
4618 if (complain & tf_error)
4619 permerror (input_location, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4621 return error_mark_node;
4626 arg = BASELINK_FUNCTIONS (arg);
4630 arg = OVL_CURRENT (arg);
4634 /* Turn a reference to a non-static data member into a
4635 pointer-to-member. */
4640 if (!PTRMEM_OK_P (arg))
4641 return cp_build_unary_op (code, arg, 0, complain);
4643 t = TREE_OPERAND (arg, 1);
4644 if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
4646 if (complain & tf_error)
4647 error ("cannot create pointer to reference member %qD", t);
4648 return error_mark_node;
4651 type = build_ptrmem_type (context_for_name_lookup (t),
4653 t = make_ptrmem_cst (type, TREE_OPERAND (arg, 1));
4661 /* Anything not already handled and not a true memory reference
4663 if (TREE_CODE (argtype) != FUNCTION_TYPE
4664 && TREE_CODE (argtype) != METHOD_TYPE
4665 && TREE_CODE (arg) != OFFSET_REF
4666 && !lvalue_or_else (arg, lv_addressof, complain))
4667 return error_mark_node;
4669 if (argtype != error_mark_node)
4670 argtype = build_pointer_type (argtype);
4672 /* In a template, we are processing a non-dependent expression
4673 so we can just form an ADDR_EXPR with the correct type. */
4674 if (processing_template_decl || TREE_CODE (arg) != COMPONENT_REF)
4676 val = build_address (arg);
4677 if (TREE_CODE (arg) == OFFSET_REF)
4678 PTRMEM_OK_P (val) = PTRMEM_OK_P (arg);
4680 else if (TREE_CODE (TREE_OPERAND (arg, 1)) == BASELINK)
4682 tree fn = BASELINK_FUNCTIONS (TREE_OPERAND (arg, 1));
4684 /* We can only get here with a single static member
4686 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
4687 && DECL_STATIC_FUNCTION_P (fn));
4689 val = build_address (fn);
4690 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg, 0)))
4691 /* Do not lose object's side effects. */
4692 val = build2 (COMPOUND_EXPR, TREE_TYPE (val),
4693 TREE_OPERAND (arg, 0), val);
4695 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)))
4697 if (complain & tf_error)
4698 error ("attempt to take address of bit-field structure member %qD",
4699 TREE_OPERAND (arg, 1));
4700 return error_mark_node;
4704 tree object = TREE_OPERAND (arg, 0);
4705 tree field = TREE_OPERAND (arg, 1);
4706 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4707 (TREE_TYPE (object), decl_type_context (field)));
4708 val = build_address (arg);
4711 if (TREE_CODE (argtype) == POINTER_TYPE
4712 && TREE_CODE (TREE_TYPE (argtype)) == METHOD_TYPE)
4714 build_ptrmemfunc_type (argtype);
4715 val = build_ptrmemfunc (argtype, val, 0,
4716 /*c_cast_p=*/false);
4728 argtype = TREE_TYPE (arg);
4729 return fold_if_not_in_template (build1 (code, argtype, arg));
4732 if (complain & tf_error)
4733 error ("%s", errstring);
4734 return error_mark_node;
4737 /* Hook for the c-common bits that build a unary op. */
4739 build_unary_op (location_t location ATTRIBUTE_UNUSED,
4740 enum tree_code code, tree xarg, int noconvert)
4742 return cp_build_unary_op (code, xarg, noconvert, tf_warning_or_error);
4745 /* Apply unary lvalue-demanding operator CODE to the expression ARG
4746 for certain kinds of expressions which are not really lvalues
4747 but which we can accept as lvalues.
4749 If ARG is not a kind of expression we can handle, return
4753 unary_complex_lvalue (enum tree_code code, tree arg)
4755 /* Inside a template, making these kinds of adjustments is
4756 pointless; we are only concerned with the type of the
4758 if (processing_template_decl)
4761 /* Handle (a, b) used as an "lvalue". */
4762 if (TREE_CODE (arg) == COMPOUND_EXPR)
4764 tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 1), 0,
4765 tf_warning_or_error);
4766 return build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
4767 TREE_OPERAND (arg, 0), real_result);
4770 /* Handle (a ? b : c) used as an "lvalue". */
4771 if (TREE_CODE (arg) == COND_EXPR
4772 || TREE_CODE (arg) == MIN_EXPR || TREE_CODE (arg) == MAX_EXPR)
4773 return rationalize_conditional_expr (code, arg, tf_warning_or_error);
4775 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
4776 if (TREE_CODE (arg) == MODIFY_EXPR
4777 || TREE_CODE (arg) == PREINCREMENT_EXPR
4778 || TREE_CODE (arg) == PREDECREMENT_EXPR)
4780 tree lvalue = TREE_OPERAND (arg, 0);
4781 if (TREE_SIDE_EFFECTS (lvalue))
4783 lvalue = stabilize_reference (lvalue);
4784 arg = build2 (TREE_CODE (arg), TREE_TYPE (arg),
4785 lvalue, TREE_OPERAND (arg, 1));
4787 return unary_complex_lvalue
4788 (code, build2 (COMPOUND_EXPR, TREE_TYPE (lvalue), arg, lvalue));
4791 if (code != ADDR_EXPR)
4794 /* Handle (a = b) used as an "lvalue" for `&'. */
4795 if (TREE_CODE (arg) == MODIFY_EXPR
4796 || TREE_CODE (arg) == INIT_EXPR)
4798 tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 0), 0,
4799 tf_warning_or_error);
4800 arg = build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
4802 TREE_NO_WARNING (arg) = 1;
4806 if (TREE_CODE (TREE_TYPE (arg)) == FUNCTION_TYPE
4807 || TREE_CODE (TREE_TYPE (arg)) == METHOD_TYPE
4808 || TREE_CODE (arg) == OFFSET_REF)
4811 /* We permit compiler to make function calls returning
4812 objects of aggregate type look like lvalues. */
4816 if (TREE_CODE (targ) == SAVE_EXPR)
4817 targ = TREE_OPERAND (targ, 0);
4819 if (TREE_CODE (targ) == CALL_EXPR && MAYBE_CLASS_TYPE_P (TREE_TYPE (targ)))
4821 if (TREE_CODE (arg) == SAVE_EXPR)
4824 targ = build_cplus_new (TREE_TYPE (arg), arg);
4825 return build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (arg)), targ);
4828 if (TREE_CODE (arg) == SAVE_EXPR && TREE_CODE (targ) == INDIRECT_REF)
4829 return build3 (SAVE_EXPR, build_pointer_type (TREE_TYPE (arg)),
4830 TREE_OPERAND (targ, 0), current_function_decl, NULL);
4833 /* Don't let anything else be handled specially. */
4837 /* Mark EXP saying that we need to be able to take the
4838 address of it; it should not be allocated in a register.
4839 Value is true if successful.
4841 C++: we do not allow `current_class_ptr' to be addressable. */
4844 cxx_mark_addressable (tree exp)
4849 switch (TREE_CODE (x))
4856 x = TREE_OPERAND (x, 0);
4860 if (x == current_class_ptr)
4862 error ("cannot take the address of %<this%>, which is an rvalue expression");
4863 TREE_ADDRESSABLE (x) = 1; /* so compiler doesn't die later. */
4869 /* Caller should not be trying to mark initialized
4870 constant fields addressable. */
4871 gcc_assert (DECL_LANG_SPECIFIC (x) == 0
4872 || DECL_IN_AGGR_P (x) == 0
4874 || DECL_EXTERNAL (x));
4879 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
4880 && !DECL_ARTIFICIAL (x))
4882 if (TREE_CODE (x) == VAR_DECL && DECL_HARD_REGISTER (x))
4885 ("address of explicit register variable %qD requested", x);
4888 else if (extra_warnings)
4890 (OPT_Wextra, "address requested for %qD, which is declared %<register%>", x);
4892 TREE_ADDRESSABLE (x) = 1;
4896 TREE_ADDRESSABLE (x) = 1;
4900 TREE_ADDRESSABLE (x) = 1;
4904 TREE_ADDRESSABLE (x) = 1;
4905 cxx_mark_addressable (TREE_OPERAND (x, 0));
4913 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
4916 build_x_conditional_expr (tree ifexp, tree op1, tree op2,
4917 tsubst_flags_t complain)
4919 tree orig_ifexp = ifexp;
4920 tree orig_op1 = op1;
4921 tree orig_op2 = op2;
4924 if (processing_template_decl)
4926 /* The standard says that the expression is type-dependent if
4927 IFEXP is type-dependent, even though the eventual type of the
4928 expression doesn't dependent on IFEXP. */
4929 if (type_dependent_expression_p (ifexp)
4930 /* As a GNU extension, the middle operand may be omitted. */
4931 || (op1 && type_dependent_expression_p (op1))
4932 || type_dependent_expression_p (op2))
4933 return build_min_nt (COND_EXPR, ifexp, op1, op2);
4934 ifexp = build_non_dependent_expr (ifexp);
4936 op1 = build_non_dependent_expr (op1);
4937 op2 = build_non_dependent_expr (op2);
4940 expr = build_conditional_expr (ifexp, op1, op2, complain);
4941 if (processing_template_decl && expr != error_mark_node)
4942 return build_min_non_dep (COND_EXPR, expr,
4943 orig_ifexp, orig_op1, orig_op2);
4947 /* Given a list of expressions, return a compound expression
4948 that performs them all and returns the value of the last of them. */
4950 tree build_x_compound_expr_from_list (tree list, const char *msg)
4952 tree expr = TREE_VALUE (list);
4954 if (TREE_CHAIN (list))
4957 permerror (input_location, "%s expression list treated as compound expression", msg);
4959 for (list = TREE_CHAIN (list); list; list = TREE_CHAIN (list))
4960 expr = build_x_compound_expr (expr, TREE_VALUE (list),
4961 tf_warning_or_error);
4967 /* Handle overloading of the ',' operator when needed. */
4970 build_x_compound_expr (tree op1, tree op2, tsubst_flags_t complain)
4973 tree orig_op1 = op1;
4974 tree orig_op2 = op2;
4976 if (processing_template_decl)
4978 if (type_dependent_expression_p (op1)
4979 || type_dependent_expression_p (op2))
4980 return build_min_nt (COMPOUND_EXPR, op1, op2);
4981 op1 = build_non_dependent_expr (op1);
4982 op2 = build_non_dependent_expr (op2);
4985 result = build_new_op (COMPOUND_EXPR, LOOKUP_NORMAL, op1, op2, NULL_TREE,
4986 /*overloaded_p=*/NULL, complain);
4988 result = cp_build_compound_expr (op1, op2, complain);
4990 if (processing_template_decl && result != error_mark_node)
4991 return build_min_non_dep (COMPOUND_EXPR, result, orig_op1, orig_op2);
4996 /* Like cp_build_compound_expr, but for the c-common bits. */
4999 build_compound_expr (tree lhs, tree rhs)
5001 return cp_build_compound_expr (lhs, rhs, tf_warning_or_error);
5004 /* Build a compound expression. */
5007 cp_build_compound_expr (tree lhs, tree rhs, tsubst_flags_t complain)
5009 lhs = convert_to_void (lhs, "left-hand operand of comma", complain);
5011 if (lhs == error_mark_node || rhs == error_mark_node)
5012 return error_mark_node;
5014 if (TREE_CODE (rhs) == TARGET_EXPR)
5016 /* If the rhs is a TARGET_EXPR, then build the compound
5017 expression inside the target_expr's initializer. This
5018 helps the compiler to eliminate unnecessary temporaries. */
5019 tree init = TREE_OPERAND (rhs, 1);
5021 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), lhs, init);
5022 TREE_OPERAND (rhs, 1) = init;
5027 return build2 (COMPOUND_EXPR, TREE_TYPE (rhs), lhs, rhs);
5030 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5031 casts away constness. CAST gives the type of cast. */
5034 check_for_casting_away_constness (tree src_type, tree dest_type,
5035 enum tree_code cast)
5037 /* C-style casts are allowed to cast away constness. With
5038 WARN_CAST_QUAL, we still want to issue a warning. */
5039 if (cast == CAST_EXPR && !warn_cast_qual)
5042 if (casts_away_constness (src_type, dest_type))
5046 warning (OPT_Wcast_qual,
5047 "cast from type %qT to type %qT casts away constness",
5048 src_type, dest_type);
5051 case STATIC_CAST_EXPR:
5052 error ("static_cast from type %qT to type %qT casts away constness",
5053 src_type, dest_type);
5056 case REINTERPRET_CAST_EXPR:
5057 error ("reinterpret_cast from type %qT to type %qT casts away constness",
5058 src_type, dest_type);
5065 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5066 (another pointer-to-member type in the same hierarchy) and return
5067 the converted expression. If ALLOW_INVERSE_P is permitted, a
5068 pointer-to-derived may be converted to pointer-to-base; otherwise,
5069 only the other direction is permitted. If C_CAST_P is true, this
5070 conversion is taking place as part of a C-style cast. */
5073 convert_ptrmem (tree type, tree expr, bool allow_inverse_p,
5076 if (TYPE_PTRMEM_P (type))
5080 if (TREE_CODE (expr) == PTRMEM_CST)
5081 expr = cplus_expand_constant (expr);
5082 delta = get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr)),
5083 TYPE_PTRMEM_CLASS_TYPE (type),
5086 if (!integer_zerop (delta))
5088 tree cond, op1, op2;
5090 cond = cp_build_binary_op (input_location,
5093 build_int_cst (TREE_TYPE (expr), -1),
5094 tf_warning_or_error);
5095 op1 = build_nop (ptrdiff_type_node, expr);
5096 op2 = cp_build_binary_op (input_location,
5097 PLUS_EXPR, op1, delta,
5098 tf_warning_or_error);
5100 expr = fold_build3 (COND_EXPR, ptrdiff_type_node, cond, op1, op2);
5104 return build_nop (type, expr);
5107 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), expr,
5108 allow_inverse_p, c_cast_p);
5111 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
5112 a version of EXPR that has TREE_OVERFLOW set if it is set in ORIG.
5113 Otherwise, return EXPR unchanged. */
5116 ignore_overflows (tree expr, tree orig)
5118 if (TREE_CODE (expr) == INTEGER_CST
5119 && CONSTANT_CLASS_P (orig)
5120 && TREE_CODE (orig) != STRING_CST
5121 && TREE_OVERFLOW (expr) != TREE_OVERFLOW (orig))
5123 if (!TREE_OVERFLOW (orig))
5124 /* Ensure constant sharing. */
5125 expr = build_int_cst_wide (TREE_TYPE (expr),
5126 TREE_INT_CST_LOW (expr),
5127 TREE_INT_CST_HIGH (expr));
5130 /* Avoid clobbering a shared constant. */
5131 expr = copy_node (expr);
5132 TREE_OVERFLOW (expr) = TREE_OVERFLOW (orig);
5138 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5139 this static_cast is being attempted as one of the possible casts
5140 allowed by a C-style cast. (In that case, accessibility of base
5141 classes is not considered, and it is OK to cast away
5142 constness.) Return the result of the cast. *VALID_P is set to
5143 indicate whether or not the cast was valid. */
5146 build_static_cast_1 (tree type, tree expr, bool c_cast_p,
5147 bool *valid_p, tsubst_flags_t complain)
5153 /* Assume the cast is valid. */
5156 intype = TREE_TYPE (expr);
5158 /* Save casted types in the function's used types hash table. */
5159 used_types_insert (type);
5161 /* [expr.static.cast]
5163 An lvalue of type "cv1 B", where B is a class type, can be cast
5164 to type "reference to cv2 D", where D is a class derived (clause
5165 _class.derived_) from B, if a valid standard conversion from
5166 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5167 same cv-qualification as, or greater cv-qualification than, cv1,
5168 and B is not a virtual base class of D. */
5169 /* We check this case before checking the validity of "TYPE t =
5170 EXPR;" below because for this case:
5173 struct D : public B { D(const B&); };
5175 void f() { static_cast<const D&>(b); }
5177 we want to avoid constructing a new D. The standard is not
5178 completely clear about this issue, but our interpretation is
5179 consistent with other compilers. */
5180 if (TREE_CODE (type) == REFERENCE_TYPE
5181 && CLASS_TYPE_P (TREE_TYPE (type))
5182 && CLASS_TYPE_P (intype)
5183 && real_lvalue_p (expr)
5184 && DERIVED_FROM_P (intype, TREE_TYPE (type))
5185 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype)),
5186 build_pointer_type (TYPE_MAIN_VARIANT
5187 (TREE_TYPE (type))))
5189 || at_least_as_qualified_p (TREE_TYPE (type), intype)))
5193 /* There is a standard conversion from "D*" to "B*" even if "B"
5194 is ambiguous or inaccessible. If this is really a
5195 static_cast, then we check both for inaccessibility and
5196 ambiguity. However, if this is a static_cast being performed
5197 because the user wrote a C-style cast, then accessibility is
5199 base = lookup_base (TREE_TYPE (type), intype,
5200 c_cast_p ? ba_unique : ba_check,
5203 /* Convert from "B*" to "D*". This function will check that "B"
5204 is not a virtual base of "D". */
5205 expr = build_base_path (MINUS_EXPR, build_address (expr),
5206 base, /*nonnull=*/false);
5207 /* Convert the pointer to a reference -- but then remember that
5208 there are no expressions with reference type in C++. */
5209 return convert_from_reference (build_nop (type, expr));
5214 /* [expr.static.cast]
5216 An expression e can be explicitly converted to a type T using a
5217 static_cast of the form static_cast<T>(e) if the declaration T
5218 t(e);" is well-formed, for some invented temporary variable
5220 result = perform_direct_initialization_if_possible (type, expr,
5221 c_cast_p, complain);
5224 result = convert_from_reference (result);
5226 /* Ignore any integer overflow caused by the cast. */
5227 result = ignore_overflows (result, orig);
5229 /* [expr.static.cast]
5231 If T is a reference type, the result is an lvalue; otherwise,
5232 the result is an rvalue. */
5233 if (TREE_CODE (type) != REFERENCE_TYPE)
5234 result = rvalue (result);
5238 /* [expr.static.cast]
5240 Any expression can be explicitly converted to type cv void. */
5241 if (TREE_CODE (type) == VOID_TYPE)
5242 return convert_to_void (expr, /*implicit=*/NULL, complain);
5244 /* [expr.static.cast]
5246 The inverse of any standard conversion sequence (clause _conv_),
5247 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5248 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5249 (_conv.bool_) conversions, can be performed explicitly using
5250 static_cast subject to the restriction that the explicit
5251 conversion does not cast away constness (_expr.const.cast_), and
5252 the following additional rules for specific cases: */
5253 /* For reference, the conversions not excluded are: integral
5254 promotions, floating point promotion, integral conversions,
5255 floating point conversions, floating-integral conversions,
5256 pointer conversions, and pointer to member conversions. */
5259 A value of integral _or enumeration_ type can be explicitly
5260 converted to an enumeration type. */
5261 /* The effect of all that is that any conversion between any two
5262 types which are integral, floating, or enumeration types can be
5264 if ((INTEGRAL_TYPE_P (type) || SCALAR_FLOAT_TYPE_P (type))
5265 && (INTEGRAL_TYPE_P (intype) || SCALAR_FLOAT_TYPE_P (intype)))
5267 expr = ocp_convert (type, expr, CONV_C_CAST, LOOKUP_NORMAL);
5269 /* Ignore any integer overflow caused by the cast. */
5270 expr = ignore_overflows (expr, orig);
5274 if (TYPE_PTR_P (type) && TYPE_PTR_P (intype)
5275 && CLASS_TYPE_P (TREE_TYPE (type))
5276 && CLASS_TYPE_P (TREE_TYPE (intype))
5277 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5278 (TREE_TYPE (intype))),
5279 build_pointer_type (TYPE_MAIN_VARIANT
5280 (TREE_TYPE (type)))))
5285 check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR);
5286 base = lookup_base (TREE_TYPE (type), TREE_TYPE (intype),
5287 c_cast_p ? ba_unique : ba_check,
5289 return build_base_path (MINUS_EXPR, expr, base, /*nonnull=*/false);
5292 if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
5293 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
5300 c1 = TYPE_PTRMEM_CLASS_TYPE (intype);
5301 c2 = TYPE_PTRMEM_CLASS_TYPE (type);
5303 if (TYPE_PTRMEM_P (type))
5305 t1 = (build_ptrmem_type
5307 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype))));
5308 t2 = (build_ptrmem_type
5310 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type))));
5317 if (can_convert (t1, t2) || can_convert (t2, t1))
5320 check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR);
5321 return convert_ptrmem (type, expr, /*allow_inverse_p=*/1,
5326 /* [expr.static.cast]
5328 An rvalue of type "pointer to cv void" can be explicitly
5329 converted to a pointer to object type. A value of type pointer
5330 to object converted to "pointer to cv void" and back to the
5331 original pointer type will have its original value. */
5332 if (TREE_CODE (intype) == POINTER_TYPE
5333 && VOID_TYPE_P (TREE_TYPE (intype))
5334 && TYPE_PTROB_P (type))
5337 check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR);
5338 return build_nop (type, expr);
5342 return error_mark_node;
5345 /* Return an expression representing static_cast<TYPE>(EXPR). */
5348 build_static_cast (tree type, tree expr, tsubst_flags_t complain)
5353 if (type == error_mark_node || expr == error_mark_node)
5354 return error_mark_node;
5356 if (processing_template_decl)
5358 expr = build_min (STATIC_CAST_EXPR, type, expr);
5359 /* We don't know if it will or will not have side effects. */
5360 TREE_SIDE_EFFECTS (expr) = 1;
5361 return convert_from_reference (expr);
5364 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5365 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5366 if (TREE_CODE (type) != REFERENCE_TYPE
5367 && TREE_CODE (expr) == NOP_EXPR
5368 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
5369 expr = TREE_OPERAND (expr, 0);
5371 result = build_static_cast_1 (type, expr, /*c_cast_p=*/false, &valid_p,
5376 if (complain & tf_error)
5377 error ("invalid static_cast from type %qT to type %qT",
5378 TREE_TYPE (expr), type);
5379 return error_mark_node;
5382 /* EXPR is an expression with member function or pointer-to-member
5383 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5384 not permitted by ISO C++, but we accept it in some modes. If we
5385 are not in one of those modes, issue a diagnostic. Return the
5386 converted expression. */
5389 convert_member_func_to_ptr (tree type, tree expr)
5394 intype = TREE_TYPE (expr);
5395 gcc_assert (TYPE_PTRMEMFUNC_P (intype)
5396 || TREE_CODE (intype) == METHOD_TYPE);
5398 if (pedantic || warn_pmf2ptr)
5399 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpmf_conversions,
5400 "converting from %qT to %qT", intype, type);
5402 if (TREE_CODE (intype) == METHOD_TYPE)
5403 expr = build_addr_func (expr);
5404 else if (TREE_CODE (expr) == PTRMEM_CST)
5405 expr = build_address (PTRMEM_CST_MEMBER (expr));
5408 decl = maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype), 0);
5409 decl = build_address (decl);
5410 expr = get_member_function_from_ptrfunc (&decl, expr);
5413 return build_nop (type, expr);
5416 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
5417 If C_CAST_P is true, this reinterpret cast is being done as part of
5418 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
5419 indicate whether or not reinterpret_cast was valid. */
5422 build_reinterpret_cast_1 (tree type, tree expr, bool c_cast_p,
5423 bool *valid_p, tsubst_flags_t complain)
5427 /* Assume the cast is invalid. */
5431 if (type == error_mark_node || error_operand_p (expr))
5432 return error_mark_node;
5434 intype = TREE_TYPE (expr);
5436 /* Save casted types in the function's used types hash table. */
5437 used_types_insert (type);
5439 /* [expr.reinterpret.cast]
5440 An lvalue expression of type T1 can be cast to the type
5441 "reference to T2" if an expression of type "pointer to T1" can be
5442 explicitly converted to the type "pointer to T2" using a
5443 reinterpret_cast. */
5444 if (TREE_CODE (type) == REFERENCE_TYPE)
5446 if (! real_lvalue_p (expr))
5448 if (complain & tf_error)
5449 error ("invalid cast of an rvalue expression of type "
5452 return error_mark_node;
5455 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
5456 "B" are related class types; the reinterpret_cast does not
5457 adjust the pointer. */
5458 if (TYPE_PTR_P (intype)
5459 && (complain & tf_warning)
5460 && (comptypes (TREE_TYPE (intype), TREE_TYPE (type),
5461 COMPARE_BASE | COMPARE_DERIVED)))
5462 warning (0, "casting %qT to %qT does not dereference pointer",
5465 expr = cp_build_unary_op (ADDR_EXPR, expr, 0, complain);
5466 if (expr != error_mark_node)
5467 expr = build_reinterpret_cast_1
5468 (build_pointer_type (TREE_TYPE (type)), expr, c_cast_p,
5470 if (expr != error_mark_node)
5471 expr = cp_build_indirect_ref (expr, 0, complain);
5475 /* As a G++ extension, we consider conversions from member
5476 functions, and pointers to member functions to
5477 pointer-to-function and pointer-to-void types. If
5478 -Wno-pmf-conversions has not been specified,
5479 convert_member_func_to_ptr will issue an error message. */
5480 if ((TYPE_PTRMEMFUNC_P (intype)
5481 || TREE_CODE (intype) == METHOD_TYPE)
5482 && TYPE_PTR_P (type)
5483 && (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
5484 || VOID_TYPE_P (TREE_TYPE (type))))
5485 return convert_member_func_to_ptr (type, expr);
5487 /* If the cast is not to a reference type, the lvalue-to-rvalue,
5488 array-to-pointer, and function-to-pointer conversions are
5490 expr = decay_conversion (expr);
5492 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5493 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5494 if (TREE_CODE (expr) == NOP_EXPR
5495 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
5496 expr = TREE_OPERAND (expr, 0);
5498 if (error_operand_p (expr))
5499 return error_mark_node;
5501 intype = TREE_TYPE (expr);
5503 /* [expr.reinterpret.cast]
5504 A pointer can be converted to any integral type large enough to
5506 if (CP_INTEGRAL_TYPE_P (type) && TYPE_PTR_P (intype))
5508 if (TYPE_PRECISION (type) < TYPE_PRECISION (intype))
5510 if (complain & tf_error)
5511 permerror (input_location, "cast from %qT to %qT loses precision",
5514 return error_mark_node;
5517 /* [expr.reinterpret.cast]
5518 A value of integral or enumeration type can be explicitly
5519 converted to a pointer. */
5520 else if (TYPE_PTR_P (type) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype))
5523 else if ((TYPE_PTRFN_P (type) && TYPE_PTRFN_P (intype))
5524 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
5525 return fold_if_not_in_template (build_nop (type, expr));
5526 else if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
5527 || (TYPE_PTROBV_P (type) && TYPE_PTROBV_P (intype)))
5532 check_for_casting_away_constness (intype, type, REINTERPRET_CAST_EXPR);
5533 /* Warn about possible alignment problems. */
5534 if (STRICT_ALIGNMENT && warn_cast_align
5535 && (complain & tf_warning)
5536 && !VOID_TYPE_P (type)
5537 && TREE_CODE (TREE_TYPE (intype)) != FUNCTION_TYPE
5538 && COMPLETE_TYPE_P (TREE_TYPE (type))
5539 && COMPLETE_TYPE_P (TREE_TYPE (intype))
5540 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (intype)))
5541 warning (OPT_Wcast_align, "cast from %qT to %qT "
5542 "increases required alignment of target type", intype, type);
5544 /* We need to strip nops here, because the front end likes to
5545 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
5547 if (warn_strict_aliasing <= 2)
5548 strict_aliasing_warning (intype, type, sexpr);
5550 return fold_if_not_in_template (build_nop (type, expr));
5552 else if ((TYPE_PTRFN_P (type) && TYPE_PTROBV_P (intype))
5553 || (TYPE_PTRFN_P (intype) && TYPE_PTROBV_P (type)))
5555 if (pedantic && (complain & tf_warning))
5556 /* Only issue a warning, as we have always supported this
5557 where possible, and it is necessary in some cases. DR 195
5558 addresses this issue, but as of 2004/10/26 is still in
5560 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
5561 return fold_if_not_in_template (build_nop (type, expr));
5563 else if (TREE_CODE (type) == VECTOR_TYPE)
5564 return fold_if_not_in_template (convert_to_vector (type, expr));
5565 else if (TREE_CODE (intype) == VECTOR_TYPE && INTEGRAL_TYPE_P (type))
5566 return fold_if_not_in_template (convert_to_integer (type, expr));
5571 if (complain & tf_error)
5572 error ("invalid cast from type %qT to type %qT", intype, type);
5573 return error_mark_node;
5576 return cp_convert (type, expr);
5580 build_reinterpret_cast (tree type, tree expr, tsubst_flags_t complain)
5582 if (type == error_mark_node || expr == error_mark_node)
5583 return error_mark_node;
5585 if (processing_template_decl)
5587 tree t = build_min (REINTERPRET_CAST_EXPR, type, expr);
5589 if (!TREE_SIDE_EFFECTS (t)
5590 && type_dependent_expression_p (expr))
5591 /* There might turn out to be side effects inside expr. */
5592 TREE_SIDE_EFFECTS (t) = 1;
5593 return convert_from_reference (t);
5596 return build_reinterpret_cast_1 (type, expr, /*c_cast_p=*/false,
5597 /*valid_p=*/NULL, complain);
5600 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
5601 return an appropriate expression. Otherwise, return
5602 error_mark_node. If the cast is not valid, and COMPLAIN is true,
5603 then a diagnostic will be issued. If VALID_P is non-NULL, we are
5604 performing a C-style cast, its value upon return will indicate
5605 whether or not the conversion succeeded. */
5608 build_const_cast_1 (tree dst_type, tree expr, bool complain,
5612 tree reference_type;
5614 /* Callers are responsible for handling error_mark_node as a
5615 destination type. */
5616 gcc_assert (dst_type != error_mark_node);
5617 /* In a template, callers should be building syntactic
5618 representations of casts, not using this machinery. */
5619 gcc_assert (!processing_template_decl);
5621 /* Assume the conversion is invalid. */
5625 if (!POINTER_TYPE_P (dst_type) && !TYPE_PTRMEM_P (dst_type))
5628 error ("invalid use of const_cast with type %qT, "
5629 "which is not a pointer, "
5630 "reference, nor a pointer-to-data-member type", dst_type);
5631 return error_mark_node;
5634 if (TREE_CODE (TREE_TYPE (dst_type)) == FUNCTION_TYPE)
5637 error ("invalid use of const_cast with type %qT, which is a pointer "
5638 "or reference to a function type", dst_type);
5639 return error_mark_node;
5642 /* Save casted types in the function's used types hash table. */
5643 used_types_insert (dst_type);
5645 src_type = TREE_TYPE (expr);
5646 /* Expressions do not really have reference types. */
5647 if (TREE_CODE (src_type) == REFERENCE_TYPE)
5648 src_type = TREE_TYPE (src_type);
5650 /* [expr.const.cast]
5652 An lvalue of type T1 can be explicitly converted to an lvalue of
5653 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
5654 types) if a pointer to T1 can be explicitly converted to the type
5655 pointer to T2 using a const_cast. */
5656 if (TREE_CODE (dst_type) == REFERENCE_TYPE)
5658 reference_type = dst_type;
5659 if (! real_lvalue_p (expr))
5662 error ("invalid const_cast of an rvalue of type %qT to type %qT",
5663 src_type, dst_type);
5664 return error_mark_node;
5666 dst_type = build_pointer_type (TREE_TYPE (dst_type));
5667 src_type = build_pointer_type (src_type);
5671 reference_type = NULL_TREE;
5672 /* If the destination type is not a reference type, the
5673 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
5674 conversions are performed. */
5675 src_type = type_decays_to (src_type);
5676 if (src_type == error_mark_node)
5677 return error_mark_node;
5680 if ((TYPE_PTR_P (src_type) || TYPE_PTRMEM_P (src_type))
5681 && comp_ptr_ttypes_const (dst_type, src_type))
5686 /* This cast is actually a C-style cast. Issue a warning if
5687 the user is making a potentially unsafe cast. */
5688 check_for_casting_away_constness (src_type, dst_type, CAST_EXPR);
5692 expr = cp_build_unary_op (ADDR_EXPR, expr, 0,
5693 complain? tf_warning_or_error : tf_none);
5694 expr = build_nop (reference_type, expr);
5695 return convert_from_reference (expr);
5699 expr = decay_conversion (expr);
5700 /* build_c_cast puts on a NOP_EXPR to make the result not an
5701 lvalue. Strip such NOP_EXPRs if VALUE is being used in
5702 non-lvalue context. */
5703 if (TREE_CODE (expr) == NOP_EXPR
5704 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
5705 expr = TREE_OPERAND (expr, 0);
5706 return build_nop (dst_type, expr);
5711 error ("invalid const_cast from type %qT to type %qT",
5712 src_type, dst_type);
5713 return error_mark_node;
5717 build_const_cast (tree type, tree expr, tsubst_flags_t complain)
5719 if (type == error_mark_node || error_operand_p (expr))
5720 return error_mark_node;
5722 if (processing_template_decl)
5724 tree t = build_min (CONST_CAST_EXPR, type, expr);
5726 if (!TREE_SIDE_EFFECTS (t)
5727 && type_dependent_expression_p (expr))
5728 /* There might turn out to be side effects inside expr. */
5729 TREE_SIDE_EFFECTS (t) = 1;
5730 return convert_from_reference (t);
5733 return build_const_cast_1 (type, expr, complain & tf_error,
5737 /* Like cp_build_c_cast, but for the c-common bits. */
5740 build_c_cast (tree type, tree expr)
5742 return cp_build_c_cast (type, expr, tf_warning_or_error);
5745 /* Build an expression representing an explicit C-style cast to type
5746 TYPE of expression EXPR. */
5749 cp_build_c_cast (tree type, tree expr, tsubst_flags_t complain)
5755 if (type == error_mark_node || error_operand_p (expr))
5756 return error_mark_node;
5758 if (processing_template_decl)
5760 tree t = build_min (CAST_EXPR, type,
5761 tree_cons (NULL_TREE, value, NULL_TREE));
5762 /* We don't know if it will or will not have side effects. */
5763 TREE_SIDE_EFFECTS (t) = 1;
5764 return convert_from_reference (t);
5767 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
5768 'Class') should always be retained, because this information aids
5769 in method lookup. */
5770 if (objc_is_object_ptr (type)
5771 && objc_is_object_ptr (TREE_TYPE (expr)))
5772 return build_nop (type, expr);
5774 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5775 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5776 if (TREE_CODE (type) != REFERENCE_TYPE
5777 && TREE_CODE (value) == NOP_EXPR
5778 && TREE_TYPE (value) == TREE_TYPE (TREE_OPERAND (value, 0)))
5779 value = TREE_OPERAND (value, 0);
5781 if (TREE_CODE (type) == ARRAY_TYPE)
5783 /* Allow casting from T1* to T2[] because Cfront allows it.
5784 NIHCL uses it. It is not valid ISO C++ however. */
5785 if (TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE)
5787 if (complain & tf_error)
5788 permerror (input_location, "ISO C++ forbids casting to an array type %qT", type);
5790 return error_mark_node;
5791 type = build_pointer_type (TREE_TYPE (type));
5795 if (complain & tf_error)
5796 error ("ISO C++ forbids casting to an array type %qT", type);
5797 return error_mark_node;
5801 if (TREE_CODE (type) == FUNCTION_TYPE
5802 || TREE_CODE (type) == METHOD_TYPE)
5804 if (complain & tf_error)
5805 error ("invalid cast to function type %qT", type);
5806 return error_mark_node;
5809 /* A C-style cast can be a const_cast. */
5810 result = build_const_cast_1 (type, value, /*complain=*/false,
5815 /* Or a static cast. */
5816 result = build_static_cast_1 (type, value, /*c_cast_p=*/true,
5817 &valid_p, complain);
5818 /* Or a reinterpret_cast. */
5820 result = build_reinterpret_cast_1 (type, value, /*c_cast_p=*/true,
5821 &valid_p, complain);
5822 /* The static_cast or reinterpret_cast may be followed by a
5825 /* A valid cast may result in errors if, for example, a
5826 conversion to am ambiguous base class is required. */
5827 && !error_operand_p (result))
5831 /* Non-class rvalues always have cv-unqualified type. */
5832 if (!CLASS_TYPE_P (type))
5833 type = TYPE_MAIN_VARIANT (type);
5834 result_type = TREE_TYPE (result);
5835 if (!CLASS_TYPE_P (result_type))
5836 result_type = TYPE_MAIN_VARIANT (result_type);
5837 /* If the type of RESULT does not match TYPE, perform a
5838 const_cast to make it match. If the static_cast or
5839 reinterpret_cast succeeded, we will differ by at most
5840 cv-qualification, so the follow-on const_cast is guaranteed
5842 if (!same_type_p (non_reference (type), non_reference (result_type)))
5844 result = build_const_cast_1 (type, result, false, &valid_p);
5845 gcc_assert (valid_p);
5850 return error_mark_node;
5853 /* For use from the C common bits. */
5855 build_modify_expr (location_t location ATTRIBUTE_UNUSED,
5856 tree lhs, enum tree_code modifycode, tree rhs)
5858 return cp_build_modify_expr (lhs, modifycode, rhs, tf_warning_or_error);
5861 /* Build an assignment expression of lvalue LHS from value RHS.
5862 MODIFYCODE is the code for a binary operator that we use
5863 to combine the old value of LHS with RHS to get the new value.
5864 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
5866 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
5869 cp_build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs,
5870 tsubst_flags_t complain)
5874 tree lhstype = TREE_TYPE (lhs);
5875 tree olhstype = lhstype;
5876 bool plain_assign = (modifycode == NOP_EXPR);
5878 /* Avoid duplicate error messages from operands that had errors. */
5879 if (error_operand_p (lhs) || error_operand_p (rhs))
5880 return error_mark_node;
5882 /* Handle control structure constructs used as "lvalues". */
5883 switch (TREE_CODE (lhs))
5885 /* Handle --foo = 5; as these are valid constructs in C++. */
5886 case PREDECREMENT_EXPR:
5887 case PREINCREMENT_EXPR:
5888 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
5889 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
5890 stabilize_reference (TREE_OPERAND (lhs, 0)),
5891 TREE_OPERAND (lhs, 1));
5892 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 0),
5893 modifycode, rhs, complain);
5894 if (newrhs == error_mark_node)
5895 return error_mark_node;
5896 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
5898 /* Handle (a, b) used as an "lvalue". */
5900 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 1),
5901 modifycode, rhs, complain);
5902 if (newrhs == error_mark_node)
5903 return error_mark_node;
5904 return build2 (COMPOUND_EXPR, lhstype,
5905 TREE_OPERAND (lhs, 0), newrhs);
5908 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
5909 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
5910 stabilize_reference (TREE_OPERAND (lhs, 0)),
5911 TREE_OPERAND (lhs, 1));
5912 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 0), modifycode, rhs,
5914 if (newrhs == error_mark_node)
5915 return error_mark_node;
5916 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
5920 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
5921 when neither operand has side-effects. */
5922 if (!lvalue_or_else (lhs, lv_assign, complain))
5923 return error_mark_node;
5925 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0))
5926 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 1)));
5928 lhs = build3 (COND_EXPR, TREE_TYPE (lhs),
5929 build2 (TREE_CODE (lhs) == MIN_EXPR ? LE_EXPR : GE_EXPR,
5931 TREE_OPERAND (lhs, 0),
5932 TREE_OPERAND (lhs, 1)),
5933 TREE_OPERAND (lhs, 0),
5934 TREE_OPERAND (lhs, 1));
5937 /* Handle (a ? b : c) used as an "lvalue". */
5940 /* Produce (a ? (b = rhs) : (c = rhs))
5941 except that the RHS goes through a save-expr
5942 so the code to compute it is only emitted once. */
5944 tree preeval = NULL_TREE;
5946 if (VOID_TYPE_P (TREE_TYPE (rhs)))
5948 if (complain & tf_error)
5949 error ("void value not ignored as it ought to be");
5950 return error_mark_node;
5953 rhs = stabilize_expr (rhs, &preeval);
5955 /* Check this here to avoid odd errors when trying to convert
5956 a throw to the type of the COND_EXPR. */
5957 if (!lvalue_or_else (lhs, lv_assign, complain))
5958 return error_mark_node;
5960 cond = build_conditional_expr
5961 (TREE_OPERAND (lhs, 0),
5962 cp_build_modify_expr (TREE_OPERAND (lhs, 1),
5963 modifycode, rhs, complain),
5964 cp_build_modify_expr (TREE_OPERAND (lhs, 2),
5965 modifycode, rhs, complain),
5968 if (cond == error_mark_node)
5970 /* Make sure the code to compute the rhs comes out
5971 before the split. */
5973 cond = build2 (COMPOUND_EXPR, TREE_TYPE (lhs), preeval, cond);
5981 if (modifycode == INIT_EXPR)
5983 if (BRACE_ENCLOSED_INITIALIZER_P (rhs))
5984 /* Do the default thing. */;
5985 else if (TREE_CODE (rhs) == CONSTRUCTOR)
5987 /* Compound literal. */
5988 if (! same_type_p (TREE_TYPE (rhs), lhstype))
5989 /* Call convert to generate an error; see PR 11063. */
5990 rhs = convert (lhstype, rhs);
5991 result = build2 (INIT_EXPR, lhstype, lhs, rhs);
5992 TREE_SIDE_EFFECTS (result) = 1;
5995 else if (! MAYBE_CLASS_TYPE_P (lhstype))
5996 /* Do the default thing. */;
5999 result = build_special_member_call (lhs, complete_ctor_identifier,
6000 build_tree_list (NULL_TREE, rhs),
6001 lhstype, LOOKUP_NORMAL,
6003 if (result == NULL_TREE)
6004 return error_mark_node;
6010 lhs = require_complete_type (lhs);
6011 if (lhs == error_mark_node)
6012 return error_mark_node;
6014 if (modifycode == NOP_EXPR)
6016 /* `operator=' is not an inheritable operator. */
6017 if (! MAYBE_CLASS_TYPE_P (lhstype))
6018 /* Do the default thing. */;
6021 result = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL,
6022 lhs, rhs, make_node (NOP_EXPR),
6023 /*overloaded_p=*/NULL,
6025 if (result == NULL_TREE)
6026 return error_mark_node;
6033 /* A binary op has been requested. Combine the old LHS
6034 value with the RHS producing the value we should actually
6035 store into the LHS. */
6036 gcc_assert (!((TREE_CODE (lhstype) == REFERENCE_TYPE
6037 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype)))
6038 || MAYBE_CLASS_TYPE_P (lhstype)));
6040 lhs = stabilize_reference (lhs);
6041 newrhs = cp_build_binary_op (input_location,
6042 modifycode, lhs, rhs,
6044 if (newrhs == error_mark_node)
6046 if (complain & tf_error)
6047 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode,
6048 TREE_TYPE (lhs), TREE_TYPE (rhs));
6049 return error_mark_node;
6052 /* Now it looks like a plain assignment. */
6053 modifycode = NOP_EXPR;
6055 gcc_assert (TREE_CODE (lhstype) != REFERENCE_TYPE);
6056 gcc_assert (TREE_CODE (TREE_TYPE (newrhs)) != REFERENCE_TYPE);
6059 /* The left-hand side must be an lvalue. */
6060 if (!lvalue_or_else (lhs, lv_assign, complain))
6061 return error_mark_node;
6063 /* Warn about modifying something that is `const'. Don't warn if
6064 this is initialization. */
6065 if (modifycode != INIT_EXPR
6066 && (TREE_READONLY (lhs) || CP_TYPE_CONST_P (lhstype)
6067 /* Functions are not modifiable, even though they are
6069 || TREE_CODE (TREE_TYPE (lhs)) == FUNCTION_TYPE
6070 || TREE_CODE (TREE_TYPE (lhs)) == METHOD_TYPE
6071 /* If it's an aggregate and any field is const, then it is
6072 effectively const. */
6073 || (CLASS_TYPE_P (lhstype)
6074 && C_TYPE_FIELDS_READONLY (lhstype))))
6076 if (complain & tf_error)
6077 readonly_error (lhs, "assignment");
6079 return error_mark_node;
6082 /* If storing into a structure or union member, it may have been given a
6083 lowered bitfield type. We need to convert to the declared type first,
6084 so retrieve it now. */
6086 olhstype = unlowered_expr_type (lhs);
6088 /* Convert new value to destination type. */
6090 if (TREE_CODE (lhstype) == ARRAY_TYPE)
6094 if (BRACE_ENCLOSED_INITIALIZER_P (rhs))
6095 rhs = digest_init (lhstype, rhs);
6097 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype),
6098 TYPE_MAIN_VARIANT (TREE_TYPE (rhs))))
6100 if (complain & tf_error)
6101 error ("incompatible types in assignment of %qT to %qT",
6102 TREE_TYPE (rhs), lhstype);
6103 return error_mark_node;
6106 /* Allow array assignment in compiler-generated code. */
6107 else if (!current_function_decl
6108 || !DECL_ARTIFICIAL (current_function_decl))
6110 /* This routine is used for both initialization and assignment.
6111 Make sure the diagnostic message differentiates the context. */
6112 if (complain & tf_error)
6114 if (modifycode == INIT_EXPR)
6115 error ("array used as initializer");
6117 error ("invalid array assignment");
6119 return error_mark_node;
6122 from_array = TREE_CODE (TREE_TYPE (newrhs)) == ARRAY_TYPE
6123 ? 1 + (modifycode != INIT_EXPR): 0;
6124 return build_vec_init (lhs, NULL_TREE, newrhs,
6125 /*explicit_value_init_p=*/false,
6126 from_array, complain);
6129 if (modifycode == INIT_EXPR)
6130 newrhs = convert_for_initialization (lhs, olhstype, newrhs, LOOKUP_NORMAL,
6131 "initialization", NULL_TREE, 0,
6134 newrhs = convert_for_assignment (olhstype, newrhs, "assignment",
6135 NULL_TREE, 0, complain);
6137 if (!same_type_p (lhstype, olhstype))
6138 newrhs = cp_convert_and_check (lhstype, newrhs);
6140 if (modifycode != INIT_EXPR)
6142 if (TREE_CODE (newrhs) == CALL_EXPR
6143 && TYPE_NEEDS_CONSTRUCTING (lhstype))
6144 newrhs = build_cplus_new (lhstype, newrhs);
6146 /* Can't initialize directly from a TARGET_EXPR, since that would
6147 cause the lhs to be constructed twice, and possibly result in
6148 accidental self-initialization. So we force the TARGET_EXPR to be
6149 expanded without a target. */
6150 if (TREE_CODE (newrhs) == TARGET_EXPR)
6151 newrhs = build2 (COMPOUND_EXPR, TREE_TYPE (newrhs), newrhs,
6152 TREE_OPERAND (newrhs, 0));
6155 if (newrhs == error_mark_node)
6156 return error_mark_node;
6158 if (c_dialect_objc () && flag_objc_gc)
6160 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
6166 result = build2 (modifycode == NOP_EXPR ? MODIFY_EXPR : INIT_EXPR,
6167 lhstype, lhs, newrhs);
6169 TREE_SIDE_EFFECTS (result) = 1;
6171 TREE_NO_WARNING (result) = 1;
6177 build_x_modify_expr (tree lhs, enum tree_code modifycode, tree rhs,
6178 tsubst_flags_t complain)
6180 if (processing_template_decl)
6181 return build_min_nt (MODOP_EXPR, lhs,
6182 build_min_nt (modifycode, NULL_TREE, NULL_TREE), rhs);
6184 if (modifycode != NOP_EXPR)
6186 tree rval = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL, lhs, rhs,
6187 make_node (modifycode),
6188 /*overloaded_p=*/NULL,
6192 TREE_NO_WARNING (rval) = 1;
6196 return cp_build_modify_expr (lhs, modifycode, rhs, complain);
6199 /* Helper function for get_delta_difference which assumes FROM is a base
6200 class of TO. Returns a delta for the conversion of pointer-to-member
6201 of FROM to pointer-to-member of TO. If the conversion is invalid,
6202 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6203 If C_CAST_P is true, this conversion is taking place as part of a C-style
6207 get_delta_difference_1 (tree from, tree to, bool c_cast_p)
6212 binfo = lookup_base (to, from, c_cast_p ? ba_unique : ba_check, &kind);
6213 if (kind == bk_inaccessible || kind == bk_ambig)
6215 error (" in pointer to member function conversion");
6216 return size_zero_node;
6220 if (kind != bk_via_virtual)
6221 return BINFO_OFFSET (binfo);
6223 /* FROM is a virtual base class of TO. Issue an error or warning
6224 depending on whether or not this is a reinterpret cast. */
6226 error ("pointer to member conversion via virtual base %qT",
6227 BINFO_TYPE (binfo_from_vbase (binfo)));
6229 return size_zero_node;
6236 /* Get difference in deltas for different pointer to member function
6237 types. Returns an integer constant of type PTRDIFF_TYPE_NODE. If
6238 the conversion is invalid, the constant is zero. If
6239 ALLOW_INVERSE_P is true, then allow reverse conversions as well.
6240 If C_CAST_P is true this conversion is taking place as part of a
6243 Note that the naming of FROM and TO is kind of backwards; the return
6244 value is what we add to a TO in order to get a FROM. They are named
6245 this way because we call this function to find out how to convert from
6246 a pointer to member of FROM to a pointer to member of TO. */
6249 get_delta_difference (tree from, tree to,
6250 bool allow_inverse_p,
6255 if (same_type_ignoring_top_level_qualifiers_p (from, to))
6256 /* Pointer to member of incomplete class is permitted*/
6257 result = size_zero_node;
6259 result = get_delta_difference_1 (from, to, c_cast_p);
6263 if (!allow_inverse_p)
6265 error_not_base_type (from, to);
6266 error (" in pointer to member conversion");
6267 result = size_zero_node;
6271 result = get_delta_difference_1 (to, from, c_cast_p);
6274 result = size_diffop (size_zero_node, result);
6277 error_not_base_type (from, to);
6278 error (" in pointer to member conversion");
6279 result = size_zero_node;
6284 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node,
6288 /* Return a constructor for the pointer-to-member-function TYPE using
6289 the other components as specified. */
6292 build_ptrmemfunc1 (tree type, tree delta, tree pfn)
6297 VEC(constructor_elt, gc) *v;
6299 /* Pull the FIELD_DECLs out of the type. */
6300 pfn_field = TYPE_FIELDS (type);
6301 delta_field = TREE_CHAIN (pfn_field);
6303 /* Make sure DELTA has the type we want. */
6304 delta = convert_and_check (delta_type_node, delta);
6306 /* Convert to the correct target type if necessary. */
6307 pfn = fold_convert (TREE_TYPE (pfn_field), pfn);
6309 /* Finish creating the initializer. */
6310 v = VEC_alloc(constructor_elt, gc, 2);
6311 CONSTRUCTOR_APPEND_ELT(v, pfn_field, pfn);
6312 CONSTRUCTOR_APPEND_ELT(v, delta_field, delta);
6313 u = build_constructor (type, v);
6314 TREE_CONSTANT (u) = TREE_CONSTANT (pfn) & TREE_CONSTANT (delta);
6315 TREE_STATIC (u) = (TREE_CONSTANT (u)
6316 && (initializer_constant_valid_p (pfn, TREE_TYPE (pfn))
6318 && (initializer_constant_valid_p (delta, TREE_TYPE (delta))
6323 /* Build a constructor for a pointer to member function. It can be
6324 used to initialize global variables, local variable, or used
6325 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6328 If FORCE is nonzero, then force this conversion, even if
6329 we would rather not do it. Usually set when using an explicit
6330 cast. A C-style cast is being processed iff C_CAST_P is true.
6332 Return error_mark_node, if something goes wrong. */
6335 build_ptrmemfunc (tree type, tree pfn, int force, bool c_cast_p)
6341 if (error_operand_p (pfn))
6342 return error_mark_node;
6344 pfn_type = TREE_TYPE (pfn);
6345 to_type = build_ptrmemfunc_type (type);
6347 /* Handle multiple conversions of pointer to member functions. */
6348 if (TYPE_PTRMEMFUNC_P (pfn_type))
6350 tree delta = NULL_TREE;
6351 tree npfn = NULL_TREE;
6355 && !can_convert_arg (to_type, TREE_TYPE (pfn), pfn, LOOKUP_NORMAL))
6356 error ("invalid conversion to type %qT from type %qT",
6359 n = get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type),
6360 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type),
6364 /* We don't have to do any conversion to convert a
6365 pointer-to-member to its own type. But, we don't want to
6366 just return a PTRMEM_CST if there's an explicit cast; that
6367 cast should make the expression an invalid template argument. */
6368 if (TREE_CODE (pfn) != PTRMEM_CST)
6370 if (same_type_p (to_type, pfn_type))
6372 else if (integer_zerop (n))
6373 return build_reinterpret_cast (to_type, pfn,
6374 tf_warning_or_error);
6377 if (TREE_SIDE_EFFECTS (pfn))
6378 pfn = save_expr (pfn);
6380 /* Obtain the function pointer and the current DELTA. */
6381 if (TREE_CODE (pfn) == PTRMEM_CST)
6382 expand_ptrmemfunc_cst (pfn, &delta, &npfn);
6385 npfn = build_ptrmemfunc_access_expr (pfn, pfn_identifier);
6386 delta = build_ptrmemfunc_access_expr (pfn, delta_identifier);
6389 /* Just adjust the DELTA field. */
6390 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6391 (TREE_TYPE (delta), ptrdiff_type_node));
6392 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_delta)
6393 n = cp_build_binary_op (input_location,
6394 LSHIFT_EXPR, n, integer_one_node,
6395 tf_warning_or_error);
6396 delta = cp_build_binary_op (input_location,
6397 PLUS_EXPR, delta, n, tf_warning_or_error);
6398 return build_ptrmemfunc1 (to_type, delta, npfn);
6401 /* Handle null pointer to member function conversions. */
6402 if (integer_zerop (pfn))
6404 pfn = build_c_cast (type, integer_zero_node);
6405 return build_ptrmemfunc1 (to_type,
6410 if (type_unknown_p (pfn))
6411 return instantiate_type (type, pfn, tf_warning_or_error);
6413 fn = TREE_OPERAND (pfn, 0);
6414 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
6415 /* In a template, we will have preserved the
6417 || (processing_template_decl && TREE_CODE (fn) == OFFSET_REF));
6418 return make_ptrmem_cst (to_type, fn);
6421 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
6424 ??? There is no consistency as to the types returned for the above
6425 values. Some code acts as if it were a sizetype and some as if it were
6426 integer_type_node. */
6429 expand_ptrmemfunc_cst (tree cst, tree *delta, tree *pfn)
6431 tree type = TREE_TYPE (cst);
6432 tree fn = PTRMEM_CST_MEMBER (cst);
6433 tree ptr_class, fn_class;
6435 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
6437 /* The class that the function belongs to. */
6438 fn_class = DECL_CONTEXT (fn);
6440 /* The class that we're creating a pointer to member of. */
6441 ptr_class = TYPE_PTRMEMFUNC_OBJECT_TYPE (type);
6443 /* First, calculate the adjustment to the function's class. */
6444 *delta = get_delta_difference (fn_class, ptr_class, /*force=*/0,
6447 if (!DECL_VIRTUAL_P (fn))
6448 *pfn = convert (TYPE_PTRMEMFUNC_FN_TYPE (type), build_addr_func (fn));
6451 /* If we're dealing with a virtual function, we have to adjust 'this'
6452 again, to point to the base which provides the vtable entry for
6453 fn; the call will do the opposite adjustment. */
6454 tree orig_class = DECL_CONTEXT (fn);
6455 tree binfo = binfo_or_else (orig_class, fn_class);
6456 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
6457 *delta, BINFO_OFFSET (binfo));
6458 *delta = fold_if_not_in_template (*delta);
6460 /* We set PFN to the vtable offset at which the function can be
6461 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
6462 case delta is shifted left, and then incremented). */
6463 *pfn = DECL_VINDEX (fn);
6464 *pfn = build2 (MULT_EXPR, integer_type_node, *pfn,
6465 TYPE_SIZE_UNIT (vtable_entry_type));
6466 *pfn = fold_if_not_in_template (*pfn);
6468 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
6470 case ptrmemfunc_vbit_in_pfn:
6471 *pfn = build2 (PLUS_EXPR, integer_type_node, *pfn,
6473 *pfn = fold_if_not_in_template (*pfn);
6476 case ptrmemfunc_vbit_in_delta:
6477 *delta = build2 (LSHIFT_EXPR, TREE_TYPE (*delta),
6478 *delta, integer_one_node);
6479 *delta = fold_if_not_in_template (*delta);
6480 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
6481 *delta, integer_one_node);
6482 *delta = fold_if_not_in_template (*delta);
6489 *pfn = build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type), *pfn);
6490 *pfn = fold_if_not_in_template (*pfn);
6494 /* Return an expression for PFN from the pointer-to-member function
6498 pfn_from_ptrmemfunc (tree t)
6500 if (TREE_CODE (t) == PTRMEM_CST)
6505 expand_ptrmemfunc_cst (t, &delta, &pfn);
6510 return build_ptrmemfunc_access_expr (t, pfn_identifier);
6513 /* Return an expression for DELTA from the pointer-to-member function
6517 delta_from_ptrmemfunc (tree t)
6519 if (TREE_CODE (t) == PTRMEM_CST)
6524 expand_ptrmemfunc_cst (t, &delta, &pfn);
6529 return build_ptrmemfunc_access_expr (t, delta_identifier);
6532 /* Convert value RHS to type TYPE as preparation for an assignment to
6533 an lvalue of type TYPE. ERRTYPE is a string to use in error
6534 messages: "assignment", "return", etc. If FNDECL is non-NULL, we
6535 are doing the conversion in order to pass the PARMNUMth argument of
6539 convert_for_assignment (tree type, tree rhs,
6540 const char *errtype, tree fndecl, int parmnum,
6541 tsubst_flags_t complain)
6544 enum tree_code coder;
6546 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
6547 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
6548 rhs = TREE_OPERAND (rhs, 0);
6550 rhstype = TREE_TYPE (rhs);
6551 coder = TREE_CODE (rhstype);
6553 if (TREE_CODE (type) == VECTOR_TYPE && coder == VECTOR_TYPE
6554 && vector_types_convertible_p (type, rhstype, true))
6555 return convert (type, rhs);
6557 if (rhs == error_mark_node || rhstype == error_mark_node)
6558 return error_mark_node;
6559 if (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node)
6560 return error_mark_node;
6562 /* The RHS of an assignment cannot have void type. */
6563 if (coder == VOID_TYPE)
6565 if (complain & tf_error)
6566 error ("void value not ignored as it ought to be");
6567 return error_mark_node;
6570 /* Simplify the RHS if possible. */
6571 if (TREE_CODE (rhs) == CONST_DECL)
6572 rhs = DECL_INITIAL (rhs);
6574 if (c_dialect_objc ())
6577 tree rname = fndecl;
6579 if (!strcmp (errtype, "assignment"))
6581 else if (!strcmp (errtype, "initialization"))
6585 tree selector = objc_message_selector ();
6589 if (selector && parmno > 1)
6596 if (objc_compare_types (type, rhstype, parmno, rname))
6597 return convert (type, rhs);
6602 The expression is implicitly converted (clause _conv_) to the
6603 cv-unqualified type of the left operand.
6605 We allow bad conversions here because by the time we get to this point
6606 we are committed to doing the conversion. If we end up doing a bad
6607 conversion, convert_like will complain. */
6608 if (!can_convert_arg_bad (type, rhstype, rhs))
6610 /* When -Wno-pmf-conversions is use, we just silently allow
6611 conversions from pointers-to-members to plain pointers. If
6612 the conversion doesn't work, cp_convert will complain. */
6614 && TYPE_PTR_P (type)
6615 && TYPE_PTRMEMFUNC_P (rhstype))
6616 rhs = cp_convert (strip_top_quals (type), rhs);
6619 if (complain & tf_error)
6621 /* If the right-hand side has unknown type, then it is an
6622 overloaded function. Call instantiate_type to get error
6624 if (rhstype == unknown_type_node)
6625 instantiate_type (type, rhs, tf_warning_or_error);
6627 error ("cannot convert %qT to %qT for argument %qP to %qD",
6628 rhstype, type, parmnum, fndecl);
6630 error ("cannot convert %qT to %qT in %s", rhstype, type,
6633 return error_mark_node;
6636 if (warn_missing_format_attribute)
6638 const enum tree_code codel = TREE_CODE (type);
6639 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
6641 && check_missing_format_attribute (type, rhstype)
6642 && (complain & tf_warning))
6643 warning (OPT_Wmissing_format_attribute,
6644 "%s might be a candidate for a format attribute",
6648 /* If -Wparentheses, warn about a = b = c when a has type bool and b
6650 if (warn_parentheses
6651 && type == boolean_type_node
6652 && TREE_CODE (rhs) == MODIFY_EXPR
6653 && !TREE_NO_WARNING (rhs)
6654 && TREE_TYPE (rhs) != boolean_type_node
6655 && (complain & tf_warning))
6657 warning (OPT_Wparentheses,
6658 "suggest parentheses around assignment used as truth value");
6659 TREE_NO_WARNING (rhs) = 1;
6662 return perform_implicit_conversion (strip_top_quals (type), rhs, complain);
6665 /* Convert RHS to be of type TYPE.
6666 If EXP is nonzero, it is the target of the initialization.
6667 ERRTYPE is a string to use in error messages.
6669 Two major differences between the behavior of
6670 `convert_for_assignment' and `convert_for_initialization'
6671 are that references are bashed in the former, while
6672 copied in the latter, and aggregates are assigned in
6673 the former (operator=) while initialized in the
6676 If using constructor make sure no conversion operator exists, if one does
6677 exist, an ambiguity exists.
6679 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
6682 convert_for_initialization (tree exp, tree type, tree rhs, int flags,
6683 const char *errtype, tree fndecl, int parmnum,
6684 tsubst_flags_t complain)
6686 enum tree_code codel = TREE_CODE (type);
6688 enum tree_code coder;
6690 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6691 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
6692 if (TREE_CODE (rhs) == NOP_EXPR
6693 && TREE_TYPE (rhs) == TREE_TYPE (TREE_OPERAND (rhs, 0))
6694 && codel != REFERENCE_TYPE)
6695 rhs = TREE_OPERAND (rhs, 0);
6697 if (type == error_mark_node
6698 || rhs == error_mark_node
6699 || (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node))
6700 return error_mark_node;
6702 if ((TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
6703 && TREE_CODE (type) != ARRAY_TYPE
6704 && (TREE_CODE (type) != REFERENCE_TYPE
6705 || TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE))
6706 || (TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE
6707 && (TREE_CODE (type) != REFERENCE_TYPE
6708 || TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE))
6709 || TREE_CODE (TREE_TYPE (rhs)) == METHOD_TYPE)
6710 rhs = decay_conversion (rhs);
6712 rhstype = TREE_TYPE (rhs);
6713 coder = TREE_CODE (rhstype);
6715 if (coder == ERROR_MARK)
6716 return error_mark_node;
6718 /* We accept references to incomplete types, so we can
6719 return here before checking if RHS is of complete type. */
6721 if (codel == REFERENCE_TYPE)
6723 /* This should eventually happen in convert_arguments. */
6724 int savew = 0, savee = 0;
6727 savew = warningcount, savee = errorcount;
6728 rhs = initialize_reference (type, rhs, /*decl=*/NULL_TREE,
6732 if (warningcount > savew)
6733 warning (0, "in passing argument %P of %q+D", parmnum, fndecl);
6734 else if (errorcount > savee)
6735 error ("in passing argument %P of %q+D", parmnum, fndecl);
6741 exp = require_complete_type (exp);
6742 if (exp == error_mark_node)
6743 return error_mark_node;
6745 rhstype = non_reference (rhstype);
6747 type = complete_type (type);
6749 if (MAYBE_CLASS_TYPE_P (type))
6750 return ocp_convert (type, rhs, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
6752 return convert_for_assignment (type, rhs, errtype, fndecl, parmnum,
6756 /* If RETVAL is the address of, or a reference to, a local variable or
6757 temporary give an appropriate warning. */
6760 maybe_warn_about_returning_address_of_local (tree retval)
6762 tree valtype = TREE_TYPE (DECL_RESULT (current_function_decl));
6763 tree whats_returned = retval;
6767 if (TREE_CODE (whats_returned) == COMPOUND_EXPR)
6768 whats_returned = TREE_OPERAND (whats_returned, 1);
6769 else if (CONVERT_EXPR_P (whats_returned)
6770 || TREE_CODE (whats_returned) == NON_LVALUE_EXPR)
6771 whats_returned = TREE_OPERAND (whats_returned, 0);
6776 if (TREE_CODE (whats_returned) != ADDR_EXPR)
6778 whats_returned = TREE_OPERAND (whats_returned, 0);
6780 if (TREE_CODE (valtype) == REFERENCE_TYPE)
6782 if (TREE_CODE (whats_returned) == AGGR_INIT_EXPR
6783 || TREE_CODE (whats_returned) == TARGET_EXPR)
6785 warning (0, "returning reference to temporary");
6788 if (TREE_CODE (whats_returned) == VAR_DECL
6789 && DECL_NAME (whats_returned)
6790 && TEMP_NAME_P (DECL_NAME (whats_returned)))
6792 warning (0, "reference to non-lvalue returned");
6797 while (TREE_CODE (whats_returned) == COMPONENT_REF
6798 || TREE_CODE (whats_returned) == ARRAY_REF)
6799 whats_returned = TREE_OPERAND (whats_returned, 0);
6801 if (DECL_P (whats_returned)
6802 && DECL_NAME (whats_returned)
6803 && DECL_FUNCTION_SCOPE_P (whats_returned)
6804 && !(TREE_STATIC (whats_returned)
6805 || TREE_PUBLIC (whats_returned)))
6807 if (TREE_CODE (valtype) == REFERENCE_TYPE)
6808 warning (0, "reference to local variable %q+D returned",
6811 warning (0, "address of local variable %q+D returned",
6817 /* Check that returning RETVAL from the current function is valid.
6818 Return an expression explicitly showing all conversions required to
6819 change RETVAL into the function return type, and to assign it to
6820 the DECL_RESULT for the function. Set *NO_WARNING to true if
6821 code reaches end of non-void function warning shouldn't be issued
6822 on this RETURN_EXPR. */
6825 check_return_expr (tree retval, bool *no_warning)
6828 /* The type actually returned by the function, after any
6831 int fn_returns_value_p;
6832 bool named_return_value_okay_p;
6834 *no_warning = false;
6836 /* A `volatile' function is one that isn't supposed to return, ever.
6837 (This is a G++ extension, used to get better code for functions
6838 that call the `volatile' function.) */
6839 if (TREE_THIS_VOLATILE (current_function_decl))
6840 warning (0, "function declared %<noreturn%> has a %<return%> statement");
6842 /* Check for various simple errors. */
6843 if (DECL_DESTRUCTOR_P (current_function_decl))
6846 error ("returning a value from a destructor");
6849 else if (DECL_CONSTRUCTOR_P (current_function_decl))
6851 if (in_function_try_handler)
6852 /* If a return statement appears in a handler of the
6853 function-try-block of a constructor, the program is ill-formed. */
6854 error ("cannot return from a handler of a function-try-block of a constructor");
6856 /* You can't return a value from a constructor. */
6857 error ("returning a value from a constructor");
6861 if (processing_template_decl)
6863 current_function_returns_value = 1;
6864 if (check_for_bare_parameter_packs (retval))
6865 retval = error_mark_node;
6869 /* When no explicit return-value is given in a function with a named
6870 return value, the named return value is used. */
6871 result = DECL_RESULT (current_function_decl);
6872 valtype = TREE_TYPE (result);
6873 gcc_assert (valtype != NULL_TREE);
6874 fn_returns_value_p = !VOID_TYPE_P (valtype);
6875 if (!retval && DECL_NAME (result) && fn_returns_value_p)
6878 /* Check for a return statement with no return value in a function
6879 that's supposed to return a value. */
6880 if (!retval && fn_returns_value_p)
6882 permerror (input_location, "return-statement with no value, in function returning %qT",
6884 /* Clear this, so finish_function won't say that we reach the
6885 end of a non-void function (which we don't, we gave a
6887 current_function_returns_null = 0;
6888 /* And signal caller that TREE_NO_WARNING should be set on the
6889 RETURN_EXPR to avoid control reaches end of non-void function
6890 warnings in tree-cfg.c. */
6893 /* Check for a return statement with a value in a function that
6894 isn't supposed to return a value. */
6895 else if (retval && !fn_returns_value_p)
6897 if (VOID_TYPE_P (TREE_TYPE (retval)))
6898 /* You can return a `void' value from a function of `void'
6899 type. In that case, we have to evaluate the expression for
6900 its side-effects. */
6901 finish_expr_stmt (retval);
6903 permerror (input_location, "return-statement with a value, in function "
6904 "returning 'void'");
6905 current_function_returns_null = 1;
6907 /* There's really no value to return, after all. */
6911 /* Remember that this function can sometimes return without a
6913 current_function_returns_null = 1;
6915 /* Remember that this function did return a value. */
6916 current_function_returns_value = 1;
6918 /* Check for erroneous operands -- but after giving ourselves a
6919 chance to provide an error about returning a value from a void
6921 if (error_operand_p (retval))
6923 current_function_return_value = error_mark_node;
6924 return error_mark_node;
6927 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
6928 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl) == NEW_EXPR
6929 || DECL_OVERLOADED_OPERATOR_P (current_function_decl) == VEC_NEW_EXPR)
6930 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl))
6932 && retval && null_ptr_cst_p (retval))
6933 warning (0, "%<operator new%> must not return NULL unless it is "
6934 "declared %<throw()%> (or -fcheck-new is in effect)");
6936 /* Effective C++ rule 15. See also start_function. */
6938 && DECL_NAME (current_function_decl) == ansi_assopname(NOP_EXPR))
6942 /* The function return type must be a reference to the current
6944 if (TREE_CODE (valtype) == REFERENCE_TYPE
6945 && same_type_ignoring_top_level_qualifiers_p
6946 (TREE_TYPE (valtype), TREE_TYPE (current_class_ref)))
6948 /* Returning '*this' is obviously OK. */
6949 if (retval == current_class_ref)
6951 /* If we are calling a function whose return type is the same of
6952 the current class reference, it is ok. */
6953 else if (TREE_CODE (retval) == INDIRECT_REF
6954 && TREE_CODE (TREE_OPERAND (retval, 0)) == CALL_EXPR)
6959 warning (OPT_Weffc__, "%<operator=%> should return a reference to %<*this%>");
6962 /* The fabled Named Return Value optimization, as per [class.copy]/15:
6964 [...] For a function with a class return type, if the expression
6965 in the return statement is the name of a local object, and the cv-
6966 unqualified type of the local object is the same as the function
6967 return type, an implementation is permitted to omit creating the tem-
6968 porary object to hold the function return value [...]
6970 So, if this is a value-returning function that always returns the same
6971 local variable, remember it.
6973 It might be nice to be more flexible, and choose the first suitable
6974 variable even if the function sometimes returns something else, but
6975 then we run the risk of clobbering the variable we chose if the other
6976 returned expression uses the chosen variable somehow. And people expect
6977 this restriction, anyway. (jason 2000-11-19)
6979 See finish_function and finalize_nrv for the rest of this optimization. */
6981 named_return_value_okay_p =
6982 (retval != NULL_TREE
6983 /* Must be a local, automatic variable. */
6984 && TREE_CODE (retval) == VAR_DECL
6985 && DECL_CONTEXT (retval) == current_function_decl
6986 && ! TREE_STATIC (retval)
6987 && ! DECL_ANON_UNION_VAR_P (retval)
6988 && (DECL_ALIGN (retval)
6989 >= DECL_ALIGN (DECL_RESULT (current_function_decl)))
6990 /* The cv-unqualified type of the returned value must be the
6991 same as the cv-unqualified return type of the
6993 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval))),
6995 (TREE_TYPE (TREE_TYPE (current_function_decl)))))
6996 /* And the returned value must be non-volatile. */
6997 && ! TYPE_VOLATILE (TREE_TYPE (retval)));
6999 if (fn_returns_value_p && flag_elide_constructors)
7001 if (named_return_value_okay_p
7002 && (current_function_return_value == NULL_TREE
7003 || current_function_return_value == retval))
7004 current_function_return_value = retval;
7006 current_function_return_value = error_mark_node;
7009 /* We don't need to do any conversions when there's nothing being
7014 /* Do any required conversions. */
7015 if (retval == result || DECL_CONSTRUCTOR_P (current_function_decl))
7016 /* No conversions are required. */
7020 /* The type the function is declared to return. */
7021 tree functype = TREE_TYPE (TREE_TYPE (current_function_decl));
7022 int flags = LOOKUP_NORMAL | LOOKUP_ONLYCONVERTING;
7024 /* The functype's return type will have been set to void, if it
7025 was an incomplete type. Just treat this as 'return;' */
7026 if (VOID_TYPE_P (functype))
7027 return error_mark_node;
7029 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7030 treated as an rvalue for the purposes of overload resolution to
7031 favor move constructors over copy constructors. */
7032 if ((cxx_dialect != cxx98)
7033 && named_return_value_okay_p
7034 /* The variable must not have the `volatile' qualifier. */
7035 && !(cp_type_quals (TREE_TYPE (retval)) & TYPE_QUAL_VOLATILE)
7036 /* The return type must be a class type. */
7037 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
7038 flags = flags | LOOKUP_PREFER_RVALUE;
7040 /* First convert the value to the function's return type, then
7041 to the type of return value's location to handle the
7042 case that functype is smaller than the valtype. */
7043 retval = convert_for_initialization
7044 (NULL_TREE, functype, retval, flags, "return", NULL_TREE, 0,
7045 tf_warning_or_error);
7046 retval = convert (valtype, retval);
7048 /* If the conversion failed, treat this just like `return;'. */
7049 if (retval == error_mark_node)
7051 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7052 else if (! cfun->returns_struct
7053 && TREE_CODE (retval) == TARGET_EXPR
7054 && TREE_CODE (TREE_OPERAND (retval, 1)) == AGGR_INIT_EXPR)
7055 retval = build2 (COMPOUND_EXPR, TREE_TYPE (retval), retval,
7056 TREE_OPERAND (retval, 0));
7058 maybe_warn_about_returning_address_of_local (retval);
7061 /* Actually copy the value returned into the appropriate location. */
7062 if (retval && retval != result)
7063 retval = build2 (INIT_EXPR, TREE_TYPE (result), result, retval);
7069 /* Returns nonzero if the pointer-type FROM can be converted to the
7070 pointer-type TO via a qualification conversion. If CONSTP is -1,
7071 then we return nonzero if the pointers are similar, and the
7072 cv-qualification signature of FROM is a proper subset of that of TO.
7074 If CONSTP is positive, then all outer pointers have been
7078 comp_ptr_ttypes_real (tree to, tree from, int constp)
7080 bool to_more_cv_qualified = false;
7081 bool is_opaque_pointer = false;
7083 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7085 if (TREE_CODE (to) != TREE_CODE (from))
7088 if (TREE_CODE (from) == OFFSET_TYPE
7089 && !same_type_p (TYPE_OFFSET_BASETYPE (from),
7090 TYPE_OFFSET_BASETYPE (to)))
7093 /* Const and volatile mean something different for function types,
7094 so the usual checks are not appropriate. */
7095 if (TREE_CODE (to) != FUNCTION_TYPE && TREE_CODE (to) != METHOD_TYPE)
7097 /* In Objective-C++, some types may have been 'volatilized' by
7098 the compiler for EH; when comparing them here, the volatile
7099 qualification must be ignored. */
7100 bool objc_quals_match = objc_type_quals_match (to, from);
7102 if (!at_least_as_qualified_p (to, from) && !objc_quals_match)
7105 if (!at_least_as_qualified_p (from, to) && !objc_quals_match)
7109 to_more_cv_qualified = true;
7113 constp &= TYPE_READONLY (to);
7116 if (TREE_CODE (to) == VECTOR_TYPE)
7117 is_opaque_pointer = vector_targets_convertible_p (to, from);
7119 if (TREE_CODE (to) != POINTER_TYPE && !TYPE_PTRMEM_P (to))
7120 return ((constp >= 0 || to_more_cv_qualified)
7121 && (is_opaque_pointer
7122 || same_type_ignoring_top_level_qualifiers_p (to, from)));
7126 /* When comparing, say, char ** to char const **, this function takes
7127 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7128 types to this function. */
7131 comp_ptr_ttypes (tree to, tree from)
7133 return comp_ptr_ttypes_real (to, from, 1);
7136 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7137 type or inheritance-related types, regardless of cv-quals. */
7140 ptr_reasonably_similar (const_tree to, const_tree from)
7142 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7144 /* Any target type is similar enough to void. */
7145 if (TREE_CODE (to) == VOID_TYPE
7146 || TREE_CODE (from) == VOID_TYPE)
7149 if (TREE_CODE (to) != TREE_CODE (from))
7152 if (TREE_CODE (from) == OFFSET_TYPE
7153 && comptypes (TYPE_OFFSET_BASETYPE (to),
7154 TYPE_OFFSET_BASETYPE (from),
7155 COMPARE_BASE | COMPARE_DERIVED))
7158 if (TREE_CODE (to) == VECTOR_TYPE
7159 && vector_types_convertible_p (to, from, false))
7162 if (TREE_CODE (to) == INTEGER_TYPE
7163 && TYPE_PRECISION (to) == TYPE_PRECISION (from))
7166 if (TREE_CODE (to) == FUNCTION_TYPE)
7169 if (TREE_CODE (to) != POINTER_TYPE)
7171 (TYPE_MAIN_VARIANT (to), TYPE_MAIN_VARIANT (from),
7172 COMPARE_BASE | COMPARE_DERIVED);
7176 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
7177 pointer-to-member types) are the same, ignoring cv-qualification at
7181 comp_ptr_ttypes_const (tree to, tree from)
7183 bool is_opaque_pointer = false;
7185 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7187 if (TREE_CODE (to) != TREE_CODE (from))
7190 if (TREE_CODE (from) == OFFSET_TYPE
7191 && same_type_p (TYPE_OFFSET_BASETYPE (from),
7192 TYPE_OFFSET_BASETYPE (to)))
7195 if (TREE_CODE (to) == VECTOR_TYPE)
7196 is_opaque_pointer = vector_targets_convertible_p (to, from);
7198 if (TREE_CODE (to) != POINTER_TYPE)
7199 return (is_opaque_pointer
7200 || same_type_ignoring_top_level_qualifiers_p (to, from));
7204 /* Returns the type qualifiers for this type, including the qualifiers on the
7205 elements for an array type. */
7208 cp_type_quals (const_tree type)
7210 /* This CONST_CAST is okay because strip_array_types returns its
7211 argument unmodified and we assign it to a const_tree. */
7212 type = strip_array_types (CONST_CAST_TREE(type));
7213 if (type == error_mark_node)
7214 return TYPE_UNQUALIFIED;
7215 return TYPE_QUALS (type);
7218 /* Returns nonzero if the TYPE is const from a C++ perspective: look inside
7222 cp_type_readonly (const_tree type)
7224 /* This CONST_CAST is okay because strip_array_types returns its
7225 argument unmodified and we assign it to a const_tree. */
7226 type = strip_array_types (CONST_CAST_TREE(type));
7227 return TYPE_READONLY (type);
7230 /* Returns nonzero if the TYPE contains a mutable member. */
7233 cp_has_mutable_p (const_tree type)
7235 /* This CONST_CAST is okay because strip_array_types returns its
7236 argument unmodified and we assign it to a const_tree. */
7237 type = strip_array_types (CONST_CAST_TREE(type));
7239 return CLASS_TYPE_P (type) && CLASSTYPE_HAS_MUTABLE (type);
7242 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
7243 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
7244 approximation. In particular, consider:
7247 struct S { int i; };
7248 const S s = { f(); }
7250 Here, we will make "s" as TREE_READONLY (because it is declared
7251 "const") -- only to reverse ourselves upon seeing that the
7252 initializer is non-constant. */
7255 cp_apply_type_quals_to_decl (int type_quals, tree decl)
7257 tree type = TREE_TYPE (decl);
7259 if (type == error_mark_node)
7262 if (TREE_CODE (decl) == TYPE_DECL)
7265 if (TREE_CODE (type) == FUNCTION_TYPE
7266 && type_quals != TYPE_UNQUALIFIED)
7268 /* This was an error in C++98 (cv-qualifiers cannot be added to
7269 a function type), but DR 295 makes the code well-formed by
7270 dropping the extra qualifiers. */
7273 tree bad_type = build_qualified_type (type, type_quals);
7274 pedwarn (input_location, OPT_pedantic,
7275 "ignoring %qV qualifiers added to function type %qT",
7279 TREE_TYPE (decl) = TYPE_MAIN_VARIANT (type);
7283 /* Avoid setting TREE_READONLY incorrectly. */
7284 if (/* If the object has a constructor, the constructor may modify
7286 TYPE_NEEDS_CONSTRUCTING (type)
7287 /* If the type isn't complete, we don't know yet if it will need
7289 || !COMPLETE_TYPE_P (type)
7290 /* If the type has a mutable component, that component might be
7292 || TYPE_HAS_MUTABLE_P (type))
7293 type_quals &= ~TYPE_QUAL_CONST;
7295 c_apply_type_quals_to_decl (type_quals, decl);
7298 /* Subroutine of casts_away_constness. Make T1 and T2 point at
7299 exemplar types such that casting T1 to T2 is casting away constness
7300 if and only if there is no implicit conversion from T1 to T2. */
7303 casts_away_constness_r (tree *t1, tree *t2)
7308 /* [expr.const.cast]
7310 For multi-level pointer to members and multi-level mixed pointers
7311 and pointers to members (conv.qual), the "member" aspect of a
7312 pointer to member level is ignored when determining if a const
7313 cv-qualifier has been cast away. */
7314 /* [expr.const.cast]
7316 For two pointer types:
7318 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
7319 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
7322 casting from X1 to X2 casts away constness if, for a non-pointer
7323 type T there does not exist an implicit conversion (clause
7326 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
7330 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
7331 if ((!TYPE_PTR_P (*t1) && !TYPE_PTRMEM_P (*t1))
7332 || (!TYPE_PTR_P (*t2) && !TYPE_PTRMEM_P (*t2)))
7334 *t1 = cp_build_qualified_type (void_type_node,
7335 cp_type_quals (*t1));
7336 *t2 = cp_build_qualified_type (void_type_node,
7337 cp_type_quals (*t2));
7341 quals1 = cp_type_quals (*t1);
7342 quals2 = cp_type_quals (*t2);
7344 if (TYPE_PTRMEM_P (*t1))
7345 *t1 = TYPE_PTRMEM_POINTED_TO_TYPE (*t1);
7347 *t1 = TREE_TYPE (*t1);
7348 if (TYPE_PTRMEM_P (*t2))
7349 *t2 = TYPE_PTRMEM_POINTED_TO_TYPE (*t2);
7351 *t2 = TREE_TYPE (*t2);
7353 casts_away_constness_r (t1, t2);
7354 *t1 = build_pointer_type (*t1);
7355 *t2 = build_pointer_type (*t2);
7356 *t1 = cp_build_qualified_type (*t1, quals1);
7357 *t2 = cp_build_qualified_type (*t2, quals2);
7360 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
7364 casts_away_constness (tree t1, tree t2)
7366 if (TREE_CODE (t2) == REFERENCE_TYPE)
7368 /* [expr.const.cast]
7370 Casting from an lvalue of type T1 to an lvalue of type T2
7371 using a reference cast casts away constness if a cast from an
7372 rvalue of type "pointer to T1" to the type "pointer to T2"
7373 casts away constness. */
7374 t1 = (TREE_CODE (t1) == REFERENCE_TYPE ? TREE_TYPE (t1) : t1);
7375 return casts_away_constness (build_pointer_type (t1),
7376 build_pointer_type (TREE_TYPE (t2)));
7379 if (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2))
7380 /* [expr.const.cast]
7382 Casting from an rvalue of type "pointer to data member of X
7383 of type T1" to the type "pointer to data member of Y of type
7384 T2" casts away constness if a cast from an rvalue of type
7385 "pointer to T1" to the type "pointer to T2" casts away
7387 return casts_away_constness
7388 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1)),
7389 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2)));
7391 /* Casting away constness is only something that makes sense for
7392 pointer or reference types. */
7393 if (TREE_CODE (t1) != POINTER_TYPE
7394 || TREE_CODE (t2) != POINTER_TYPE)
7397 /* Top-level qualifiers don't matter. */
7398 t1 = TYPE_MAIN_VARIANT (t1);
7399 t2 = TYPE_MAIN_VARIANT (t2);
7400 casts_away_constness_r (&t1, &t2);
7401 if (!can_convert (t2, t1))
7407 /* If T is a REFERENCE_TYPE return the type to which T refers.
7408 Otherwise, return T itself. */
7411 non_reference (tree t)
7413 if (TREE_CODE (t) == REFERENCE_TYPE)
7419 /* Return nonzero if REF is an lvalue valid for this language;
7420 otherwise, print an error message and return zero. USE says
7421 how the lvalue is being used and so selects the error message. */
7424 lvalue_or_else (tree ref, enum lvalue_use use, tsubst_flags_t complain)
7426 int win = lvalue_p (ref);
7428 if (!win && (complain & tf_error))