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"
38 #include "diagnostic.h"
45 static tree pfn_from_ptrmemfunc (tree);
46 static tree delta_from_ptrmemfunc (tree);
47 static tree convert_for_assignment (tree, tree, const char *, tree, int,
49 static tree cp_pointer_int_sum (enum tree_code, tree, tree);
50 static tree rationalize_conditional_expr (enum tree_code, tree,
52 static int comp_ptr_ttypes_real (tree, tree, int);
53 static bool comp_except_types (tree, tree, bool);
54 static bool comp_array_types (const_tree, const_tree, bool);
55 static tree pointer_diff (tree, tree, tree);
56 static tree get_delta_difference (tree, tree, bool, bool);
57 static void casts_away_constness_r (tree *, tree *);
58 static bool casts_away_constness (tree, tree);
59 static void maybe_warn_about_returning_address_of_local (tree);
60 static tree lookup_destructor (tree, tree, tree);
61 static void warn_args_num (location_t, tree, bool);
62 static int convert_arguments (tree, VEC(tree,gc) **, tree, int,
65 /* Do `exp = require_complete_type (exp);' to make sure exp
66 does not have an incomplete type. (That includes void types.)
67 Returns the error_mark_node if the VALUE does not have
68 complete type when this function returns. */
71 require_complete_type (tree value)
75 if (processing_template_decl || value == error_mark_node)
78 if (TREE_CODE (value) == OVERLOAD)
79 type = unknown_type_node;
81 type = TREE_TYPE (value);
83 if (type == error_mark_node)
84 return error_mark_node;
86 /* First, detect a valid value with a complete type. */
87 if (COMPLETE_TYPE_P (type))
90 if (complete_type_or_else (type, value))
93 return error_mark_node;
96 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
97 a template instantiation, do the instantiation. Returns TYPE,
98 whether or not it could be completed, unless something goes
99 horribly wrong, in which case the error_mark_node is returned. */
102 complete_type (tree type)
104 if (type == NULL_TREE)
105 /* Rather than crash, we return something sure to cause an error
107 return error_mark_node;
109 if (type == error_mark_node || COMPLETE_TYPE_P (type))
111 else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type))
113 tree t = complete_type (TREE_TYPE (type));
114 unsigned int needs_constructing, has_nontrivial_dtor;
115 if (COMPLETE_TYPE_P (t) && !dependent_type_p (type))
118 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t));
120 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t));
121 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
123 TYPE_NEEDS_CONSTRUCTING (t) = needs_constructing;
124 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) = has_nontrivial_dtor;
127 else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INSTANTIATION (type))
128 instantiate_class_template (TYPE_MAIN_VARIANT (type));
133 /* Like complete_type, but issue an error if the TYPE cannot be completed.
134 VALUE is used for informative diagnostics.
135 Returns NULL_TREE if the type cannot be made complete. */
138 complete_type_or_else (tree type, tree value)
140 type = complete_type (type);
141 if (type == error_mark_node)
142 /* We already issued an error. */
144 else if (!COMPLETE_TYPE_P (type))
146 cxx_incomplete_type_diagnostic (value, type, DK_ERROR);
153 /* Return truthvalue of whether type of EXP is instantiated. */
156 type_unknown_p (const_tree exp)
158 return (TREE_CODE (exp) == TREE_LIST
159 || TREE_TYPE (exp) == unknown_type_node);
163 /* Return the common type of two parameter lists.
164 We assume that comptypes has already been done and returned 1;
165 if that isn't so, this may crash.
167 As an optimization, free the space we allocate if the parameter
168 lists are already common. */
171 commonparms (tree p1, tree p2)
173 tree oldargs = p1, newargs, n;
177 len = list_length (p1);
178 newargs = tree_last (p1);
180 if (newargs == void_list_node)
189 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
194 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n), i++)
196 if (TREE_PURPOSE (p1) && !TREE_PURPOSE (p2))
198 TREE_PURPOSE (n) = TREE_PURPOSE (p1);
201 else if (! TREE_PURPOSE (p1))
203 if (TREE_PURPOSE (p2))
205 TREE_PURPOSE (n) = TREE_PURPOSE (p2);
211 if (1 != simple_cst_equal (TREE_PURPOSE (p1), TREE_PURPOSE (p2)))
213 TREE_PURPOSE (n) = TREE_PURPOSE (p2);
215 if (TREE_VALUE (p1) != TREE_VALUE (p2))
218 TREE_VALUE (n) = merge_types (TREE_VALUE (p1), TREE_VALUE (p2));
221 TREE_VALUE (n) = TREE_VALUE (p1);
229 /* Given a type, perhaps copied for a typedef,
230 find the "original" version of it. */
232 original_type (tree t)
234 int quals = cp_type_quals (t);
235 while (t != error_mark_node
236 && TYPE_NAME (t) != NULL_TREE)
238 tree x = TYPE_NAME (t);
239 if (TREE_CODE (x) != TYPE_DECL)
241 x = DECL_ORIGINAL_TYPE (x);
246 return cp_build_qualified_type (t, quals);
249 /* Return the common type for two arithmetic types T1 and T2 under the
250 usual arithmetic conversions. The default conversions have already
251 been applied, and enumerated types converted to their compatible
255 cp_common_type (tree t1, tree t2)
257 enum tree_code code1 = TREE_CODE (t1);
258 enum tree_code code2 = TREE_CODE (t2);
261 /* In what follows, we slightly generalize the rules given in [expr] so
262 as to deal with `long long' and `complex'. First, merge the
264 attributes = (*targetm.merge_type_attributes) (t1, t2);
266 if (SCOPED_ENUM_P (t1) || SCOPED_ENUM_P (t2))
268 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
269 return build_type_attribute_variant (t1, attributes);
274 /* FIXME: Attributes. */
275 gcc_assert (ARITHMETIC_TYPE_P (t1)
276 || TREE_CODE (t1) == VECTOR_TYPE
277 || UNSCOPED_ENUM_P (t1));
278 gcc_assert (ARITHMETIC_TYPE_P (t2)
279 || TREE_CODE (t2) == VECTOR_TYPE
280 || UNSCOPED_ENUM_P (t2));
282 /* If one type is complex, form the common type of the non-complex
283 components, then make that complex. Use T1 or T2 if it is the
285 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
287 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
288 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
290 = type_after_usual_arithmetic_conversions (subtype1, subtype2);
292 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
293 return build_type_attribute_variant (t1, attributes);
294 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
295 return build_type_attribute_variant (t2, attributes);
297 return build_type_attribute_variant (build_complex_type (subtype),
301 if (code1 == VECTOR_TYPE)
303 /* When we get here we should have two vectors of the same size.
304 Just prefer the unsigned one if present. */
305 if (TYPE_UNSIGNED (t1))
306 return build_type_attribute_variant (t1, attributes);
308 return build_type_attribute_variant (t2, attributes);
311 /* If only one is real, use it as the result. */
312 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
313 return build_type_attribute_variant (t1, attributes);
314 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
315 return build_type_attribute_variant (t2, attributes);
317 /* Both real or both integers; use the one with greater precision. */
318 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
319 return build_type_attribute_variant (t1, attributes);
320 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
321 return build_type_attribute_variant (t2, attributes);
323 /* The types are the same; no need to do anything fancy. */
324 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
325 return build_type_attribute_variant (t1, attributes);
327 if (code1 != REAL_TYPE)
329 /* If one is unsigned long long, then convert the other to unsigned
331 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_unsigned_type_node)
332 || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_unsigned_type_node))
333 return build_type_attribute_variant (long_long_unsigned_type_node,
335 /* If one is a long long, and the other is an unsigned long, and
336 long long can represent all the values of an unsigned long, then
337 convert to a long long. Otherwise, convert to an unsigned long
338 long. Otherwise, if either operand is long long, convert the
341 Since we're here, we know the TYPE_PRECISION is the same;
342 therefore converting to long long cannot represent all the values
343 of an unsigned long, so we choose unsigned long long in that
345 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_integer_type_node)
346 || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_integer_type_node))
348 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
349 ? long_long_unsigned_type_node
350 : long_long_integer_type_node);
351 return build_type_attribute_variant (t, attributes);
354 /* Go through the same procedure, but for longs. */
355 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_unsigned_type_node)
356 || same_type_p (TYPE_MAIN_VARIANT (t2), long_unsigned_type_node))
357 return build_type_attribute_variant (long_unsigned_type_node,
359 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_integer_type_node)
360 || same_type_p (TYPE_MAIN_VARIANT (t2), long_integer_type_node))
362 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
363 ? long_unsigned_type_node : long_integer_type_node);
364 return build_type_attribute_variant (t, attributes);
366 /* Otherwise prefer the unsigned one. */
367 if (TYPE_UNSIGNED (t1))
368 return build_type_attribute_variant (t1, attributes);
370 return build_type_attribute_variant (t2, attributes);
374 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_double_type_node)
375 || same_type_p (TYPE_MAIN_VARIANT (t2), long_double_type_node))
376 return build_type_attribute_variant (long_double_type_node,
378 if (same_type_p (TYPE_MAIN_VARIANT (t1), double_type_node)
379 || same_type_p (TYPE_MAIN_VARIANT (t2), double_type_node))
380 return build_type_attribute_variant (double_type_node,
382 if (same_type_p (TYPE_MAIN_VARIANT (t1), float_type_node)
383 || same_type_p (TYPE_MAIN_VARIANT (t2), float_type_node))
384 return build_type_attribute_variant (float_type_node,
387 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
388 the standard C++ floating-point types. Logic earlier in this
389 function has already eliminated the possibility that
390 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
391 compelling reason to choose one or the other. */
392 return build_type_attribute_variant (t1, attributes);
396 /* T1 and T2 are arithmetic or enumeration types. Return the type
397 that will result from the "usual arithmetic conversions" on T1 and
398 T2 as described in [expr]. */
401 type_after_usual_arithmetic_conversions (tree t1, tree t2)
403 gcc_assert (ARITHMETIC_TYPE_P (t1)
404 || TREE_CODE (t1) == VECTOR_TYPE
405 || UNSCOPED_ENUM_P (t1));
406 gcc_assert (ARITHMETIC_TYPE_P (t2)
407 || TREE_CODE (t2) == VECTOR_TYPE
408 || UNSCOPED_ENUM_P (t2));
410 /* Perform the integral promotions. We do not promote real types here. */
411 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1)
412 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2))
414 t1 = type_promotes_to (t1);
415 t2 = type_promotes_to (t2);
418 return cp_common_type (t1, t2);
421 /* Subroutine of composite_pointer_type to implement the recursive
422 case. See that function for documentation of the parameters. */
425 composite_pointer_type_r (tree t1, tree t2,
426 composite_pointer_operation operation,
427 tsubst_flags_t complain)
434 /* Determine the types pointed to by T1 and T2. */
435 if (TREE_CODE (t1) == POINTER_TYPE)
437 pointee1 = TREE_TYPE (t1);
438 pointee2 = TREE_TYPE (t2);
442 pointee1 = TYPE_PTRMEM_POINTED_TO_TYPE (t1);
443 pointee2 = TYPE_PTRMEM_POINTED_TO_TYPE (t2);
448 Otherwise, the composite pointer type is a pointer type
449 similar (_conv.qual_) to the type of one of the operands,
450 with a cv-qualification signature (_conv.qual_) that is the
451 union of the cv-qualification signatures of the operand
453 if (same_type_ignoring_top_level_qualifiers_p (pointee1, pointee2))
454 result_type = pointee1;
455 else if ((TREE_CODE (pointee1) == POINTER_TYPE
456 && TREE_CODE (pointee2) == POINTER_TYPE)
457 || (TYPE_PTR_TO_MEMBER_P (pointee1)
458 && TYPE_PTR_TO_MEMBER_P (pointee2)))
459 result_type = composite_pointer_type_r (pointee1, pointee2, operation,
463 if (complain & tf_error)
468 permerror (input_location, "comparison between "
469 "distinct pointer types %qT and %qT lacks a cast",
473 permerror (input_location, "conversion between "
474 "distinct pointer types %qT and %qT lacks a cast",
477 case CPO_CONDITIONAL_EXPR:
478 permerror (input_location, "conditional expression between "
479 "distinct pointer types %qT and %qT lacks a cast",
486 result_type = void_type_node;
488 result_type = cp_build_qualified_type (result_type,
489 (cp_type_quals (pointee1)
490 | cp_type_quals (pointee2)));
491 /* If the original types were pointers to members, so is the
493 if (TYPE_PTR_TO_MEMBER_P (t1))
495 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
496 TYPE_PTRMEM_CLASS_TYPE (t2))
497 && (complain & tf_error))
502 permerror (input_location, "comparison between "
503 "distinct pointer types %qT and %qT lacks a cast",
507 permerror (input_location, "conversion between "
508 "distinct pointer types %qT and %qT lacks a cast",
511 case CPO_CONDITIONAL_EXPR:
512 permerror (input_location, "conditional expression between "
513 "distinct pointer types %qT and %qT lacks a cast",
520 result_type = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
524 result_type = build_pointer_type (result_type);
526 /* Merge the attributes. */
527 attributes = (*targetm.merge_type_attributes) (t1, t2);
528 return build_type_attribute_variant (result_type, attributes);
531 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
532 ARG1 and ARG2 are the values with those types. The OPERATION is to
533 describe the operation between the pointer types,
534 in case an error occurs.
536 This routine also implements the computation of a common type for
537 pointers-to-members as per [expr.eq]. */
540 composite_pointer_type (tree t1, tree t2, tree arg1, tree arg2,
541 composite_pointer_operation operation,
542 tsubst_flags_t complain)
549 If one operand is a null pointer constant, the composite pointer
550 type is the type of the other operand. */
551 if (null_ptr_cst_p (arg1))
553 if (null_ptr_cst_p (arg2))
560 If one of the operands has type "pointer to cv1 void*", then
561 the other has type "pointer to cv2T", and the composite pointer
562 type is "pointer to cv12 void", where cv12 is the union of cv1
565 If either type is a pointer to void, make sure it is T1. */
566 if (TREE_CODE (t2) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t2)))
574 /* Now, if T1 is a pointer to void, merge the qualifiers. */
575 if (TREE_CODE (t1) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t1)))
580 if (TYPE_PTRFN_P (t2) && (complain & tf_error))
585 pedwarn (input_location, OPT_pedantic,
586 "ISO C++ forbids comparison between "
587 "pointer of type %<void *%> and pointer-to-function");
590 pedwarn (input_location, OPT_pedantic,
591 "ISO C++ forbids conversion between "
592 "pointer of type %<void *%> and pointer-to-function");
594 case CPO_CONDITIONAL_EXPR:
595 pedwarn (input_location, OPT_pedantic,
596 "ISO C++ forbids conditional expression between "
597 "pointer of type %<void *%> and pointer-to-function");
604 = cp_build_qualified_type (void_type_node,
605 (cp_type_quals (TREE_TYPE (t1))
606 | cp_type_quals (TREE_TYPE (t2))));
607 result_type = build_pointer_type (result_type);
608 /* Merge the attributes. */
609 attributes = (*targetm.merge_type_attributes) (t1, t2);
610 return build_type_attribute_variant (result_type, attributes);
613 if (c_dialect_objc () && TREE_CODE (t1) == POINTER_TYPE
614 && TREE_CODE (t2) == POINTER_TYPE)
616 if (objc_compare_types (t1, t2, -3, NULL_TREE))
620 /* [expr.eq] permits the application of a pointer conversion to
621 bring the pointers to a common type. */
622 if (TREE_CODE (t1) == POINTER_TYPE && TREE_CODE (t2) == POINTER_TYPE
623 && CLASS_TYPE_P (TREE_TYPE (t1))
624 && CLASS_TYPE_P (TREE_TYPE (t2))
625 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1),
628 class1 = TREE_TYPE (t1);
629 class2 = TREE_TYPE (t2);
631 if (DERIVED_FROM_P (class1, class2))
632 t2 = (build_pointer_type
633 (cp_build_qualified_type (class1, cp_type_quals (class2))));
634 else if (DERIVED_FROM_P (class2, class1))
635 t1 = (build_pointer_type
636 (cp_build_qualified_type (class2, cp_type_quals (class1))));
639 if (complain & tf_error)
643 error ("comparison between distinct "
644 "pointer types %qT and %qT lacks a cast", t1, t2);
647 error ("conversion between distinct "
648 "pointer types %qT and %qT lacks a cast", t1, t2);
650 case CPO_CONDITIONAL_EXPR:
651 error ("conditional expression between distinct "
652 "pointer types %qT and %qT lacks a cast", t1, t2);
657 return error_mark_node;
660 /* [expr.eq] permits the application of a pointer-to-member
661 conversion to change the class type of one of the types. */
662 else if (TYPE_PTR_TO_MEMBER_P (t1)
663 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
664 TYPE_PTRMEM_CLASS_TYPE (t2)))
666 class1 = TYPE_PTRMEM_CLASS_TYPE (t1);
667 class2 = TYPE_PTRMEM_CLASS_TYPE (t2);
669 if (DERIVED_FROM_P (class1, class2))
670 t1 = build_ptrmem_type (class2, TYPE_PTRMEM_POINTED_TO_TYPE (t1));
671 else if (DERIVED_FROM_P (class2, class1))
672 t2 = build_ptrmem_type (class1, TYPE_PTRMEM_POINTED_TO_TYPE (t2));
675 if (complain & tf_error)
679 error ("comparison between distinct "
680 "pointer-to-member types %qT and %qT lacks a cast",
684 error ("conversion between distinct "
685 "pointer-to-member types %qT and %qT lacks a cast",
688 case CPO_CONDITIONAL_EXPR:
689 error ("conditional expression between distinct "
690 "pointer-to-member types %qT and %qT lacks a cast",
696 return error_mark_node;
700 return composite_pointer_type_r (t1, t2, operation, complain);
703 /* Return the merged type of two types.
704 We assume that comptypes has already been done and returned 1;
705 if that isn't so, this may crash.
707 This just combines attributes and default arguments; any other
708 differences would cause the two types to compare unalike. */
711 merge_types (tree t1, tree t2)
713 enum tree_code code1;
714 enum tree_code code2;
717 /* Save time if the two types are the same. */
720 if (original_type (t1) == original_type (t2))
723 /* If one type is nonsense, use the other. */
724 if (t1 == error_mark_node)
726 if (t2 == error_mark_node)
729 /* Merge the attributes. */
730 attributes = (*targetm.merge_type_attributes) (t1, t2);
732 if (TYPE_PTRMEMFUNC_P (t1))
733 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
734 if (TYPE_PTRMEMFUNC_P (t2))
735 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
737 code1 = TREE_CODE (t1);
738 code2 = TREE_CODE (t2);
741 gcc_assert (code1 == TYPENAME_TYPE || code2 == TYPENAME_TYPE);
742 if (code1 == TYPENAME_TYPE)
744 t1 = resolve_typename_type (t1, /*only_current_p=*/true);
745 code1 = TREE_CODE (t1);
749 t2 = resolve_typename_type (t2, /*only_current_p=*/true);
750 code2 = TREE_CODE (t2);
758 /* For two pointers, do this recursively on the target type. */
760 tree target = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
761 int quals = cp_type_quals (t1);
763 if (code1 == POINTER_TYPE)
764 t1 = build_pointer_type (target);
766 t1 = cp_build_reference_type (target, TYPE_REF_IS_RVALUE (t1));
767 t1 = build_type_attribute_variant (t1, attributes);
768 t1 = cp_build_qualified_type (t1, quals);
770 if (TREE_CODE (target) == METHOD_TYPE)
771 t1 = build_ptrmemfunc_type (t1);
780 quals = cp_type_quals (t1);
781 pointee = merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1),
782 TYPE_PTRMEM_POINTED_TO_TYPE (t2));
783 t1 = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
785 t1 = cp_build_qualified_type (t1, quals);
791 tree elt = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
792 /* Save space: see if the result is identical to one of the args. */
793 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
794 return build_type_attribute_variant (t1, attributes);
795 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
796 return build_type_attribute_variant (t2, attributes);
797 /* Merge the element types, and have a size if either arg has one. */
798 t1 = build_cplus_array_type
799 (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
804 /* Function types: prefer the one that specified arg types.
805 If both do, merge the arg types. Also merge the return types. */
807 tree valtype = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
808 tree p1 = TYPE_ARG_TYPES (t1);
809 tree p2 = TYPE_ARG_TYPES (t2);
813 /* Save space: see if the result is identical to one of the args. */
814 if (valtype == TREE_TYPE (t1) && ! p2)
815 return cp_build_type_attribute_variant (t1, attributes);
816 if (valtype == TREE_TYPE (t2) && ! p1)
817 return cp_build_type_attribute_variant (t2, attributes);
819 /* Simple way if one arg fails to specify argument types. */
820 if (p1 == NULL_TREE || TREE_VALUE (p1) == void_type_node)
823 raises = TYPE_RAISES_EXCEPTIONS (t2);
825 else if (p2 == NULL_TREE || TREE_VALUE (p2) == void_type_node)
828 raises = TYPE_RAISES_EXCEPTIONS (t1);
832 parms = commonparms (p1, p2);
833 /* In cases where we're merging a real declaration with a
834 built-in declaration, t1 is the real one. */
835 raises = TYPE_RAISES_EXCEPTIONS (t1);
838 rval = build_function_type (valtype, parms);
839 gcc_assert (type_memfn_quals (t1) == type_memfn_quals (t2));
840 rval = apply_memfn_quals (rval, type_memfn_quals (t1));
841 t1 = build_exception_variant (rval, raises);
847 /* Get this value the long way, since TYPE_METHOD_BASETYPE
848 is just the main variant of this. */
849 tree basetype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2)));
850 tree raises = TYPE_RAISES_EXCEPTIONS (t1);
853 /* If this was a member function type, get back to the
854 original type of type member function (i.e., without
855 the class instance variable up front. */
856 t1 = build_function_type (TREE_TYPE (t1),
857 TREE_CHAIN (TYPE_ARG_TYPES (t1)));
858 t2 = build_function_type (TREE_TYPE (t2),
859 TREE_CHAIN (TYPE_ARG_TYPES (t2)));
860 t3 = merge_types (t1, t2);
861 t3 = build_method_type_directly (basetype, TREE_TYPE (t3),
862 TYPE_ARG_TYPES (t3));
863 t1 = build_exception_variant (t3, raises);
868 /* There is no need to merge attributes into a TYPENAME_TYPE.
869 When the type is instantiated it will have whatever
870 attributes result from the instantiation. */
876 if (attribute_list_equal (TYPE_ATTRIBUTES (t1), attributes))
878 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2), attributes))
881 return cp_build_type_attribute_variant (t1, attributes);
884 /* Return the ARRAY_TYPE type without its domain. */
887 strip_array_domain (tree type)
890 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
891 if (TYPE_DOMAIN (type) == NULL_TREE)
893 t2 = build_cplus_array_type (TREE_TYPE (type), NULL_TREE);
894 return cp_build_type_attribute_variant (t2, TYPE_ATTRIBUTES (type));
897 /* Wrapper around cp_common_type that is used by c-common.c and other
898 front end optimizations that remove promotions.
900 Return the common type for two arithmetic types T1 and T2 under the
901 usual arithmetic conversions. The default conversions have already
902 been applied, and enumerated types converted to their compatible
906 common_type (tree t1, tree t2)
908 /* If one type is nonsense, use the other */
909 if (t1 == error_mark_node)
911 if (t2 == error_mark_node)
914 return cp_common_type (t1, t2);
917 /* Return the common type of two pointer types T1 and T2. This is the
918 type for the result of most arithmetic operations if the operands
919 have the given two types.
921 We assume that comp_target_types has already been done and returned
922 nonzero; if that isn't so, this may crash. */
925 common_pointer_type (tree t1, tree t2)
927 gcc_assert ((TYPE_PTR_P (t1) && TYPE_PTR_P (t2))
928 || (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2))
929 || (TYPE_PTRMEMFUNC_P (t1) && TYPE_PTRMEMFUNC_P (t2)));
931 return composite_pointer_type (t1, t2, error_mark_node, error_mark_node,
932 CPO_CONVERSION, tf_warning_or_error);
935 /* Compare two exception specifier types for exactness or subsetness, if
936 allowed. Returns false for mismatch, true for match (same, or
939 [except.spec] "If a class X ... objects of class X or any class publicly
940 and unambiguously derived from X. Similarly, if a pointer type Y * ...
941 exceptions of type Y * or that are pointers to any type publicly and
942 unambiguously derived from Y. Otherwise a function only allows exceptions
943 that have the same type ..."
944 This does not mention cv qualifiers and is different to what throw
945 [except.throw] and catch [except.catch] will do. They will ignore the
946 top level cv qualifiers, and allow qualifiers in the pointer to class
949 We implement the letter of the standard. */
952 comp_except_types (tree a, tree b, bool exact)
954 if (same_type_p (a, b))
958 if (cp_type_quals (a) || cp_type_quals (b))
961 if (TREE_CODE (a) == POINTER_TYPE
962 && TREE_CODE (b) == POINTER_TYPE)
966 if (cp_type_quals (a) || cp_type_quals (b))
970 if (TREE_CODE (a) != RECORD_TYPE
971 || TREE_CODE (b) != RECORD_TYPE)
974 if (PUBLICLY_UNIQUELY_DERIVED_P (a, b))
980 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
981 If EXACT is false, T2 can be stricter than T1 (according to 15.4/7),
982 otherwise it must be exact. Exception lists are unordered, but
983 we've already filtered out duplicates. Most lists will be in order,
984 we should try to make use of that. */
987 comp_except_specs (const_tree t1, const_tree t2, bool exact)
996 if (t1 == NULL_TREE) /* T1 is ... */
997 return t2 == NULL_TREE || !exact;
998 if (!TREE_VALUE (t1)) /* t1 is EMPTY */
999 return t2 != NULL_TREE && !TREE_VALUE (t2);
1000 if (t2 == NULL_TREE) /* T2 is ... */
1002 if (TREE_VALUE (t1) && !TREE_VALUE (t2)) /* T2 is EMPTY, T1 is not */
1005 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1006 Count how many we find, to determine exactness. For exact matching and
1007 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1009 for (base = t1; t2 != NULL_TREE; t2 = TREE_CHAIN (t2))
1011 for (probe = base; probe != NULL_TREE; probe = TREE_CHAIN (probe))
1013 tree a = TREE_VALUE (probe);
1014 tree b = TREE_VALUE (t2);
1016 if (comp_except_types (a, b, exact))
1018 if (probe == base && exact)
1019 base = TREE_CHAIN (probe);
1024 if (probe == NULL_TREE)
1027 return !exact || base == NULL_TREE || length == list_length (t1);
1030 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1031 [] can match [size]. */
1034 comp_array_types (const_tree t1, const_tree t2, bool allow_redeclaration)
1043 /* The type of the array elements must be the same. */
1044 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1047 d1 = TYPE_DOMAIN (t1);
1048 d2 = TYPE_DOMAIN (t2);
1053 /* If one of the arrays is dimensionless, and the other has a
1054 dimension, they are of different types. However, it is valid to
1062 declarations for an array object can specify
1063 array types that differ by the presence or absence of a major
1064 array bound (_dcl.array_). */
1066 return allow_redeclaration;
1068 /* Check that the dimensions are the same. */
1070 if (!cp_tree_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2)))
1072 max1 = TYPE_MAX_VALUE (d1);
1073 max2 = TYPE_MAX_VALUE (d2);
1074 if (processing_template_decl && !abi_version_at_least (2)
1075 && !value_dependent_expression_p (max1)
1076 && !value_dependent_expression_p (max2))
1078 /* With abi-1 we do not fold non-dependent array bounds, (and
1079 consequently mangle them incorrectly). We must therefore
1080 fold them here, to verify the domains have the same
1086 if (!cp_tree_equal (max1, max2))
1092 /* Compare the relative position of T1 and T2 into their respective
1093 template parameter list.
1094 T1 and T2 must be template parameter types.
1095 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1098 comp_template_parms_position (tree t1, tree t2)
1100 gcc_assert (t1 && t2
1101 && TREE_CODE (t1) == TREE_CODE (t2)
1102 && (TREE_CODE (t1) == BOUND_TEMPLATE_TEMPLATE_PARM
1103 || TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM
1104 || TREE_CODE (t1) == TEMPLATE_TYPE_PARM));
1106 if (TEMPLATE_TYPE_IDX (t1) != TEMPLATE_TYPE_IDX (t2)
1107 || TEMPLATE_TYPE_LEVEL (t1) != TEMPLATE_TYPE_LEVEL (t2)
1108 || (TEMPLATE_TYPE_PARAMETER_PACK (t1)
1109 != TEMPLATE_TYPE_PARAMETER_PACK (t2)))
1115 /* Subroutine of incompatible_dependent_types_p.
1116 Return the template parameter of the dependent type T.
1117 If T is a typedef, return the template parameters of
1118 the _decl_ of the typedef. T must be a dependent type. */
1121 get_template_parms_of_dependent_type (tree t)
1123 tree tinfo = NULL_TREE, tparms = NULL_TREE;
1125 /* First, try the obvious case of getting the
1126 template info from T itself. */
1127 if ((tinfo = get_template_info (t)))
1129 else if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
1130 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (t);
1131 else if (typedef_variant_p (t)
1132 && !NAMESPACE_SCOPE_P (TYPE_NAME (t)))
1133 tinfo = get_template_info (DECL_CONTEXT (TYPE_NAME (t)));
1134 /* If T is a TYPENAME_TYPE which context is a template type
1135 parameter, get the template parameters from that context. */
1136 else if (TYPE_CONTEXT (t)
1137 && TREE_CODE (TYPE_CONTEXT (t)) == TEMPLATE_TYPE_PARM)
1138 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (TYPE_CONTEXT (t));
1139 else if (TYPE_CONTEXT (t)
1140 && !NAMESPACE_SCOPE_P (t))
1141 tinfo = get_template_info (TYPE_CONTEXT (t));
1144 tparms = DECL_TEMPLATE_PARMS (TI_TEMPLATE (tinfo));
1149 /* Subroutine of structural_comptypes.
1150 Compare the dependent types T1 and T2.
1151 Return TRUE if we are sure they can't be equal, FALSE otherwise.
1152 The whole point of this function is to support cases where either T1 or
1153 T2 is a typedef. In those cases, we need to compare the template parameters
1154 of the _decl_ of the typedef. If those don't match then we know T1
1155 and T2 cannot be equal. */
1158 incompatible_dependent_types_p (tree t1, tree t2)
1160 tree tparms1 = NULL_TREE, tparms2 = NULL_TREE;
1161 bool t1_typedef_variant_p, t2_typedef_variant_p;
1163 if (!uses_template_parms (t1) || !uses_template_parms (t2))
1166 if (TREE_CODE (t1) == TEMPLATE_TYPE_PARM)
1168 /* If T1 and T2 don't have the same relative position in their
1169 template parameters set, they can't be equal. */
1170 if (!comp_template_parms_position (t1, t2))
1174 t1_typedef_variant_p = typedef_variant_p (t1);
1175 t2_typedef_variant_p = typedef_variant_p (t2);
1177 /* Either T1 or T2 must be a typedef. */
1178 if (!t1_typedef_variant_p && !t2_typedef_variant_p)
1181 if (!t1_typedef_variant_p || !t2_typedef_variant_p)
1182 /* Either T1 or T2 is not a typedef so we cannot compare the
1183 the template parms of the typedefs of T1 and T2.
1184 At this point, if the main variant type of T1 and T2 are equal
1185 it means the two types can't be incompatible, from the perspective
1186 of this function. */
1187 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
1190 /* So if we reach this point, it means either T1 or T2 is a typedef variant.
1191 Let's compare their template parameters. */
1193 tparms1 = get_template_parms_of_dependent_type (t1);
1194 tparms2 = get_template_parms_of_dependent_type (t2);
1196 /* If T2 is a template type parm and if we could not get the template
1197 parms it belongs to, that means we have not finished parsing the
1198 full set of template parameters of the template declaration it
1199 belongs to yet. If we could get the template parms T1 belongs to,
1200 that mostly means T1 and T2 belongs to templates that are
1201 different and incompatible. */
1202 if (TREE_CODE (t1) == TEMPLATE_TYPE_PARM
1203 && (tparms1 == NULL_TREE || tparms2 == NULL_TREE)
1204 && tparms1 != tparms2)
1207 if (tparms1 == NULL_TREE
1208 || tparms2 == NULL_TREE
1209 || tparms1 == tparms2)
1212 /* And now compare the mighty template parms! */
1213 return !comp_template_parms (tparms1, tparms2);
1216 /* Subroutine in comptypes. */
1219 structural_comptypes (tree t1, tree t2, int strict)
1224 /* Suppress errors caused by previously reported errors. */
1225 if (t1 == error_mark_node || t2 == error_mark_node)
1228 gcc_assert (TYPE_P (t1) && TYPE_P (t2));
1230 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1231 current instantiation. */
1232 if (TREE_CODE (t1) == TYPENAME_TYPE)
1233 t1 = resolve_typename_type (t1, /*only_current_p=*/true);
1235 if (TREE_CODE (t2) == TYPENAME_TYPE)
1236 t2 = resolve_typename_type (t2, /*only_current_p=*/true);
1238 if (TYPE_PTRMEMFUNC_P (t1))
1239 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
1240 if (TYPE_PTRMEMFUNC_P (t2))
1241 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
1243 /* Different classes of types can't be compatible. */
1244 if (TREE_CODE (t1) != TREE_CODE (t2))
1247 /* Qualifiers must match. For array types, we will check when we
1248 recur on the array element types. */
1249 if (TREE_CODE (t1) != ARRAY_TYPE
1250 && cp_type_quals (t1) != cp_type_quals (t2))
1252 if (TREE_CODE (t1) == FUNCTION_TYPE
1253 && type_memfn_quals (t1) != type_memfn_quals (t2))
1255 if (TYPE_FOR_JAVA (t1) != TYPE_FOR_JAVA (t2))
1258 /* If T1 and T2 are dependent typedefs then check upfront that
1259 the template parameters of their typedef DECLs match before
1260 going down checking their subtypes. */
1261 if (incompatible_dependent_types_p (t1, t2))
1264 /* Allow for two different type nodes which have essentially the same
1265 definition. Note that we already checked for equality of the type
1266 qualifiers (just above). */
1268 if (TREE_CODE (t1) != ARRAY_TYPE
1269 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
1273 /* Compare the types. Break out if they could be the same. */
1274 switch (TREE_CODE (t1))
1278 /* All void and bool types are the same. */
1282 case FIXED_POINT_TYPE:
1284 /* With these nodes, we can't determine type equivalence by
1285 looking at what is stored in the nodes themselves, because
1286 two nodes might have different TYPE_MAIN_VARIANTs but still
1287 represent the same type. For example, wchar_t and int could
1288 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1289 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1290 and are distinct types. On the other hand, int and the
1293 typedef int INT __attribute((may_alias));
1295 have identical properties, different TYPE_MAIN_VARIANTs, but
1296 represent the same type. The canonical type system keeps
1297 track of equivalence in this case, so we fall back on it. */
1298 return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
1300 case TEMPLATE_TEMPLATE_PARM:
1301 case BOUND_TEMPLATE_TEMPLATE_PARM:
1302 if (!comp_template_parms_position (t1, t2))
1304 if (!comp_template_parms
1305 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1)),
1306 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2))))
1308 if (TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM)
1310 /* Don't check inheritance. */
1311 strict = COMPARE_STRICT;
1316 if (TYPE_TEMPLATE_INFO (t1) && TYPE_TEMPLATE_INFO (t2)
1317 && (TYPE_TI_TEMPLATE (t1) == TYPE_TI_TEMPLATE (t2)
1318 || TREE_CODE (t1) == BOUND_TEMPLATE_TEMPLATE_PARM)
1319 && comp_template_args (TYPE_TI_ARGS (t1), TYPE_TI_ARGS (t2)))
1322 if ((strict & COMPARE_BASE) && DERIVED_FROM_P (t1, t2))
1324 else if ((strict & COMPARE_DERIVED) && DERIVED_FROM_P (t2, t1))
1330 if (!comptypes (TYPE_OFFSET_BASETYPE (t1), TYPE_OFFSET_BASETYPE (t2),
1331 strict & ~COMPARE_REDECLARATION))
1333 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1337 case REFERENCE_TYPE:
1338 if (TYPE_REF_IS_RVALUE (t1) != TYPE_REF_IS_RVALUE (t2))
1340 /* fall through to checks for pointer types */
1343 if (TYPE_MODE (t1) != TYPE_MODE (t2)
1344 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2)
1345 || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1351 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1353 if (!compparms (TYPE_ARG_TYPES (t1), TYPE_ARG_TYPES (t2)))
1358 /* Target types must match incl. qualifiers. */
1359 if (!comp_array_types (t1, t2, !!(strict & COMPARE_REDECLARATION)))
1363 case TEMPLATE_TYPE_PARM:
1364 /* If incompatible_dependent_types_p called earlier didn't decide
1365 T1 and T2 were different, they might be equal. */
1369 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1),
1370 TYPENAME_TYPE_FULLNAME (t2)))
1372 if (!same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)))
1376 case UNBOUND_CLASS_TEMPLATE:
1377 if (!cp_tree_equal (TYPE_IDENTIFIER (t1), TYPE_IDENTIFIER (t2)))
1379 if (!same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)))
1384 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1389 if (TYPE_VECTOR_SUBPARTS (t1) != TYPE_VECTOR_SUBPARTS (t2)
1390 || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1394 case TYPE_PACK_EXPANSION:
1395 return same_type_p (PACK_EXPANSION_PATTERN (t1),
1396 PACK_EXPANSION_PATTERN (t2));
1399 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1)
1400 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2)
1401 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1)
1402 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2))
1403 || (DECLTYPE_FOR_LAMBDA_RETURN (t1)
1404 != DECLTYPE_FOR_LAMBDA_RETURN (t2))
1405 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1),
1406 DECLTYPE_TYPE_EXPR (t2)))
1414 /* If we get here, we know that from a target independent POV the
1415 types are the same. Make sure the target attributes are also
1417 return targetm.comp_type_attributes (t1, t2);
1420 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1421 is a bitwise-or of the COMPARE_* flags. */
1424 comptypes (tree t1, tree t2, int strict)
1426 if (strict == COMPARE_STRICT)
1431 if (t1 == error_mark_node || t2 == error_mark_node)
1434 if (TYPE_STRUCTURAL_EQUALITY_P (t1) || TYPE_STRUCTURAL_EQUALITY_P (t2))
1435 /* At least one of the types requires structural equality, so
1436 perform a deep check. */
1437 return structural_comptypes (t1, t2, strict);
1439 #ifdef ENABLE_CHECKING
1440 if (USE_CANONICAL_TYPES)
1442 bool result = structural_comptypes (t1, t2, strict);
1444 if (result && TYPE_CANONICAL (t1) != TYPE_CANONICAL (t2))
1445 /* The two types are structurally equivalent, but their
1446 canonical types were different. This is a failure of the
1447 canonical type propagation code.*/
1449 ("canonical types differ for identical types %T and %T",
1451 else if (!result && TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2))
1452 /* Two types are structurally different, but the canonical
1453 types are the same. This means we were over-eager in
1454 assigning canonical types. */
1456 ("same canonical type node for different types %T and %T",
1462 if (USE_CANONICAL_TYPES)
1463 return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
1466 return structural_comptypes (t1, t2, strict);
1468 else if (strict == COMPARE_STRUCTURAL)
1469 return structural_comptypes (t1, t2, COMPARE_STRICT);
1471 return structural_comptypes (t1, t2, strict);
1474 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1477 at_least_as_qualified_p (const_tree type1, const_tree type2)
1479 int q1 = cp_type_quals (type1);
1480 int q2 = cp_type_quals (type2);
1482 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1483 return (q1 & q2) == q2;
1486 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1487 more cv-qualified that TYPE1, and 0 otherwise. */
1490 comp_cv_qualification (const_tree type1, const_tree type2)
1492 int q1 = cp_type_quals (type1);
1493 int q2 = cp_type_quals (type2);
1498 if ((q1 & q2) == q2)
1500 else if ((q1 & q2) == q1)
1506 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1507 subset of the cv-qualification signature of TYPE2, and the types
1508 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1511 comp_cv_qual_signature (tree type1, tree type2)
1513 if (comp_ptr_ttypes_real (type2, type1, -1))
1515 else if (comp_ptr_ttypes_real (type1, type2, -1))
1521 /* Subroutines of `comptypes'. */
1523 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1524 equivalent in the sense that functions with those parameter types
1525 can have equivalent types. The two lists must be equivalent,
1526 element by element. */
1529 compparms (const_tree parms1, const_tree parms2)
1533 /* An unspecified parmlist matches any specified parmlist
1534 whose argument types don't need default promotions. */
1536 for (t1 = parms1, t2 = parms2;
1538 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
1540 /* If one parmlist is shorter than the other,
1541 they fail to match. */
1544 if (!same_type_p (TREE_VALUE (t1), TREE_VALUE (t2)))
1551 /* Process a sizeof or alignof expression where the operand is a
1555 cxx_sizeof_or_alignof_type (tree type, enum tree_code op, bool complain)
1560 gcc_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR);
1561 if (type == error_mark_node)
1562 return error_mark_node;
1564 type = non_reference (type);
1565 if (TREE_CODE (type) == METHOD_TYPE)
1568 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
1569 "invalid application of %qs to a member function",
1570 operator_name_info[(int) op].name);
1571 value = size_one_node;
1574 dependent_p = dependent_type_p (type);
1576 complete_type (type);
1578 /* VLA types will have a non-constant size. In the body of an
1579 uninstantiated template, we don't need to try to compute the
1580 value, because the sizeof expression is not an integral
1581 constant expression in that case. And, if we do try to
1582 compute the value, we'll likely end up with SAVE_EXPRs, which
1583 the template substitution machinery does not expect to see. */
1584 || (processing_template_decl
1585 && COMPLETE_TYPE_P (type)
1586 && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST))
1588 value = build_min (op, size_type_node, type);
1589 TREE_READONLY (value) = 1;
1593 return c_sizeof_or_alignof_type (input_location, complete_type (type),
1598 /* Return the size of the type, without producing any warnings for
1599 types whose size cannot be taken. This routine should be used only
1600 in some other routine that has already produced a diagnostic about
1601 using the size of such a type. */
1603 cxx_sizeof_nowarn (tree type)
1605 if (TREE_CODE (type) == FUNCTION_TYPE
1606 || TREE_CODE (type) == VOID_TYPE
1607 || TREE_CODE (type) == ERROR_MARK)
1608 return size_one_node;
1609 else if (!COMPLETE_TYPE_P (type))
1610 return size_zero_node;
1612 return cxx_sizeof_or_alignof_type (type, SIZEOF_EXPR, false);
1615 /* Process a sizeof expression where the operand is an expression. */
1618 cxx_sizeof_expr (tree e, tsubst_flags_t complain)
1620 if (e == error_mark_node)
1621 return error_mark_node;
1623 if (processing_template_decl)
1625 e = build_min (SIZEOF_EXPR, size_type_node, e);
1626 TREE_SIDE_EFFECTS (e) = 0;
1627 TREE_READONLY (e) = 1;
1632 /* To get the size of a static data member declared as an array of
1633 unknown bound, we need to instantiate it. */
1634 if (TREE_CODE (e) == VAR_DECL
1635 && VAR_HAD_UNKNOWN_BOUND (e)
1636 && DECL_TEMPLATE_INSTANTIATION (e))
1637 instantiate_decl (e, /*defer_ok*/true, /*expl_inst_mem*/false);
1639 e = mark_type_use (e);
1641 if (TREE_CODE (e) == COMPONENT_REF
1642 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1643 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1645 if (complain & tf_error)
1646 error ("invalid application of %<sizeof%> to a bit-field");
1648 return error_mark_node;
1651 else if (is_overloaded_fn (e))
1653 if (complain & tf_error)
1654 permerror (input_location, "ISO C++ forbids applying %<sizeof%> to an expression of "
1657 return error_mark_node;
1660 else if (type_unknown_p (e))
1662 if (complain & tf_error)
1663 cxx_incomplete_type_error (e, TREE_TYPE (e));
1665 return error_mark_node;
1671 return cxx_sizeof_or_alignof_type (e, SIZEOF_EXPR, complain & tf_error);
1674 /* Implement the __alignof keyword: Return the minimum required
1675 alignment of E, measured in bytes. For VAR_DECL's and
1676 FIELD_DECL's return DECL_ALIGN (which can be set from an
1677 "aligned" __attribute__ specification). */
1680 cxx_alignof_expr (tree e, tsubst_flags_t complain)
1684 if (e == error_mark_node)
1685 return error_mark_node;
1687 if (processing_template_decl)
1689 e = build_min (ALIGNOF_EXPR, size_type_node, e);
1690 TREE_SIDE_EFFECTS (e) = 0;
1691 TREE_READONLY (e) = 1;
1696 e = mark_type_use (e);
1698 if (TREE_CODE (e) == VAR_DECL)
1699 t = size_int (DECL_ALIGN_UNIT (e));
1700 else if (TREE_CODE (e) == COMPONENT_REF
1701 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1702 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1704 if (complain & tf_error)
1705 error ("invalid application of %<__alignof%> to a bit-field");
1707 return error_mark_node;
1710 else if (TREE_CODE (e) == COMPONENT_REF
1711 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL)
1712 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e, 1)));
1713 else if (is_overloaded_fn (e))
1715 if (complain & tf_error)
1716 permerror (input_location, "ISO C++ forbids applying %<__alignof%> to an expression of "
1719 return error_mark_node;
1720 if (TREE_CODE (e) == FUNCTION_DECL)
1721 t = size_int (DECL_ALIGN_UNIT (e));
1725 else if (type_unknown_p (e))
1727 if (complain & tf_error)
1728 cxx_incomplete_type_error (e, TREE_TYPE (e));
1730 return error_mark_node;
1734 return cxx_sizeof_or_alignof_type (TREE_TYPE (e), ALIGNOF_EXPR,
1735 complain & tf_error);
1737 return fold_convert (size_type_node, t);
1740 /* Process a sizeof or alignof expression E with code OP where the operand
1741 is an expression. */
1744 cxx_sizeof_or_alignof_expr (tree e, enum tree_code op, bool complain)
1746 if (op == SIZEOF_EXPR)
1747 return cxx_sizeof_expr (e, complain? tf_warning_or_error : tf_none);
1749 return cxx_alignof_expr (e, complain? tf_warning_or_error : tf_none);
1752 /* EXPR is being used in a context that is not a function call.
1757 The expression can be used only as the left-hand operand of a
1758 member function call.
1760 [expr.mptr.operator]
1762 If the result of .* or ->* is a function, then that result can be
1763 used only as the operand for the function call operator ().
1765 by issuing an error message if appropriate. Returns true iff EXPR
1766 violates these rules. */
1769 invalid_nonstatic_memfn_p (const_tree expr, tsubst_flags_t complain)
1771 if (expr && DECL_NONSTATIC_MEMBER_FUNCTION_P (expr))
1773 if (complain & tf_error)
1774 error ("invalid use of non-static member function");
1780 /* If EXP is a reference to a bitfield, and the type of EXP does not
1781 match the declared type of the bitfield, return the declared type
1782 of the bitfield. Otherwise, return NULL_TREE. */
1785 is_bitfield_expr_with_lowered_type (const_tree exp)
1787 switch (TREE_CODE (exp))
1790 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1)
1791 ? TREE_OPERAND (exp, 1)
1792 : TREE_OPERAND (exp, 0)))
1794 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 2));
1797 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1));
1801 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
1807 field = TREE_OPERAND (exp, 1);
1808 if (TREE_CODE (field) != FIELD_DECL || !DECL_BIT_FIELD_TYPE (field))
1810 if (same_type_ignoring_top_level_qualifiers_p
1811 (TREE_TYPE (exp), DECL_BIT_FIELD_TYPE (field)))
1813 return DECL_BIT_FIELD_TYPE (field);
1817 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp, 0)))
1818 == TYPE_MAIN_VARIANT (TREE_TYPE (exp)))
1819 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
1827 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1828 bitfield with a lowered type, the type of EXP is returned, rather
1832 unlowered_expr_type (const_tree exp)
1836 type = is_bitfield_expr_with_lowered_type (exp);
1838 type = TREE_TYPE (exp);
1843 /* Perform the conversions in [expr] that apply when an lvalue appears
1844 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1845 function-to-pointer conversions. In addition, manifest constants
1846 are replaced by their values, and bitfield references are converted
1847 to their declared types. Note that this function does not perform the
1848 lvalue-to-rvalue conversion for class types. If you need that conversion
1849 to for class types, then you probably need to use force_rvalue.
1851 Although the returned value is being used as an rvalue, this
1852 function does not wrap the returned expression in a
1853 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1854 that the return value is no longer an lvalue. */
1857 decay_conversion (tree exp)
1860 enum tree_code code;
1862 type = TREE_TYPE (exp);
1863 if (type == error_mark_node)
1864 return error_mark_node;
1866 exp = mark_rvalue_use (exp);
1868 exp = resolve_nondeduced_context (exp);
1869 if (type_unknown_p (exp))
1871 cxx_incomplete_type_error (exp, TREE_TYPE (exp));
1872 return error_mark_node;
1875 exp = decl_constant_value (exp);
1876 if (error_operand_p (exp))
1877 return error_mark_node;
1879 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1880 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1881 code = TREE_CODE (type);
1882 if (code == VOID_TYPE)
1884 error ("void value not ignored as it ought to be");
1885 return error_mark_node;
1887 if (invalid_nonstatic_memfn_p (exp, tf_warning_or_error))
1888 return error_mark_node;
1889 if (code == FUNCTION_TYPE || is_overloaded_fn (exp))
1890 return cp_build_unary_op (ADDR_EXPR, exp, 0, tf_warning_or_error);
1891 if (code == ARRAY_TYPE)
1896 if (TREE_CODE (exp) == INDIRECT_REF)
1897 return build_nop (build_pointer_type (TREE_TYPE (type)),
1898 TREE_OPERAND (exp, 0));
1900 if (TREE_CODE (exp) == COMPOUND_EXPR)
1902 tree op1 = decay_conversion (TREE_OPERAND (exp, 1));
1903 return build2 (COMPOUND_EXPR, TREE_TYPE (op1),
1904 TREE_OPERAND (exp, 0), op1);
1908 && ! (TREE_CODE (exp) == CONSTRUCTOR && TREE_STATIC (exp)))
1910 error ("invalid use of non-lvalue array");
1911 return error_mark_node;
1914 ptrtype = build_pointer_type (TREE_TYPE (type));
1916 if (TREE_CODE (exp) == VAR_DECL)
1918 if (!cxx_mark_addressable (exp))
1919 return error_mark_node;
1920 adr = build_nop (ptrtype, build_address (exp));
1923 /* This way is better for a COMPONENT_REF since it can
1924 simplify the offset for a component. */
1925 adr = cp_build_unary_op (ADDR_EXPR, exp, 1, tf_warning_or_error);
1926 return cp_convert (ptrtype, adr);
1929 /* If a bitfield is used in a context where integral promotion
1930 applies, then the caller is expected to have used
1931 default_conversion. That function promotes bitfields correctly
1932 before calling this function. At this point, if we have a
1933 bitfield referenced, we may assume that is not subject to
1934 promotion, and that, therefore, the type of the resulting rvalue
1935 is the declared type of the bitfield. */
1936 exp = convert_bitfield_to_declared_type (exp);
1938 /* We do not call rvalue() here because we do not want to wrap EXP
1939 in a NON_LVALUE_EXPR. */
1943 Non-class rvalues always have cv-unqualified types. */
1944 type = TREE_TYPE (exp);
1945 if (!CLASS_TYPE_P (type) && cv_qualified_p (type))
1946 exp = build_nop (cv_unqualified (type), exp);
1951 /* Perform preparatory conversions, as part of the "usual arithmetic
1952 conversions". In particular, as per [expr]:
1954 Whenever an lvalue expression appears as an operand of an
1955 operator that expects the rvalue for that operand, the
1956 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1957 standard conversions are applied to convert the expression to an
1960 In addition, we perform integral promotions here, as those are
1961 applied to both operands to a binary operator before determining
1962 what additional conversions should apply. */
1965 default_conversion (tree exp)
1967 /* Check for target-specific promotions. */
1968 tree promoted_type = targetm.promoted_type (TREE_TYPE (exp));
1970 exp = cp_convert (promoted_type, exp);
1971 /* Perform the integral promotions first so that bitfield
1972 expressions (which may promote to "int", even if the bitfield is
1973 declared "unsigned") are promoted correctly. */
1974 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp)))
1975 exp = perform_integral_promotions (exp);
1976 /* Perform the other conversions. */
1977 exp = decay_conversion (exp);
1982 /* EXPR is an expression with an integral or enumeration type.
1983 Perform the integral promotions in [conv.prom], and return the
1987 perform_integral_promotions (tree expr)
1992 expr = mark_rvalue_use (expr);
1996 If the bitfield has an enumerated type, it is treated as any
1997 other value of that type for promotion purposes. */
1998 type = is_bitfield_expr_with_lowered_type (expr);
1999 if (!type || TREE_CODE (type) != ENUMERAL_TYPE)
2000 type = TREE_TYPE (expr);
2001 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
2002 promoted_type = type_promotes_to (type);
2003 if (type != promoted_type)
2004 expr = cp_convert (promoted_type, expr);
2008 /* Returns nonzero iff exp is a STRING_CST or the result of applying
2009 decay_conversion to one. */
2012 string_conv_p (const_tree totype, const_tree exp, int warn)
2016 if (TREE_CODE (totype) != POINTER_TYPE)
2019 t = TREE_TYPE (totype);
2020 if (!same_type_p (t, char_type_node)
2021 && !same_type_p (t, char16_type_node)
2022 && !same_type_p (t, char32_type_node)
2023 && !same_type_p (t, wchar_type_node))
2026 if (TREE_CODE (exp) == STRING_CST)
2028 /* Make sure that we don't try to convert between char and wide chars. */
2029 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp))), t))
2034 /* Is this a string constant which has decayed to 'const char *'? */
2035 t = build_pointer_type (cp_build_qualified_type (t, TYPE_QUAL_CONST));
2036 if (!same_type_p (TREE_TYPE (exp), t))
2039 if (TREE_CODE (exp) != ADDR_EXPR
2040 || TREE_CODE (TREE_OPERAND (exp, 0)) != STRING_CST)
2044 /* This warning is not very useful, as it complains about printf. */
2046 warning (OPT_Wwrite_strings,
2047 "deprecated conversion from string constant to %qT",
2053 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2054 can, for example, use as an lvalue. This code used to be in
2055 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2056 expressions, where we're dealing with aggregates. But now it's again only
2057 called from unary_complex_lvalue. The case (in particular) that led to
2058 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2062 rationalize_conditional_expr (enum tree_code code, tree t,
2063 tsubst_flags_t complain)
2065 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2066 the first operand is always the one to be used if both operands
2067 are equal, so we know what conditional expression this used to be. */
2068 if (TREE_CODE (t) == MIN_EXPR || TREE_CODE (t) == MAX_EXPR)
2070 tree op0 = TREE_OPERAND (t, 0);
2071 tree op1 = TREE_OPERAND (t, 1);
2073 /* The following code is incorrect if either operand side-effects. */
2074 gcc_assert (!TREE_SIDE_EFFECTS (op0)
2075 && !TREE_SIDE_EFFECTS (op1));
2077 build_conditional_expr (build_x_binary_op ((TREE_CODE (t) == MIN_EXPR
2078 ? LE_EXPR : GE_EXPR),
2079 op0, TREE_CODE (op0),
2080 op1, TREE_CODE (op1),
2081 /*overloaded_p=*/NULL,
2083 cp_build_unary_op (code, op0, 0, complain),
2084 cp_build_unary_op (code, op1, 0, complain),
2089 build_conditional_expr (TREE_OPERAND (t, 0),
2090 cp_build_unary_op (code, TREE_OPERAND (t, 1), 0,
2092 cp_build_unary_op (code, TREE_OPERAND (t, 2), 0,
2097 /* Given the TYPE of an anonymous union field inside T, return the
2098 FIELD_DECL for the field. If not found return NULL_TREE. Because
2099 anonymous unions can nest, we must also search all anonymous unions
2100 that are directly reachable. */
2103 lookup_anon_field (tree t, tree type)
2107 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
2109 if (TREE_STATIC (field))
2111 if (TREE_CODE (field) != FIELD_DECL || DECL_ARTIFICIAL (field))
2114 /* If we find it directly, return the field. */
2115 if (DECL_NAME (field) == NULL_TREE
2116 && type == TYPE_MAIN_VARIANT (TREE_TYPE (field)))
2121 /* Otherwise, it could be nested, search harder. */
2122 if (DECL_NAME (field) == NULL_TREE
2123 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2125 tree subfield = lookup_anon_field (TREE_TYPE (field), type);
2133 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2134 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2135 non-NULL, it indicates the path to the base used to name MEMBER.
2136 If PRESERVE_REFERENCE is true, the expression returned will have
2137 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2138 returned will have the type referred to by the reference.
2140 This function does not perform access control; that is either done
2141 earlier by the parser when the name of MEMBER is resolved to MEMBER
2142 itself, or later when overload resolution selects one of the
2143 functions indicated by MEMBER. */
2146 build_class_member_access_expr (tree object, tree member,
2147 tree access_path, bool preserve_reference,
2148 tsubst_flags_t complain)
2152 tree result = NULL_TREE;
2154 if (error_operand_p (object) || error_operand_p (member))
2155 return error_mark_node;
2157 gcc_assert (DECL_P (member) || BASELINK_P (member));
2161 The type of the first expression shall be "class object" (of a
2163 object_type = TREE_TYPE (object);
2164 if (!currently_open_class (object_type)
2165 && !complete_type_or_else (object_type, object))
2166 return error_mark_node;
2167 if (!CLASS_TYPE_P (object_type))
2169 if (complain & tf_error)
2170 error ("request for member %qD in %qE, which is of non-class type %qT",
2171 member, object, object_type);
2172 return error_mark_node;
2175 /* The standard does not seem to actually say that MEMBER must be a
2176 member of OBJECT_TYPE. However, that is clearly what is
2178 if (DECL_P (member))
2180 member_scope = DECL_CLASS_CONTEXT (member);
2182 if (TREE_DEPRECATED (member))
2183 warn_deprecated_use (member, NULL_TREE);
2186 member_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (member));
2187 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2188 presently be the anonymous union. Go outwards until we find a
2189 type related to OBJECT_TYPE. */
2190 while (ANON_AGGR_TYPE_P (member_scope)
2191 && !same_type_ignoring_top_level_qualifiers_p (member_scope,
2193 member_scope = TYPE_CONTEXT (member_scope);
2194 if (!member_scope || !DERIVED_FROM_P (member_scope, object_type))
2196 if (complain & tf_error)
2198 if (TREE_CODE (member) == FIELD_DECL)
2199 error ("invalid use of nonstatic data member %qE", member);
2201 error ("%qD is not a member of %qT", member, object_type);
2203 return error_mark_node;
2206 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2207 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2208 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2210 tree temp = unary_complex_lvalue (ADDR_EXPR, object);
2212 object = cp_build_indirect_ref (temp, RO_NULL, complain);
2215 /* In [expr.ref], there is an explicit list of the valid choices for
2216 MEMBER. We check for each of those cases here. */
2217 if (TREE_CODE (member) == VAR_DECL)
2219 /* A static data member. */
2221 /* If OBJECT has side-effects, they are supposed to occur. */
2222 if (TREE_SIDE_EFFECTS (object))
2223 result = build2 (COMPOUND_EXPR, TREE_TYPE (result), object, result);
2225 else if (TREE_CODE (member) == FIELD_DECL)
2227 /* A non-static data member. */
2232 null_object_p = (TREE_CODE (object) == INDIRECT_REF
2233 && integer_zerop (TREE_OPERAND (object, 0)));
2235 /* Convert OBJECT to the type of MEMBER. */
2236 if (!same_type_p (TYPE_MAIN_VARIANT (object_type),
2237 TYPE_MAIN_VARIANT (member_scope)))
2242 binfo = lookup_base (access_path ? access_path : object_type,
2243 member_scope, ba_unique, &kind);
2244 if (binfo == error_mark_node)
2245 return error_mark_node;
2247 /* It is invalid to try to get to a virtual base of a
2248 NULL object. The most common cause is invalid use of
2250 if (null_object_p && kind == bk_via_virtual)
2252 if (complain & tf_error)
2254 error ("invalid access to non-static data member %qD of "
2257 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2259 return error_mark_node;
2262 /* Convert to the base. */
2263 object = build_base_path (PLUS_EXPR, object, binfo,
2265 /* If we found the base successfully then we should be able
2266 to convert to it successfully. */
2267 gcc_assert (object != error_mark_node);
2270 /* Complain about other invalid uses of offsetof, even though they will
2271 give the right answer. Note that we complain whether or not they
2272 actually used the offsetof macro, since there's no way to know at this
2273 point. So we just give a warning, instead of a pedwarn. */
2274 /* Do not produce this warning for base class field references, because
2275 we know for a fact that didn't come from offsetof. This does occur
2276 in various testsuite cases where a null object is passed where a
2277 vtable access is required. */
2278 if (null_object_p && warn_invalid_offsetof
2279 && CLASSTYPE_NON_STD_LAYOUT (object_type)
2280 && !DECL_FIELD_IS_BASE (member)
2281 && cp_unevaluated_operand == 0
2282 && (complain & tf_warning))
2284 warning (OPT_Winvalid_offsetof,
2285 "invalid access to non-static data member %qD "
2286 " of NULL object", member);
2287 warning (OPT_Winvalid_offsetof,
2288 "(perhaps the %<offsetof%> macro was used incorrectly)");
2291 /* If MEMBER is from an anonymous aggregate, we have converted
2292 OBJECT so that it refers to the class containing the
2293 anonymous union. Generate a reference to the anonymous union
2294 itself, and recur to find MEMBER. */
2295 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member))
2296 /* When this code is called from build_field_call, the
2297 object already has the type of the anonymous union.
2298 That is because the COMPONENT_REF was already
2299 constructed, and was then disassembled before calling
2300 build_field_call. After the function-call code is
2301 cleaned up, this waste can be eliminated. */
2302 && (!same_type_ignoring_top_level_qualifiers_p
2303 (TREE_TYPE (object), DECL_CONTEXT (member))))
2305 tree anonymous_union;
2307 anonymous_union = lookup_anon_field (TREE_TYPE (object),
2308 DECL_CONTEXT (member));
2309 object = build_class_member_access_expr (object,
2311 /*access_path=*/NULL_TREE,
2316 /* Compute the type of the field, as described in [expr.ref]. */
2317 type_quals = TYPE_UNQUALIFIED;
2318 member_type = TREE_TYPE (member);
2319 if (TREE_CODE (member_type) != REFERENCE_TYPE)
2321 type_quals = (cp_type_quals (member_type)
2322 | cp_type_quals (object_type));
2324 /* A field is const (volatile) if the enclosing object, or the
2325 field itself, is const (volatile). But, a mutable field is
2326 not const, even within a const object. */
2327 if (DECL_MUTABLE_P (member))
2328 type_quals &= ~TYPE_QUAL_CONST;
2329 member_type = cp_build_qualified_type (member_type, type_quals);
2332 result = build3 (COMPONENT_REF, member_type, object, member,
2334 result = fold_if_not_in_template (result);
2336 /* Mark the expression const or volatile, as appropriate. Even
2337 though we've dealt with the type above, we still have to mark the
2338 expression itself. */
2339 if (type_quals & TYPE_QUAL_CONST)
2340 TREE_READONLY (result) = 1;
2341 if (type_quals & TYPE_QUAL_VOLATILE)
2342 TREE_THIS_VOLATILE (result) = 1;
2344 else if (BASELINK_P (member))
2346 /* The member is a (possibly overloaded) member function. */
2350 /* If the MEMBER is exactly one static member function, then we
2351 know the type of the expression. Otherwise, we must wait
2352 until overload resolution has been performed. */
2353 functions = BASELINK_FUNCTIONS (member);
2354 if (TREE_CODE (functions) == FUNCTION_DECL
2355 && DECL_STATIC_FUNCTION_P (functions))
2356 type = TREE_TYPE (functions);
2358 type = unknown_type_node;
2359 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2360 base. That will happen when the function is called. */
2361 result = build3 (COMPONENT_REF, type, object, member, NULL_TREE);
2363 else if (TREE_CODE (member) == CONST_DECL)
2365 /* The member is an enumerator. */
2367 /* If OBJECT has side-effects, they are supposed to occur. */
2368 if (TREE_SIDE_EFFECTS (object))
2369 result = build2 (COMPOUND_EXPR, TREE_TYPE (result),
2374 if (complain & tf_error)
2375 error ("invalid use of %qD", member);
2376 return error_mark_node;
2379 if (!preserve_reference)
2382 If E2 is declared to have type "reference to T", then ... the
2383 type of E1.E2 is T. */
2384 result = convert_from_reference (result);
2389 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2390 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2393 lookup_destructor (tree object, tree scope, tree dtor_name)
2395 tree object_type = TREE_TYPE (object);
2396 tree dtor_type = TREE_OPERAND (dtor_name, 0);
2399 if (scope && !check_dtor_name (scope, dtor_type))
2401 error ("qualified type %qT does not match destructor name ~%qT",
2403 return error_mark_node;
2405 if (TREE_CODE (dtor_type) == IDENTIFIER_NODE)
2407 /* In a template, names we can't find a match for are still accepted
2408 destructor names, and we check them here. */
2409 if (check_dtor_name (object_type, dtor_type))
2410 dtor_type = object_type;
2413 error ("object type %qT does not match destructor name ~%qT",
2414 object_type, dtor_type);
2415 return error_mark_node;
2419 else if (!DERIVED_FROM_P (dtor_type, TYPE_MAIN_VARIANT (object_type)))
2421 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2422 TYPE_MAIN_VARIANT (object_type), dtor_type);
2423 return error_mark_node;
2425 expr = lookup_member (dtor_type, complete_dtor_identifier,
2426 /*protect=*/1, /*want_type=*/false);
2427 expr = (adjust_result_of_qualified_name_lookup
2428 (expr, dtor_type, object_type));
2432 /* An expression of the form "A::template B" has been resolved to
2433 DECL. Issue a diagnostic if B is not a template or template
2437 check_template_keyword (tree decl)
2439 /* The standard says:
2443 If a name prefixed by the keyword template is not a member
2444 template, the program is ill-formed.
2446 DR 228 removed the restriction that the template be a member
2449 DR 96, if accepted would add the further restriction that explicit
2450 template arguments must be provided if the template keyword is
2451 used, but, as of 2005-10-16, that DR is still in "drafting". If
2452 this DR is accepted, then the semantic checks here can be
2453 simplified, as the entity named must in fact be a template
2454 specialization, rather than, as at present, a set of overloaded
2455 functions containing at least one template function. */
2456 if (TREE_CODE (decl) != TEMPLATE_DECL
2457 && TREE_CODE (decl) != TEMPLATE_ID_EXPR)
2459 if (!is_overloaded_fn (decl))
2460 permerror (input_location, "%qD is not a template", decl);
2465 if (BASELINK_P (fns))
2466 fns = BASELINK_FUNCTIONS (fns);
2469 tree fn = OVL_CURRENT (fns);
2470 if (TREE_CODE (fn) == TEMPLATE_DECL
2471 || TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2473 if (TREE_CODE (fn) == FUNCTION_DECL
2474 && DECL_USE_TEMPLATE (fn)
2475 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
2477 fns = OVL_NEXT (fns);
2480 permerror (input_location, "%qD is not a template", decl);
2485 /* This function is called by the parser to process a class member
2486 access expression of the form OBJECT.NAME. NAME is a node used by
2487 the parser to represent a name; it is not yet a DECL. It may,
2488 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2489 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2490 there is no reason to do the lookup twice, so the parser keeps the
2491 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2492 be a template via the use of the "A::template B" syntax. */
2495 finish_class_member_access_expr (tree object, tree name, bool template_p,
2496 tsubst_flags_t complain)
2501 tree access_path = NULL_TREE;
2502 tree orig_object = object;
2503 tree orig_name = name;
2505 if (object == error_mark_node || name == error_mark_node)
2506 return error_mark_node;
2508 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2509 if (!objc_is_public (object, name))
2510 return error_mark_node;
2512 object_type = TREE_TYPE (object);
2514 if (processing_template_decl)
2516 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2517 dependent_type_p (object_type)
2518 /* If NAME is just an IDENTIFIER_NODE, then the expression
2520 || TREE_CODE (object) == IDENTIFIER_NODE
2521 /* If NAME is "f<args>", where either 'f' or 'args' is
2522 dependent, then the expression is dependent. */
2523 || (TREE_CODE (name) == TEMPLATE_ID_EXPR
2524 && dependent_template_id_p (TREE_OPERAND (name, 0),
2525 TREE_OPERAND (name, 1)))
2526 /* If NAME is "T::X" where "T" is dependent, then the
2527 expression is dependent. */
2528 || (TREE_CODE (name) == SCOPE_REF
2529 && TYPE_P (TREE_OPERAND (name, 0))
2530 && dependent_type_p (TREE_OPERAND (name, 0))))
2531 return build_min_nt (COMPONENT_REF, object, name, NULL_TREE);
2532 object = build_non_dependent_expr (object);
2537 The type of the first expression shall be "class object" (of a
2539 if (!currently_open_class (object_type)
2540 && !complete_type_or_else (object_type, object))
2541 return error_mark_node;
2542 if (!CLASS_TYPE_P (object_type))
2544 if (complain & tf_error)
2545 error ("request for member %qD in %qE, which is of non-class type %qT",
2546 name, object, object_type);
2547 return error_mark_node;
2550 if (BASELINK_P (name))
2551 /* A member function that has already been looked up. */
2555 bool is_template_id = false;
2556 tree template_args = NULL_TREE;
2559 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
2561 is_template_id = true;
2562 template_args = TREE_OPERAND (name, 1);
2563 name = TREE_OPERAND (name, 0);
2565 if (TREE_CODE (name) == OVERLOAD)
2566 name = DECL_NAME (get_first_fn (name));
2567 else if (DECL_P (name))
2568 name = DECL_NAME (name);
2571 if (TREE_CODE (name) == SCOPE_REF)
2573 /* A qualified name. The qualifying class or namespace `S'
2574 has already been looked up; it is either a TYPE or a
2576 scope = TREE_OPERAND (name, 0);
2577 name = TREE_OPERAND (name, 1);
2579 /* If SCOPE is a namespace, then the qualified name does not
2580 name a member of OBJECT_TYPE. */
2581 if (TREE_CODE (scope) == NAMESPACE_DECL)
2583 if (complain & tf_error)
2584 error ("%<%D::%D%> is not a member of %qT",
2585 scope, name, object_type);
2586 return error_mark_node;
2589 gcc_assert (CLASS_TYPE_P (scope));
2590 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE
2591 || TREE_CODE (name) == BIT_NOT_EXPR);
2593 if (constructor_name_p (name, scope))
2595 if (complain & tf_error)
2596 error ("cannot call constructor %<%T::%D%> directly",
2598 return error_mark_node;
2601 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2602 access_path = lookup_base (object_type, scope, ba_check, NULL);
2603 if (access_path == error_mark_node)
2604 return error_mark_node;
2607 if (complain & tf_error)
2608 error ("%qT is not a base of %qT", scope, object_type);
2609 return error_mark_node;
2615 access_path = object_type;
2618 if (TREE_CODE (name) == BIT_NOT_EXPR)
2619 member = lookup_destructor (object, scope, name);
2622 /* Look up the member. */
2623 member = lookup_member (access_path, name, /*protect=*/1,
2624 /*want_type=*/false);
2625 if (member == NULL_TREE)
2627 if (complain & tf_error)
2628 error ("%qD has no member named %qE", object_type, name);
2629 return error_mark_node;
2631 if (member == error_mark_node)
2632 return error_mark_node;
2637 tree templ = member;
2639 if (BASELINK_P (templ))
2640 templ = lookup_template_function (templ, template_args);
2643 if (complain & tf_error)
2644 error ("%qD is not a member template function", name);
2645 return error_mark_node;
2650 if (TREE_DEPRECATED (member))
2651 warn_deprecated_use (member, NULL_TREE);
2654 check_template_keyword (member);
2656 expr = build_class_member_access_expr (object, member, access_path,
2657 /*preserve_reference=*/false,
2659 if (processing_template_decl && expr != error_mark_node)
2661 if (BASELINK_P (member))
2663 if (TREE_CODE (orig_name) == SCOPE_REF)
2664 BASELINK_QUALIFIED_P (member) = 1;
2667 return build_min_non_dep (COMPONENT_REF, expr,
2668 orig_object, orig_name,
2675 /* Return an expression for the MEMBER_NAME field in the internal
2676 representation of PTRMEM, a pointer-to-member function. (Each
2677 pointer-to-member function type gets its own RECORD_TYPE so it is
2678 more convenient to access the fields by name than by FIELD_DECL.)
2679 This routine converts the NAME to a FIELD_DECL and then creates the
2680 node for the complete expression. */
2683 build_ptrmemfunc_access_expr (tree ptrmem, tree member_name)
2689 /* This code is a stripped down version of
2690 build_class_member_access_expr. It does not work to use that
2691 routine directly because it expects the object to be of class
2693 ptrmem_type = TREE_TYPE (ptrmem);
2694 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type));
2695 member = lookup_member (ptrmem_type, member_name, /*protect=*/0,
2696 /*want_type=*/false);
2697 member_type = cp_build_qualified_type (TREE_TYPE (member),
2698 cp_type_quals (ptrmem_type));
2699 return fold_build3_loc (input_location,
2700 COMPONENT_REF, member_type,
2701 ptrmem, member, NULL_TREE);
2704 /* Given an expression PTR for a pointer, return an expression
2705 for the value pointed to.
2706 ERRORSTRING is the name of the operator to appear in error messages.
2708 This function may need to overload OPERATOR_FNNAME.
2709 Must also handle REFERENCE_TYPEs for C++. */
2712 build_x_indirect_ref (tree expr, ref_operator errorstring,
2713 tsubst_flags_t complain)
2715 tree orig_expr = expr;
2718 if (processing_template_decl)
2720 /* Retain the type if we know the operand is a pointer so that
2721 describable_type doesn't make auto deduction break. */
2722 if (TREE_TYPE (expr) && POINTER_TYPE_P (TREE_TYPE (expr)))
2723 return build_min (INDIRECT_REF, TREE_TYPE (TREE_TYPE (expr)), expr);
2724 if (type_dependent_expression_p (expr))
2725 return build_min_nt (INDIRECT_REF, expr);
2726 expr = build_non_dependent_expr (expr);
2729 rval = build_new_op (INDIRECT_REF, LOOKUP_NORMAL, expr, NULL_TREE,
2730 NULL_TREE, /*overloaded_p=*/NULL, complain);
2732 rval = cp_build_indirect_ref (expr, errorstring, complain);
2734 if (processing_template_decl && rval != error_mark_node)
2735 return build_min_non_dep (INDIRECT_REF, rval, orig_expr);
2740 /* Helper function called from c-common. */
2742 build_indirect_ref (location_t loc __attribute__ ((__unused__)),
2743 tree ptr, ref_operator errorstring)
2745 return cp_build_indirect_ref (ptr, errorstring, tf_warning_or_error);
2749 cp_build_indirect_ref (tree ptr, ref_operator errorstring,
2750 tsubst_flags_t complain)
2754 if (ptr == error_mark_node)
2755 return error_mark_node;
2757 if (ptr == current_class_ptr)
2758 return current_class_ref;
2760 pointer = (TREE_CODE (TREE_TYPE (ptr)) == REFERENCE_TYPE
2761 ? ptr : decay_conversion (ptr));
2762 type = TREE_TYPE (pointer);
2764 if (POINTER_TYPE_P (type))
2768 If the type of the expression is "pointer to T," the type
2769 of the result is "T." */
2770 tree t = TREE_TYPE (type);
2772 if (CONVERT_EXPR_P (ptr)
2773 || TREE_CODE (ptr) == VIEW_CONVERT_EXPR)
2775 /* If a warning is issued, mark it to avoid duplicates from
2776 the backend. This only needs to be done at
2777 warn_strict_aliasing > 2. */
2778 if (warn_strict_aliasing > 2)
2779 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr, 0)),
2780 type, TREE_OPERAND (ptr, 0)))
2781 TREE_NO_WARNING (ptr) = 1;
2784 if (VOID_TYPE_P (t))
2786 /* A pointer to incomplete type (other than cv void) can be
2787 dereferenced [expr.unary.op]/1 */
2788 if (complain & tf_error)
2789 error ("%qT is not a pointer-to-object type", type);
2790 return error_mark_node;
2792 else if (TREE_CODE (pointer) == ADDR_EXPR
2793 && same_type_p (t, TREE_TYPE (TREE_OPERAND (pointer, 0))))
2794 /* The POINTER was something like `&x'. We simplify `*&x' to
2796 return TREE_OPERAND (pointer, 0);
2799 tree ref = build1 (INDIRECT_REF, t, pointer);
2801 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2802 so that we get the proper error message if the result is used
2803 to assign to. Also, &* is supposed to be a no-op. */
2804 TREE_READONLY (ref) = CP_TYPE_CONST_P (t);
2805 TREE_THIS_VOLATILE (ref) = CP_TYPE_VOLATILE_P (t);
2806 TREE_SIDE_EFFECTS (ref)
2807 = (TREE_THIS_VOLATILE (ref) || TREE_SIDE_EFFECTS (pointer));
2811 else if (!(complain & tf_error))
2812 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2814 /* `pointer' won't be an error_mark_node if we were given a
2815 pointer to member, so it's cool to check for this here. */
2816 else if (TYPE_PTR_TO_MEMBER_P (type))
2817 switch (errorstring)
2819 case RO_ARRAY_INDEXING:
2820 error ("invalid use of array indexing on pointer to member");
2823 error ("invalid use of unary %<*%> on pointer to member");
2825 case RO_IMPLICIT_CONVERSION:
2826 error ("invalid use of implicit conversion on pointer to member");
2831 else if (pointer != error_mark_node)
2832 switch (errorstring)
2835 error ("invalid type argument");
2837 case RO_ARRAY_INDEXING:
2838 error ("invalid type argument of array indexing");
2841 error ("invalid type argument of unary %<*%>");
2843 case RO_IMPLICIT_CONVERSION:
2844 error ("invalid type argument of implicit conversion");
2849 return error_mark_node;
2852 /* This handles expressions of the form "a[i]", which denotes
2855 This is logically equivalent in C to *(a+i), but we may do it differently.
2856 If A is a variable or a member, we generate a primitive ARRAY_REF.
2857 This avoids forcing the array out of registers, and can work on
2858 arrays that are not lvalues (for example, members of structures returned
2861 If INDEX is of some user-defined type, it must be converted to
2862 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2863 will inherit the type of the array, which will be some pointer type.
2865 LOC is the location to use in building the array reference. */
2868 cp_build_array_ref (location_t loc, tree array, tree idx,
2869 tsubst_flags_t complain)
2875 if (complain & tf_error)
2876 error_at (loc, "subscript missing in array reference");
2877 return error_mark_node;
2880 if (TREE_TYPE (array) == error_mark_node
2881 || TREE_TYPE (idx) == error_mark_node)
2882 return error_mark_node;
2884 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2886 switch (TREE_CODE (array))
2890 tree value = cp_build_array_ref (loc, TREE_OPERAND (array, 1), idx,
2892 ret = build2 (COMPOUND_EXPR, TREE_TYPE (value),
2893 TREE_OPERAND (array, 0), value);
2894 SET_EXPR_LOCATION (ret, loc);
2899 ret = build_conditional_expr
2900 (TREE_OPERAND (array, 0),
2901 cp_build_array_ref (loc, TREE_OPERAND (array, 1), idx,
2903 cp_build_array_ref (loc, TREE_OPERAND (array, 2), idx,
2905 tf_warning_or_error);
2906 protected_set_expr_location (ret, loc);
2913 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
2917 warn_array_subscript_with_type_char (idx);
2919 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx)))
2921 if (complain & tf_error)
2922 error_at (loc, "array subscript is not an integer");
2923 return error_mark_node;
2926 /* Apply integral promotions *after* noticing character types.
2927 (It is unclear why we do these promotions -- the standard
2928 does not say that we should. In fact, the natural thing would
2929 seem to be to convert IDX to ptrdiff_t; we're performing
2930 pointer arithmetic.) */
2931 idx = perform_integral_promotions (idx);
2933 /* An array that is indexed by a non-constant
2934 cannot be stored in a register; we must be able to do
2935 address arithmetic on its address.
2936 Likewise an array of elements of variable size. */
2937 if (TREE_CODE (idx) != INTEGER_CST
2938 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
2939 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array))))
2942 if (!cxx_mark_addressable (array))
2943 return error_mark_node;
2946 /* An array that is indexed by a constant value which is not within
2947 the array bounds cannot be stored in a register either; because we
2948 would get a crash in store_bit_field/extract_bit_field when trying
2949 to access a non-existent part of the register. */
2950 if (TREE_CODE (idx) == INTEGER_CST
2951 && TYPE_DOMAIN (TREE_TYPE (array))
2952 && ! int_fits_type_p (idx, TYPE_DOMAIN (TREE_TYPE (array))))
2954 if (!cxx_mark_addressable (array))
2955 return error_mark_node;
2958 if (!lvalue_p (array) && (complain & tf_error))
2959 pedwarn (loc, OPT_pedantic,
2960 "ISO C++ forbids subscripting non-lvalue array");
2962 /* Note in C++ it is valid to subscript a `register' array, since
2963 it is valid to take the address of something with that
2964 storage specification. */
2968 while (TREE_CODE (foo) == COMPONENT_REF)
2969 foo = TREE_OPERAND (foo, 0);
2970 if (TREE_CODE (foo) == VAR_DECL && DECL_REGISTER (foo)
2971 && (complain & tf_warning))
2972 warning_at (loc, OPT_Wextra,
2973 "subscripting array declared %<register%>");
2976 type = TREE_TYPE (TREE_TYPE (array));
2977 rval = build4 (ARRAY_REF, type, array, idx, NULL_TREE, NULL_TREE);
2978 /* Array ref is const/volatile if the array elements are
2979 or if the array is.. */
2980 TREE_READONLY (rval)
2981 |= (CP_TYPE_CONST_P (type) | TREE_READONLY (array));
2982 TREE_SIDE_EFFECTS (rval)
2983 |= (CP_TYPE_VOLATILE_P (type) | TREE_SIDE_EFFECTS (array));
2984 TREE_THIS_VOLATILE (rval)
2985 |= (CP_TYPE_VOLATILE_P (type) | TREE_THIS_VOLATILE (array));
2986 ret = require_complete_type (fold_if_not_in_template (rval));
2987 protected_set_expr_location (ret, loc);
2992 tree ar = default_conversion (array);
2993 tree ind = default_conversion (idx);
2995 /* Put the integer in IND to simplify error checking. */
2996 if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
3003 if (ar == error_mark_node)
3006 if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE)
3008 if (complain & tf_error)
3009 error_at (loc, "subscripted value is neither array nor pointer");
3010 return error_mark_node;
3012 if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
3014 if (complain & tf_error)
3015 error_at (loc, "array subscript is not an integer");
3016 return error_mark_node;
3019 warn_array_subscript_with_type_char (idx);
3021 ret = cp_build_indirect_ref (cp_build_binary_op (input_location,
3026 protected_set_expr_location (ret, loc);
3031 /* Entry point for Obj-C++. */
3034 build_array_ref (location_t loc, tree array, tree idx)
3036 return cp_build_array_ref (loc, array, idx, tf_warning_or_error);
3039 /* Resolve a pointer to member function. INSTANCE is the object
3040 instance to use, if the member points to a virtual member.
3042 This used to avoid checking for virtual functions if basetype
3043 has no virtual functions, according to an earlier ANSI draft.
3044 With the final ISO C++ rules, such an optimization is
3045 incorrect: A pointer to a derived member can be static_cast
3046 to pointer-to-base-member, as long as the dynamic object
3047 later has the right member. */
3050 get_member_function_from_ptrfunc (tree *instance_ptrptr, tree function)
3052 if (TREE_CODE (function) == OFFSET_REF)
3053 function = TREE_OPERAND (function, 1);
3055 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function)))
3057 tree idx, delta, e1, e2, e3, vtbl, basetype;
3058 tree fntype = TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function));
3060 tree instance_ptr = *instance_ptrptr;
3061 tree instance_save_expr = 0;
3062 if (instance_ptr == error_mark_node)
3064 if (TREE_CODE (function) == PTRMEM_CST)
3066 /* Extracting the function address from a pmf is only
3067 allowed with -Wno-pmf-conversions. It only works for
3069 e1 = build_addr_func (PTRMEM_CST_MEMBER (function));
3070 e1 = convert (fntype, e1);
3075 error ("object missing in use of %qE", function);
3076 return error_mark_node;
3080 if (TREE_SIDE_EFFECTS (instance_ptr))
3081 instance_ptr = instance_save_expr = save_expr (instance_ptr);
3083 if (TREE_SIDE_EFFECTS (function))
3084 function = save_expr (function);
3086 /* Start by extracting all the information from the PMF itself. */
3087 e3 = pfn_from_ptrmemfunc (function);
3088 delta = delta_from_ptrmemfunc (function);
3089 idx = build1 (NOP_EXPR, vtable_index_type, e3);
3090 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
3092 case ptrmemfunc_vbit_in_pfn:
3093 e1 = cp_build_binary_op (input_location,
3094 BIT_AND_EXPR, idx, integer_one_node,
3095 tf_warning_or_error);
3096 idx = cp_build_binary_op (input_location,
3097 MINUS_EXPR, idx, integer_one_node,
3098 tf_warning_or_error);
3101 case ptrmemfunc_vbit_in_delta:
3102 e1 = cp_build_binary_op (input_location,
3103 BIT_AND_EXPR, delta, integer_one_node,
3104 tf_warning_or_error);
3105 delta = cp_build_binary_op (input_location,
3106 RSHIFT_EXPR, delta, integer_one_node,
3107 tf_warning_or_error);
3114 /* Convert down to the right base before using the instance. A
3115 special case is that in a pointer to member of class C, C may
3116 be incomplete. In that case, the function will of course be
3117 a member of C, and no conversion is required. In fact,
3118 lookup_base will fail in that case, because incomplete
3119 classes do not have BINFOs. */
3120 basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (fntype));
3121 if (!same_type_ignoring_top_level_qualifiers_p
3122 (basetype, TREE_TYPE (TREE_TYPE (instance_ptr))))
3124 basetype = lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr)),
3125 basetype, ba_check, NULL);
3126 instance_ptr = build_base_path (PLUS_EXPR, instance_ptr, basetype,
3128 if (instance_ptr == error_mark_node)
3129 return error_mark_node;
3131 /* ...and then the delta in the PMF. */
3132 instance_ptr = build2 (POINTER_PLUS_EXPR, TREE_TYPE (instance_ptr),
3133 instance_ptr, fold_convert (sizetype, delta));
3135 /* Hand back the adjusted 'this' argument to our caller. */
3136 *instance_ptrptr = instance_ptr;
3138 /* Next extract the vtable pointer from the object. */
3139 vtbl = build1 (NOP_EXPR, build_pointer_type (vtbl_ptr_type_node),
3141 vtbl = cp_build_indirect_ref (vtbl, RO_NULL, tf_warning_or_error);
3142 /* If the object is not dynamic the access invokes undefined
3143 behavior. As it is not executed in this case silence the
3144 spurious warnings it may provoke. */
3145 TREE_NO_WARNING (vtbl) = 1;
3147 /* Finally, extract the function pointer from the vtable. */
3148 e2 = fold_build2_loc (input_location,
3149 POINTER_PLUS_EXPR, TREE_TYPE (vtbl), vtbl,
3150 fold_convert (sizetype, idx));
3151 e2 = cp_build_indirect_ref (e2, RO_NULL, tf_warning_or_error);
3152 TREE_CONSTANT (e2) = 1;
3154 /* When using function descriptors, the address of the
3155 vtable entry is treated as a function pointer. */
3156 if (TARGET_VTABLE_USES_DESCRIPTORS)
3157 e2 = build1 (NOP_EXPR, TREE_TYPE (e2),
3158 cp_build_unary_op (ADDR_EXPR, e2, /*noconvert=*/1,
3159 tf_warning_or_error));
3161 e2 = fold_convert (TREE_TYPE (e3), e2);
3162 e1 = build_conditional_expr (e1, e2, e3, tf_warning_or_error);
3164 /* Make sure this doesn't get evaluated first inside one of the
3165 branches of the COND_EXPR. */
3166 if (instance_save_expr)
3167 e1 = build2 (COMPOUND_EXPR, TREE_TYPE (e1),
3168 instance_save_expr, e1);
3175 /* Used by the C-common bits. */
3177 build_function_call (location_t loc ATTRIBUTE_UNUSED,
3178 tree function, tree params)
3180 return cp_build_function_call (function, params, tf_warning_or_error);
3183 /* Used by the C-common bits. */
3185 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED,
3186 tree function, VEC(tree,gc) *params,
3187 VEC(tree,gc) *origtypes ATTRIBUTE_UNUSED)
3189 VEC(tree,gc) *orig_params = params;
3190 tree ret = cp_build_function_call_vec (function, ¶ms,
3191 tf_warning_or_error);
3193 /* cp_build_function_call_vec can reallocate PARAMS by adding
3194 default arguments. That should never happen here. Verify
3196 gcc_assert (params == orig_params);
3201 /* Build a function call using a tree list of arguments. */
3204 cp_build_function_call (tree function, tree params, tsubst_flags_t complain)
3209 vec = make_tree_vector ();
3210 for (; params != NULL_TREE; params = TREE_CHAIN (params))
3211 VEC_safe_push (tree, gc, vec, TREE_VALUE (params));
3212 ret = cp_build_function_call_vec (function, &vec, complain);
3213 release_tree_vector (vec);
3217 /* Build a function call using a vector of arguments. PARAMS may be
3218 NULL if there are no parameters. This changes the contents of
3222 cp_build_function_call_vec (tree function, VEC(tree,gc) **params,
3223 tsubst_flags_t complain)
3225 tree fntype, fndecl;
3227 tree original = function;
3231 VEC(tree,gc) *allocated = NULL;
3234 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3235 expressions, like those used for ObjC messenger dispatches. */
3236 if (params != NULL && !VEC_empty (tree, *params))
3237 function = objc_rewrite_function_call (function,
3238 VEC_index (tree, *params, 0));
3240 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3241 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3242 if (TREE_CODE (function) == NOP_EXPR
3243 && TREE_TYPE (function) == TREE_TYPE (TREE_OPERAND (function, 0)))
3244 function = TREE_OPERAND (function, 0);
3246 if (TREE_CODE (function) == FUNCTION_DECL)
3248 mark_used (function);
3251 /* Convert anything with function type to a pointer-to-function. */
3252 if (DECL_MAIN_P (function) && (complain & tf_error))
3253 pedwarn (input_location, OPT_pedantic,
3254 "ISO C++ forbids calling %<::main%> from within program");
3256 function = build_addr_func (function);
3262 function = build_addr_func (function);
3265 if (function == error_mark_node)
3266 return error_mark_node;
3268 fntype = TREE_TYPE (function);
3270 if (TYPE_PTRMEMFUNC_P (fntype))
3272 if (complain & tf_error)
3273 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3274 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3275 original, original);
3276 return error_mark_node;
3279 is_method = (TREE_CODE (fntype) == POINTER_TYPE
3280 && TREE_CODE (TREE_TYPE (fntype)) == METHOD_TYPE);
3282 if (!((TREE_CODE (fntype) == POINTER_TYPE
3283 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE)
3285 || TREE_CODE (function) == TEMPLATE_ID_EXPR))
3287 if (complain & tf_error)
3288 error ("%qE cannot be used as a function", original);
3289 return error_mark_node;
3292 /* fntype now gets the type of function pointed to. */
3293 fntype = TREE_TYPE (fntype);
3294 parm_types = TYPE_ARG_TYPES (fntype);
3298 allocated = make_tree_vector ();
3299 params = &allocated;
3302 nargs = convert_arguments (parm_types, params, fndecl, LOOKUP_NORMAL,
3305 return error_mark_node;
3307 argarray = VEC_address (tree, *params);
3309 /* Check for errors in format strings and inappropriately
3311 check_function_arguments (TYPE_ATTRIBUTES (fntype), nargs, argarray,
3314 ret = build_cxx_call (function, nargs, argarray);
3316 if (allocated != NULL)
3317 release_tree_vector (allocated);
3322 /* Subroutine of convert_arguments.
3323 Warn about wrong number of args are genereted. */
3326 warn_args_num (location_t loc, tree fndecl, bool too_many_p)
3330 if (TREE_CODE (TREE_TYPE (fndecl)) == METHOD_TYPE)
3332 if (DECL_NAME (fndecl) == NULL_TREE
3333 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl)))
3336 ? G_("too many arguments to constructor %q#D")
3337 : G_("too few arguments to constructor %q#D"),
3342 ? G_("too many arguments to member function %q#D")
3343 : G_("too few arguments to member function %q#D"),
3349 ? G_("too many arguments to function %q#D")
3350 : G_("too few arguments to function %q#D"),
3352 inform (DECL_SOURCE_LOCATION (fndecl),
3356 error_at (loc, too_many_p ? G_("too many arguments to function")
3357 : G_("too few arguments to function"));
3360 /* Convert the actual parameter expressions in the list VALUES to the
3361 types in the list TYPELIST. The converted expressions are stored
3362 back in the VALUES vector.
3363 If parmdecls is exhausted, or when an element has NULL as its type,
3364 perform the default conversions.
3366 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3368 This is also where warnings about wrong number of args are generated.
3370 Returns the actual number of arguments processed (which might be less
3371 than the length of the vector), or -1 on error.
3373 In C++, unspecified trailing parameters can be filled in with their
3374 default arguments, if such were specified. Do so here. */
3377 convert_arguments (tree typelist, VEC(tree,gc) **values, tree fndecl,
3378 int flags, tsubst_flags_t complain)
3383 /* Argument passing is always copy-initialization. */
3384 flags |= LOOKUP_ONLYCONVERTING;
3386 for (i = 0, typetail = typelist;
3387 i < VEC_length (tree, *values);
3390 tree type = typetail ? TREE_VALUE (typetail) : 0;
3391 tree val = VEC_index (tree, *values, i);
3393 if (val == error_mark_node || type == error_mark_node)
3396 if (type == void_type_node)
3398 if (complain & tf_error)
3400 warn_args_num (input_location, fndecl, /*too_many_p=*/true);
3407 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3408 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3409 if (TREE_CODE (val) == NOP_EXPR
3410 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0))
3411 && (type == 0 || TREE_CODE (type) != REFERENCE_TYPE))
3412 val = TREE_OPERAND (val, 0);
3414 if (type == 0 || TREE_CODE (type) != REFERENCE_TYPE)
3416 if (TREE_CODE (TREE_TYPE (val)) == ARRAY_TYPE
3417 || TREE_CODE (TREE_TYPE (val)) == FUNCTION_TYPE
3418 || TREE_CODE (TREE_TYPE (val)) == METHOD_TYPE)
3419 val = decay_conversion (val);
3422 if (val == error_mark_node)
3427 /* Formal parm type is specified by a function prototype. */
3430 if (!COMPLETE_TYPE_P (complete_type (type)))
3432 if (complain & tf_error)
3435 error ("parameter %P of %qD has incomplete type %qT",
3438 error ("parameter %P has incomplete type %qT", i, type);
3440 parmval = error_mark_node;
3444 parmval = convert_for_initialization
3445 (NULL_TREE, type, val, flags,
3446 "argument passing", fndecl, i, complain);
3447 parmval = convert_for_arg_passing (type, parmval);
3450 if (parmval == error_mark_node)
3453 VEC_replace (tree, *values, i, parmval);
3457 if (fndecl && DECL_BUILT_IN (fndecl)
3458 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CONSTANT_P)
3459 /* Don't do ellipsis conversion for __built_in_constant_p
3460 as this will result in spurious errors for non-trivial
3462 val = require_complete_type (val);
3464 val = convert_arg_to_ellipsis (val);
3466 VEC_replace (tree, *values, i, val);
3470 typetail = TREE_CHAIN (typetail);
3473 if (typetail != 0 && typetail != void_list_node)
3475 /* See if there are default arguments that can be used. Because
3476 we hold default arguments in the FUNCTION_TYPE (which is so
3477 wrong), we can see default parameters here from deduced
3478 contexts (and via typeof) for indirect function calls.
3479 Fortunately we know whether we have a function decl to
3480 provide default arguments in a language conformant
3482 if (fndecl && TREE_PURPOSE (typetail)
3483 && TREE_CODE (TREE_PURPOSE (typetail)) != DEFAULT_ARG)
3485 for (; typetail != void_list_node; ++i)
3488 = convert_default_arg (TREE_VALUE (typetail),
3489 TREE_PURPOSE (typetail),
3492 if (parmval == error_mark_node)
3495 VEC_safe_push (tree, gc, *values, parmval);
3496 typetail = TREE_CHAIN (typetail);
3497 /* ends with `...'. */
3498 if (typetail == NULL_TREE)
3504 if (complain & tf_error)
3505 warn_args_num (input_location, fndecl, /*too_many_p=*/false);
3513 /* Build a binary-operation expression, after performing default
3514 conversions on the operands. CODE is the kind of expression to
3515 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3516 are the tree codes which correspond to ARG1 and ARG2 when issuing
3517 warnings about possibly misplaced parentheses. They may differ
3518 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3519 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3520 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3521 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3522 ARG2_CODE as ERROR_MARK. */
3525 build_x_binary_op (enum tree_code code, tree arg1, enum tree_code arg1_code,
3526 tree arg2, enum tree_code arg2_code, bool *overloaded_p,
3527 tsubst_flags_t complain)
3536 if (processing_template_decl)
3538 if (type_dependent_expression_p (arg1)
3539 || type_dependent_expression_p (arg2))
3540 return build_min_nt (code, arg1, arg2);
3541 arg1 = build_non_dependent_expr (arg1);
3542 arg2 = build_non_dependent_expr (arg2);
3545 if (code == DOTSTAR_EXPR)
3546 expr = build_m_component_ref (arg1, arg2);
3548 expr = build_new_op (code, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
3549 overloaded_p, complain);
3551 /* Check for cases such as x+y<<z which users are likely to
3552 misinterpret. But don't warn about obj << x + y, since that is a
3553 common idiom for I/O. */
3554 if (warn_parentheses
3555 && (complain & tf_warning)
3556 && !processing_template_decl
3557 && !error_operand_p (arg1)
3558 && !error_operand_p (arg2)
3559 && (code != LSHIFT_EXPR
3560 || !CLASS_TYPE_P (TREE_TYPE (arg1))))
3561 warn_about_parentheses (code, arg1_code, orig_arg1, arg2_code, orig_arg2);
3563 if (processing_template_decl && expr != error_mark_node)
3564 return build_min_non_dep (code, expr, orig_arg1, orig_arg2);
3569 /* Build and return an ARRAY_REF expression. */
3572 build_x_array_ref (tree arg1, tree arg2, tsubst_flags_t complain)
3574 tree orig_arg1 = arg1;
3575 tree orig_arg2 = arg2;
3578 if (processing_template_decl)
3580 if (type_dependent_expression_p (arg1)
3581 || type_dependent_expression_p (arg2))
3582 return build_min_nt (ARRAY_REF, arg1, arg2,
3583 NULL_TREE, NULL_TREE);
3584 arg1 = build_non_dependent_expr (arg1);
3585 arg2 = build_non_dependent_expr (arg2);
3588 expr = build_new_op (ARRAY_REF, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
3589 /*overloaded_p=*/NULL, complain);
3591 if (processing_template_decl && expr != error_mark_node)
3592 return build_min_non_dep (ARRAY_REF, expr, orig_arg1, orig_arg2,
3593 NULL_TREE, NULL_TREE);
3597 /* For the c-common bits. */
3599 build_binary_op (location_t location, enum tree_code code, tree op0, tree op1,
3600 int convert_p ATTRIBUTE_UNUSED)
3602 return cp_build_binary_op (location, code, op0, op1, tf_warning_or_error);
3606 /* Build a binary-operation expression without default conversions.
3607 CODE is the kind of expression to build.
3608 LOCATION is the location_t of the operator in the source code.
3609 This function differs from `build' in several ways:
3610 the data type of the result is computed and recorded in it,
3611 warnings are generated if arg data types are invalid,
3612 special handling for addition and subtraction of pointers is known,
3613 and some optimization is done (operations on narrow ints
3614 are done in the narrower type when that gives the same result).
3615 Constant folding is also done before the result is returned.
3617 Note that the operands will never have enumeral types
3618 because either they have just had the default conversions performed
3619 or they have both just been converted to some other type in which
3620 the arithmetic is to be done.
3622 C++: must do special pointer arithmetic when implementing
3623 multiple inheritance, and deal with pointer to member functions. */
3626 cp_build_binary_op (location_t location,
3627 enum tree_code code, tree orig_op0, tree orig_op1,
3628 tsubst_flags_t complain)
3631 enum tree_code code0, code1;
3633 const char *invalid_op_diag;
3635 /* Expression code to give to the expression when it is built.
3636 Normally this is CODE, which is what the caller asked for,
3637 but in some special cases we change it. */
3638 enum tree_code resultcode = code;
3640 /* Data type in which the computation is to be performed.
3641 In the simplest cases this is the common type of the arguments. */
3642 tree result_type = NULL;
3644 /* Nonzero means operands have already been type-converted
3645 in whatever way is necessary.
3646 Zero means they need to be converted to RESULT_TYPE. */
3649 /* Nonzero means create the expression with this type, rather than
3651 tree build_type = 0;
3653 /* Nonzero means after finally constructing the expression
3654 convert it to this type. */
3655 tree final_type = 0;
3659 /* Nonzero if this is an operation like MIN or MAX which can
3660 safely be computed in short if both args are promoted shorts.
3661 Also implies COMMON.
3662 -1 indicates a bitwise operation; this makes a difference
3663 in the exact conditions for when it is safe to do the operation
3664 in a narrower mode. */
3667 /* Nonzero if this is a comparison operation;
3668 if both args are promoted shorts, compare the original shorts.
3669 Also implies COMMON. */
3670 int short_compare = 0;
3672 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3675 /* True if both operands have arithmetic type. */
3676 bool arithmetic_types_p;
3678 /* Apply default conversions. */
3682 if (code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
3683 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
3684 || code == TRUTH_XOR_EXPR)
3686 if (!really_overloaded_fn (op0))
3687 op0 = decay_conversion (op0);
3688 if (!really_overloaded_fn (op1))
3689 op1 = decay_conversion (op1);
3693 if (!really_overloaded_fn (op0))
3694 op0 = default_conversion (op0);
3695 if (!really_overloaded_fn (op1))
3696 op1 = default_conversion (op1);
3699 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3700 STRIP_TYPE_NOPS (op0);
3701 STRIP_TYPE_NOPS (op1);
3703 /* DTRT if one side is an overloaded function, but complain about it. */
3704 if (type_unknown_p (op0))
3706 tree t = instantiate_type (TREE_TYPE (op1), op0, tf_none);
3707 if (t != error_mark_node)
3709 if (complain & tf_error)
3710 permerror (input_location, "assuming cast to type %qT from overloaded function",
3715 if (type_unknown_p (op1))
3717 tree t = instantiate_type (TREE_TYPE (op0), op1, tf_none);
3718 if (t != error_mark_node)
3720 if (complain & tf_error)
3721 permerror (input_location, "assuming cast to type %qT from overloaded function",
3727 type0 = TREE_TYPE (op0);
3728 type1 = TREE_TYPE (op1);
3730 /* The expression codes of the data types of the arguments tell us
3731 whether the arguments are integers, floating, pointers, etc. */
3732 code0 = TREE_CODE (type0);
3733 code1 = TREE_CODE (type1);
3735 /* If an error was already reported for one of the arguments,
3736 avoid reporting another error. */
3737 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
3738 return error_mark_node;
3740 if ((invalid_op_diag
3741 = targetm.invalid_binary_op (code, type0, type1)))
3743 error (invalid_op_diag);
3744 return error_mark_node;
3747 /* Issue warnings about peculiar, but valid, uses of NULL. */
3748 if ((orig_op0 == null_node || orig_op1 == null_node)
3749 /* It's reasonable to use pointer values as operands of &&
3750 and ||, so NULL is no exception. */
3751 && code != TRUTH_ANDIF_EXPR && code != TRUTH_ORIF_EXPR
3752 && ( /* Both are NULL (or 0) and the operation was not a
3753 comparison or a pointer subtraction. */
3754 (null_ptr_cst_p (orig_op0) && null_ptr_cst_p (orig_op1)
3755 && code != EQ_EXPR && code != NE_EXPR && code != MINUS_EXPR)
3756 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3757 || (!null_ptr_cst_p (orig_op0)
3758 && !TYPE_PTR_P (type0) && !TYPE_PTR_TO_MEMBER_P (type0))
3759 || (!null_ptr_cst_p (orig_op1)
3760 && !TYPE_PTR_P (type1) && !TYPE_PTR_TO_MEMBER_P (type1)))
3761 && (complain & tf_warning))
3762 /* Some sort of arithmetic operation involving NULL was
3764 warning (OPT_Wpointer_arith, "NULL used in arithmetic");
3769 /* Subtraction of two similar pointers.
3770 We must subtract them as integers, then divide by object size. */
3771 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
3772 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0),
3774 return pointer_diff (op0, op1, common_pointer_type (type0, type1));
3775 /* In all other cases except pointer - int, the usual arithmetic
3777 else if (!(code0 == POINTER_TYPE && code1 == INTEGER_TYPE))
3782 /* The pointer - int case is just like pointer + int; fall
3785 if ((code0 == POINTER_TYPE || code1 == POINTER_TYPE)
3786 && (code0 == INTEGER_TYPE || code1 == INTEGER_TYPE))
3790 ptr_operand = ((code0 == POINTER_TYPE) ? op0 : op1);
3791 int_operand = ((code0 == INTEGER_TYPE) ? op0 : op1);
3792 if (processing_template_decl)
3794 result_type = TREE_TYPE (ptr_operand);
3797 return cp_pointer_int_sum (code,
3808 case TRUNC_DIV_EXPR:
3810 case FLOOR_DIV_EXPR:
3811 case ROUND_DIV_EXPR:
3812 case EXACT_DIV_EXPR:
3813 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
3814 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
3815 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3816 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
3818 enum tree_code tcode0 = code0, tcode1 = code1;
3820 warn_for_div_by_zero (location, op1);
3822 if (tcode0 == COMPLEX_TYPE || tcode0 == VECTOR_TYPE)
3823 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
3824 if (tcode1 == COMPLEX_TYPE || tcode1 == VECTOR_TYPE)
3825 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
3827 if (!(tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE))
3828 resultcode = RDIV_EXPR;
3830 /* When dividing two signed integers, we have to promote to int.
3831 unless we divide by a constant != -1. Note that default
3832 conversion will have been performed on the operands at this
3833 point, so we have to dig out the original type to find out if
3835 shorten = ((TREE_CODE (op0) == NOP_EXPR
3836 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3837 || (TREE_CODE (op1) == INTEGER_CST
3838 && ! integer_all_onesp (op1)));
3847 if ((code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3848 || (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
3849 && !VECTOR_FLOAT_TYPE_P (type0)
3850 && !VECTOR_FLOAT_TYPE_P (type1)))
3854 case TRUNC_MOD_EXPR:
3855 case FLOOR_MOD_EXPR:
3856 warn_for_div_by_zero (location, op1);
3858 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
3859 && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE
3860 && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE)
3862 else if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3864 /* Although it would be tempting to shorten always here, that loses
3865 on some targets, since the modulo instruction is undefined if the
3866 quotient can't be represented in the computation mode. We shorten
3867 only if unsigned or if dividing by something we know != -1. */
3868 shorten = ((TREE_CODE (op0) == NOP_EXPR
3869 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3870 || (TREE_CODE (op1) == INTEGER_CST
3871 && ! integer_all_onesp (op1)));
3876 case TRUTH_ANDIF_EXPR:
3877 case TRUTH_ORIF_EXPR:
3878 case TRUTH_AND_EXPR:
3880 result_type = boolean_type_node;
3883 /* Shift operations: result has same type as first operand;
3884 always convert second operand to int.
3885 Also set SHORT_SHIFT if shifting rightward. */
3888 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3890 result_type = type0;
3891 if (TREE_CODE (op1) == INTEGER_CST)
3893 if (tree_int_cst_lt (op1, integer_zero_node))
3895 if ((complain & tf_warning)
3896 && c_inhibit_evaluation_warnings == 0)
3897 warning (0, "right shift count is negative");
3901 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0
3902 && (complain & tf_warning)
3903 && c_inhibit_evaluation_warnings == 0)
3904 warning (0, "right shift count >= width of type");
3907 /* Convert the shift-count to an integer, regardless of
3908 size of value being shifted. */
3909 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3910 op1 = cp_convert (integer_type_node, op1);
3911 /* Avoid converting op1 to result_type later. */
3917 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3919 result_type = type0;
3920 if (TREE_CODE (op1) == INTEGER_CST)
3922 if (tree_int_cst_lt (op1, integer_zero_node))
3924 if ((complain & tf_warning)
3925 && c_inhibit_evaluation_warnings == 0)
3926 warning (0, "left shift count is negative");
3928 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3930 if ((complain & tf_warning)
3931 && c_inhibit_evaluation_warnings == 0)
3932 warning (0, "left shift count >= width of type");
3935 /* Convert the shift-count to an integer, regardless of
3936 size of value being shifted. */
3937 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3938 op1 = cp_convert (integer_type_node, op1);
3939 /* Avoid converting op1 to result_type later. */
3946 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3948 result_type = type0;
3949 if (TREE_CODE (op1) == INTEGER_CST)
3951 if (tree_int_cst_lt (op1, integer_zero_node))
3953 if (complain & tf_warning)
3954 warning (0, (code == LROTATE_EXPR)
3955 ? G_("left rotate count is negative")
3956 : G_("right rotate count is negative"));
3958 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3960 if (complain & tf_warning)
3961 warning (0, (code == LROTATE_EXPR)
3962 ? G_("left rotate count >= width of type")
3963 : G_("right rotate count >= width of type"));
3966 /* Convert the shift-count to an integer, regardless of
3967 size of value being shifted. */
3968 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3969 op1 = cp_convert (integer_type_node, op1);
3975 if ((complain & tf_warning)
3976 && (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1)))
3977 warning (OPT_Wfloat_equal,
3978 "comparing floating point with == or != is unsafe");
3979 if ((complain & tf_warning)
3980 && ((TREE_CODE (orig_op0) == STRING_CST && !integer_zerop (op1))
3981 || (TREE_CODE (orig_op1) == STRING_CST && !integer_zerop (op0))))
3982 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
3984 build_type = boolean_type_node;
3985 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
3986 || code0 == COMPLEX_TYPE || code0 == ENUMERAL_TYPE)
3987 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3988 || code1 == COMPLEX_TYPE || code1 == ENUMERAL_TYPE))
3990 else if ((code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3991 || (TYPE_PTRMEM_P (type0) && TYPE_PTRMEM_P (type1)))
3992 result_type = composite_pointer_type (type0, type1, op0, op1,
3993 CPO_COMPARISON, complain);
3994 else if ((code0 == POINTER_TYPE || TYPE_PTRMEM_P (type0))
3995 && null_ptr_cst_p (op1))
3997 if (TREE_CODE (op0) == ADDR_EXPR
3998 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
4000 if (complain & tf_warning)
4001 warning (OPT_Waddress, "the address of %qD will never be NULL",
4002 TREE_OPERAND (op0, 0));
4004 result_type = type0;
4006 else if ((code1 == POINTER_TYPE || TYPE_PTRMEM_P (type1))
4007 && null_ptr_cst_p (op0))
4009 if (TREE_CODE (op1) == ADDR_EXPR
4010 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
4012 if (complain & tf_warning)
4013 warning (OPT_Waddress, "the address of %qD will never be NULL",
4014 TREE_OPERAND (op1, 0));
4016 result_type = type1;
4018 else if (null_ptr_cst_p (op0) && null_ptr_cst_p (op1))
4019 /* One of the operands must be of nullptr_t type. */
4020 result_type = TREE_TYPE (nullptr_node);
4021 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
4023 result_type = type0;
4024 if (complain & tf_error)
4025 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4027 return error_mark_node;
4029 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
4031 result_type = type1;
4032 if (complain & tf_error)
4033 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4035 return error_mark_node;
4037 else if (TYPE_PTRMEMFUNC_P (type0) && null_ptr_cst_p (op1))
4039 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4040 == ptrmemfunc_vbit_in_delta)
4042 tree pfn0 = pfn_from_ptrmemfunc (op0);
4043 tree delta0 = delta_from_ptrmemfunc (op0);
4044 tree e1 = cp_build_binary_op (location,
4047 fold_convert (TREE_TYPE (pfn0),
4050 tree e2 = cp_build_binary_op (location,
4055 e2 = cp_build_binary_op (location,
4056 EQ_EXPR, e2, integer_zero_node,
4058 op0 = cp_build_binary_op (location,
4059 TRUTH_ANDIF_EXPR, e1, e2,
4061 op1 = cp_convert (TREE_TYPE (op0), integer_one_node);
4065 op0 = build_ptrmemfunc_access_expr (op0, pfn_identifier);
4066 op1 = cp_convert (TREE_TYPE (op0), integer_zero_node);
4068 result_type = TREE_TYPE (op0);
4070 else if (TYPE_PTRMEMFUNC_P (type1) && null_ptr_cst_p (op0))
4071 return cp_build_binary_op (location, code, op1, op0, complain);
4072 else if (TYPE_PTRMEMFUNC_P (type0) && TYPE_PTRMEMFUNC_P (type1))
4075 /* E will be the final comparison. */
4077 /* E1 and E2 are for scratch. */
4085 type = composite_pointer_type (type0, type1, op0, op1,
4086 CPO_COMPARISON, complain);
4088 if (!same_type_p (TREE_TYPE (op0), type))
4089 op0 = cp_convert_and_check (type, op0);
4090 if (!same_type_p (TREE_TYPE (op1), type))
4091 op1 = cp_convert_and_check (type, op1);
4093 if (op0 == error_mark_node || op1 == error_mark_node)
4094 return error_mark_node;
4096 if (TREE_SIDE_EFFECTS (op0))
4097 op0 = save_expr (op0);
4098 if (TREE_SIDE_EFFECTS (op1))
4099 op1 = save_expr (op1);
4101 pfn0 = pfn_from_ptrmemfunc (op0);
4102 pfn1 = pfn_from_ptrmemfunc (op1);
4103 delta0 = delta_from_ptrmemfunc (op0);
4104 delta1 = delta_from_ptrmemfunc (op1);
4105 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4106 == ptrmemfunc_vbit_in_delta)
4111 && ((op0.delta == op1.delta)
4112 || (!op0.pfn && op0.delta & 1 == 0
4113 && op1.delta & 1 == 0))
4115 The reason for the `!op0.pfn' bit is that a NULL
4116 pointer-to-member is any member with a zero PFN and
4117 LSB of the DELTA field is 0. */
4119 e1 = cp_build_binary_op (location, BIT_AND_EXPR,
4123 e1 = cp_build_binary_op (location,
4124 EQ_EXPR, e1, integer_zero_node,
4126 e2 = cp_build_binary_op (location, BIT_AND_EXPR,
4130 e2 = cp_build_binary_op (location,
4131 EQ_EXPR, e2, integer_zero_node,
4133 e1 = cp_build_binary_op (location,
4134 TRUTH_ANDIF_EXPR, e2, e1,
4136 e2 = cp_build_binary_op (location, EQ_EXPR,
4138 fold_convert (TREE_TYPE (pfn0),
4141 e2 = cp_build_binary_op (location,
4142 TRUTH_ANDIF_EXPR, e2, e1, complain);
4143 e1 = cp_build_binary_op (location,
4144 EQ_EXPR, delta0, delta1, complain);
4145 e1 = cp_build_binary_op (location,
4146 TRUTH_ORIF_EXPR, e1, e2, complain);
4153 && (!op0.pfn || op0.delta == op1.delta))
4155 The reason for the `!op0.pfn' bit is that a NULL
4156 pointer-to-member is any member with a zero PFN; the
4157 DELTA field is unspecified. */
4159 e1 = cp_build_binary_op (location,
4160 EQ_EXPR, delta0, delta1, complain);
4161 e2 = cp_build_binary_op (location,
4164 fold_convert (TREE_TYPE (pfn0),
4167 e1 = cp_build_binary_op (location,
4168 TRUTH_ORIF_EXPR, e1, e2, complain);
4170 e2 = build2 (EQ_EXPR, boolean_type_node, pfn0, pfn1);
4171 e = cp_build_binary_op (location,
4172 TRUTH_ANDIF_EXPR, e2, e1, complain);
4173 if (code == EQ_EXPR)
4175 return cp_build_binary_op (location,
4176 EQ_EXPR, e, integer_zero_node, complain);
4180 gcc_assert (!TYPE_PTRMEMFUNC_P (type0)
4181 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0),
4183 gcc_assert (!TYPE_PTRMEMFUNC_P (type1)
4184 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1),
4192 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
4193 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
4195 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
4196 result_type = composite_pointer_type (type0, type1, op0, op1,
4197 CPO_COMPARISON, complain);
4204 if (TREE_CODE (orig_op0) == STRING_CST
4205 || TREE_CODE (orig_op1) == STRING_CST)
4207 if (complain & tf_warning)
4208 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
4211 build_type = boolean_type_node;
4212 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
4213 || code0 == ENUMERAL_TYPE)
4214 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4215 || code1 == ENUMERAL_TYPE))
4217 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
4218 result_type = composite_pointer_type (type0, type1, op0, op1,
4219 CPO_COMPARISON, complain);
4220 else if (code0 == POINTER_TYPE && null_ptr_cst_p (op1))
4221 result_type = type0;
4222 else if (code1 == POINTER_TYPE && null_ptr_cst_p (op0))
4223 result_type = type1;
4224 else if (null_ptr_cst_p (op0) && null_ptr_cst_p (op1))
4225 /* One of the operands must be of nullptr_t type. */
4226 result_type = TREE_TYPE (nullptr_node);
4227 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
4229 result_type = type0;
4230 if (complain & tf_error)
4231 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4233 return error_mark_node;
4235 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
4237 result_type = type1;
4238 if (complain & tf_error)
4239 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4241 return error_mark_node;
4245 case UNORDERED_EXPR:
4252 build_type = integer_type_node;
4253 if (code0 != REAL_TYPE || code1 != REAL_TYPE)
4255 if (complain & tf_error)
4256 error ("unordered comparison on non-floating point argument");
4257 return error_mark_node;
4266 if (((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
4267 || code0 == ENUMERAL_TYPE)
4268 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4269 || code1 == COMPLEX_TYPE || code1 == ENUMERAL_TYPE)))
4270 arithmetic_types_p = 1;
4273 arithmetic_types_p = 0;
4274 /* Vector arithmetic is only allowed when both sides are vectors. */
4275 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
4277 if (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
4278 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
4281 binary_op_error (location, code, type0, type1);
4282 return error_mark_node;
4284 arithmetic_types_p = 1;
4287 /* Determine the RESULT_TYPE, if it is not already known. */
4289 && arithmetic_types_p
4290 && (shorten || common || short_compare))
4291 result_type = cp_common_type (type0, type1);
4295 if (complain & tf_error)
4296 error ("invalid operands of types %qT and %qT to binary %qO",
4297 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1), code);
4298 return error_mark_node;
4301 /* If we're in a template, the only thing we need to know is the
4303 if (processing_template_decl)
4305 /* Since the middle-end checks the type when doing a build2, we
4306 need to build the tree in pieces. This built tree will never
4307 get out of the front-end as we replace it when instantiating
4309 tree tmp = build2 (resultcode,
4310 build_type ? build_type : result_type,
4312 TREE_OPERAND (tmp, 0) = op0;
4316 if (arithmetic_types_p)
4318 bool first_complex = (code0 == COMPLEX_TYPE);
4319 bool second_complex = (code1 == COMPLEX_TYPE);
4320 int none_complex = (!first_complex && !second_complex);
4322 /* Adapted from patch for c/24581. */
4323 if (first_complex != second_complex
4324 && (code == PLUS_EXPR
4325 || code == MINUS_EXPR
4326 || code == MULT_EXPR
4327 || (code == TRUNC_DIV_EXPR && first_complex))
4328 && TREE_CODE (TREE_TYPE (result_type)) == REAL_TYPE
4329 && flag_signed_zeros)
4331 /* An operation on mixed real/complex operands must be
4332 handled specially, but the language-independent code can
4333 more easily optimize the plain complex arithmetic if
4334 -fno-signed-zeros. */
4335 tree real_type = TREE_TYPE (result_type);
4339 if (TREE_TYPE (op0) != result_type)
4340 op0 = cp_convert_and_check (result_type, op0);
4341 if (TREE_TYPE (op1) != real_type)
4342 op1 = cp_convert_and_check (real_type, op1);
4346 if (TREE_TYPE (op0) != real_type)
4347 op0 = cp_convert_and_check (real_type, op0);
4348 if (TREE_TYPE (op1) != result_type)
4349 op1 = cp_convert_and_check (result_type, op1);
4351 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
4352 return error_mark_node;
4355 op0 = save_expr (op0);
4356 real = cp_build_unary_op (REALPART_EXPR, op0, 1, complain);
4357 imag = cp_build_unary_op (IMAGPART_EXPR, op0, 1, complain);
4361 case TRUNC_DIV_EXPR:
4362 imag = build2 (resultcode, real_type, imag, op1);
4366 real = build2 (resultcode, real_type, real, op1);
4374 op1 = save_expr (op1);
4375 real = cp_build_unary_op (REALPART_EXPR, op1, 1, complain);
4376 imag = cp_build_unary_op (IMAGPART_EXPR, op1, 1, complain);
4380 imag = build2 (resultcode, real_type, op0, imag);
4383 real = build2 (resultcode, real_type, op0, real);
4386 real = build2 (resultcode, real_type, op0, real);
4387 imag = build1 (NEGATE_EXPR, real_type, imag);
4393 return build2 (COMPLEX_EXPR, result_type, real, imag);
4396 /* For certain operations (which identify themselves by shorten != 0)
4397 if both args were extended from the same smaller type,
4398 do the arithmetic in that type and then extend.
4400 shorten !=0 and !=1 indicates a bitwise operation.
4401 For them, this optimization is safe only if
4402 both args are zero-extended or both are sign-extended.
4403 Otherwise, we might change the result.
4404 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4405 but calculated in (unsigned short) it would be (unsigned short)-1. */
4407 if (shorten && none_complex)
4409 final_type = result_type;
4410 result_type = shorten_binary_op (result_type, op0, op1,
4414 /* Comparison operations are shortened too but differently.
4415 They identify themselves by setting short_compare = 1. */
4419 /* Don't write &op0, etc., because that would prevent op0
4420 from being kept in a register.
4421 Instead, make copies of the our local variables and
4422 pass the copies by reference, then copy them back afterward. */
4423 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
4424 enum tree_code xresultcode = resultcode;
4426 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
4428 return cp_convert (boolean_type_node, val);
4429 op0 = xop0, op1 = xop1;
4431 resultcode = xresultcode;
4434 if ((short_compare || code == MIN_EXPR || code == MAX_EXPR)
4435 && warn_sign_compare
4436 && !TREE_NO_WARNING (orig_op0)
4437 && !TREE_NO_WARNING (orig_op1)
4438 /* Do not warn until the template is instantiated; we cannot
4439 bound the ranges of the arguments until that point. */
4440 && !processing_template_decl
4441 && (complain & tf_warning)
4442 && c_inhibit_evaluation_warnings == 0)
4444 warn_for_sign_compare (location, orig_op0, orig_op1, op0, op1,
4445 result_type, resultcode);
4449 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4450 Then the expression will be built.
4451 It will be given type FINAL_TYPE if that is nonzero;
4452 otherwise, it will be given type RESULT_TYPE. */
4455 if (TREE_TYPE (op0) != result_type)
4456 op0 = cp_convert_and_check (result_type, op0);
4457 if (TREE_TYPE (op1) != result_type)
4458 op1 = cp_convert_and_check (result_type, op1);
4460 if (op0 == error_mark_node || op1 == error_mark_node)
4461 return error_mark_node;
4464 if (build_type == NULL_TREE)
4465 build_type = result_type;
4467 result = build2 (resultcode, build_type, op0, op1);
4468 result = fold_if_not_in_template (result);
4469 if (final_type != 0)
4470 result = cp_convert (final_type, result);
4472 if (TREE_OVERFLOW_P (result)
4473 && !TREE_OVERFLOW_P (op0)
4474 && !TREE_OVERFLOW_P (op1))
4475 overflow_warning (location, result);
4480 /* Return a tree for the sum or difference (RESULTCODE says which)
4481 of pointer PTROP and integer INTOP. */
4484 cp_pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
4486 tree res_type = TREE_TYPE (ptrop);
4488 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4489 in certain circumstance (when it's valid to do so). So we need
4490 to make sure it's complete. We don't need to check here, if we
4491 can actually complete it at all, as those checks will be done in
4492 pointer_int_sum() anyway. */
4493 complete_type (TREE_TYPE (res_type));
4495 return pointer_int_sum (input_location, resultcode, ptrop,
4496 fold_if_not_in_template (intop));
4499 /* Return a tree for the difference of pointers OP0 and OP1.
4500 The resulting tree has type int. */
4503 pointer_diff (tree op0, tree op1, tree ptrtype)
4506 tree restype = ptrdiff_type_node;
4507 tree target_type = TREE_TYPE (ptrtype);
4509 if (!complete_type_or_else (target_type, NULL_TREE))
4510 return error_mark_node;
4512 if (TREE_CODE (target_type) == VOID_TYPE)
4513 permerror (input_location, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4514 if (TREE_CODE (target_type) == FUNCTION_TYPE)
4515 permerror (input_location, "ISO C++ forbids using pointer to a function in subtraction");
4516 if (TREE_CODE (target_type) == METHOD_TYPE)
4517 permerror (input_location, "ISO C++ forbids using pointer to a method in subtraction");
4519 /* First do the subtraction as integers;
4520 then drop through to build the divide operator. */
4522 op0 = cp_build_binary_op (input_location,
4524 cp_convert (restype, op0),
4525 cp_convert (restype, op1),
4526 tf_warning_or_error);
4528 /* This generates an error if op1 is a pointer to an incomplete type. */
4529 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1))))
4530 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4532 op1 = (TYPE_PTROB_P (ptrtype)
4533 ? size_in_bytes (target_type)
4534 : integer_one_node);
4536 /* Do the division. */
4538 result = build2 (EXACT_DIV_EXPR, restype, op0, cp_convert (restype, op1));
4539 return fold_if_not_in_template (result);
4542 /* Construct and perhaps optimize a tree representation
4543 for a unary operation. CODE, a tree_code, specifies the operation
4544 and XARG is the operand. */
4547 build_x_unary_op (enum tree_code code, tree xarg, tsubst_flags_t complain)
4549 tree orig_expr = xarg;
4553 if (processing_template_decl)
4555 if (type_dependent_expression_p (xarg))
4556 return build_min_nt (code, xarg, NULL_TREE);
4558 xarg = build_non_dependent_expr (xarg);
4563 /* [expr.unary.op] says:
4565 The address of an object of incomplete type can be taken.
4567 (And is just the ordinary address operator, not an overloaded
4568 "operator &".) However, if the type is a template
4569 specialization, we must complete the type at this point so that
4570 an overloaded "operator &" will be available if required. */
4571 if (code == ADDR_EXPR
4572 && TREE_CODE (xarg) != TEMPLATE_ID_EXPR
4573 && ((CLASS_TYPE_P (TREE_TYPE (xarg))
4574 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg))))
4575 || (TREE_CODE (xarg) == OFFSET_REF)))
4576 /* Don't look for a function. */;
4578 exp = build_new_op (code, LOOKUP_NORMAL, xarg, NULL_TREE, NULL_TREE,
4579 /*overloaded_p=*/NULL, complain);
4580 if (!exp && code == ADDR_EXPR)
4582 if (is_overloaded_fn (xarg))
4584 tree fn = get_first_fn (xarg);
4585 if (DECL_CONSTRUCTOR_P (fn) || DECL_DESTRUCTOR_P (fn))
4587 error (DECL_CONSTRUCTOR_P (fn)
4588 ? G_("taking address of constructor %qE")
4589 : G_("taking address of destructor %qE"),
4591 return error_mark_node;
4595 /* A pointer to member-function can be formed only by saying
4597 if (!flag_ms_extensions && TREE_CODE (TREE_TYPE (xarg)) == METHOD_TYPE
4598 && (TREE_CODE (xarg) != OFFSET_REF || !PTRMEM_OK_P (xarg)))
4600 if (TREE_CODE (xarg) != OFFSET_REF
4601 || !TYPE_P (TREE_OPERAND (xarg, 0)))
4603 error ("invalid use of %qE to form a pointer-to-member-function",
4605 if (TREE_CODE (xarg) != OFFSET_REF)
4606 inform (input_location, " a qualified-id is required");
4607 return error_mark_node;
4611 error ("parentheses around %qE cannot be used to form a"
4612 " pointer-to-member-function",
4614 PTRMEM_OK_P (xarg) = 1;
4618 if (TREE_CODE (xarg) == OFFSET_REF)
4620 ptrmem = PTRMEM_OK_P (xarg);
4622 if (!ptrmem && !flag_ms_extensions
4623 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg, 1))) == METHOD_TYPE)
4625 /* A single non-static member, make sure we don't allow a
4626 pointer-to-member. */
4627 xarg = build2 (OFFSET_REF, TREE_TYPE (xarg),
4628 TREE_OPERAND (xarg, 0),
4629 ovl_cons (TREE_OPERAND (xarg, 1), NULL_TREE));
4630 PTRMEM_OK_P (xarg) = ptrmem;
4633 else if (TREE_CODE (xarg) == TARGET_EXPR && (complain & tf_warning))
4634 warning (0, "taking address of temporary");
4635 exp = cp_build_unary_op (ADDR_EXPR, xarg, 0, complain);
4638 if (processing_template_decl && exp != error_mark_node)
4639 exp = build_min_non_dep (code, exp, orig_expr,
4640 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE);
4641 if (TREE_CODE (exp) == ADDR_EXPR)
4642 PTRMEM_OK_P (exp) = ptrmem;
4646 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4647 constants, where a null value is represented by an INTEGER_CST of
4651 cp_truthvalue_conversion (tree expr)
4653 tree type = TREE_TYPE (expr);
4654 if (TYPE_PTRMEM_P (type))
4655 return build_binary_op (EXPR_LOCATION (expr),
4656 NE_EXPR, expr, integer_zero_node, 1);
4658 return c_common_truthvalue_conversion (input_location, expr);
4661 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4664 condition_conversion (tree expr)
4667 if (processing_template_decl)
4669 t = perform_implicit_conversion_flags (boolean_type_node, expr,
4670 tf_warning_or_error, LOOKUP_NORMAL);
4671 t = fold_build_cleanup_point_expr (boolean_type_node, t);
4675 /* Returns the address of T. This function will fold away
4676 ADDR_EXPR of INDIRECT_REF. */
4679 build_address (tree t)
4681 if (error_operand_p (t) || !cxx_mark_addressable (t))
4682 return error_mark_node;
4683 t = build_fold_addr_expr (t);
4684 if (TREE_CODE (t) != ADDR_EXPR)
4689 /* Returns the address of T with type TYPE. */
4692 build_typed_address (tree t, tree type)
4694 if (error_operand_p (t) || !cxx_mark_addressable (t))
4695 return error_mark_node;
4696 t = build_fold_addr_expr_with_type (t, type);
4697 if (TREE_CODE (t) != ADDR_EXPR)
4702 /* Return a NOP_EXPR converting EXPR to TYPE. */
4705 build_nop (tree type, tree expr)
4707 if (type == error_mark_node || error_operand_p (expr))
4709 return build1 (NOP_EXPR, type, expr);
4712 /* C++: Must handle pointers to members.
4714 Perhaps type instantiation should be extended to handle conversion
4715 from aggregates to types we don't yet know we want? (Or are those
4716 cases typically errors which should be reported?)
4718 NOCONVERT nonzero suppresses the default promotions
4719 (such as from short to int). */
4722 cp_build_unary_op (enum tree_code code, tree xarg, int noconvert,
4723 tsubst_flags_t complain)
4725 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4728 const char *errstring = NULL;
4730 const char *invalid_op_diag;
4732 if (error_operand_p (arg))
4733 return error_mark_node;
4735 if ((invalid_op_diag
4736 = targetm.invalid_unary_op ((code == UNARY_PLUS_EXPR
4741 error (invalid_op_diag);
4742 return error_mark_node;
4747 case UNARY_PLUS_EXPR:
4750 int flags = WANT_ARITH | WANT_ENUM;
4751 /* Unary plus (but not unary minus) is allowed on pointers. */
4752 if (code == UNARY_PLUS_EXPR)
4753 flags |= WANT_POINTER;
4754 arg = build_expr_type_conversion (flags, arg, true);
4756 errstring = (code == NEGATE_EXPR
4757 ? _("wrong type argument to unary minus")
4758 : _("wrong type argument to unary plus"));
4761 if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
4762 arg = perform_integral_promotions (arg);
4764 /* Make sure the result is not an lvalue: a unary plus or minus
4765 expression is always a rvalue. */
4772 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4776 arg = default_conversion (arg);
4778 else if (!(arg = build_expr_type_conversion (WANT_INT | WANT_ENUM
4779 | WANT_VECTOR_OR_COMPLEX,
4781 errstring = _("wrong type argument to bit-complement");
4782 else if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
4783 arg = perform_integral_promotions (arg);
4787 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
4788 errstring = _("wrong type argument to abs");
4789 else if (!noconvert)
4790 arg = default_conversion (arg);
4794 /* Conjugating a real value is a no-op, but allow it anyway. */
4795 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
4796 errstring = _("wrong type argument to conjugation");
4797 else if (!noconvert)
4798 arg = default_conversion (arg);
4801 case TRUTH_NOT_EXPR:
4802 arg = perform_implicit_conversion (boolean_type_node, arg,
4804 val = invert_truthvalue_loc (input_location, arg);
4805 if (arg != error_mark_node)
4807 errstring = _("in argument to unary !");
4814 if (TREE_CODE (arg) == COMPLEX_CST)
4815 return TREE_REALPART (arg);
4816 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4818 arg = build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
4819 return fold_if_not_in_template (arg);
4825 if (TREE_CODE (arg) == COMPLEX_CST)
4826 return TREE_IMAGPART (arg);
4827 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4829 arg = build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
4830 return fold_if_not_in_template (arg);
4833 return cp_convert (TREE_TYPE (arg), integer_zero_node);
4835 case PREINCREMENT_EXPR:
4836 case POSTINCREMENT_EXPR:
4837 case PREDECREMENT_EXPR:
4838 case POSTDECREMENT_EXPR:
4839 /* Handle complex lvalues (when permitted)
4840 by reduction to simpler cases. */
4842 val = unary_complex_lvalue (code, arg);
4846 arg = mark_lvalue_use (arg);
4848 /* Increment or decrement the real part of the value,
4849 and don't change the imaginary part. */
4850 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4854 arg = stabilize_reference (arg);
4855 real = cp_build_unary_op (REALPART_EXPR, arg, 1, complain);
4856 imag = cp_build_unary_op (IMAGPART_EXPR, arg, 1, complain);
4857 real = cp_build_unary_op (code, real, 1, complain);
4858 if (real == error_mark_node || imag == error_mark_node)
4859 return error_mark_node;
4860 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
4864 /* Report invalid types. */
4866 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_POINTER,
4869 if (code == PREINCREMENT_EXPR)
4870 errstring = _("no pre-increment operator for type");
4871 else if (code == POSTINCREMENT_EXPR)
4872 errstring = _("no post-increment operator for type");
4873 else if (code == PREDECREMENT_EXPR)
4874 errstring = _("no pre-decrement operator for type");
4876 errstring = _("no post-decrement operator for type");
4879 else if (arg == error_mark_node)
4880 return error_mark_node;
4882 /* Report something read-only. */
4884 if (CP_TYPE_CONST_P (TREE_TYPE (arg))
4885 || TREE_READONLY (arg))
4887 if (complain & tf_error)
4888 readonly_error (arg, ((code == PREINCREMENT_EXPR
4889 || code == POSTINCREMENT_EXPR)
4890 ? REK_INCREMENT : REK_DECREMENT));
4892 return error_mark_node;
4897 tree declared_type = unlowered_expr_type (arg);
4899 argtype = TREE_TYPE (arg);
4901 /* ARM $5.2.5 last annotation says this should be forbidden. */
4902 if (TREE_CODE (argtype) == ENUMERAL_TYPE)
4904 if (complain & tf_error)
4905 permerror (input_location, (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
4906 ? G_("ISO C++ forbids incrementing an enum")
4907 : G_("ISO C++ forbids decrementing an enum"));
4909 return error_mark_node;
4912 /* Compute the increment. */
4914 if (TREE_CODE (argtype) == POINTER_TYPE)
4916 tree type = complete_type (TREE_TYPE (argtype));
4918 if (!COMPLETE_OR_VOID_TYPE_P (type))
4920 if (complain & tf_error)
4921 error (((code == PREINCREMENT_EXPR
4922 || code == POSTINCREMENT_EXPR))
4923 ? G_("cannot increment a pointer to incomplete type %qT")
4924 : G_("cannot decrement a pointer to incomplete type %qT"),
4925 TREE_TYPE (argtype));
4927 return error_mark_node;
4929 else if ((pedantic || warn_pointer_arith)
4930 && !TYPE_PTROB_P (argtype))
4932 if (complain & tf_error)
4933 permerror (input_location, (code == PREINCREMENT_EXPR
4934 || code == POSTINCREMENT_EXPR)
4935 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
4936 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
4939 return error_mark_node;
4942 inc = cxx_sizeof_nowarn (TREE_TYPE (argtype));
4945 inc = integer_one_node;
4947 inc = cp_convert (argtype, inc);
4949 /* Complain about anything else that is not a true lvalue. */
4950 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
4951 || code == POSTINCREMENT_EXPR)
4952 ? lv_increment : lv_decrement),
4954 return error_mark_node;
4956 /* Forbid using -- on `bool'. */
4957 if (TREE_CODE (declared_type) == BOOLEAN_TYPE)
4959 if (code == POSTDECREMENT_EXPR || code == PREDECREMENT_EXPR)
4961 if (complain & tf_error)
4962 error ("invalid use of Boolean expression as operand "
4963 "to %<operator--%>");
4964 return error_mark_node;
4966 val = boolean_increment (code, arg);
4969 val = build2 (code, TREE_TYPE (arg), arg, inc);
4971 TREE_SIDE_EFFECTS (val) = 1;
4976 /* Note that this operation never does default_conversion
4977 regardless of NOCONVERT. */
4979 argtype = lvalue_type (arg);
4981 arg = mark_lvalue_use (arg);
4983 if (TREE_CODE (arg) == OFFSET_REF)
4986 if (TREE_CODE (argtype) == REFERENCE_TYPE)
4988 tree type = build_pointer_type (TREE_TYPE (argtype));
4989 arg = build1 (CONVERT_EXPR, type, arg);
4992 else if (pedantic && DECL_MAIN_P (arg))
4995 /* Apparently a lot of autoconf scripts for C++ packages do this,
4996 so only complain if -pedantic. */
4997 if (complain & (flag_pedantic_errors ? tf_error : tf_warning))
4998 pedwarn (input_location, OPT_pedantic,
4999 "ISO C++ forbids taking address of function %<::main%>");
5000 else if (flag_pedantic_errors)
5001 return error_mark_node;
5004 /* Let &* cancel out to simplify resulting code. */
5005 if (TREE_CODE (arg) == INDIRECT_REF)
5007 /* We don't need to have `current_class_ptr' wrapped in a
5008 NON_LVALUE_EXPR node. */
5009 if (arg == current_class_ref)
5010 return current_class_ptr;
5012 arg = TREE_OPERAND (arg, 0);
5013 if (TREE_CODE (TREE_TYPE (arg)) == REFERENCE_TYPE)
5015 tree type = build_pointer_type (TREE_TYPE (TREE_TYPE (arg)));
5016 arg = build1 (CONVERT_EXPR, type, arg);
5019 /* Don't let this be an lvalue. */
5024 /* ??? Cope with user tricks that amount to offsetof. */
5025 if (TREE_CODE (argtype) != FUNCTION_TYPE
5026 && TREE_CODE (argtype) != METHOD_TYPE
5027 && argtype != unknown_type_node
5028 && (val = get_base_address (arg))
5029 && TREE_CODE (val) == INDIRECT_REF
5030 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
5032 tree type = build_pointer_type (argtype);
5033 tree op0 = fold_convert (type, TREE_OPERAND (val, 0));
5034 tree op1 = fold_convert (sizetype, fold_offsetof (arg, val));
5035 return fold_build2 (POINTER_PLUS_EXPR, type, op0, op1);
5038 /* Uninstantiated types are all functions. Taking the
5039 address of a function is a no-op, so just return the
5042 gcc_assert (TREE_CODE (arg) != IDENTIFIER_NODE
5043 || !IDENTIFIER_OPNAME_P (arg));
5045 if (TREE_CODE (arg) == COMPONENT_REF && type_unknown_p (arg)
5046 && !really_overloaded_fn (TREE_OPERAND (arg, 1)))
5048 /* They're trying to take the address of a unique non-static
5049 member function. This is ill-formed (except in MS-land),
5050 but let's try to DTRT.
5051 Note: We only handle unique functions here because we don't
5052 want to complain if there's a static overload; non-unique
5053 cases will be handled by instantiate_type. But we need to
5054 handle this case here to allow casts on the resulting PMF.
5055 We could defer this in non-MS mode, but it's easier to give
5056 a useful error here. */
5058 /* Inside constant member functions, the `this' pointer
5059 contains an extra const qualifier. TYPE_MAIN_VARIANT
5060 is used here to remove this const from the diagnostics
5061 and the created OFFSET_REF. */
5062 tree base = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg, 0)));
5063 tree fn = get_first_fn (TREE_OPERAND (arg, 1));
5066 if (! flag_ms_extensions)
5068 tree name = DECL_NAME (fn);
5069 if (!(complain & tf_error))
5070 return error_mark_node;
5071 else if (current_class_type
5072 && TREE_OPERAND (arg, 0) == current_class_ref)
5073 /* An expression like &memfn. */
5074 permerror (input_location, "ISO C++ forbids taking the address of an unqualified"
5075 " or parenthesized non-static member function to form"
5076 " a pointer to member function. Say %<&%T::%D%>",
5079 permerror (input_location, "ISO C++ forbids taking the address of a bound member"
5080 " function to form a pointer to member function."
5084 arg = build_offset_ref (base, fn, /*address_p=*/true);
5088 if (type_unknown_p (arg))
5089 return build1 (ADDR_EXPR, unknown_type_node, arg);
5091 /* Handle complex lvalues (when permitted)
5092 by reduction to simpler cases. */
5093 val = unary_complex_lvalue (code, arg);
5097 switch (TREE_CODE (arg))
5101 case FIX_TRUNC_EXPR:
5102 /* Even if we're not being pedantic, we cannot allow this
5103 extension when we're instantiating in a SFINAE
5105 if (! lvalue_p (arg) && complain == tf_none)
5107 if (complain & tf_error)
5108 permerror (input_location, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
5110 return error_mark_node;
5115 arg = BASELINK_FUNCTIONS (arg);
5119 arg = OVL_CURRENT (arg);
5123 /* Turn a reference to a non-static data member into a
5124 pointer-to-member. */
5129 if (!PTRMEM_OK_P (arg))
5130 return cp_build_unary_op (code, arg, 0, complain);
5132 t = TREE_OPERAND (arg, 1);
5133 if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
5135 if (complain & tf_error)
5136 error ("cannot create pointer to reference member %qD", t);
5137 return error_mark_node;
5140 type = build_ptrmem_type (context_for_name_lookup (t),
5142 t = make_ptrmem_cst (type, TREE_OPERAND (arg, 1));
5150 /* Anything not already handled and not a true memory reference
5152 if (TREE_CODE (argtype) != FUNCTION_TYPE
5153 && TREE_CODE (argtype) != METHOD_TYPE
5154 && TREE_CODE (arg) != OFFSET_REF
5155 && !lvalue_or_else (arg, lv_addressof, complain))
5156 return error_mark_node;
5158 if (argtype != error_mark_node)
5159 argtype = build_pointer_type (argtype);
5161 /* In a template, we are processing a non-dependent expression
5162 so we can just form an ADDR_EXPR with the correct type. */
5163 if (processing_template_decl || TREE_CODE (arg) != COMPONENT_REF)
5165 val = build_address (arg);
5166 if (TREE_CODE (arg) == OFFSET_REF)
5167 PTRMEM_OK_P (val) = PTRMEM_OK_P (arg);
5169 else if (TREE_CODE (TREE_OPERAND (arg, 1)) == BASELINK)
5171 tree fn = BASELINK_FUNCTIONS (TREE_OPERAND (arg, 1));
5173 /* We can only get here with a single static member
5175 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
5176 && DECL_STATIC_FUNCTION_P (fn));
5178 val = build_address (fn);
5179 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg, 0)))
5180 /* Do not lose object's side effects. */
5181 val = build2 (COMPOUND_EXPR, TREE_TYPE (val),
5182 TREE_OPERAND (arg, 0), val);
5184 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)))
5186 if (complain & tf_error)
5187 error ("attempt to take address of bit-field structure member %qD",
5188 TREE_OPERAND (arg, 1));
5189 return error_mark_node;
5193 tree object = TREE_OPERAND (arg, 0);
5194 tree field = TREE_OPERAND (arg, 1);
5195 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5196 (TREE_TYPE (object), decl_type_context (field)));
5197 val = build_address (arg);
5200 if (TREE_CODE (argtype) == POINTER_TYPE
5201 && TREE_CODE (TREE_TYPE (argtype)) == METHOD_TYPE)
5203 build_ptrmemfunc_type (argtype);
5204 val = build_ptrmemfunc (argtype, val, 0,
5205 /*c_cast_p=*/false);
5217 argtype = TREE_TYPE (arg);
5218 return fold_if_not_in_template (build1 (code, argtype, arg));
5221 if (complain & tf_error)
5222 error ("%s", errstring);
5223 return error_mark_node;
5226 /* Hook for the c-common bits that build a unary op. */
5228 build_unary_op (location_t location ATTRIBUTE_UNUSED,
5229 enum tree_code code, tree xarg, int noconvert)
5231 return cp_build_unary_op (code, xarg, noconvert, tf_warning_or_error);
5234 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5235 for certain kinds of expressions which are not really lvalues
5236 but which we can accept as lvalues.
5238 If ARG is not a kind of expression we can handle, return
5242 unary_complex_lvalue (enum tree_code code, tree arg)
5244 /* Inside a template, making these kinds of adjustments is
5245 pointless; we are only concerned with the type of the
5247 if (processing_template_decl)
5250 /* Handle (a, b) used as an "lvalue". */
5251 if (TREE_CODE (arg) == COMPOUND_EXPR)
5253 tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 1), 0,
5254 tf_warning_or_error);
5255 return build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
5256 TREE_OPERAND (arg, 0), real_result);
5259 /* Handle (a ? b : c) used as an "lvalue". */
5260 if (TREE_CODE (arg) == COND_EXPR
5261 || TREE_CODE (arg) == MIN_EXPR || TREE_CODE (arg) == MAX_EXPR)
5262 return rationalize_conditional_expr (code, arg, tf_warning_or_error);
5264 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5265 if (TREE_CODE (arg) == MODIFY_EXPR
5266 || TREE_CODE (arg) == PREINCREMENT_EXPR
5267 || TREE_CODE (arg) == PREDECREMENT_EXPR)
5269 tree lvalue = TREE_OPERAND (arg, 0);
5270 if (TREE_SIDE_EFFECTS (lvalue))
5272 lvalue = stabilize_reference (lvalue);
5273 arg = build2 (TREE_CODE (arg), TREE_TYPE (arg),
5274 lvalue, TREE_OPERAND (arg, 1));
5276 return unary_complex_lvalue
5277 (code, build2 (COMPOUND_EXPR, TREE_TYPE (lvalue), arg, lvalue));
5280 if (code != ADDR_EXPR)
5283 /* Handle (a = b) used as an "lvalue" for `&'. */
5284 if (TREE_CODE (arg) == MODIFY_EXPR
5285 || TREE_CODE (arg) == INIT_EXPR)
5287 tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 0), 0,
5288 tf_warning_or_error);
5289 arg = build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
5291 TREE_NO_WARNING (arg) = 1;
5295 if (TREE_CODE (TREE_TYPE (arg)) == FUNCTION_TYPE
5296 || TREE_CODE (TREE_TYPE (arg)) == METHOD_TYPE
5297 || TREE_CODE (arg) == OFFSET_REF)
5300 /* We permit compiler to make function calls returning
5301 objects of aggregate type look like lvalues. */
5305 if (TREE_CODE (targ) == SAVE_EXPR)
5306 targ = TREE_OPERAND (targ, 0);
5308 if (TREE_CODE (targ) == CALL_EXPR && MAYBE_CLASS_TYPE_P (TREE_TYPE (targ)))
5310 if (TREE_CODE (arg) == SAVE_EXPR)
5313 targ = build_cplus_new (TREE_TYPE (arg), arg);
5314 return build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (arg)), targ);
5317 if (TREE_CODE (arg) == SAVE_EXPR && TREE_CODE (targ) == INDIRECT_REF)
5318 return build3 (SAVE_EXPR, build_pointer_type (TREE_TYPE (arg)),
5319 TREE_OPERAND (targ, 0), current_function_decl, NULL);
5322 /* Don't let anything else be handled specially. */
5326 /* Mark EXP saying that we need to be able to take the
5327 address of it; it should not be allocated in a register.
5328 Value is true if successful.
5330 C++: we do not allow `current_class_ptr' to be addressable. */
5333 cxx_mark_addressable (tree exp)
5338 switch (TREE_CODE (x))
5345 x = TREE_OPERAND (x, 0);
5349 if (x == current_class_ptr)
5351 error ("cannot take the address of %<this%>, which is an rvalue expression");
5352 TREE_ADDRESSABLE (x) = 1; /* so compiler doesn't die later. */
5358 /* Caller should not be trying to mark initialized
5359 constant fields addressable. */
5360 gcc_assert (DECL_LANG_SPECIFIC (x) == 0
5361 || DECL_IN_AGGR_P (x) == 0
5363 || DECL_EXTERNAL (x));
5368 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
5369 && !DECL_ARTIFICIAL (x))
5371 if (TREE_CODE (x) == VAR_DECL && DECL_HARD_REGISTER (x))
5374 ("address of explicit register variable %qD requested", x);
5377 else if (extra_warnings)
5379 (OPT_Wextra, "address requested for %qD, which is declared %<register%>", x);
5381 TREE_ADDRESSABLE (x) = 1;
5385 TREE_ADDRESSABLE (x) = 1;
5389 TREE_ADDRESSABLE (x) = 1;
5393 TREE_ADDRESSABLE (x) = 1;
5394 cxx_mark_addressable (TREE_OPERAND (x, 0));
5402 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5405 build_x_conditional_expr (tree ifexp, tree op1, tree op2,
5406 tsubst_flags_t complain)
5408 tree orig_ifexp = ifexp;
5409 tree orig_op1 = op1;
5410 tree orig_op2 = op2;
5413 if (processing_template_decl)
5415 /* The standard says that the expression is type-dependent if
5416 IFEXP is type-dependent, even though the eventual type of the
5417 expression doesn't dependent on IFEXP. */
5418 if (type_dependent_expression_p (ifexp)
5419 /* As a GNU extension, the middle operand may be omitted. */
5420 || (op1 && type_dependent_expression_p (op1))
5421 || type_dependent_expression_p (op2))
5422 return build_min_nt (COND_EXPR, ifexp, op1, op2);
5423 ifexp = build_non_dependent_expr (ifexp);
5425 op1 = build_non_dependent_expr (op1);
5426 op2 = build_non_dependent_expr (op2);
5429 expr = build_conditional_expr (ifexp, op1, op2, complain);
5430 if (processing_template_decl && expr != error_mark_node)
5431 return build_min_non_dep (COND_EXPR, expr,
5432 orig_ifexp, orig_op1, orig_op2);
5436 /* Given a list of expressions, return a compound expression
5437 that performs them all and returns the value of the last of them. */
5439 tree build_x_compound_expr_from_list (tree list, const char *msg)
5441 tree expr = TREE_VALUE (list);
5443 if (TREE_CHAIN (list))
5446 permerror (input_location, "%s expression list treated as compound expression", msg);
5448 for (list = TREE_CHAIN (list); list; list = TREE_CHAIN (list))
5449 expr = build_x_compound_expr (expr, TREE_VALUE (list),
5450 tf_warning_or_error);
5456 /* Like build_x_compound_expr_from_list, but using a VEC. */
5459 build_x_compound_expr_from_vec (VEC(tree,gc) *vec, const char *msg)
5461 if (VEC_empty (tree, vec))
5463 else if (VEC_length (tree, vec) == 1)
5464 return VEC_index (tree, vec, 0);
5472 permerror (input_location,
5473 "%s expression list treated as compound expression",
5476 expr = VEC_index (tree, vec, 0);
5477 for (ix = 1; VEC_iterate (tree, vec, ix, t); ++ix)
5478 expr = build_x_compound_expr (expr, t, tf_warning_or_error);
5484 /* Handle overloading of the ',' operator when needed. */
5487 build_x_compound_expr (tree op1, tree op2, tsubst_flags_t complain)
5490 tree orig_op1 = op1;
5491 tree orig_op2 = op2;
5493 if (processing_template_decl)
5495 if (type_dependent_expression_p (op1)
5496 || type_dependent_expression_p (op2))
5497 return build_min_nt (COMPOUND_EXPR, op1, op2);
5498 op1 = build_non_dependent_expr (op1);
5499 op2 = build_non_dependent_expr (op2);
5502 result = build_new_op (COMPOUND_EXPR, LOOKUP_NORMAL, op1, op2, NULL_TREE,
5503 /*overloaded_p=*/NULL, complain);
5505 result = cp_build_compound_expr (op1, op2, complain);
5507 if (processing_template_decl && result != error_mark_node)
5508 return build_min_non_dep (COMPOUND_EXPR, result, orig_op1, orig_op2);
5513 /* Like cp_build_compound_expr, but for the c-common bits. */
5516 build_compound_expr (location_t loc ATTRIBUTE_UNUSED, tree lhs, tree rhs)
5518 return cp_build_compound_expr (lhs, rhs, tf_warning_or_error);
5521 /* Build a compound expression. */
5524 cp_build_compound_expr (tree lhs, tree rhs, tsubst_flags_t complain)
5526 lhs = convert_to_void (lhs, "left-hand operand of comma", complain);
5528 if (lhs == error_mark_node || rhs == error_mark_node)
5529 return error_mark_node;
5531 if (TREE_CODE (rhs) == TARGET_EXPR)
5533 /* If the rhs is a TARGET_EXPR, then build the compound
5534 expression inside the target_expr's initializer. This
5535 helps the compiler to eliminate unnecessary temporaries. */
5536 tree init = TREE_OPERAND (rhs, 1);
5538 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), lhs, init);
5539 TREE_OPERAND (rhs, 1) = init;
5544 if (type_unknown_p (rhs))
5546 error ("no context to resolve type of %qE", rhs);
5547 return error_mark_node;
5550 return build2 (COMPOUND_EXPR, TREE_TYPE (rhs), lhs, rhs);
5553 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5554 casts away constness. CAST gives the type of cast.
5556 ??? This function warns for casting away any qualifier not just
5557 const. We would like to specify exactly what qualifiers are casted
5562 check_for_casting_away_constness (tree src_type, tree dest_type,
5563 enum tree_code cast)
5565 /* C-style casts are allowed to cast away constness. With
5566 WARN_CAST_QUAL, we still want to issue a warning. */
5567 if (cast == CAST_EXPR && !warn_cast_qual)
5570 if (!casts_away_constness (src_type, dest_type))
5576 warning (OPT_Wcast_qual,
5577 "cast from type %qT to type %qT casts away qualifiers",
5578 src_type, dest_type);
5581 case STATIC_CAST_EXPR:
5582 error ("static_cast from type %qT to type %qT casts away qualifiers",
5583 src_type, dest_type);
5586 case REINTERPRET_CAST_EXPR:
5587 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5588 src_type, dest_type);
5595 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5596 (another pointer-to-member type in the same hierarchy) and return
5597 the converted expression. If ALLOW_INVERSE_P is permitted, a
5598 pointer-to-derived may be converted to pointer-to-base; otherwise,
5599 only the other direction is permitted. If C_CAST_P is true, this
5600 conversion is taking place as part of a C-style cast. */
5603 convert_ptrmem (tree type, tree expr, bool allow_inverse_p,
5606 if (TYPE_PTRMEM_P (type))
5610 if (TREE_CODE (expr) == PTRMEM_CST)
5611 expr = cplus_expand_constant (expr);
5612 delta = get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr)),
5613 TYPE_PTRMEM_CLASS_TYPE (type),
5616 if (!integer_zerop (delta))
5618 tree cond, op1, op2;
5620 cond = cp_build_binary_op (input_location,
5623 build_int_cst (TREE_TYPE (expr), -1),
5624 tf_warning_or_error);
5625 op1 = build_nop (ptrdiff_type_node, expr);
5626 op2 = cp_build_binary_op (input_location,
5627 PLUS_EXPR, op1, delta,
5628 tf_warning_or_error);
5630 expr = fold_build3_loc (input_location,
5631 COND_EXPR, ptrdiff_type_node, cond, op1, op2);
5635 return build_nop (type, expr);
5638 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), expr,
5639 allow_inverse_p, c_cast_p);
5642 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
5643 a version of EXPR that has TREE_OVERFLOW set if it is set in ORIG.
5644 Otherwise, return EXPR unchanged. */
5647 ignore_overflows (tree expr, tree orig)
5649 if (TREE_CODE (expr) == INTEGER_CST
5650 && CONSTANT_CLASS_P (orig)
5651 && TREE_CODE (orig) != STRING_CST
5652 && TREE_OVERFLOW (expr) != TREE_OVERFLOW (orig))
5654 if (!TREE_OVERFLOW (orig))
5655 /* Ensure constant sharing. */
5656 expr = build_int_cst_wide (TREE_TYPE (expr),
5657 TREE_INT_CST_LOW (expr),
5658 TREE_INT_CST_HIGH (expr));
5661 /* Avoid clobbering a shared constant. */
5662 expr = copy_node (expr);
5663 TREE_OVERFLOW (expr) = TREE_OVERFLOW (orig);
5669 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5670 this static_cast is being attempted as one of the possible casts
5671 allowed by a C-style cast. (In that case, accessibility of base
5672 classes is not considered, and it is OK to cast away
5673 constness.) Return the result of the cast. *VALID_P is set to
5674 indicate whether or not the cast was valid. */
5677 build_static_cast_1 (tree type, tree expr, bool c_cast_p,
5678 bool *valid_p, tsubst_flags_t complain)
5684 /* Assume the cast is valid. */
5687 intype = TREE_TYPE (expr);
5689 /* Save casted types in the function's used types hash table. */
5690 used_types_insert (type);
5692 /* [expr.static.cast]
5694 An lvalue of type "cv1 B", where B is a class type, can be cast
5695 to type "reference to cv2 D", where D is a class derived (clause
5696 _class.derived_) from B, if a valid standard conversion from
5697 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5698 same cv-qualification as, or greater cv-qualification than, cv1,
5699 and B is not a virtual base class of D. */
5700 /* We check this case before checking the validity of "TYPE t =
5701 EXPR;" below because for this case:
5704 struct D : public B { D(const B&); };
5706 void f() { static_cast<const D&>(b); }
5708 we want to avoid constructing a new D. The standard is not
5709 completely clear about this issue, but our interpretation is
5710 consistent with other compilers. */
5711 if (TREE_CODE (type) == REFERENCE_TYPE
5712 && CLASS_TYPE_P (TREE_TYPE (type))
5713 && CLASS_TYPE_P (intype)
5714 && (TYPE_REF_IS_RVALUE (type) || real_lvalue_p (expr))
5715 && DERIVED_FROM_P (intype, TREE_TYPE (type))
5716 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype)),
5717 build_pointer_type (TYPE_MAIN_VARIANT
5718 (TREE_TYPE (type))))
5720 || at_least_as_qualified_p (TREE_TYPE (type), intype)))
5724 /* There is a standard conversion from "D*" to "B*" even if "B"
5725 is ambiguous or inaccessible. If this is really a
5726 static_cast, then we check both for inaccessibility and
5727 ambiguity. However, if this is a static_cast being performed
5728 because the user wrote a C-style cast, then accessibility is
5730 base = lookup_base (TREE_TYPE (type), intype,
5731 c_cast_p ? ba_unique : ba_check,
5734 /* Convert from "B*" to "D*". This function will check that "B"
5735 is not a virtual base of "D". */
5736 expr = build_base_path (MINUS_EXPR, build_address (expr),
5737 base, /*nonnull=*/false);
5738 /* Convert the pointer to a reference -- but then remember that
5739 there are no expressions with reference type in C++. */
5740 return convert_from_reference (cp_fold_convert (type, expr));
5743 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5744 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5745 if (TREE_CODE (type) == REFERENCE_TYPE
5746 && TYPE_REF_IS_RVALUE (type)
5747 && real_lvalue_p (expr)
5748 && reference_related_p (TREE_TYPE (type), intype)
5749 && (c_cast_p || at_least_as_qualified_p (TREE_TYPE (type), intype)))
5751 expr = build_typed_address (expr, type);
5752 return convert_from_reference (expr);
5757 /* Resolve overloaded address here rather than once in
5758 implicit_conversion and again in the inverse code below. */
5759 if (TYPE_PTRMEMFUNC_P (type) && type_unknown_p (expr))
5761 expr = instantiate_type (type, expr, complain);
5762 intype = TREE_TYPE (expr);
5765 /* [expr.static.cast]
5767 An expression e can be explicitly converted to a type T using a
5768 static_cast of the form static_cast<T>(e) if the declaration T
5769 t(e);" is well-formed, for some invented temporary variable
5771 result = perform_direct_initialization_if_possible (type, expr,
5772 c_cast_p, complain);
5775 result = convert_from_reference (result);
5777 /* Ignore any integer overflow caused by the cast. */
5778 result = ignore_overflows (result, orig);
5780 /* [expr.static.cast]
5782 If T is a reference type, the result is an lvalue; otherwise,
5783 the result is an rvalue. */
5784 if (TREE_CODE (type) != REFERENCE_TYPE)
5785 result = rvalue (result);
5789 /* [expr.static.cast]
5791 Any expression can be explicitly converted to type cv void. */
5792 if (TREE_CODE (type) == VOID_TYPE)
5793 return convert_to_void (expr, /*implicit=*/NULL, complain);
5795 /* [expr.static.cast]
5797 The inverse of any standard conversion sequence (clause _conv_),
5798 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5799 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5800 (_conv.bool_) conversions, can be performed explicitly using
5801 static_cast subject to the restriction that the explicit
5802 conversion does not cast away constness (_expr.const.cast_), and
5803 the following additional rules for specific cases: */
5804 /* For reference, the conversions not excluded are: integral
5805 promotions, floating point promotion, integral conversions,
5806 floating point conversions, floating-integral conversions,
5807 pointer conversions, and pointer to member conversions. */
5810 A value of integral _or enumeration_ type can be explicitly
5811 converted to an enumeration type. */
5812 /* The effect of all that is that any conversion between any two
5813 types which are integral, floating, or enumeration types can be
5815 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type)
5816 || SCALAR_FLOAT_TYPE_P (type))
5817 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype)
5818 || SCALAR_FLOAT_TYPE_P (intype)))
5820 expr = ocp_convert (type, expr, CONV_C_CAST, LOOKUP_NORMAL);
5822 /* Ignore any integer overflow caused by the cast. */
5823 expr = ignore_overflows (expr, orig);
5827 if (TYPE_PTR_P (type) && TYPE_PTR_P (intype)
5828 && CLASS_TYPE_P (TREE_TYPE (type))
5829 && CLASS_TYPE_P (TREE_TYPE (intype))
5830 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5831 (TREE_TYPE (intype))),
5832 build_pointer_type (TYPE_MAIN_VARIANT
5833 (TREE_TYPE (type)))))
5838 check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR);
5839 base = lookup_base (TREE_TYPE (type), TREE_TYPE (intype),
5840 c_cast_p ? ba_unique : ba_check,
5842 return build_base_path (MINUS_EXPR, expr, base, /*nonnull=*/false);
5845 if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
5846 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
5853 c1 = TYPE_PTRMEM_CLASS_TYPE (intype);
5854 c2 = TYPE_PTRMEM_CLASS_TYPE (type);
5856 if (TYPE_PTRMEM_P (type))
5858 t1 = (build_ptrmem_type
5860 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype))));
5861 t2 = (build_ptrmem_type
5863 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type))));
5870 if (can_convert (t1, t2) || can_convert (t2, t1))
5873 check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR);
5874 return convert_ptrmem (type, expr, /*allow_inverse_p=*/1,
5879 /* [expr.static.cast]
5881 An rvalue of type "pointer to cv void" can be explicitly
5882 converted to a pointer to object type. A value of type pointer
5883 to object converted to "pointer to cv void" and back to the
5884 original pointer type will have its original value. */
5885 if (TREE_CODE (intype) == POINTER_TYPE
5886 && VOID_TYPE_P (TREE_TYPE (intype))
5887 && TYPE_PTROB_P (type))
5890 check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR);
5891 return build_nop (type, expr);
5895 return error_mark_node;
5898 /* Return an expression representing static_cast<TYPE>(EXPR). */
5901 build_static_cast (tree type, tree expr, tsubst_flags_t complain)
5906 if (type == error_mark_node || expr == error_mark_node)
5907 return error_mark_node;
5909 if (processing_template_decl)
5911 expr = build_min (STATIC_CAST_EXPR, type, expr);
5912 /* We don't know if it will or will not have side effects. */
5913 TREE_SIDE_EFFECTS (expr) = 1;
5914 return convert_from_reference (expr);
5917 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5918 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5919 if (TREE_CODE (type) != REFERENCE_TYPE
5920 && TREE_CODE (expr) == NOP_EXPR
5921 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
5922 expr = TREE_OPERAND (expr, 0);
5924 result = build_static_cast_1 (type, expr, /*c_cast_p=*/false, &valid_p,
5929 if (complain & tf_error)
5930 error ("invalid static_cast from type %qT to type %qT",
5931 TREE_TYPE (expr), type);
5932 return error_mark_node;
5935 /* EXPR is an expression with member function or pointer-to-member
5936 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5937 not permitted by ISO C++, but we accept it in some modes. If we
5938 are not in one of those modes, issue a diagnostic. Return the
5939 converted expression. */
5942 convert_member_func_to_ptr (tree type, tree expr)
5947 intype = TREE_TYPE (expr);
5948 gcc_assert (TYPE_PTRMEMFUNC_P (intype)
5949 || TREE_CODE (intype) == METHOD_TYPE);
5951 if (pedantic || warn_pmf2ptr)
5952 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpmf_conversions,
5953 "converting from %qT to %qT", intype, type);
5955 if (TREE_CODE (intype) == METHOD_TYPE)
5956 expr = build_addr_func (expr);
5957 else if (TREE_CODE (expr) == PTRMEM_CST)
5958 expr = build_address (PTRMEM_CST_MEMBER (expr));
5961 decl = maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype), 0);
5962 decl = build_address (decl);
5963 expr = get_member_function_from_ptrfunc (&decl, expr);
5966 return build_nop (type, expr);
5969 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
5970 If C_CAST_P is true, this reinterpret cast is being done as part of
5971 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
5972 indicate whether or not reinterpret_cast was valid. */
5975 build_reinterpret_cast_1 (tree type, tree expr, bool c_cast_p,
5976 bool *valid_p, tsubst_flags_t complain)
5980 /* Assume the cast is invalid. */
5984 if (type == error_mark_node || error_operand_p (expr))
5985 return error_mark_node;
5987 intype = TREE_TYPE (expr);
5989 /* Save casted types in the function's used types hash table. */
5990 used_types_insert (type);
5992 /* [expr.reinterpret.cast]
5993 An lvalue expression of type T1 can be cast to the type
5994 "reference to T2" if an expression of type "pointer to T1" can be
5995 explicitly converted to the type "pointer to T2" using a
5996 reinterpret_cast. */
5997 if (TREE_CODE (type) == REFERENCE_TYPE)
5999 if (! real_lvalue_p (expr))
6001 if (complain & tf_error)
6002 error ("invalid cast of an rvalue expression of type "
6005 return error_mark_node;
6008 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6009 "B" are related class types; the reinterpret_cast does not
6010 adjust the pointer. */
6011 if (TYPE_PTR_P (intype)
6012 && (complain & tf_warning)
6013 && (comptypes (TREE_TYPE (intype), TREE_TYPE (type),
6014 COMPARE_BASE | COMPARE_DERIVED)))
6015 warning (0, "casting %qT to %qT does not dereference pointer",
6018 expr = cp_build_unary_op (ADDR_EXPR, expr, 0, complain);
6020 if (warn_strict_aliasing > 2)
6021 strict_aliasing_warning (TREE_TYPE (expr), type, expr);
6023 if (expr != error_mark_node)
6024 expr = build_reinterpret_cast_1
6025 (build_pointer_type (TREE_TYPE (type)), expr, c_cast_p,
6027 if (expr != error_mark_node)
6028 /* cp_build_indirect_ref isn't right for rvalue refs. */
6029 expr = convert_from_reference (fold_convert (type, expr));
6033 /* As a G++ extension, we consider conversions from member
6034 functions, and pointers to member functions to
6035 pointer-to-function and pointer-to-void types. If
6036 -Wno-pmf-conversions has not been specified,
6037 convert_member_func_to_ptr will issue an error message. */
6038 if ((TYPE_PTRMEMFUNC_P (intype)
6039 || TREE_CODE (intype) == METHOD_TYPE)
6040 && TYPE_PTR_P (type)
6041 && (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
6042 || VOID_TYPE_P (TREE_TYPE (type))))
6043 return convert_member_func_to_ptr (type, expr);
6045 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6046 array-to-pointer, and function-to-pointer conversions are
6048 expr = decay_conversion (expr);
6050 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6051 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6052 if (TREE_CODE (expr) == NOP_EXPR
6053 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
6054 expr = TREE_OPERAND (expr, 0);
6056 if (error_operand_p (expr))
6057 return error_mark_node;
6059 intype = TREE_TYPE (expr);
6061 /* [expr.reinterpret.cast]
6062 A pointer can be converted to any integral type large enough to
6063 hold it. ... A value of type std::nullptr_t can be converted to
6064 an integral type; the conversion has the same meaning and
6065 validity as a conversion of (void*)0 to the integral type. */
6066 if (CP_INTEGRAL_TYPE_P (type)
6067 && (TYPE_PTR_P (intype) || NULLPTR_TYPE_P (intype)))
6069 if (TYPE_PRECISION (type) < TYPE_PRECISION (intype))
6071 if (complain & tf_error)
6072 permerror (input_location, "cast from %qT to %qT loses precision",
6075 return error_mark_node;
6077 if (NULLPTR_TYPE_P (intype))
6078 return build_int_cst (type, 0);
6080 /* [expr.reinterpret.cast]
6081 A value of integral or enumeration type can be explicitly
6082 converted to a pointer. */
6083 else if (TYPE_PTR_P (type) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype))
6086 else if ((TYPE_PTRFN_P (type) && TYPE_PTRFN_P (intype))
6087 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
6088 return fold_if_not_in_template (build_nop (type, expr));
6089 else if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
6090 || (TYPE_PTROBV_P (type) && TYPE_PTROBV_P (intype)))
6095 check_for_casting_away_constness (intype, type, REINTERPRET_CAST_EXPR);
6096 /* Warn about possible alignment problems. */
6097 if (STRICT_ALIGNMENT && warn_cast_align
6098 && (complain & tf_warning)
6099 && !VOID_TYPE_P (type)
6100 && TREE_CODE (TREE_TYPE (intype)) != FUNCTION_TYPE
6101 && COMPLETE_TYPE_P (TREE_TYPE (type))
6102 && COMPLETE_TYPE_P (TREE_TYPE (intype))
6103 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (intype)))
6104 warning (OPT_Wcast_align, "cast from %qT to %qT "
6105 "increases required alignment of target type", intype, type);
6107 /* We need to strip nops here, because the front end likes to
6108 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6110 if (warn_strict_aliasing <= 2)
6111 strict_aliasing_warning (intype, type, sexpr);
6113 return fold_if_not_in_template (build_nop (type, expr));
6115 else if ((TYPE_PTRFN_P (type) && TYPE_PTROBV_P (intype))
6116 || (TYPE_PTRFN_P (intype) && TYPE_PTROBV_P (type)))
6118 if (pedantic && (complain & tf_warning))
6119 /* Only issue a warning, as we have always supported this
6120 where possible, and it is necessary in some cases. DR 195
6121 addresses this issue, but as of 2004/10/26 is still in
6123 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6124 return fold_if_not_in_template (build_nop (type, expr));
6126 else if (TREE_CODE (type) == VECTOR_TYPE)
6127 return fold_if_not_in_template (convert_to_vector (type, expr));
6128 else if (TREE_CODE (intype) == VECTOR_TYPE
6129 && INTEGRAL_OR_ENUMERATION_TYPE_P (type))
6130 return fold_if_not_in_template (convert_to_integer (type, expr));
6135 if (complain & tf_error)
6136 error ("invalid cast from type %qT to type %qT", intype, type);
6137 return error_mark_node;
6140 return cp_convert (type, expr);
6144 build_reinterpret_cast (tree type, tree expr, tsubst_flags_t complain)
6146 if (type == error_mark_node || expr == error_mark_node)
6147 return error_mark_node;
6149 if (processing_template_decl)
6151 tree t = build_min (REINTERPRET_CAST_EXPR, type, expr);
6153 if (!TREE_SIDE_EFFECTS (t)
6154 && type_dependent_expression_p (expr))
6155 /* There might turn out to be side effects inside expr. */
6156 TREE_SIDE_EFFECTS (t) = 1;
6157 return convert_from_reference (t);
6160 return build_reinterpret_cast_1 (type, expr, /*c_cast_p=*/false,
6161 /*valid_p=*/NULL, complain);
6164 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6165 return an appropriate expression. Otherwise, return
6166 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6167 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6168 performing a C-style cast, its value upon return will indicate
6169 whether or not the conversion succeeded. */
6172 build_const_cast_1 (tree dst_type, tree expr, bool complain,
6176 tree reference_type;
6178 /* Callers are responsible for handling error_mark_node as a
6179 destination type. */
6180 gcc_assert (dst_type != error_mark_node);
6181 /* In a template, callers should be building syntactic
6182 representations of casts, not using this machinery. */
6183 gcc_assert (!processing_template_decl);
6185 /* Assume the conversion is invalid. */
6189 if (!POINTER_TYPE_P (dst_type) && !TYPE_PTRMEM_P (dst_type))
6192 error ("invalid use of const_cast with type %qT, "
6193 "which is not a pointer, "
6194 "reference, nor a pointer-to-data-member type", dst_type);
6195 return error_mark_node;
6198 if (TREE_CODE (TREE_TYPE (dst_type)) == FUNCTION_TYPE)
6201 error ("invalid use of const_cast with type %qT, which is a pointer "
6202 "or reference to a function type", dst_type);
6203 return error_mark_node;
6206 /* Save casted types in the function's used types hash table. */
6207 used_types_insert (dst_type);
6209 src_type = TREE_TYPE (expr);
6210 /* Expressions do not really have reference types. */
6211 if (TREE_CODE (src_type) == REFERENCE_TYPE)
6212 src_type = TREE_TYPE (src_type);
6214 /* [expr.const.cast]
6216 An lvalue of type T1 can be explicitly converted to an lvalue of
6217 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6218 types) if a pointer to T1 can be explicitly converted to the type
6219 pointer to T2 using a const_cast. */
6220 if (TREE_CODE (dst_type) == REFERENCE_TYPE)
6222 reference_type = dst_type;
6223 if (! real_lvalue_p (expr))
6226 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6227 src_type, dst_type);
6228 return error_mark_node;
6230 dst_type = build_pointer_type (TREE_TYPE (dst_type));
6231 src_type = build_pointer_type (src_type);
6235 reference_type = NULL_TREE;
6236 /* If the destination type is not a reference type, the
6237 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6238 conversions are performed. */
6239 src_type = type_decays_to (src_type);
6240 if (src_type == error_mark_node)
6241 return error_mark_node;
6244 if ((TYPE_PTR_P (src_type) || TYPE_PTRMEM_P (src_type))
6245 && comp_ptr_ttypes_const (dst_type, src_type))
6250 /* This cast is actually a C-style cast. Issue a warning if
6251 the user is making a potentially unsafe cast. */
6252 check_for_casting_away_constness (src_type, dst_type, CAST_EXPR);
6256 expr = cp_build_unary_op (ADDR_EXPR, expr, 0,
6257 complain? tf_warning_or_error : tf_none);
6258 expr = build_nop (reference_type, expr);
6259 return convert_from_reference (expr);
6263 expr = decay_conversion (expr);
6264 /* build_c_cast puts on a NOP_EXPR to make the result not an
6265 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6266 non-lvalue context. */
6267 if (TREE_CODE (expr) == NOP_EXPR
6268 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
6269 expr = TREE_OPERAND (expr, 0);
6270 return build_nop (dst_type, expr);
6275 error ("invalid const_cast from type %qT to type %qT",
6276 src_type, dst_type);
6277 return error_mark_node;
6281 build_const_cast (tree type, tree expr, tsubst_flags_t complain)
6283 if (type == error_mark_node || error_operand_p (expr))
6284 return error_mark_node;
6286 if (processing_template_decl)
6288 tree t = build_min (CONST_CAST_EXPR, type, expr);
6290 if (!TREE_SIDE_EFFECTS (t)
6291 && type_dependent_expression_p (expr))
6292 /* There might turn out to be side effects inside expr. */
6293 TREE_SIDE_EFFECTS (t) = 1;
6294 return convert_from_reference (t);
6297 return build_const_cast_1 (type, expr, complain & tf_error,
6301 /* Like cp_build_c_cast, but for the c-common bits. */
6304 build_c_cast (location_t loc ATTRIBUTE_UNUSED, tree type, tree expr)
6306 return cp_build_c_cast (type, expr, tf_warning_or_error);
6309 /* Build an expression representing an explicit C-style cast to type
6310 TYPE of expression EXPR. */
6313 cp_build_c_cast (tree type, tree expr, tsubst_flags_t complain)
6319 if (type == error_mark_node || error_operand_p (expr))
6320 return error_mark_node;
6322 if (processing_template_decl)
6324 tree t = build_min (CAST_EXPR, type,
6325 tree_cons (NULL_TREE, value, NULL_TREE));
6326 /* We don't know if it will or will not have side effects. */
6327 TREE_SIDE_EFFECTS (t) = 1;
6328 return convert_from_reference (t);
6331 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6332 'Class') should always be retained, because this information aids
6333 in method lookup. */
6334 if (objc_is_object_ptr (type)
6335 && objc_is_object_ptr (TREE_TYPE (expr)))
6336 return build_nop (type, expr);
6338 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6339 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6340 if (TREE_CODE (type) != REFERENCE_TYPE
6341 && TREE_CODE (value) == NOP_EXPR
6342 && TREE_TYPE (value) == TREE_TYPE (TREE_OPERAND (value, 0)))
6343 value = TREE_OPERAND (value, 0);
6345 if (TREE_CODE (type) == ARRAY_TYPE)
6347 /* Allow casting from T1* to T2[] because Cfront allows it.
6348 NIHCL uses it. It is not valid ISO C++ however. */
6349 if (TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE)
6351 if (complain & tf_error)
6352 permerror (input_location, "ISO C++ forbids casting to an array type %qT", type);
6354 return error_mark_node;
6355 type = build_pointer_type (TREE_TYPE (type));
6359 if (complain & tf_error)
6360 error ("ISO C++ forbids casting to an array type %qT", type);
6361 return error_mark_node;
6365 if (TREE_CODE (type) == FUNCTION_TYPE
6366 || TREE_CODE (type) == METHOD_TYPE)
6368 if (complain & tf_error)
6369 error ("invalid cast to function type %qT", type);
6370 return error_mark_node;
6373 if (TREE_CODE (type) == POINTER_TYPE
6374 && TREE_CODE (TREE_TYPE (value)) == INTEGER_TYPE
6375 /* Casting to an integer of smaller size is an error detected elsewhere. */
6376 && TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (value))
6377 /* Don't warn about converting any constant. */
6378 && !TREE_CONSTANT (value))
6379 warning_at (input_location, OPT_Wint_to_pointer_cast,
6380 "cast to pointer from integer of different size");
6382 /* A C-style cast can be a const_cast. */
6383 result = build_const_cast_1 (type, value, /*complain=*/false,
6388 /* Or a static cast. */
6389 result = build_static_cast_1 (type, value, /*c_cast_p=*/true,
6390 &valid_p, complain);
6391 /* Or a reinterpret_cast. */
6393 result = build_reinterpret_cast_1 (type, value, /*c_cast_p=*/true,
6394 &valid_p, complain);
6395 /* The static_cast or reinterpret_cast may be followed by a
6398 /* A valid cast may result in errors if, for example, a
6399 conversion to am ambiguous base class is required. */
6400 && !error_operand_p (result))
6404 /* Non-class rvalues always have cv-unqualified type. */
6405 if (!CLASS_TYPE_P (type))
6406 type = TYPE_MAIN_VARIANT (type);
6407 result_type = TREE_TYPE (result);
6408 if (!CLASS_TYPE_P (result_type))
6409 result_type = TYPE_MAIN_VARIANT (result_type);
6410 /* If the type of RESULT does not match TYPE, perform a
6411 const_cast to make it match. If the static_cast or
6412 reinterpret_cast succeeded, we will differ by at most
6413 cv-qualification, so the follow-on const_cast is guaranteed
6415 if (!same_type_p (non_reference (type), non_reference (result_type)))
6417 result = build_const_cast_1 (type, result, false, &valid_p);
6418 gcc_assert (valid_p);
6423 return error_mark_node;
6426 /* For use from the C common bits. */
6428 build_modify_expr (location_t location ATTRIBUTE_UNUSED,
6429 tree lhs, tree lhs_origtype ATTRIBUTE_UNUSED,
6430 enum tree_code modifycode,
6431 location_t rhs_location ATTRIBUTE_UNUSED, tree rhs,
6432 tree rhs_origtype ATTRIBUTE_UNUSED)
6434 return cp_build_modify_expr (lhs, modifycode, rhs, tf_warning_or_error);
6437 /* Build an assignment expression of lvalue LHS from value RHS.
6438 MODIFYCODE is the code for a binary operator that we use
6439 to combine the old value of LHS with RHS to get the new value.
6440 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6442 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6445 cp_build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs,
6446 tsubst_flags_t complain)
6450 tree lhstype = TREE_TYPE (lhs);
6451 tree olhstype = lhstype;
6452 bool plain_assign = (modifycode == NOP_EXPR);
6454 /* Avoid duplicate error messages from operands that had errors. */
6455 if (error_operand_p (lhs) || error_operand_p (rhs))
6456 return error_mark_node;
6458 /* Handle control structure constructs used as "lvalues". */
6459 switch (TREE_CODE (lhs))
6461 /* Handle --foo = 5; as these are valid constructs in C++. */
6462 case PREDECREMENT_EXPR:
6463 case PREINCREMENT_EXPR:
6464 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
6465 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
6466 stabilize_reference (TREE_OPERAND (lhs, 0)),
6467 TREE_OPERAND (lhs, 1));
6468 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 0),
6469 modifycode, rhs, complain);
6470 if (newrhs == error_mark_node)
6471 return error_mark_node;
6472 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
6474 /* Handle (a, b) used as an "lvalue". */
6476 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 1),
6477 modifycode, rhs, complain);
6478 if (newrhs == error_mark_node)
6479 return error_mark_node;
6480 return build2 (COMPOUND_EXPR, lhstype,
6481 TREE_OPERAND (lhs, 0), newrhs);
6484 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
6485 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
6486 stabilize_reference (TREE_OPERAND (lhs, 0)),
6487 TREE_OPERAND (lhs, 1));
6488 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 0), modifycode, rhs,
6490 if (newrhs == error_mark_node)
6491 return error_mark_node;
6492 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
6496 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6497 when neither operand has side-effects. */
6498 if (!lvalue_or_else (lhs, lv_assign, complain))
6499 return error_mark_node;
6501 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0))
6502 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 1)));
6504 lhs = build3 (COND_EXPR, TREE_TYPE (lhs),
6505 build2 (TREE_CODE (lhs) == MIN_EXPR ? LE_EXPR : GE_EXPR,
6507 TREE_OPERAND (lhs, 0),
6508 TREE_OPERAND (lhs, 1)),
6509 TREE_OPERAND (lhs, 0),
6510 TREE_OPERAND (lhs, 1));
6513 /* Handle (a ? b : c) used as an "lvalue". */
6516 /* Produce (a ? (b = rhs) : (c = rhs))
6517 except that the RHS goes through a save-expr
6518 so the code to compute it is only emitted once. */
6520 tree preeval = NULL_TREE;
6522 if (VOID_TYPE_P (TREE_TYPE (rhs)))
6524 if (complain & tf_error)
6525 error ("void value not ignored as it ought to be");
6526 return error_mark_node;
6529 rhs = stabilize_expr (rhs, &preeval);
6531 /* Check this here to avoid odd errors when trying to convert
6532 a throw to the type of the COND_EXPR. */
6533 if (!lvalue_or_else (lhs, lv_assign, complain))
6534 return error_mark_node;
6536 cond = build_conditional_expr
6537 (TREE_OPERAND (lhs, 0),
6538 cp_build_modify_expr (TREE_OPERAND (lhs, 1),
6539 modifycode, rhs, complain),
6540 cp_build_modify_expr (TREE_OPERAND (lhs, 2),
6541 modifycode, rhs, complain),
6544 if (cond == error_mark_node)
6546 /* Make sure the code to compute the rhs comes out
6547 before the split. */
6549 cond = build2 (COMPOUND_EXPR, TREE_TYPE (lhs), preeval, cond);
6557 if (modifycode == INIT_EXPR)
6559 if (BRACE_ENCLOSED_INITIALIZER_P (rhs))
6560 /* Do the default thing. */;
6561 else if (TREE_CODE (rhs) == CONSTRUCTOR)
6563 /* Compound literal. */
6564 if (! same_type_p (TREE_TYPE (rhs), lhstype))
6565 /* Call convert to generate an error; see PR 11063. */
6566 rhs = convert (lhstype, rhs);
6567 result = build2 (INIT_EXPR, lhstype, lhs, rhs);
6568 TREE_SIDE_EFFECTS (result) = 1;
6571 else if (! MAYBE_CLASS_TYPE_P (lhstype))
6572 /* Do the default thing. */;
6575 VEC(tree,gc) *rhs_vec = make_tree_vector_single (rhs);
6576 result = build_special_member_call (lhs, complete_ctor_identifier,
6577 &rhs_vec, lhstype, LOOKUP_NORMAL,
6579 release_tree_vector (rhs_vec);
6580 if (result == NULL_TREE)
6581 return error_mark_node;
6587 lhs = require_complete_type (lhs);
6588 if (lhs == error_mark_node)
6589 return error_mark_node;
6591 if (modifycode == NOP_EXPR)
6593 /* `operator=' is not an inheritable operator. */
6594 if (! MAYBE_CLASS_TYPE_P (lhstype))
6595 /* Do the default thing. */;
6598 result = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL,
6599 lhs, rhs, make_node (NOP_EXPR),
6600 /*overloaded_p=*/NULL,
6602 if (result == NULL_TREE)
6603 return error_mark_node;
6610 /* A binary op has been requested. Combine the old LHS
6611 value with the RHS producing the value we should actually
6612 store into the LHS. */
6613 gcc_assert (!((TREE_CODE (lhstype) == REFERENCE_TYPE
6614 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype)))
6615 || MAYBE_CLASS_TYPE_P (lhstype)));
6617 lhs = stabilize_reference (lhs);
6618 newrhs = cp_build_binary_op (input_location,
6619 modifycode, lhs, rhs,
6621 if (newrhs == error_mark_node)
6623 if (complain & tf_error)
6624 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode,
6625 TREE_TYPE (lhs), TREE_TYPE (rhs));
6626 return error_mark_node;
6629 /* Now it looks like a plain assignment. */
6630 modifycode = NOP_EXPR;
6632 gcc_assert (TREE_CODE (lhstype) != REFERENCE_TYPE);
6633 gcc_assert (TREE_CODE (TREE_TYPE (newrhs)) != REFERENCE_TYPE);
6636 /* The left-hand side must be an lvalue. */
6637 if (!lvalue_or_else (lhs, lv_assign, complain))
6638 return error_mark_node;
6640 /* Warn about modifying something that is `const'. Don't warn if
6641 this is initialization. */
6642 if (modifycode != INIT_EXPR
6643 && (TREE_READONLY (lhs) || CP_TYPE_CONST_P (lhstype)
6644 /* Functions are not modifiable, even though they are
6646 || TREE_CODE (TREE_TYPE (lhs)) == FUNCTION_TYPE
6647 || TREE_CODE (TREE_TYPE (lhs)) == METHOD_TYPE
6648 /* If it's an aggregate and any field is const, then it is
6649 effectively const. */
6650 || (CLASS_TYPE_P (lhstype)
6651 && C_TYPE_FIELDS_READONLY (lhstype))))
6653 if (complain & tf_error)
6654 readonly_error (lhs, REK_ASSIGNMENT);
6656 return error_mark_node;
6659 /* If storing into a structure or union member, it may have been given a
6660 lowered bitfield type. We need to convert to the declared type first,
6661 so retrieve it now. */
6663 olhstype = unlowered_expr_type (lhs);
6665 /* Convert new value to destination type. */
6667 if (TREE_CODE (lhstype) == ARRAY_TYPE)
6671 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs))
6673 if (modifycode != INIT_EXPR)
6675 if (complain & tf_error)
6676 error ("assigning to an array from an initializer list");
6677 return error_mark_node;
6679 if (check_array_initializer (lhs, lhstype, newrhs))
6680 return error_mark_node;
6681 newrhs = digest_init (lhstype, newrhs);
6684 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype),
6685 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs))))
6687 if (complain & tf_error)
6688 error ("incompatible types in assignment of %qT to %qT",
6689 TREE_TYPE (rhs), lhstype);
6690 return error_mark_node;
6693 /* Allow array assignment in compiler-generated code. */
6694 else if (!current_function_decl
6695 || !DECL_ARTIFICIAL (current_function_decl))
6697 /* This routine is used for both initialization and assignment.
6698 Make sure the diagnostic message differentiates the context. */
6699 if (complain & tf_error)
6701 if (modifycode == INIT_EXPR)
6702 error ("array used as initializer");
6704 error ("invalid array assignment");
6706 return error_mark_node;
6709 from_array = TREE_CODE (TREE_TYPE (newrhs)) == ARRAY_TYPE
6710 ? 1 + (modifycode != INIT_EXPR): 0;
6711 return build_vec_init (lhs, NULL_TREE, newrhs,
6712 /*explicit_value_init_p=*/false,
6713 from_array, complain);
6716 if (modifycode == INIT_EXPR)
6717 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6718 LOOKUP_ONLYCONVERTING. */
6719 newrhs = convert_for_initialization (lhs, olhstype, newrhs, LOOKUP_NORMAL,
6720 "initialization", NULL_TREE, 0,
6723 newrhs = convert_for_assignment (olhstype, newrhs, "assignment",
6724 NULL_TREE, 0, complain, LOOKUP_IMPLICIT);
6726 if (!same_type_p (lhstype, olhstype))
6727 newrhs = cp_convert_and_check (lhstype, newrhs);
6729 if (modifycode != INIT_EXPR)
6731 if (TREE_CODE (newrhs) == CALL_EXPR
6732 && TYPE_NEEDS_CONSTRUCTING (lhstype))
6733 newrhs = build_cplus_new (lhstype, newrhs);
6735 /* Can't initialize directly from a TARGET_EXPR, since that would
6736 cause the lhs to be constructed twice, and possibly result in
6737 accidental self-initialization. So we force the TARGET_EXPR to be
6738 expanded without a target. */
6739 if (TREE_CODE (newrhs) == TARGET_EXPR)
6740 newrhs = build2 (COMPOUND_EXPR, TREE_TYPE (newrhs), newrhs,
6741 TREE_OPERAND (newrhs, 0));
6744 if (newrhs == error_mark_node)
6745 return error_mark_node;
6747 if (c_dialect_objc () && flag_objc_gc)
6749 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
6755 result = build2 (modifycode == NOP_EXPR ? MODIFY_EXPR : INIT_EXPR,
6756 lhstype, lhs, newrhs);
6758 TREE_SIDE_EFFECTS (result) = 1;
6760 TREE_NO_WARNING (result) = 1;
6766 build_x_modify_expr (tree lhs, enum tree_code modifycode, tree rhs,
6767 tsubst_flags_t complain)
6769 if (processing_template_decl)
6770 return build_min_nt (MODOP_EXPR, lhs,
6771 build_min_nt (modifycode, NULL_TREE, NULL_TREE), rhs);
6773 if (modifycode != NOP_EXPR)
6775 tree rval = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL, lhs, rhs,
6776 make_node (modifycode),
6777 /*overloaded_p=*/NULL,
6781 TREE_NO_WARNING (rval) = 1;
6785 return cp_build_modify_expr (lhs, modifycode, rhs, complain);
6788 /* Helper function for get_delta_difference which assumes FROM is a base
6789 class of TO. Returns a delta for the conversion of pointer-to-member
6790 of FROM to pointer-to-member of TO. If the conversion is invalid,
6791 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6792 If C_CAST_P is true, this conversion is taking place as part of a C-style
6796 get_delta_difference_1 (tree from, tree to, bool c_cast_p)
6801 binfo = lookup_base (to, from, c_cast_p ? ba_unique : ba_check, &kind);
6802 if (kind == bk_inaccessible || kind == bk_ambig)
6804 error (" in pointer to member function conversion");
6805 return size_zero_node;
6809 if (kind != bk_via_virtual)
6810 return BINFO_OFFSET (binfo);
6812 /* FROM is a virtual base class of TO. Issue an error or warning
6813 depending on whether or not this is a reinterpret cast. */
6815 error ("pointer to member conversion via virtual base %qT",
6816 BINFO_TYPE (binfo_from_vbase (binfo)));
6818 return size_zero_node;
6825 /* Get difference in deltas for different pointer to member function
6826 types. Returns an integer constant of type PTRDIFF_TYPE_NODE. If
6827 the conversion is invalid, the constant is zero. If
6828 ALLOW_INVERSE_P is true, then allow reverse conversions as well.
6829 If C_CAST_P is true this conversion is taking place as part of a
6832 Note that the naming of FROM and TO is kind of backwards; the return
6833 value is what we add to a TO in order to get a FROM. They are named
6834 this way because we call this function to find out how to convert from
6835 a pointer to member of FROM to a pointer to member of TO. */
6838 get_delta_difference (tree from, tree to,
6839 bool allow_inverse_p,
6844 if (same_type_ignoring_top_level_qualifiers_p (from, to))
6845 /* Pointer to member of incomplete class is permitted*/
6846 result = size_zero_node;
6848 result = get_delta_difference_1 (from, to, c_cast_p);
6852 if (!allow_inverse_p)
6854 error_not_base_type (from, to);
6855 error (" in pointer to member conversion");
6856 result = size_zero_node;
6860 result = get_delta_difference_1 (to, from, c_cast_p);
6863 result = size_diffop_loc (input_location,
6864 size_zero_node, result);
6867 error_not_base_type (from, to);
6868 error (" in pointer to member conversion");
6869 result = size_zero_node;
6874 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node,
6878 /* Return a constructor for the pointer-to-member-function TYPE using
6879 the other components as specified. */
6882 build_ptrmemfunc1 (tree type, tree delta, tree pfn)
6887 VEC(constructor_elt, gc) *v;
6889 /* Pull the FIELD_DECLs out of the type. */
6890 pfn_field = TYPE_FIELDS (type);
6891 delta_field = TREE_CHAIN (pfn_field);
6893 /* Make sure DELTA has the type we want. */
6894 delta = convert_and_check (delta_type_node, delta);
6896 /* Convert to the correct target type if necessary. */
6897 pfn = fold_convert (TREE_TYPE (pfn_field), pfn);
6899 /* Finish creating the initializer. */
6900 v = VEC_alloc(constructor_elt, gc, 2);
6901 CONSTRUCTOR_APPEND_ELT(v, pfn_field, pfn);
6902 CONSTRUCTOR_APPEND_ELT(v, delta_field, delta);
6903 u = build_constructor (type, v);
6904 TREE_CONSTANT (u) = TREE_CONSTANT (pfn) & TREE_CONSTANT (delta);
6905 TREE_STATIC (u) = (TREE_CONSTANT (u)
6906 && (initializer_constant_valid_p (pfn, TREE_TYPE (pfn))
6908 && (initializer_constant_valid_p (delta, TREE_TYPE (delta))
6913 /* Build a constructor for a pointer to member function. It can be
6914 used to initialize global variables, local variable, or used
6915 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6918 If FORCE is nonzero, then force this conversion, even if
6919 we would rather not do it. Usually set when using an explicit
6920 cast. A C-style cast is being processed iff C_CAST_P is true.
6922 Return error_mark_node, if something goes wrong. */
6925 build_ptrmemfunc (tree type, tree pfn, int force, bool c_cast_p)
6931 if (error_operand_p (pfn))
6932 return error_mark_node;
6934 pfn_type = TREE_TYPE (pfn);
6935 to_type = build_ptrmemfunc_type (type);
6937 /* Handle multiple conversions of pointer to member functions. */
6938 if (TYPE_PTRMEMFUNC_P (pfn_type))
6940 tree delta = NULL_TREE;
6941 tree npfn = NULL_TREE;
6945 && !can_convert_arg (to_type, TREE_TYPE (pfn), pfn, LOOKUP_NORMAL))
6946 error ("invalid conversion to type %qT from type %qT",
6949 n = get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type),
6950 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type),
6954 /* We don't have to do any conversion to convert a
6955 pointer-to-member to its own type. But, we don't want to
6956 just return a PTRMEM_CST if there's an explicit cast; that
6957 cast should make the expression an invalid template argument. */
6958 if (TREE_CODE (pfn) != PTRMEM_CST)
6960 if (same_type_p (to_type, pfn_type))
6962 else if (integer_zerop (n))
6963 return build_reinterpret_cast (to_type, pfn,
6964 tf_warning_or_error);
6967 if (TREE_SIDE_EFFECTS (pfn))
6968 pfn = save_expr (pfn);
6970 /* Obtain the function pointer and the current DELTA. */
6971 if (TREE_CODE (pfn) == PTRMEM_CST)
6972 expand_ptrmemfunc_cst (pfn, &delta, &npfn);
6975 npfn = build_ptrmemfunc_access_expr (pfn, pfn_identifier);
6976 delta = build_ptrmemfunc_access_expr (pfn, delta_identifier);
6979 /* Just adjust the DELTA field. */
6980 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6981 (TREE_TYPE (delta), ptrdiff_type_node));
6982 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_delta)
6983 n = cp_build_binary_op (input_location,
6984 LSHIFT_EXPR, n, integer_one_node,
6985 tf_warning_or_error);
6986 delta = cp_build_binary_op (input_location,
6987 PLUS_EXPR, delta, n, tf_warning_or_error);
6988 return build_ptrmemfunc1 (to_type, delta, npfn);
6991 /* Handle null pointer to member function conversions. */
6992 if (integer_zerop (pfn))
6994 pfn = build_c_cast (input_location, type, integer_zero_node);
6995 return build_ptrmemfunc1 (to_type,
7000 if (type_unknown_p (pfn))
7001 return instantiate_type (type, pfn, tf_warning_or_error);
7003 fn = TREE_OPERAND (pfn, 0);
7004 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
7005 /* In a template, we will have preserved the
7007 || (processing_template_decl && TREE_CODE (fn) == OFFSET_REF));
7008 return make_ptrmem_cst (to_type, fn);
7011 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7014 ??? There is no consistency as to the types returned for the above
7015 values. Some code acts as if it were a sizetype and some as if it were
7016 integer_type_node. */
7019 expand_ptrmemfunc_cst (tree cst, tree *delta, tree *pfn)
7021 tree type = TREE_TYPE (cst);
7022 tree fn = PTRMEM_CST_MEMBER (cst);
7023 tree ptr_class, fn_class;
7025 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
7027 /* The class that the function belongs to. */
7028 fn_class = DECL_CONTEXT (fn);
7030 /* The class that we're creating a pointer to member of. */
7031 ptr_class = TYPE_PTRMEMFUNC_OBJECT_TYPE (type);
7033 /* First, calculate the adjustment to the function's class. */
7034 *delta = get_delta_difference (fn_class, ptr_class, /*force=*/0,
7037 if (!DECL_VIRTUAL_P (fn))
7038 *pfn = convert (TYPE_PTRMEMFUNC_FN_TYPE (type), build_addr_func (fn));
7041 /* If we're dealing with a virtual function, we have to adjust 'this'
7042 again, to point to the base which provides the vtable entry for
7043 fn; the call will do the opposite adjustment. */
7044 tree orig_class = DECL_CONTEXT (fn);
7045 tree binfo = binfo_or_else (orig_class, fn_class);
7046 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
7047 *delta, BINFO_OFFSET (binfo));
7048 *delta = fold_if_not_in_template (*delta);
7050 /* We set PFN to the vtable offset at which the function can be
7051 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7052 case delta is shifted left, and then incremented). */
7053 *pfn = DECL_VINDEX (fn);
7054 *pfn = build2 (MULT_EXPR, integer_type_node, *pfn,
7055 TYPE_SIZE_UNIT (vtable_entry_type));
7056 *pfn = fold_if_not_in_template (*pfn);
7058 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
7060 case ptrmemfunc_vbit_in_pfn:
7061 *pfn = build2 (PLUS_EXPR, integer_type_node, *pfn,
7063 *pfn = fold_if_not_in_template (*pfn);
7066 case ptrmemfunc_vbit_in_delta:
7067 *delta = build2 (LSHIFT_EXPR, TREE_TYPE (*delta),
7068 *delta, integer_one_node);
7069 *delta = fold_if_not_in_template (*delta);
7070 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
7071 *delta, integer_one_node);
7072 *delta = fold_if_not_in_template (*delta);
7079 *pfn = build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type), *pfn);
7080 *pfn = fold_if_not_in_template (*pfn);
7084 /* Return an expression for PFN from the pointer-to-member function
7088 pfn_from_ptrmemfunc (tree t)
7090 if (TREE_CODE (t) == PTRMEM_CST)
7095 expand_ptrmemfunc_cst (t, &delta, &pfn);
7100 return build_ptrmemfunc_access_expr (t, pfn_identifier);
7103 /* Return an expression for DELTA from the pointer-to-member function
7107 delta_from_ptrmemfunc (tree t)
7109 if (TREE_CODE (t) == PTRMEM_CST)
7114 expand_ptrmemfunc_cst (t, &delta, &pfn);
7119 return build_ptrmemfunc_access_expr (t, delta_identifier);
7122 /* Convert value RHS to type TYPE as preparation for an assignment to
7123 an lvalue of type TYPE. ERRTYPE is a string to use in error
7124 messages: "assignment", "return", etc. If FNDECL is non-NULL, we
7125 are doing the conversion in order to pass the PARMNUMth argument of
7129 convert_for_assignment (tree type, tree rhs,
7130 const char *errtype, tree fndecl, int parmnum,
7131 tsubst_flags_t complain, int flags)
7134 enum tree_code coder;
7136 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7137 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
7138 rhs = TREE_OPERAND (rhs, 0);
7140 rhstype = TREE_TYPE (rhs);
7141 coder = TREE_CODE (rhstype);
7143 if (TREE_CODE (type) == VECTOR_TYPE && coder == VECTOR_TYPE
7144 && vector_types_convertible_p (type, rhstype, true))
7145 return convert (type, rhs);
7147 if (rhs == error_mark_node || rhstype == error_mark_node)
7148 return error_mark_node;
7149 if (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node)
7150 return error_mark_node;
7152 /* The RHS of an assignment cannot have void type. */
7153 if (coder == VOID_TYPE)
7155 if (complain & tf_error)
7156 error ("void value not ignored as it ought to be");
7157 return error_mark_node;
7160 /* Simplify the RHS if possible. */
7161 if (TREE_CODE (rhs) == CONST_DECL)
7162 rhs = DECL_INITIAL (rhs);
7164 if (c_dialect_objc ())
7167 tree rname = fndecl;
7169 if (!strcmp (errtype, "assignment"))
7171 else if (!strcmp (errtype, "initialization"))
7175 tree selector = objc_message_selector ();
7179 if (selector && parmno > 1)
7186 if (objc_compare_types (type, rhstype, parmno, rname))
7187 return convert (type, rhs);
7192 The expression is implicitly converted (clause _conv_) to the
7193 cv-unqualified type of the left operand.
7195 We allow bad conversions here because by the time we get to this point
7196 we are committed to doing the conversion. If we end up doing a bad
7197 conversion, convert_like will complain. */
7198 if (!can_convert_arg_bad (type, rhstype, rhs, flags))
7200 /* When -Wno-pmf-conversions is use, we just silently allow
7201 conversions from pointers-to-members to plain pointers. If
7202 the conversion doesn't work, cp_convert will complain. */
7204 && TYPE_PTR_P (type)
7205 && TYPE_PTRMEMFUNC_P (rhstype))
7206 rhs = cp_convert (strip_top_quals (type), rhs);
7209 if (complain & tf_error)
7211 /* If the right-hand side has unknown type, then it is an
7212 overloaded function. Call instantiate_type to get error
7214 if (rhstype == unknown_type_node)
7215 instantiate_type (type, rhs, tf_warning_or_error);
7217 error ("cannot convert %qT to %qT for argument %qP to %qD",
7218 rhstype, type, parmnum, fndecl);
7220 error ("cannot convert %qT to %qT in %s", rhstype, type,
7223 return error_mark_node;
7226 if (warn_missing_format_attribute)
7228 const enum tree_code codel = TREE_CODE (type);
7229 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
7231 && check_missing_format_attribute (type, rhstype)
7232 && (complain & tf_warning))
7233 warning (OPT_Wmissing_format_attribute,
7234 "%s might be a candidate for a format attribute",
7238 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7240 if (warn_parentheses
7241 && TREE_CODE (type) == BOOLEAN_TYPE
7242 && TREE_CODE (rhs) == MODIFY_EXPR
7243 && !TREE_NO_WARNING (rhs)
7244 && TREE_CODE (TREE_TYPE (rhs)) != BOOLEAN_TYPE
7245 && (complain & tf_warning))
7247 location_t loc = EXPR_HAS_LOCATION (rhs)
7248 ? EXPR_LOCATION (rhs) : input_location;
7250 warning_at (loc, OPT_Wparentheses,
7251 "suggest parentheses around assignment used as truth value");
7252 TREE_NO_WARNING (rhs) = 1;
7255 return perform_implicit_conversion_flags (strip_top_quals (type), rhs,
7259 /* Convert RHS to be of type TYPE.
7260 If EXP is nonzero, it is the target of the initialization.
7261 ERRTYPE is a string to use in error messages.
7263 Two major differences between the behavior of
7264 `convert_for_assignment' and `convert_for_initialization'
7265 are that references are bashed in the former, while
7266 copied in the latter, and aggregates are assigned in
7267 the former (operator=) while initialized in the
7270 If using constructor make sure no conversion operator exists, if one does
7271 exist, an ambiguity exists.
7273 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7276 convert_for_initialization (tree exp, tree type, tree rhs, int flags,
7277 const char *errtype, tree fndecl, int parmnum,
7278 tsubst_flags_t complain)
7280 enum tree_code codel = TREE_CODE (type);
7282 enum tree_code coder;
7284 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7285 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7286 if (TREE_CODE (rhs) == NOP_EXPR
7287 && TREE_TYPE (rhs) == TREE_TYPE (TREE_OPERAND (rhs, 0))
7288 && codel != REFERENCE_TYPE)
7289 rhs = TREE_OPERAND (rhs, 0);
7291 if (type == error_mark_node
7292 || rhs == error_mark_node
7293 || (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node))
7294 return error_mark_node;
7296 if ((TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
7297 && TREE_CODE (type) != ARRAY_TYPE
7298 && (TREE_CODE (type) != REFERENCE_TYPE
7299 || TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE))
7300 || (TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE
7301 && (TREE_CODE (type) != REFERENCE_TYPE
7302 || TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE))
7303 || TREE_CODE (TREE_TYPE (rhs)) == METHOD_TYPE)
7304 rhs = decay_conversion (rhs);
7306 rhstype = TREE_TYPE (rhs);
7307 coder = TREE_CODE (rhstype);
7309 if (coder == ERROR_MARK)
7310 return error_mark_node;
7312 /* We accept references to incomplete types, so we can
7313 return here before checking if RHS is of complete type. */
7315 if (codel == REFERENCE_TYPE)
7317 /* This should eventually happen in convert_arguments. */
7318 int savew = 0, savee = 0;
7321 savew = warningcount, savee = errorcount;
7322 rhs = initialize_reference (type, rhs, /*decl=*/NULL_TREE,
7323 /*cleanup=*/NULL, complain);
7326 if (warningcount > savew)
7327 warning (0, "in passing argument %P of %q+D", parmnum, fndecl);
7328 else if (errorcount > savee)
7329 error ("in passing argument %P of %q+D", parmnum, fndecl);
7335 exp = require_complete_type (exp);
7336 if (exp == error_mark_node)
7337 return error_mark_node;
7339 rhstype = non_reference (rhstype);
7341 type = complete_type (type);
7343 if (DIRECT_INIT_EXPR_P (type, rhs))
7344 /* Don't try to do copy-initialization if we already have
7345 direct-initialization. */
7348 if (MAYBE_CLASS_TYPE_P (type))
7349 return ocp_convert (type, rhs, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
7351 return convert_for_assignment (type, rhs, errtype, fndecl, parmnum,
7355 /* If RETVAL is the address of, or a reference to, a local variable or
7356 temporary give an appropriate warning. */
7359 maybe_warn_about_returning_address_of_local (tree retval)
7361 tree valtype = TREE_TYPE (DECL_RESULT (current_function_decl));
7362 tree whats_returned = retval;
7366 if (TREE_CODE (whats_returned) == COMPOUND_EXPR)
7367 whats_returned = TREE_OPERAND (whats_returned, 1);
7368 else if (CONVERT_EXPR_P (whats_returned)
7369 || TREE_CODE (whats_returned) == NON_LVALUE_EXPR)
7370 whats_returned = TREE_OPERAND (whats_returned, 0);
7375 if (TREE_CODE (whats_returned) != ADDR_EXPR)
7377 whats_returned = TREE_OPERAND (whats_returned, 0);
7379 if (TREE_CODE (valtype) == REFERENCE_TYPE)
7381 if (TREE_CODE (whats_returned) == AGGR_INIT_EXPR
7382 || TREE_CODE (whats_returned) == TARGET_EXPR)
7384 warning (0, "returning reference to temporary");
7387 if (TREE_CODE (whats_returned) == VAR_DECL
7388 && DECL_NAME (whats_returned)
7389 && TEMP_NAME_P (DECL_NAME (whats_returned)))
7391 warning (0, "reference to non-lvalue returned");
7396 while (TREE_CODE (whats_returned) == COMPONENT_REF
7397 || TREE_CODE (whats_returned) == ARRAY_REF)
7398 whats_returned = TREE_OPERAND (whats_returned, 0);
7400 if (DECL_P (whats_returned)
7401 && DECL_NAME (whats_returned)
7402 && DECL_FUNCTION_SCOPE_P (whats_returned)
7403 && !(TREE_STATIC (whats_returned)
7404 || TREE_PUBLIC (whats_returned)))
7406 if (TREE_CODE (valtype) == REFERENCE_TYPE)
7407 warning (0, "reference to local variable %q+D returned",
7410 warning (0, "address of local variable %q+D returned",
7416 /* Check that returning RETVAL from the current function is valid.
7417 Return an expression explicitly showing all conversions required to
7418 change RETVAL into the function return type, and to assign it to
7419 the DECL_RESULT for the function. Set *NO_WARNING to true if
7420 code reaches end of non-void function warning shouldn't be issued
7421 on this RETURN_EXPR. */
7424 check_return_expr (tree retval, bool *no_warning)
7427 /* The type actually returned by the function, after any
7430 int fn_returns_value_p;
7431 bool named_return_value_okay_p;
7433 *no_warning = false;
7435 /* A `volatile' function is one that isn't supposed to return, ever.
7436 (This is a G++ extension, used to get better code for functions
7437 that call the `volatile' function.) */
7438 if (TREE_THIS_VOLATILE (current_function_decl))
7439 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7441 /* Check for various simple errors. */
7442 if (DECL_DESTRUCTOR_P (current_function_decl))
7445 error ("returning a value from a destructor");
7448 else if (DECL_CONSTRUCTOR_P (current_function_decl))
7450 if (in_function_try_handler)
7451 /* If a return statement appears in a handler of the
7452 function-try-block of a constructor, the program is ill-formed. */
7453 error ("cannot return from a handler of a function-try-block of a constructor");
7455 /* You can't return a value from a constructor. */
7456 error ("returning a value from a constructor");
7460 /* As an extension, deduce lambda return type from a return statement
7461 anywhere in the body. */
7462 if (retval && LAMBDA_FUNCTION_P (current_function_decl))
7464 tree lambda = CLASSTYPE_LAMBDA_EXPR (current_class_type);
7465 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda))
7467 tree type = lambda_return_type (retval);
7468 tree oldtype = LAMBDA_EXPR_RETURN_TYPE (lambda);
7470 if (VOID_TYPE_P (type))
7472 else if (oldtype == NULL_TREE)
7474 pedwarn (input_location, OPT_pedantic, "lambda return type "
7475 "can only be deduced when the return statement is "
7476 "the only statement in the function body");
7477 apply_lambda_return_type (lambda, type);
7479 else if (!same_type_p (type, oldtype))
7480 error ("inconsistent types %qT and %qT deduced for "
7481 "lambda return type", type, oldtype);
7485 if (processing_template_decl)
7487 current_function_returns_value = 1;
7488 if (check_for_bare_parameter_packs (retval))
7489 retval = error_mark_node;
7493 /* When no explicit return-value is given in a function with a named
7494 return value, the named return value is used. */
7495 result = DECL_RESULT (current_function_decl);
7496 valtype = TREE_TYPE (result);
7497 gcc_assert (valtype != NULL_TREE);
7498 fn_returns_value_p = !VOID_TYPE_P (valtype);
7499 if (!retval && DECL_NAME (result) && fn_returns_value_p)
7502 /* Check for a return statement with no return value in a function
7503 that's supposed to return a value. */
7504 if (!retval && fn_returns_value_p)
7506 permerror (input_location, "return-statement with no value, in function returning %qT",
7508 /* Clear this, so finish_function won't say that we reach the
7509 end of a non-void function (which we don't, we gave a
7511 current_function_returns_null = 0;
7512 /* And signal caller that TREE_NO_WARNING should be set on the
7513 RETURN_EXPR to avoid control reaches end of non-void function
7514 warnings in tree-cfg.c. */
7517 /* Check for a return statement with a value in a function that
7518 isn't supposed to return a value. */
7519 else if (retval && !fn_returns_value_p)
7521 if (VOID_TYPE_P (TREE_TYPE (retval)))
7522 /* You can return a `void' value from a function of `void'
7523 type. In that case, we have to evaluate the expression for
7524 its side-effects. */
7525 finish_expr_stmt (retval);
7527 permerror (input_location, "return-statement with a value, in function "
7528 "returning 'void'");
7529 current_function_returns_null = 1;
7531 /* There's really no value to return, after all. */
7535 /* Remember that this function can sometimes return without a
7537 current_function_returns_null = 1;
7539 /* Remember that this function did return a value. */
7540 current_function_returns_value = 1;
7542 /* Check for erroneous operands -- but after giving ourselves a
7543 chance to provide an error about returning a value from a void
7545 if (error_operand_p (retval))
7547 current_function_return_value = error_mark_node;
7548 return error_mark_node;
7551 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7552 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl) == NEW_EXPR
7553 || DECL_OVERLOADED_OPERATOR_P (current_function_decl) == VEC_NEW_EXPR)
7554 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl))
7556 && retval && null_ptr_cst_p (retval))
7557 warning (0, "%<operator new%> must not return NULL unless it is "
7558 "declared %<throw()%> (or -fcheck-new is in effect)");
7560 /* Effective C++ rule 15. See also start_function. */
7562 && DECL_NAME (current_function_decl) == ansi_assopname(NOP_EXPR))
7566 /* The function return type must be a reference to the current
7568 if (TREE_CODE (valtype) == REFERENCE_TYPE
7569 && same_type_ignoring_top_level_qualifiers_p
7570 (TREE_TYPE (valtype), TREE_TYPE (current_class_ref)))
7572 /* Returning '*this' is obviously OK. */
7573 if (retval == current_class_ref)
7575 /* If we are calling a function whose return type is the same of
7576 the current class reference, it is ok. */
7577 else if (TREE_CODE (retval) == INDIRECT_REF
7578 && TREE_CODE (TREE_OPERAND (retval, 0)) == CALL_EXPR)
7583 warning (OPT_Weffc__, "%<operator=%> should return a reference to %<*this%>");
7586 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7588 [...] For a function with a class return type, if the expression
7589 in the return statement is the name of a local object, and the cv-
7590 unqualified type of the local object is the same as the function
7591 return type, an implementation is permitted to omit creating the tem-
7592 porary object to hold the function return value [...]
7594 So, if this is a value-returning function that always returns the same
7595 local variable, remember it.
7597 It might be nice to be more flexible, and choose the first suitable
7598 variable even if the function sometimes returns something else, but
7599 then we run the risk of clobbering the variable we chose if the other
7600 returned expression uses the chosen variable somehow. And people expect
7601 this restriction, anyway. (jason 2000-11-19)
7603 See finish_function and finalize_nrv for the rest of this optimization. */
7605 named_return_value_okay_p =
7606 (retval != NULL_TREE
7607 /* Must be a local, automatic variable. */
7608 && TREE_CODE (retval) == VAR_DECL
7609 && DECL_CONTEXT (retval) == current_function_decl
7610 && ! TREE_STATIC (retval)
7611 && ! DECL_ANON_UNION_VAR_P (retval)
7612 && (DECL_ALIGN (retval)
7613 >= DECL_ALIGN (DECL_RESULT (current_function_decl)))
7614 /* The cv-unqualified type of the returned value must be the
7615 same as the cv-unqualified return type of the
7617 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval))),
7619 (TREE_TYPE (TREE_TYPE (current_function_decl)))))
7620 /* And the returned value must be non-volatile. */
7621 && ! TYPE_VOLATILE (TREE_TYPE (retval)));
7623 if (fn_returns_value_p && flag_elide_constructors)
7625 if (named_return_value_okay_p
7626 && (current_function_return_value == NULL_TREE
7627 || current_function_return_value == retval))
7628 current_function_return_value = retval;
7630 current_function_return_value = error_mark_node;
7633 /* We don't need to do any conversions when there's nothing being
7638 /* Do any required conversions. */
7639 if (retval == result || DECL_CONSTRUCTOR_P (current_function_decl))
7640 /* No conversions are required. */
7644 /* The type the function is declared to return. */
7645 tree functype = TREE_TYPE (TREE_TYPE (current_function_decl));
7646 int flags = LOOKUP_NORMAL | LOOKUP_ONLYCONVERTING;
7648 /* The functype's return type will have been set to void, if it
7649 was an incomplete type. Just treat this as 'return;' */
7650 if (VOID_TYPE_P (functype))
7651 return error_mark_node;
7653 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7654 treated as an rvalue for the purposes of overload resolution to
7655 favor move constructors over copy constructors. */
7656 if ((cxx_dialect != cxx98)
7657 && named_return_value_okay_p
7658 /* The variable must not have the `volatile' qualifier. */
7659 && !CP_TYPE_VOLATILE_P (TREE_TYPE (retval))
7660 /* The return type must be a class type. */
7661 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
7662 flags = flags | LOOKUP_PREFER_RVALUE;
7664 /* First convert the value to the function's return type, then
7665 to the type of return value's location to handle the
7666 case that functype is smaller than the valtype. */
7667 retval = convert_for_initialization
7668 (NULL_TREE, functype, retval, flags, "return", NULL_TREE, 0,
7669 tf_warning_or_error);
7670 retval = convert (valtype, retval);
7672 /* If the conversion failed, treat this just like `return;'. */
7673 if (retval == error_mark_node)
7675 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7676 else if (! cfun->returns_struct
7677 && TREE_CODE (retval) == TARGET_EXPR
7678 && TREE_CODE (TREE_OPERAND (retval, 1)) == AGGR_INIT_EXPR)
7679 retval = build2 (COMPOUND_EXPR, TREE_TYPE (retval), retval,
7680 TREE_OPERAND (retval, 0));
7682 maybe_warn_about_returning_address_of_local (retval);
7685 /* Actually copy the value returned into the appropriate location. */
7686 if (retval && retval != result)
7687 retval = build2 (INIT_EXPR, TREE_TYPE (result), result, retval);
7693 /* Returns nonzero if the pointer-type FROM can be converted to the
7694 pointer-type TO via a qualification conversion. If CONSTP is -1,
7695 then we return nonzero if the pointers are similar, and the
7696 cv-qualification signature of FROM is a proper subset of that of TO.
7698 If CONSTP is positive, then all outer pointers have been
7702 comp_ptr_ttypes_real (tree to, tree from, int constp)
7704 bool to_more_cv_qualified = false;
7705 bool is_opaque_pointer = false;
7707 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7709 if (TREE_CODE (to) != TREE_CODE (from))
7712 if (TREE_CODE (from) == OFFSET_TYPE
7713 && !same_type_p (TYPE_OFFSET_BASETYPE (from),
7714 TYPE_OFFSET_BASETYPE (to)))
7717 /* Const and volatile mean something different for function types,
7718 so the usual checks are not appropriate. */
7719 if (TREE_CODE (to) != FUNCTION_TYPE && TREE_CODE (to) != METHOD_TYPE)
7721 /* In Objective-C++, some types may have been 'volatilized' by
7722 the compiler for EH; when comparing them here, the volatile
7723 qualification must be ignored. */
7724 bool objc_quals_match = objc_type_quals_match (to, from);
7726 if (!at_least_as_qualified_p (to, from) && !objc_quals_match)
7729 if (!at_least_as_qualified_p (from, to) && !objc_quals_match)
7733 to_more_cv_qualified = true;
7737 constp &= TYPE_READONLY (to);
7740 if (TREE_CODE (to) == VECTOR_TYPE)
7741 is_opaque_pointer = vector_targets_convertible_p (to, from);
7743 if (TREE_CODE (to) != POINTER_TYPE && !TYPE_PTRMEM_P (to))
7744 return ((constp >= 0 || to_more_cv_qualified)
7745 && (is_opaque_pointer
7746 || same_type_ignoring_top_level_qualifiers_p (to, from)));
7750 /* When comparing, say, char ** to char const **, this function takes
7751 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7752 types to this function. */
7755 comp_ptr_ttypes (tree to, tree from)
7757 return comp_ptr_ttypes_real (to, from, 1);
7760 /* Returns true iff FNTYPE is a non-class type that involves
7761 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7762 if a parameter type is ill-formed. */
7765 error_type_p (const_tree type)
7769 switch (TREE_CODE (type))
7775 case REFERENCE_TYPE:
7777 return error_type_p (TREE_TYPE (type));
7781 if (error_type_p (TREE_TYPE (type)))
7783 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
7784 if (error_type_p (TREE_VALUE (t)))
7789 if (TYPE_PTRMEMFUNC_P (type))
7790 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type));
7798 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7799 type or inheritance-related types, regardless of cv-quals. */
7802 ptr_reasonably_similar (const_tree to, const_tree from)
7804 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7806 /* Any target type is similar enough to void. */
7807 if (TREE_CODE (to) == VOID_TYPE)
7808 return !error_type_p (from);
7809 if (TREE_CODE (from) == VOID_TYPE)
7810 return !error_type_p (to);
7812 if (TREE_CODE (to) != TREE_CODE (from))
7815 if (TREE_CODE (from) == OFFSET_TYPE
7816 && comptypes (TYPE_OFFSET_BASETYPE (to),
7817 TYPE_OFFSET_BASETYPE (from),
7818 COMPARE_BASE | COMPARE_DERIVED))
7821 if (TREE_CODE (to) == VECTOR_TYPE
7822 && vector_types_convertible_p (to, from, false))
7825 if (TREE_CODE (to) == INTEGER_TYPE
7826 && TYPE_PRECISION (to) == TYPE_PRECISION (from))
7829 if (TREE_CODE (to) == FUNCTION_TYPE)
7830 return !error_type_p (to) && !error_type_p (from);
7832 if (TREE_CODE (to) != POINTER_TYPE)
7834 (TYPE_MAIN_VARIANT (to), TYPE_MAIN_VARIANT (from),
7835 COMPARE_BASE | COMPARE_DERIVED);
7839 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
7840 pointer-to-member types) are the same, ignoring cv-qualification at
7844 comp_ptr_ttypes_const (tree to, tree from)
7846 bool is_opaque_pointer = false;
7848 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7850 if (TREE_CODE (to) != TREE_CODE (from))
7853 if (TREE_CODE (from) == OFFSET_TYPE
7854 && same_type_p (TYPE_OFFSET_BASETYPE (from),
7855 TYPE_OFFSET_BASETYPE (to)))
7858 if (TREE_CODE (to) == VECTOR_TYPE)
7859 is_opaque_pointer = vector_targets_convertible_p (to, from);
7861 if (TREE_CODE (to) != POINTER_TYPE)
7862 return (is_opaque_pointer
7863 || same_type_ignoring_top_level_qualifiers_p (to, from));
7867 /* Returns the type qualifiers for this type, including the qualifiers on the
7868 elements for an array type. */
7871 cp_type_quals (const_tree type)
7874 /* This CONST_CAST is okay because strip_array_types returns its
7875 argument unmodified and we assign it to a const_tree. */
7876 type = strip_array_types (CONST_CAST_TREE (type));
7877 if (type == error_mark_node
7878 /* Quals on a FUNCTION_TYPE are memfn quals. */
7879 || TREE_CODE (type) == FUNCTION_TYPE)
7880 return TYPE_UNQUALIFIED;
7881 quals = TYPE_QUALS (type);
7882 /* METHOD and REFERENCE_TYPEs should never have quals. */
7883 gcc_assert ((TREE_CODE (type) != METHOD_TYPE
7884 && TREE_CODE (type) != REFERENCE_TYPE)
7885 || ((quals & (TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE))
7886 == TYPE_UNQUALIFIED));
7890 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
7894 type_memfn_quals (const_tree type)
7896 if (TREE_CODE (type) == FUNCTION_TYPE)
7897 return TYPE_QUALS (type);
7898 else if (TREE_CODE (type) == METHOD_TYPE)
7899 return cp_type_quals (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))));
7904 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
7908 apply_memfn_quals (tree type, cp_cv_quals memfn_quals)
7910 /* Could handle METHOD_TYPE here if necessary. */
7911 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
7912 if (TYPE_QUALS (type) == memfn_quals)
7914 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
7916 return build_qualified_type (type, memfn_quals);
7919 /* Returns nonzero if TYPE is const or volatile. */
7922 cv_qualified_p (const_tree type)
7924 int quals = cp_type_quals (type);
7925 return (quals & (TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE)) != 0;
7928 /* Returns nonzero if the TYPE contains a mutable member. */
7931 cp_has_mutable_p (const_tree type)
7933 /* This CONST_CAST is okay because strip_array_types returns its
7934 argument unmodified and we assign it to a const_tree. */
7935 type = strip_array_types (CONST_CAST_TREE(type));
7937 return CLASS_TYPE_P (type) && CLASSTYPE_HAS_MUTABLE (type);
7940 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
7941 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
7942 approximation. In particular, consider:
7945 struct S { int i; };
7946 const S s = { f(); }
7948 Here, we will make "s" as TREE_READONLY (because it is declared
7949 "const") -- only to reverse ourselves upon seeing that the
7950 initializer is non-constant. */
7953 cp_apply_type_quals_to_decl (int type_quals, tree decl)
7955 tree type = TREE_TYPE (decl);
7957 if (type == error_mark_node)
7960 if (TREE_CODE (decl) == TYPE_DECL)
7963 gcc_assert (!(TREE_CODE (type) == FUNCTION_TYPE
7964 && type_quals != TYPE_UNQUALIFIED));
7966 /* Avoid setting TREE_READONLY incorrectly. */
7967 if (/* If the object has a constructor, the constructor may modify
7969 TYPE_NEEDS_CONSTRUCTING (type)
7970 /* If the type isn't complete, we don't know yet if it will need
7972 || !COMPLETE_TYPE_P (type)
7973 /* If the type has a mutable component, that component might be
7975 || TYPE_HAS_MUTABLE_P (type))
7976 type_quals &= ~TYPE_QUAL_CONST;
7978 c_apply_type_quals_to_decl (type_quals, decl);
7981 /* Subroutine of casts_away_constness. Make T1 and T2 point at
7982 exemplar types such that casting T1 to T2 is casting away constness
7983 if and only if there is no implicit conversion from T1 to T2. */
7986 casts_away_constness_r (tree *t1, tree *t2)
7991 /* [expr.const.cast]
7993 For multi-level pointer to members and multi-level mixed pointers
7994 and pointers to members (conv.qual), the "member" aspect of a
7995 pointer to member level is ignored when determining if a const
7996 cv-qualifier has been cast away. */
7997 /* [expr.const.cast]
7999 For two pointer types:
8001 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8002 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8005 casting from X1 to X2 casts away constness if, for a non-pointer
8006 type T there does not exist an implicit conversion (clause
8009 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8013 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8014 if ((!TYPE_PTR_P (*t1) && !TYPE_PTRMEM_P (*t1))
8015 || (!TYPE_PTR_P (*t2) && !TYPE_PTRMEM_P (*t2)))
8017 *t1 = cp_build_qualified_type (void_type_node,
8018 cp_type_quals (*t1));
8019 *t2 = cp_build_qualified_type (void_type_node,
8020 cp_type_quals (*t2));
8024 quals1 = cp_type_quals (*t1);
8025 quals2 = cp_type_quals (*t2);
8027 if (TYPE_PTRMEM_P (*t1))
8028 *t1 = TYPE_PTRMEM_POINTED_TO_TYPE (*t1);
8030 *t1 = TREE_TYPE (*t1);
8031 if (TYPE_PTRMEM_P (*t2))
8032 *t2 = TYPE_PTRMEM_POINTED_TO_TYPE (*t2);
8034 *t2 = TREE_TYPE (*t2);
8036 casts_away_constness_r (t1, t2);
8037 *t1 = build_pointer_type (*t1);
8038 *t2 = build_pointer_type (*t2);
8039 *t1 = cp_build_qualified_type (*t1, quals1);
8040 *t2 = cp_build_qualified_type (*t2, quals2);
8043 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8046 ??? This function returns non-zero if casting away qualifiers not
8047 just const. We would like to return to the caller exactly which
8048 qualifiers are casted away to give more accurate diagnostics.
8052 casts_away_constness (tree t1, tree t2)
8054 if (TREE_CODE (t2) == REFERENCE_TYPE)
8056 /* [expr.const.cast]
8058 Casting from an lvalue of type T1 to an lvalue of type T2
8059 using a reference cast casts away constness if a cast from an
8060 rvalue of type "pointer to T1" to the type "pointer to T2"
8061 casts away constness. */
8062 t1 = (TREE_CODE (t1) == REFERENCE_TYPE ? TREE_TYPE (t1) : t1);
8063 return casts_away_constness (build_pointer_type (t1),
8064 build_pointer_type (TREE_TYPE (t2)));
8067 if (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2))
8068 /* [expr.const.cast]
8070 Casting from an rvalue of type "pointer to data member of X
8071 of type T1" to the type "pointer to data member of Y of type
8072 T2" casts away constness if a cast from an rvalue of type
8073 "pointer to T1" to the type "pointer to T2" casts away
8075 return casts_away_constness
8076 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1)),
8077 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2)));
8079 /* Casting away constness is only something that makes sense for
8080 pointer or reference types. */
8081 if (TREE_CODE (t1) != POINTER_TYPE
8082 || TREE_CODE (t2) != POINTER_TYPE)
8085 /* Top-level qualifiers don't matter. */
8086 t1 = TYPE_MAIN_VARIANT (t1);
8087 t2 = TYPE_MAIN_VARIANT (t2);
8088 casts_away_constness_r (&t1, &t2);
8089 if (!can_convert (t2, t1))
8095 /* If T is a REFERENCE_TYPE return the type to which T refers.
8096 Otherwise, return T itself. */
8099 non_reference (tree t)
8101 if (TREE_CODE (t) == REFERENCE_TYPE)
8107 /* Return nonzero if REF is an lvalue valid for this language;
8108 otherwise, print an error message and return zero. USE says
8109 how the lvalue is being used and so selects the error message. */
8112 lvalue_or_else (tree ref, enum lvalue_use use, tsubst_flags_t complain)
8114 int win = lvalue_p (ref);
8116 if (!win && (complain & tf_error))