1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011
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"
37 #include "diagnostic.h"
41 #include "c-family/c-common.h"
42 #include "c-family/c-objc.h"
45 static tree pfn_from_ptrmemfunc (tree);
46 static tree delta_from_ptrmemfunc (tree);
47 static tree convert_for_assignment (tree, tree, impl_conv_rhs, tree, int,
49 static tree cp_pointer_int_sum (enum tree_code, tree, tree);
50 static tree rationalize_conditional_expr (enum tree_code, tree,
52 static int comp_ptr_ttypes_real (tree, tree, int);
53 static bool comp_except_types (tree, tree, bool);
54 static bool comp_array_types (const_tree, const_tree, bool);
55 static tree pointer_diff (tree, tree, tree);
56 static tree get_delta_difference (tree, tree, bool, bool, tsubst_flags_t);
57 static void casts_away_constness_r (tree *, tree *);
58 static bool casts_away_constness (tree, tree);
59 static void maybe_warn_about_returning_address_of_local (tree);
60 static tree lookup_destructor (tree, tree, tree);
61 static void warn_args_num (location_t, tree, bool);
62 static int convert_arguments (tree, VEC(tree,gc) **, tree, int,
65 /* Do `exp = require_complete_type (exp);' to make sure exp
66 does not have an incomplete type. (That includes void types.)
67 Returns error_mark_node if the VALUE does not have
68 complete type when this function returns. */
71 require_complete_type_sfinae (tree value, tsubst_flags_t complain)
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_maybe_complain (type, value, complain))
93 return error_mark_node;
97 require_complete_type (tree value)
99 return require_complete_type_sfinae (value, tf_warning_or_error);
102 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
103 a template instantiation, do the instantiation. Returns TYPE,
104 whether or not it could be completed, unless something goes
105 horribly wrong, in which case the error_mark_node is returned. */
108 complete_type (tree type)
110 if (type == NULL_TREE)
111 /* Rather than crash, we return something sure to cause an error
113 return error_mark_node;
115 if (type == error_mark_node || COMPLETE_TYPE_P (type))
117 else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type))
119 tree t = complete_type (TREE_TYPE (type));
120 unsigned int needs_constructing, has_nontrivial_dtor;
121 if (COMPLETE_TYPE_P (t) && !dependent_type_p (type))
124 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t));
126 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t));
127 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
129 TYPE_NEEDS_CONSTRUCTING (t) = needs_constructing;
130 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) = has_nontrivial_dtor;
133 else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INSTANTIATION (type))
134 instantiate_class_template (TYPE_MAIN_VARIANT (type));
139 /* Like complete_type, but issue an error if the TYPE cannot be completed.
140 VALUE is used for informative diagnostics.
141 Returns NULL_TREE if the type cannot be made complete. */
144 complete_type_or_maybe_complain (tree type, tree value, tsubst_flags_t complain)
146 type = complete_type (type);
147 if (type == error_mark_node)
148 /* We already issued an error. */
150 else if (!COMPLETE_TYPE_P (type))
152 if (complain & tf_error)
153 cxx_incomplete_type_diagnostic (value, type, DK_ERROR);
161 complete_type_or_else (tree type, tree value)
163 return complete_type_or_maybe_complain (type, value, tf_warning_or_error);
166 /* Return truthvalue of whether type of EXP is instantiated. */
169 type_unknown_p (const_tree exp)
171 return (TREE_CODE (exp) == TREE_LIST
172 || TREE_TYPE (exp) == unknown_type_node);
176 /* Return the common type of two parameter lists.
177 We assume that comptypes has already been done and returned 1;
178 if that isn't so, this may crash.
180 As an optimization, free the space we allocate if the parameter
181 lists are already common. */
184 commonparms (tree p1, tree p2)
186 tree oldargs = p1, newargs, n;
190 len = list_length (p1);
191 newargs = tree_last (p1);
193 if (newargs == void_list_node)
202 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
207 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n), i++)
209 if (TREE_PURPOSE (p1) && !TREE_PURPOSE (p2))
211 TREE_PURPOSE (n) = TREE_PURPOSE (p1);
214 else if (! TREE_PURPOSE (p1))
216 if (TREE_PURPOSE (p2))
218 TREE_PURPOSE (n) = TREE_PURPOSE (p2);
224 if (1 != simple_cst_equal (TREE_PURPOSE (p1), TREE_PURPOSE (p2)))
226 TREE_PURPOSE (n) = TREE_PURPOSE (p2);
228 if (TREE_VALUE (p1) != TREE_VALUE (p2))
231 TREE_VALUE (n) = merge_types (TREE_VALUE (p1), TREE_VALUE (p2));
234 TREE_VALUE (n) = TREE_VALUE (p1);
242 /* Given a type, perhaps copied for a typedef,
243 find the "original" version of it. */
245 original_type (tree t)
247 int quals = cp_type_quals (t);
248 while (t != error_mark_node
249 && TYPE_NAME (t) != NULL_TREE)
251 tree x = TYPE_NAME (t);
252 if (TREE_CODE (x) != TYPE_DECL)
254 x = DECL_ORIGINAL_TYPE (x);
259 return cp_build_qualified_type (t, quals);
262 /* Return the common type for two arithmetic types T1 and T2 under the
263 usual arithmetic conversions. The default conversions have already
264 been applied, and enumerated types converted to their compatible
268 cp_common_type (tree t1, tree t2)
270 enum tree_code code1 = TREE_CODE (t1);
271 enum tree_code code2 = TREE_CODE (t2);
275 /* In what follows, we slightly generalize the rules given in [expr] so
276 as to deal with `long long' and `complex'. First, merge the
278 attributes = (*targetm.merge_type_attributes) (t1, t2);
280 if (SCOPED_ENUM_P (t1) || SCOPED_ENUM_P (t2))
282 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
283 return build_type_attribute_variant (t1, attributes);
288 /* FIXME: Attributes. */
289 gcc_assert (ARITHMETIC_TYPE_P (t1)
290 || TREE_CODE (t1) == VECTOR_TYPE
291 || UNSCOPED_ENUM_P (t1));
292 gcc_assert (ARITHMETIC_TYPE_P (t2)
293 || TREE_CODE (t2) == VECTOR_TYPE
294 || UNSCOPED_ENUM_P (t2));
296 /* If one type is complex, form the common type of the non-complex
297 components, then make that complex. Use T1 or T2 if it is the
299 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
301 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
302 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
304 = type_after_usual_arithmetic_conversions (subtype1, subtype2);
306 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
307 return build_type_attribute_variant (t1, attributes);
308 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
309 return build_type_attribute_variant (t2, attributes);
311 return build_type_attribute_variant (build_complex_type (subtype),
315 if (code1 == VECTOR_TYPE)
317 /* When we get here we should have two vectors of the same size.
318 Just prefer the unsigned one if present. */
319 if (TYPE_UNSIGNED (t1))
320 return build_type_attribute_variant (t1, attributes);
322 return build_type_attribute_variant (t2, attributes);
325 /* If only one is real, use it as the result. */
326 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
327 return build_type_attribute_variant (t1, attributes);
328 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
329 return build_type_attribute_variant (t2, attributes);
331 /* Both real or both integers; use the one with greater precision. */
332 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
333 return build_type_attribute_variant (t1, attributes);
334 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
335 return build_type_attribute_variant (t2, attributes);
337 /* The types are the same; no need to do anything fancy. */
338 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
339 return build_type_attribute_variant (t1, attributes);
341 if (code1 != REAL_TYPE)
343 /* If one is unsigned long long, then convert the other to unsigned
345 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_unsigned_type_node)
346 || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_unsigned_type_node))
347 return build_type_attribute_variant (long_long_unsigned_type_node,
349 /* If one is a long long, and the other is an unsigned long, and
350 long long can represent all the values of an unsigned long, then
351 convert to a long long. Otherwise, convert to an unsigned long
352 long. Otherwise, if either operand is long long, convert the
355 Since we're here, we know the TYPE_PRECISION is the same;
356 therefore converting to long long cannot represent all the values
357 of an unsigned long, so we choose unsigned long long in that
359 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_integer_type_node)
360 || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_integer_type_node))
362 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
363 ? long_long_unsigned_type_node
364 : long_long_integer_type_node);
365 return build_type_attribute_variant (t, attributes);
367 if (int128_integer_type_node != NULL_TREE
368 && (same_type_p (TYPE_MAIN_VARIANT (t1),
369 int128_integer_type_node)
370 || same_type_p (TYPE_MAIN_VARIANT (t2),
371 int128_integer_type_node)))
373 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
374 ? int128_unsigned_type_node
375 : int128_integer_type_node);
376 return build_type_attribute_variant (t, attributes);
379 /* Go through the same procedure, but for longs. */
380 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_unsigned_type_node)
381 || same_type_p (TYPE_MAIN_VARIANT (t2), long_unsigned_type_node))
382 return build_type_attribute_variant (long_unsigned_type_node,
384 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_integer_type_node)
385 || same_type_p (TYPE_MAIN_VARIANT (t2), long_integer_type_node))
387 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
388 ? long_unsigned_type_node : long_integer_type_node);
389 return build_type_attribute_variant (t, attributes);
391 /* Otherwise prefer the unsigned one. */
392 if (TYPE_UNSIGNED (t1))
393 return build_type_attribute_variant (t1, attributes);
395 return build_type_attribute_variant (t2, attributes);
399 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_double_type_node)
400 || same_type_p (TYPE_MAIN_VARIANT (t2), long_double_type_node))
401 return build_type_attribute_variant (long_double_type_node,
403 if (same_type_p (TYPE_MAIN_VARIANT (t1), double_type_node)
404 || same_type_p (TYPE_MAIN_VARIANT (t2), double_type_node))
405 return build_type_attribute_variant (double_type_node,
407 if (same_type_p (TYPE_MAIN_VARIANT (t1), float_type_node)
408 || same_type_p (TYPE_MAIN_VARIANT (t2), float_type_node))
409 return build_type_attribute_variant (float_type_node,
412 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
413 the standard C++ floating-point types. Logic earlier in this
414 function has already eliminated the possibility that
415 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
416 compelling reason to choose one or the other. */
417 return build_type_attribute_variant (t1, attributes);
421 /* T1 and T2 are arithmetic or enumeration types. Return the type
422 that will result from the "usual arithmetic conversions" on T1 and
423 T2 as described in [expr]. */
426 type_after_usual_arithmetic_conversions (tree t1, tree t2)
428 gcc_assert (ARITHMETIC_TYPE_P (t1)
429 || TREE_CODE (t1) == VECTOR_TYPE
430 || UNSCOPED_ENUM_P (t1));
431 gcc_assert (ARITHMETIC_TYPE_P (t2)
432 || TREE_CODE (t2) == VECTOR_TYPE
433 || UNSCOPED_ENUM_P (t2));
435 /* Perform the integral promotions. We do not promote real types here. */
436 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1)
437 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2))
439 t1 = type_promotes_to (t1);
440 t2 = type_promotes_to (t2);
443 return cp_common_type (t1, t2);
447 composite_pointer_error (diagnostic_t kind, tree t1, tree t2,
448 composite_pointer_operation operation)
453 emit_diagnostic (kind, input_location, 0,
454 "comparison between "
455 "distinct pointer types %qT and %qT lacks a cast",
459 emit_diagnostic (kind, input_location, 0,
460 "conversion between "
461 "distinct pointer types %qT and %qT lacks a cast",
464 case CPO_CONDITIONAL_EXPR:
465 emit_diagnostic (kind, input_location, 0,
466 "conditional expression between "
467 "distinct pointer types %qT and %qT lacks a cast",
475 /* Subroutine of composite_pointer_type to implement the recursive
476 case. See that function for documentation of the parameters. */
479 composite_pointer_type_r (tree t1, tree t2,
480 composite_pointer_operation operation,
481 tsubst_flags_t complain)
488 /* Determine the types pointed to by T1 and T2. */
489 if (TREE_CODE (t1) == POINTER_TYPE)
491 pointee1 = TREE_TYPE (t1);
492 pointee2 = TREE_TYPE (t2);
496 pointee1 = TYPE_PTRMEM_POINTED_TO_TYPE (t1);
497 pointee2 = TYPE_PTRMEM_POINTED_TO_TYPE (t2);
502 Otherwise, the composite pointer type is a pointer type
503 similar (_conv.qual_) to the type of one of the operands,
504 with a cv-qualification signature (_conv.qual_) that is the
505 union of the cv-qualification signatures of the operand
507 if (same_type_ignoring_top_level_qualifiers_p (pointee1, pointee2))
508 result_type = pointee1;
509 else if ((TREE_CODE (pointee1) == POINTER_TYPE
510 && TREE_CODE (pointee2) == POINTER_TYPE)
511 || (TYPE_PTR_TO_MEMBER_P (pointee1)
512 && TYPE_PTR_TO_MEMBER_P (pointee2)))
514 result_type = composite_pointer_type_r (pointee1, pointee2, operation,
516 if (result_type == error_mark_node)
517 return error_mark_node;
521 if (complain & tf_error)
522 composite_pointer_error (DK_PERMERROR, t1, t2, operation);
524 return error_mark_node;
525 result_type = void_type_node;
527 result_type = cp_build_qualified_type (result_type,
528 (cp_type_quals (pointee1)
529 | cp_type_quals (pointee2)));
530 /* If the original types were pointers to members, so is the
532 if (TYPE_PTR_TO_MEMBER_P (t1))
534 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
535 TYPE_PTRMEM_CLASS_TYPE (t2)))
537 if (complain & tf_error)
538 composite_pointer_error (DK_PERMERROR, t1, t2, operation);
540 return error_mark_node;
542 result_type = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
546 result_type = build_pointer_type (result_type);
548 /* Merge the attributes. */
549 attributes = (*targetm.merge_type_attributes) (t1, t2);
550 return build_type_attribute_variant (result_type, attributes);
553 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
554 ARG1 and ARG2 are the values with those types. The OPERATION is to
555 describe the operation between the pointer types,
556 in case an error occurs.
558 This routine also implements the computation of a common type for
559 pointers-to-members as per [expr.eq]. */
562 composite_pointer_type (tree t1, tree t2, tree arg1, tree arg2,
563 composite_pointer_operation operation,
564 tsubst_flags_t complain)
571 If one operand is a null pointer constant, the composite pointer
572 type is the type of the other operand. */
573 if (null_ptr_cst_p (arg1))
575 if (null_ptr_cst_p (arg2))
582 If one of the operands has type "pointer to cv1 void*", then
583 the other has type "pointer to cv2T", and the composite pointer
584 type is "pointer to cv12 void", where cv12 is the union of cv1
587 If either type is a pointer to void, make sure it is T1. */
588 if (TREE_CODE (t2) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t2)))
596 /* Now, if T1 is a pointer to void, merge the qualifiers. */
597 if (TREE_CODE (t1) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t1)))
602 if (TYPE_PTRFN_P (t2) && (complain & tf_error))
607 pedwarn (input_location, OPT_pedantic,
608 "ISO C++ forbids comparison between "
609 "pointer of type %<void *%> and pointer-to-function");
612 pedwarn (input_location, OPT_pedantic,
613 "ISO C++ forbids conversion between "
614 "pointer of type %<void *%> and pointer-to-function");
616 case CPO_CONDITIONAL_EXPR:
617 pedwarn (input_location, OPT_pedantic,
618 "ISO C++ forbids conditional expression between "
619 "pointer of type %<void *%> and pointer-to-function");
626 = cp_build_qualified_type (void_type_node,
627 (cp_type_quals (TREE_TYPE (t1))
628 | cp_type_quals (TREE_TYPE (t2))));
629 result_type = build_pointer_type (result_type);
630 /* Merge the attributes. */
631 attributes = (*targetm.merge_type_attributes) (t1, t2);
632 return build_type_attribute_variant (result_type, attributes);
635 if (c_dialect_objc () && TREE_CODE (t1) == POINTER_TYPE
636 && TREE_CODE (t2) == POINTER_TYPE)
638 if (objc_have_common_type (t1, t2, -3, NULL_TREE))
639 return objc_common_type (t1, t2);
642 /* [expr.eq] permits the application of a pointer conversion to
643 bring the pointers to a common type. */
644 if (TREE_CODE (t1) == POINTER_TYPE && TREE_CODE (t2) == POINTER_TYPE
645 && CLASS_TYPE_P (TREE_TYPE (t1))
646 && CLASS_TYPE_P (TREE_TYPE (t2))
647 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1),
650 class1 = TREE_TYPE (t1);
651 class2 = TREE_TYPE (t2);
653 if (DERIVED_FROM_P (class1, class2))
654 t2 = (build_pointer_type
655 (cp_build_qualified_type (class1, cp_type_quals (class2))));
656 else if (DERIVED_FROM_P (class2, class1))
657 t1 = (build_pointer_type
658 (cp_build_qualified_type (class2, cp_type_quals (class1))));
661 if (complain & tf_error)
662 composite_pointer_error (DK_ERROR, t1, t2, operation);
663 return error_mark_node;
666 /* [expr.eq] permits the application of a pointer-to-member
667 conversion to change the class type of one of the types. */
668 else if (TYPE_PTR_TO_MEMBER_P (t1)
669 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
670 TYPE_PTRMEM_CLASS_TYPE (t2)))
672 class1 = TYPE_PTRMEM_CLASS_TYPE (t1);
673 class2 = TYPE_PTRMEM_CLASS_TYPE (t2);
675 if (DERIVED_FROM_P (class1, class2))
676 t1 = build_ptrmem_type (class2, TYPE_PTRMEM_POINTED_TO_TYPE (t1));
677 else if (DERIVED_FROM_P (class2, class1))
678 t2 = build_ptrmem_type (class1, TYPE_PTRMEM_POINTED_TO_TYPE (t2));
681 if (complain & tf_error)
685 error ("comparison between distinct "
686 "pointer-to-member types %qT and %qT lacks a cast",
690 error ("conversion between distinct "
691 "pointer-to-member types %qT and %qT lacks a cast",
694 case CPO_CONDITIONAL_EXPR:
695 error ("conditional expression between distinct "
696 "pointer-to-member types %qT and %qT lacks a cast",
702 return error_mark_node;
706 return composite_pointer_type_r (t1, t2, operation, complain);
709 /* Return the merged type of two types.
710 We assume that comptypes has already been done and returned 1;
711 if that isn't so, this may crash.
713 This just combines attributes and default arguments; any other
714 differences would cause the two types to compare unalike. */
717 merge_types (tree t1, tree t2)
719 enum tree_code code1;
720 enum tree_code code2;
723 /* Save time if the two types are the same. */
726 if (original_type (t1) == original_type (t2))
729 /* If one type is nonsense, use the other. */
730 if (t1 == error_mark_node)
732 if (t2 == error_mark_node)
735 /* Merge the attributes. */
736 attributes = (*targetm.merge_type_attributes) (t1, t2);
738 if (TYPE_PTRMEMFUNC_P (t1))
739 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
740 if (TYPE_PTRMEMFUNC_P (t2))
741 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
743 code1 = TREE_CODE (t1);
744 code2 = TREE_CODE (t2);
747 gcc_assert (code1 == TYPENAME_TYPE || code2 == TYPENAME_TYPE);
748 if (code1 == TYPENAME_TYPE)
750 t1 = resolve_typename_type (t1, /*only_current_p=*/true);
751 code1 = TREE_CODE (t1);
755 t2 = resolve_typename_type (t2, /*only_current_p=*/true);
756 code2 = TREE_CODE (t2);
764 /* For two pointers, do this recursively on the target type. */
766 tree target = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
767 int quals = cp_type_quals (t1);
769 if (code1 == POINTER_TYPE)
770 t1 = build_pointer_type (target);
772 t1 = cp_build_reference_type (target, TYPE_REF_IS_RVALUE (t1));
773 t1 = build_type_attribute_variant (t1, attributes);
774 t1 = cp_build_qualified_type (t1, quals);
776 if (TREE_CODE (target) == METHOD_TYPE)
777 t1 = build_ptrmemfunc_type (t1);
786 quals = cp_type_quals (t1);
787 pointee = merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1),
788 TYPE_PTRMEM_POINTED_TO_TYPE (t2));
789 t1 = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
791 t1 = cp_build_qualified_type (t1, quals);
797 tree elt = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
798 /* Save space: see if the result is identical to one of the args. */
799 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
800 return build_type_attribute_variant (t1, attributes);
801 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
802 return build_type_attribute_variant (t2, attributes);
803 /* Merge the element types, and have a size if either arg has one. */
804 t1 = build_cplus_array_type
805 (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
810 /* Function types: prefer the one that specified arg types.
811 If both do, merge the arg types. Also merge the return types. */
813 tree valtype = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
814 tree p1 = TYPE_ARG_TYPES (t1);
815 tree p2 = TYPE_ARG_TYPES (t2);
819 /* Save space: see if the result is identical to one of the args. */
820 if (valtype == TREE_TYPE (t1) && ! p2)
821 return cp_build_type_attribute_variant (t1, attributes);
822 if (valtype == TREE_TYPE (t2) && ! p1)
823 return cp_build_type_attribute_variant (t2, attributes);
825 /* Simple way if one arg fails to specify argument types. */
826 if (p1 == NULL_TREE || TREE_VALUE (p1) == void_type_node)
828 else if (p2 == NULL_TREE || TREE_VALUE (p2) == void_type_node)
831 parms = commonparms (p1, p2);
833 rval = build_function_type (valtype, parms);
834 gcc_assert (type_memfn_quals (t1) == type_memfn_quals (t2));
835 rval = apply_memfn_quals (rval, type_memfn_quals (t1));
836 raises = merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1),
837 TYPE_RAISES_EXCEPTIONS (t2),
839 t1 = build_exception_variant (rval, raises);
845 /* Get this value the long way, since TYPE_METHOD_BASETYPE
846 is just the main variant of this. */
847 tree basetype = class_of_this_parm (t2);
848 tree raises = merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1),
849 TYPE_RAISES_EXCEPTIONS (t2),
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 ce_derived, T2 can be stricter than T1 (according to 15.4/5).
982 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
983 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
984 are unordered, but we've already filtered out duplicates. Most lists will
985 be in order, we should try to make use of that. */
988 comp_except_specs (const_tree t1, const_tree t2, int exact)
997 /* First handle noexcept. */
998 if (exact < ce_exact)
1000 /* noexcept(false) is compatible with no exception-specification,
1001 and stricter than any spec. */
1002 if (t1 == noexcept_false_spec)
1003 return t2 == NULL_TREE || exact == ce_derived;
1004 /* Even a derived noexcept(false) is compatible with no
1005 exception-specification. */
1006 if (t2 == noexcept_false_spec)
1007 return t1 == NULL_TREE;
1009 /* Otherwise, if we aren't looking for an exact match, noexcept is
1010 equivalent to throw(). */
1011 if (t1 == noexcept_true_spec)
1012 t1 = empty_except_spec;
1013 if (t2 == noexcept_true_spec)
1014 t2 = empty_except_spec;
1017 /* If any noexcept is left, it is only comparable to itself;
1018 either we're looking for an exact match or we're redeclaring a
1019 template with dependent noexcept. */
1020 if ((t1 && TREE_PURPOSE (t1))
1021 || (t2 && TREE_PURPOSE (t2)))
1023 && cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)));
1025 if (t1 == NULL_TREE) /* T1 is ... */
1026 return t2 == NULL_TREE || exact == ce_derived;
1027 if (!TREE_VALUE (t1)) /* t1 is EMPTY */
1028 return t2 != NULL_TREE && !TREE_VALUE (t2);
1029 if (t2 == NULL_TREE) /* T2 is ... */
1031 if (TREE_VALUE (t1) && !TREE_VALUE (t2)) /* T2 is EMPTY, T1 is not */
1032 return exact == ce_derived;
1034 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1035 Count how many we find, to determine exactness. For exact matching and
1036 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1038 for (base = t1; t2 != NULL_TREE; t2 = TREE_CHAIN (t2))
1040 for (probe = base; probe != NULL_TREE; probe = TREE_CHAIN (probe))
1042 tree a = TREE_VALUE (probe);
1043 tree b = TREE_VALUE (t2);
1045 if (comp_except_types (a, b, exact))
1047 if (probe == base && exact > ce_derived)
1048 base = TREE_CHAIN (probe);
1053 if (probe == NULL_TREE)
1056 return exact == ce_derived || base == NULL_TREE || length == list_length (t1);
1059 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1060 [] can match [size]. */
1063 comp_array_types (const_tree t1, const_tree t2, bool allow_redeclaration)
1072 /* The type of the array elements must be the same. */
1073 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1076 d1 = TYPE_DOMAIN (t1);
1077 d2 = TYPE_DOMAIN (t2);
1082 /* If one of the arrays is dimensionless, and the other has a
1083 dimension, they are of different types. However, it is valid to
1091 declarations for an array object can specify
1092 array types that differ by the presence or absence of a major
1093 array bound (_dcl.array_). */
1095 return allow_redeclaration;
1097 /* Check that the dimensions are the same. */
1099 if (!cp_tree_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2)))
1101 max1 = TYPE_MAX_VALUE (d1);
1102 max2 = TYPE_MAX_VALUE (d2);
1103 if (processing_template_decl && !abi_version_at_least (2)
1104 && !value_dependent_expression_p (max1)
1105 && !value_dependent_expression_p (max2))
1107 /* With abi-1 we do not fold non-dependent array bounds, (and
1108 consequently mangle them incorrectly). We must therefore
1109 fold them here, to verify the domains have the same
1115 if (!cp_tree_equal (max1, max2))
1121 /* Compare the relative position of T1 and T2 into their respective
1122 template parameter list.
1123 T1 and T2 must be template parameter types.
1124 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1127 comp_template_parms_position (tree t1, tree t2)
1129 tree index1, index2;
1130 gcc_assert (t1 && t2
1131 && TREE_CODE (t1) == TREE_CODE (t2)
1132 && (TREE_CODE (t1) == BOUND_TEMPLATE_TEMPLATE_PARM
1133 || TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM
1134 || TREE_CODE (t1) == TEMPLATE_TYPE_PARM));
1136 index1 = TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t1));
1137 index2 = TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t2));
1139 /* If T1 and T2 belong to template parm lists of different size,
1140 let's assume they are different. */
1141 if (TEMPLATE_PARM_NUM_SIBLINGS (index1)
1142 != TEMPLATE_PARM_NUM_SIBLINGS (index2))
1145 /* Then compare their relative position. */
1146 if (TEMPLATE_PARM_IDX (index1) != TEMPLATE_PARM_IDX (index2)
1147 || TEMPLATE_PARM_LEVEL (index1) != TEMPLATE_PARM_LEVEL (index2)
1148 || (TEMPLATE_PARM_PARAMETER_PACK (index1)
1149 != TEMPLATE_PARM_PARAMETER_PACK (index2)))
1155 /* Subroutine in comptypes. */
1158 structural_comptypes (tree t1, tree t2, int strict)
1163 /* Suppress errors caused by previously reported errors. */
1164 if (t1 == error_mark_node || t2 == error_mark_node)
1167 gcc_assert (TYPE_P (t1) && TYPE_P (t2));
1169 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1170 current instantiation. */
1171 if (TREE_CODE (t1) == TYPENAME_TYPE)
1172 t1 = resolve_typename_type (t1, /*only_current_p=*/true);
1174 if (TREE_CODE (t2) == TYPENAME_TYPE)
1175 t2 = resolve_typename_type (t2, /*only_current_p=*/true);
1177 if (TYPE_PTRMEMFUNC_P (t1))
1178 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
1179 if (TYPE_PTRMEMFUNC_P (t2))
1180 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
1182 /* Different classes of types can't be compatible. */
1183 if (TREE_CODE (t1) != TREE_CODE (t2))
1186 /* Qualifiers must match. For array types, we will check when we
1187 recur on the array element types. */
1188 if (TREE_CODE (t1) != ARRAY_TYPE
1189 && cp_type_quals (t1) != cp_type_quals (t2))
1191 if (TREE_CODE (t1) == FUNCTION_TYPE
1192 && type_memfn_quals (t1) != type_memfn_quals (t2))
1194 if (TYPE_FOR_JAVA (t1) != TYPE_FOR_JAVA (t2))
1197 /* Allow for two different type nodes which have essentially the same
1198 definition. Note that we already checked for equality of the type
1199 qualifiers (just above). */
1201 if (TREE_CODE (t1) != ARRAY_TYPE
1202 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
1206 /* Compare the types. Break out if they could be the same. */
1207 switch (TREE_CODE (t1))
1211 /* All void and bool types are the same. */
1215 case FIXED_POINT_TYPE:
1217 /* With these nodes, we can't determine type equivalence by
1218 looking at what is stored in the nodes themselves, because
1219 two nodes might have different TYPE_MAIN_VARIANTs but still
1220 represent the same type. For example, wchar_t and int could
1221 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1222 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1223 and are distinct types. On the other hand, int and the
1226 typedef int INT __attribute((may_alias));
1228 have identical properties, different TYPE_MAIN_VARIANTs, but
1229 represent the same type. The canonical type system keeps
1230 track of equivalence in this case, so we fall back on it. */
1231 return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
1233 case TEMPLATE_TEMPLATE_PARM:
1234 case BOUND_TEMPLATE_TEMPLATE_PARM:
1235 if (!comp_template_parms_position (t1, t2))
1237 if (!comp_template_parms
1238 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1)),
1239 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2))))
1241 if (TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM)
1243 /* Don't check inheritance. */
1244 strict = COMPARE_STRICT;
1249 if (TYPE_TEMPLATE_INFO (t1) && TYPE_TEMPLATE_INFO (t2)
1250 && (TYPE_TI_TEMPLATE (t1) == TYPE_TI_TEMPLATE (t2)
1251 || TREE_CODE (t1) == BOUND_TEMPLATE_TEMPLATE_PARM)
1252 && comp_template_args (TYPE_TI_ARGS (t1), TYPE_TI_ARGS (t2)))
1255 if ((strict & COMPARE_BASE) && DERIVED_FROM_P (t1, t2))
1257 else if ((strict & COMPARE_DERIVED) && DERIVED_FROM_P (t2, t1))
1263 if (!comptypes (TYPE_OFFSET_BASETYPE (t1), TYPE_OFFSET_BASETYPE (t2),
1264 strict & ~COMPARE_REDECLARATION))
1266 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1270 case REFERENCE_TYPE:
1271 if (TYPE_REF_IS_RVALUE (t1) != TYPE_REF_IS_RVALUE (t2))
1273 /* fall through to checks for pointer types */
1276 if (TYPE_MODE (t1) != TYPE_MODE (t2)
1277 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2)
1278 || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1284 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1286 if (!compparms (TYPE_ARG_TYPES (t1), TYPE_ARG_TYPES (t2)))
1291 /* Target types must match incl. qualifiers. */
1292 if (!comp_array_types (t1, t2, !!(strict & COMPARE_REDECLARATION)))
1296 case TEMPLATE_TYPE_PARM:
1297 /* If T1 and T2 don't have the same relative position in their
1298 template parameters set, they can't be equal. */
1299 if (!comp_template_parms_position (t1, t2))
1304 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1),
1305 TYPENAME_TYPE_FULLNAME (t2)))
1307 /* Qualifiers don't matter on scopes. */
1308 if (!same_type_ignoring_top_level_qualifiers_p (TYPE_CONTEXT (t1),
1313 case UNBOUND_CLASS_TEMPLATE:
1314 if (!cp_tree_equal (TYPE_IDENTIFIER (t1), TYPE_IDENTIFIER (t2)))
1316 if (!same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)))
1321 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1326 if (TYPE_VECTOR_SUBPARTS (t1) != TYPE_VECTOR_SUBPARTS (t2)
1327 || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1331 case TYPE_PACK_EXPANSION:
1332 return (same_type_p (PACK_EXPANSION_PATTERN (t1),
1333 PACK_EXPANSION_PATTERN (t2))
1334 && comp_template_args (PACK_EXPANSION_EXTRA_ARGS (t1),
1335 PACK_EXPANSION_EXTRA_ARGS (t2)));
1338 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1)
1339 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2)
1340 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1)
1341 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2))
1342 || (DECLTYPE_FOR_LAMBDA_PROXY (t1)
1343 != DECLTYPE_FOR_LAMBDA_PROXY (t2))
1344 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1),
1345 DECLTYPE_TYPE_EXPR (t2)))
1349 case UNDERLYING_TYPE:
1350 return same_type_p (UNDERLYING_TYPE_TYPE (t1),
1351 UNDERLYING_TYPE_TYPE (t2));
1357 /* If we get here, we know that from a target independent POV the
1358 types are the same. Make sure the target attributes are also
1360 return comp_type_attributes (t1, t2);
1363 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1364 is a bitwise-or of the COMPARE_* flags. */
1367 comptypes (tree t1, tree t2, int strict)
1369 if (strict == COMPARE_STRICT)
1374 if (t1 == error_mark_node || t2 == error_mark_node)
1377 if (TYPE_STRUCTURAL_EQUALITY_P (t1) || TYPE_STRUCTURAL_EQUALITY_P (t2))
1378 /* At least one of the types requires structural equality, so
1379 perform a deep check. */
1380 return structural_comptypes (t1, t2, strict);
1382 #ifdef ENABLE_CHECKING
1383 if (USE_CANONICAL_TYPES)
1385 bool result = structural_comptypes (t1, t2, strict);
1387 if (result && TYPE_CANONICAL (t1) != TYPE_CANONICAL (t2))
1388 /* The two types are structurally equivalent, but their
1389 canonical types were different. This is a failure of the
1390 canonical type propagation code.*/
1392 ("canonical types differ for identical types %T and %T",
1394 else if (!result && TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2))
1395 /* Two types are structurally different, but the canonical
1396 types are the same. This means we were over-eager in
1397 assigning canonical types. */
1399 ("same canonical type node for different types %T and %T",
1405 if (USE_CANONICAL_TYPES)
1406 return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
1409 return structural_comptypes (t1, t2, strict);
1411 else if (strict == COMPARE_STRUCTURAL)
1412 return structural_comptypes (t1, t2, COMPARE_STRICT);
1414 return structural_comptypes (t1, t2, strict);
1417 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1418 top-level qualifiers. */
1421 same_type_ignoring_top_level_qualifiers_p (tree type1, tree type2)
1423 if (type1 == error_mark_node || type2 == error_mark_node)
1426 return same_type_p (TYPE_MAIN_VARIANT (type1), TYPE_MAIN_VARIANT (type2));
1429 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1432 at_least_as_qualified_p (const_tree type1, const_tree type2)
1434 int q1 = cp_type_quals (type1);
1435 int q2 = cp_type_quals (type2);
1437 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1438 return (q1 & q2) == q2;
1441 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1442 more cv-qualified that TYPE1, and 0 otherwise. */
1445 comp_cv_qualification (const_tree type1, const_tree type2)
1447 int q1 = cp_type_quals (type1);
1448 int q2 = cp_type_quals (type2);
1453 if ((q1 & q2) == q2)
1455 else if ((q1 & q2) == q1)
1461 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1462 subset of the cv-qualification signature of TYPE2, and the types
1463 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1466 comp_cv_qual_signature (tree type1, tree type2)
1468 if (comp_ptr_ttypes_real (type2, type1, -1))
1470 else if (comp_ptr_ttypes_real (type1, type2, -1))
1476 /* Subroutines of `comptypes'. */
1478 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1479 equivalent in the sense that functions with those parameter types
1480 can have equivalent types. The two lists must be equivalent,
1481 element by element. */
1484 compparms (const_tree parms1, const_tree parms2)
1488 /* An unspecified parmlist matches any specified parmlist
1489 whose argument types don't need default promotions. */
1491 for (t1 = parms1, t2 = parms2;
1493 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
1495 /* If one parmlist is shorter than the other,
1496 they fail to match. */
1499 if (!same_type_p (TREE_VALUE (t1), TREE_VALUE (t2)))
1506 /* Process a sizeof or alignof expression where the operand is a
1510 cxx_sizeof_or_alignof_type (tree type, enum tree_code op, bool complain)
1515 gcc_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR);
1516 if (type == error_mark_node)
1517 return error_mark_node;
1519 type = non_reference (type);
1520 if (TREE_CODE (type) == METHOD_TYPE)
1523 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
1524 "invalid application of %qs to a member function",
1525 operator_name_info[(int) op].name);
1526 value = size_one_node;
1529 dependent_p = dependent_type_p (type);
1531 complete_type (type);
1533 /* VLA types will have a non-constant size. In the body of an
1534 uninstantiated template, we don't need to try to compute the
1535 value, because the sizeof expression is not an integral
1536 constant expression in that case. And, if we do try to
1537 compute the value, we'll likely end up with SAVE_EXPRs, which
1538 the template substitution machinery does not expect to see. */
1539 || (processing_template_decl
1540 && COMPLETE_TYPE_P (type)
1541 && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST))
1543 value = build_min (op, size_type_node, type);
1544 TREE_READONLY (value) = 1;
1548 return c_sizeof_or_alignof_type (input_location, complete_type (type),
1553 /* Return the size of the type, without producing any warnings for
1554 types whose size cannot be taken. This routine should be used only
1555 in some other routine that has already produced a diagnostic about
1556 using the size of such a type. */
1558 cxx_sizeof_nowarn (tree type)
1560 if (TREE_CODE (type) == FUNCTION_TYPE
1561 || TREE_CODE (type) == VOID_TYPE
1562 || TREE_CODE (type) == ERROR_MARK)
1563 return size_one_node;
1564 else if (!COMPLETE_TYPE_P (type))
1565 return size_zero_node;
1567 return cxx_sizeof_or_alignof_type (type, SIZEOF_EXPR, false);
1570 /* Process a sizeof expression where the operand is an expression. */
1573 cxx_sizeof_expr (tree e, tsubst_flags_t complain)
1575 if (e == error_mark_node)
1576 return error_mark_node;
1578 if (processing_template_decl)
1580 e = build_min (SIZEOF_EXPR, size_type_node, e);
1581 TREE_SIDE_EFFECTS (e) = 0;
1582 TREE_READONLY (e) = 1;
1587 /* To get the size of a static data member declared as an array of
1588 unknown bound, we need to instantiate it. */
1589 if (TREE_CODE (e) == VAR_DECL
1590 && VAR_HAD_UNKNOWN_BOUND (e)
1591 && DECL_TEMPLATE_INSTANTIATION (e))
1592 instantiate_decl (e, /*defer_ok*/true, /*expl_inst_mem*/false);
1594 e = mark_type_use (e);
1596 if (TREE_CODE (e) == COMPONENT_REF
1597 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1598 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1600 if (complain & tf_error)
1601 error ("invalid application of %<sizeof%> to a bit-field");
1603 return error_mark_node;
1606 else if (is_overloaded_fn (e))
1608 if (complain & tf_error)
1609 permerror (input_location, "ISO C++ forbids applying %<sizeof%> to an expression of "
1612 return error_mark_node;
1615 else if (type_unknown_p (e))
1617 if (complain & tf_error)
1618 cxx_incomplete_type_error (e, TREE_TYPE (e));
1620 return error_mark_node;
1626 return cxx_sizeof_or_alignof_type (e, SIZEOF_EXPR, complain & tf_error);
1629 /* Implement the __alignof keyword: Return the minimum required
1630 alignment of E, measured in bytes. For VAR_DECL's and
1631 FIELD_DECL's return DECL_ALIGN (which can be set from an
1632 "aligned" __attribute__ specification). */
1635 cxx_alignof_expr (tree e, tsubst_flags_t complain)
1639 if (e == error_mark_node)
1640 return error_mark_node;
1642 if (processing_template_decl)
1644 e = build_min (ALIGNOF_EXPR, size_type_node, e);
1645 TREE_SIDE_EFFECTS (e) = 0;
1646 TREE_READONLY (e) = 1;
1651 e = mark_type_use (e);
1653 if (TREE_CODE (e) == VAR_DECL)
1654 t = size_int (DECL_ALIGN_UNIT (e));
1655 else if (TREE_CODE (e) == COMPONENT_REF
1656 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1657 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1659 if (complain & tf_error)
1660 error ("invalid application of %<__alignof%> to a bit-field");
1662 return error_mark_node;
1665 else if (TREE_CODE (e) == COMPONENT_REF
1666 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL)
1667 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e, 1)));
1668 else if (is_overloaded_fn (e))
1670 if (complain & tf_error)
1671 permerror (input_location, "ISO C++ forbids applying %<__alignof%> to an expression of "
1674 return error_mark_node;
1675 if (TREE_CODE (e) == FUNCTION_DECL)
1676 t = size_int (DECL_ALIGN_UNIT (e));
1680 else if (type_unknown_p (e))
1682 if (complain & tf_error)
1683 cxx_incomplete_type_error (e, TREE_TYPE (e));
1685 return error_mark_node;
1689 return cxx_sizeof_or_alignof_type (TREE_TYPE (e), ALIGNOF_EXPR,
1690 complain & tf_error);
1692 return fold_convert (size_type_node, t);
1695 /* Process a sizeof or alignof expression E with code OP where the operand
1696 is an expression. */
1699 cxx_sizeof_or_alignof_expr (tree e, enum tree_code op, bool complain)
1701 if (op == SIZEOF_EXPR)
1702 return cxx_sizeof_expr (e, complain? tf_warning_or_error : tf_none);
1704 return cxx_alignof_expr (e, complain? tf_warning_or_error : tf_none);
1707 /* EXPR is being used in a context that is not a function call.
1712 The expression can be used only as the left-hand operand of a
1713 member function call.
1715 [expr.mptr.operator]
1717 If the result of .* or ->* is a function, then that result can be
1718 used only as the operand for the function call operator ().
1720 by issuing an error message if appropriate. Returns true iff EXPR
1721 violates these rules. */
1724 invalid_nonstatic_memfn_p (const_tree expr, tsubst_flags_t complain)
1726 if (expr && DECL_NONSTATIC_MEMBER_FUNCTION_P (expr))
1728 if (complain & tf_error)
1729 error ("invalid use of non-static member function");
1735 /* If EXP is a reference to a bitfield, and the type of EXP does not
1736 match the declared type of the bitfield, return the declared type
1737 of the bitfield. Otherwise, return NULL_TREE. */
1740 is_bitfield_expr_with_lowered_type (const_tree exp)
1742 switch (TREE_CODE (exp))
1745 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1)
1746 ? TREE_OPERAND (exp, 1)
1747 : TREE_OPERAND (exp, 0)))
1749 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 2));
1752 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1));
1756 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
1762 field = TREE_OPERAND (exp, 1);
1763 if (TREE_CODE (field) != FIELD_DECL || !DECL_BIT_FIELD_TYPE (field))
1765 if (same_type_ignoring_top_level_qualifiers_p
1766 (TREE_TYPE (exp), DECL_BIT_FIELD_TYPE (field)))
1768 return DECL_BIT_FIELD_TYPE (field);
1772 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp, 0)))
1773 == TYPE_MAIN_VARIANT (TREE_TYPE (exp)))
1774 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
1782 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1783 bitfield with a lowered type, the type of EXP is returned, rather
1787 unlowered_expr_type (const_tree exp)
1790 tree etype = TREE_TYPE (exp);
1792 type = is_bitfield_expr_with_lowered_type (exp);
1794 type = cp_build_qualified_type (type, cp_type_quals (etype));
1801 /* Perform the conversions in [expr] that apply when an lvalue appears
1802 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1803 function-to-pointer conversions. In addition, manifest constants
1804 are replaced by their values, and bitfield references are converted
1805 to their declared types. Note that this function does not perform the
1806 lvalue-to-rvalue conversion for class types. If you need that conversion
1807 to for class types, then you probably need to use force_rvalue.
1809 Although the returned value is being used as an rvalue, this
1810 function does not wrap the returned expression in a
1811 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1812 that the return value is no longer an lvalue. */
1815 decay_conversion (tree exp)
1818 enum tree_code code;
1820 type = TREE_TYPE (exp);
1821 if (type == error_mark_node)
1822 return error_mark_node;
1824 exp = mark_rvalue_use (exp);
1826 exp = resolve_nondeduced_context (exp);
1827 if (type_unknown_p (exp))
1829 cxx_incomplete_type_error (exp, TREE_TYPE (exp));
1830 return error_mark_node;
1833 /* FIXME remove? at least need to remember that this isn't really a
1834 constant expression if EXP isn't decl_constant_var_p, like with
1835 C_MAYBE_CONST_EXPR. */
1836 exp = decl_constant_value_safe (exp);
1837 if (error_operand_p (exp))
1838 return error_mark_node;
1840 if (NULLPTR_TYPE_P (type))
1841 return nullptr_node;
1843 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1844 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1845 code = TREE_CODE (type);
1846 if (code == VOID_TYPE)
1848 error ("void value not ignored as it ought to be");
1849 return error_mark_node;
1851 if (invalid_nonstatic_memfn_p (exp, tf_warning_or_error))
1852 return error_mark_node;
1853 if (code == FUNCTION_TYPE || is_overloaded_fn (exp))
1854 return cp_build_addr_expr (exp, tf_warning_or_error);
1855 if (code == ARRAY_TYPE)
1860 if (TREE_CODE (exp) == INDIRECT_REF)
1861 return build_nop (build_pointer_type (TREE_TYPE (type)),
1862 TREE_OPERAND (exp, 0));
1864 if (TREE_CODE (exp) == COMPOUND_EXPR)
1866 tree op1 = decay_conversion (TREE_OPERAND (exp, 1));
1867 return build2 (COMPOUND_EXPR, TREE_TYPE (op1),
1868 TREE_OPERAND (exp, 0), op1);
1872 && ! (TREE_CODE (exp) == CONSTRUCTOR && TREE_STATIC (exp)))
1874 error ("invalid use of non-lvalue array");
1875 return error_mark_node;
1878 ptrtype = build_pointer_type (TREE_TYPE (type));
1880 if (TREE_CODE (exp) == VAR_DECL)
1882 if (!cxx_mark_addressable (exp))
1883 return error_mark_node;
1884 adr = build_nop (ptrtype, build_address (exp));
1887 /* This way is better for a COMPONENT_REF since it can
1888 simplify the offset for a component. */
1889 adr = cp_build_addr_expr (exp, tf_warning_or_error);
1890 return cp_convert (ptrtype, adr);
1893 /* If a bitfield is used in a context where integral promotion
1894 applies, then the caller is expected to have used
1895 default_conversion. That function promotes bitfields correctly
1896 before calling this function. At this point, if we have a
1897 bitfield referenced, we may assume that is not subject to
1898 promotion, and that, therefore, the type of the resulting rvalue
1899 is the declared type of the bitfield. */
1900 exp = convert_bitfield_to_declared_type (exp);
1902 /* We do not call rvalue() here because we do not want to wrap EXP
1903 in a NON_LVALUE_EXPR. */
1907 Non-class rvalues always have cv-unqualified types. */
1908 type = TREE_TYPE (exp);
1909 if (!CLASS_TYPE_P (type) && cv_qualified_p (type))
1910 exp = build_nop (cv_unqualified (type), exp);
1915 /* Perform preparatory conversions, as part of the "usual arithmetic
1916 conversions". In particular, as per [expr]:
1918 Whenever an lvalue expression appears as an operand of an
1919 operator that expects the rvalue for that operand, the
1920 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1921 standard conversions are applied to convert the expression to an
1924 In addition, we perform integral promotions here, as those are
1925 applied to both operands to a binary operator before determining
1926 what additional conversions should apply. */
1929 default_conversion (tree exp)
1931 /* Check for target-specific promotions. */
1932 tree promoted_type = targetm.promoted_type (TREE_TYPE (exp));
1934 exp = cp_convert (promoted_type, exp);
1935 /* Perform the integral promotions first so that bitfield
1936 expressions (which may promote to "int", even if the bitfield is
1937 declared "unsigned") are promoted correctly. */
1938 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp)))
1939 exp = perform_integral_promotions (exp);
1940 /* Perform the other conversions. */
1941 exp = decay_conversion (exp);
1946 /* EXPR is an expression with an integral or enumeration type.
1947 Perform the integral promotions in [conv.prom], and return the
1951 perform_integral_promotions (tree expr)
1956 expr = mark_rvalue_use (expr);
1960 If the bitfield has an enumerated type, it is treated as any
1961 other value of that type for promotion purposes. */
1962 type = is_bitfield_expr_with_lowered_type (expr);
1963 if (!type || TREE_CODE (type) != ENUMERAL_TYPE)
1964 type = TREE_TYPE (expr);
1965 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
1966 /* Scoped enums don't promote. */
1967 if (SCOPED_ENUM_P (type))
1969 promoted_type = type_promotes_to (type);
1970 if (type != promoted_type)
1971 expr = cp_convert (promoted_type, expr);
1975 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1976 decay_conversion to one. */
1979 string_conv_p (const_tree totype, const_tree exp, int warn)
1983 if (TREE_CODE (totype) != POINTER_TYPE)
1986 t = TREE_TYPE (totype);
1987 if (!same_type_p (t, char_type_node)
1988 && !same_type_p (t, char16_type_node)
1989 && !same_type_p (t, char32_type_node)
1990 && !same_type_p (t, wchar_type_node))
1993 if (TREE_CODE (exp) == STRING_CST)
1995 /* Make sure that we don't try to convert between char and wide chars. */
1996 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp))), t))
2001 /* Is this a string constant which has decayed to 'const char *'? */
2002 t = build_pointer_type (cp_build_qualified_type (t, TYPE_QUAL_CONST));
2003 if (!same_type_p (TREE_TYPE (exp), t))
2006 if (TREE_CODE (exp) != ADDR_EXPR
2007 || TREE_CODE (TREE_OPERAND (exp, 0)) != STRING_CST)
2011 /* This warning is not very useful, as it complains about printf. */
2013 warning (OPT_Wwrite_strings,
2014 "deprecated conversion from string constant to %qT",
2020 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2021 can, for example, use as an lvalue. This code used to be in
2022 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2023 expressions, where we're dealing with aggregates. But now it's again only
2024 called from unary_complex_lvalue. The case (in particular) that led to
2025 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2029 rationalize_conditional_expr (enum tree_code code, tree t,
2030 tsubst_flags_t complain)
2032 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2033 the first operand is always the one to be used if both operands
2034 are equal, so we know what conditional expression this used to be. */
2035 if (TREE_CODE (t) == MIN_EXPR || TREE_CODE (t) == MAX_EXPR)
2037 tree op0 = TREE_OPERAND (t, 0);
2038 tree op1 = TREE_OPERAND (t, 1);
2040 /* The following code is incorrect if either operand side-effects. */
2041 gcc_assert (!TREE_SIDE_EFFECTS (op0)
2042 && !TREE_SIDE_EFFECTS (op1));
2044 build_conditional_expr (build_x_binary_op ((TREE_CODE (t) == MIN_EXPR
2045 ? LE_EXPR : GE_EXPR),
2046 op0, TREE_CODE (op0),
2047 op1, TREE_CODE (op1),
2050 cp_build_unary_op (code, op0, 0, complain),
2051 cp_build_unary_op (code, op1, 0, complain),
2056 build_conditional_expr (TREE_OPERAND (t, 0),
2057 cp_build_unary_op (code, TREE_OPERAND (t, 1), 0,
2059 cp_build_unary_op (code, TREE_OPERAND (t, 2), 0,
2064 /* Given the TYPE of an anonymous union field inside T, return the
2065 FIELD_DECL for the field. If not found return NULL_TREE. Because
2066 anonymous unions can nest, we must also search all anonymous unions
2067 that are directly reachable. */
2070 lookup_anon_field (tree t, tree type)
2074 for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field))
2076 if (TREE_STATIC (field))
2078 if (TREE_CODE (field) != FIELD_DECL || DECL_ARTIFICIAL (field))
2081 /* If we find it directly, return the field. */
2082 if (DECL_NAME (field) == NULL_TREE
2083 && type == TYPE_MAIN_VARIANT (TREE_TYPE (field)))
2088 /* Otherwise, it could be nested, search harder. */
2089 if (DECL_NAME (field) == NULL_TREE
2090 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2092 tree subfield = lookup_anon_field (TREE_TYPE (field), type);
2100 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2101 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2102 non-NULL, it indicates the path to the base used to name MEMBER.
2103 If PRESERVE_REFERENCE is true, the expression returned will have
2104 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2105 returned will have the type referred to by the reference.
2107 This function does not perform access control; that is either done
2108 earlier by the parser when the name of MEMBER is resolved to MEMBER
2109 itself, or later when overload resolution selects one of the
2110 functions indicated by MEMBER. */
2113 build_class_member_access_expr (tree object, tree member,
2114 tree access_path, bool preserve_reference,
2115 tsubst_flags_t complain)
2119 tree result = NULL_TREE;
2120 tree using_decl = NULL_TREE;
2122 if (error_operand_p (object) || error_operand_p (member))
2123 return error_mark_node;
2125 gcc_assert (DECL_P (member) || BASELINK_P (member));
2129 The type of the first expression shall be "class object" (of a
2131 object_type = TREE_TYPE (object);
2132 if (!currently_open_class (object_type)
2133 && !complete_type_or_maybe_complain (object_type, object, complain))
2134 return error_mark_node;
2135 if (!CLASS_TYPE_P (object_type))
2137 if (complain & tf_error)
2139 if (POINTER_TYPE_P (object_type)
2140 && CLASS_TYPE_P (TREE_TYPE (object_type)))
2141 error ("request for member %qD in %qE, which is of pointer "
2142 "type %qT (maybe you meant to use %<->%> ?)",
2143 member, object, object_type);
2145 error ("request for member %qD in %qE, which is of non-class "
2146 "type %qT", member, object, object_type);
2148 return error_mark_node;
2151 /* The standard does not seem to actually say that MEMBER must be a
2152 member of OBJECT_TYPE. However, that is clearly what is
2154 if (DECL_P (member))
2156 member_scope = DECL_CLASS_CONTEXT (member);
2158 if (TREE_DEPRECATED (member))
2159 warn_deprecated_use (member, NULL_TREE);
2162 member_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (member));
2163 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2164 presently be the anonymous union. Go outwards until we find a
2165 type related to OBJECT_TYPE. */
2166 while (ANON_AGGR_TYPE_P (member_scope)
2167 && !same_type_ignoring_top_level_qualifiers_p (member_scope,
2169 member_scope = TYPE_CONTEXT (member_scope);
2170 if (!member_scope || !DERIVED_FROM_P (member_scope, object_type))
2172 if (complain & tf_error)
2174 if (TREE_CODE (member) == FIELD_DECL)
2175 error ("invalid use of nonstatic data member %qE", member);
2177 error ("%qD is not a member of %qT", member, object_type);
2179 return error_mark_node;
2182 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2183 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2184 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2186 tree temp = unary_complex_lvalue (ADDR_EXPR, object);
2188 object = cp_build_indirect_ref (temp, RO_NULL, complain);
2191 /* In [expr.ref], there is an explicit list of the valid choices for
2192 MEMBER. We check for each of those cases here. */
2193 if (TREE_CODE (member) == VAR_DECL)
2195 /* A static data member. */
2197 mark_exp_read (object);
2198 /* If OBJECT has side-effects, they are supposed to occur. */
2199 if (TREE_SIDE_EFFECTS (object))
2200 result = build2 (COMPOUND_EXPR, TREE_TYPE (result), object, result);
2202 else if (TREE_CODE (member) == FIELD_DECL)
2204 /* A non-static data member. */
2209 null_object_p = (TREE_CODE (object) == INDIRECT_REF
2210 && integer_zerop (TREE_OPERAND (object, 0)));
2212 /* Convert OBJECT to the type of MEMBER. */
2213 if (!same_type_p (TYPE_MAIN_VARIANT (object_type),
2214 TYPE_MAIN_VARIANT (member_scope)))
2219 binfo = lookup_base (access_path ? access_path : object_type,
2220 member_scope, ba_unique, &kind);
2221 if (binfo == error_mark_node)
2222 return error_mark_node;
2224 /* It is invalid to try to get to a virtual base of a
2225 NULL object. The most common cause is invalid use of
2227 if (null_object_p && kind == bk_via_virtual)
2229 if (complain & tf_error)
2231 error ("invalid access to non-static data member %qD of "
2234 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2236 return error_mark_node;
2239 /* Convert to the base. */
2240 object = build_base_path (PLUS_EXPR, object, binfo,
2241 /*nonnull=*/1, complain);
2242 /* If we found the base successfully then we should be able
2243 to convert to it successfully. */
2244 gcc_assert (object != error_mark_node);
2247 /* Complain about other invalid uses of offsetof, even though they will
2248 give the right answer. Note that we complain whether or not they
2249 actually used the offsetof macro, since there's no way to know at this
2250 point. So we just give a warning, instead of a pedwarn. */
2251 /* Do not produce this warning for base class field references, because
2252 we know for a fact that didn't come from offsetof. This does occur
2253 in various testsuite cases where a null object is passed where a
2254 vtable access is required. */
2255 if (null_object_p && warn_invalid_offsetof
2256 && CLASSTYPE_NON_STD_LAYOUT (object_type)
2257 && !DECL_FIELD_IS_BASE (member)
2258 && cp_unevaluated_operand == 0
2259 && (complain & tf_warning))
2261 warning (OPT_Winvalid_offsetof,
2262 "invalid access to non-static data member %qD "
2263 " of NULL object", member);
2264 warning (OPT_Winvalid_offsetof,
2265 "(perhaps the %<offsetof%> macro was used incorrectly)");
2268 /* If MEMBER is from an anonymous aggregate, we have converted
2269 OBJECT so that it refers to the class containing the
2270 anonymous union. Generate a reference to the anonymous union
2271 itself, and recur to find MEMBER. */
2272 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member))
2273 /* When this code is called from build_field_call, the
2274 object already has the type of the anonymous union.
2275 That is because the COMPONENT_REF was already
2276 constructed, and was then disassembled before calling
2277 build_field_call. After the function-call code is
2278 cleaned up, this waste can be eliminated. */
2279 && (!same_type_ignoring_top_level_qualifiers_p
2280 (TREE_TYPE (object), DECL_CONTEXT (member))))
2282 tree anonymous_union;
2284 anonymous_union = lookup_anon_field (TREE_TYPE (object),
2285 DECL_CONTEXT (member));
2286 object = build_class_member_access_expr (object,
2288 /*access_path=*/NULL_TREE,
2293 /* Compute the type of the field, as described in [expr.ref]. */
2294 type_quals = TYPE_UNQUALIFIED;
2295 member_type = TREE_TYPE (member);
2296 if (TREE_CODE (member_type) != REFERENCE_TYPE)
2298 type_quals = (cp_type_quals (member_type)
2299 | cp_type_quals (object_type));
2301 /* A field is const (volatile) if the enclosing object, or the
2302 field itself, is const (volatile). But, a mutable field is
2303 not const, even within a const object. */
2304 if (DECL_MUTABLE_P (member))
2305 type_quals &= ~TYPE_QUAL_CONST;
2306 member_type = cp_build_qualified_type (member_type, type_quals);
2309 result = build3 (COMPONENT_REF, member_type, object, member,
2311 result = fold_if_not_in_template (result);
2313 /* Mark the expression const or volatile, as appropriate. Even
2314 though we've dealt with the type above, we still have to mark the
2315 expression itself. */
2316 if (type_quals & TYPE_QUAL_CONST)
2317 TREE_READONLY (result) = 1;
2318 if (type_quals & TYPE_QUAL_VOLATILE)
2319 TREE_THIS_VOLATILE (result) = 1;
2321 else if (BASELINK_P (member))
2323 /* The member is a (possibly overloaded) member function. */
2327 /* If the MEMBER is exactly one static member function, then we
2328 know the type of the expression. Otherwise, we must wait
2329 until overload resolution has been performed. */
2330 functions = BASELINK_FUNCTIONS (member);
2331 if (TREE_CODE (functions) == FUNCTION_DECL
2332 && DECL_STATIC_FUNCTION_P (functions))
2333 type = TREE_TYPE (functions);
2335 type = unknown_type_node;
2336 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2337 base. That will happen when the function is called. */
2338 result = build3 (COMPONENT_REF, type, object, member, NULL_TREE);
2340 else if (TREE_CODE (member) == CONST_DECL)
2342 /* The member is an enumerator. */
2344 /* If OBJECT has side-effects, they are supposed to occur. */
2345 if (TREE_SIDE_EFFECTS (object))
2346 result = build2 (COMPOUND_EXPR, TREE_TYPE (result),
2349 else if ((using_decl = strip_using_decl (member)) != member)
2350 result = build_class_member_access_expr (object,
2352 access_path, preserve_reference,
2356 if (complain & tf_error)
2357 error ("invalid use of %qD", member);
2358 return error_mark_node;
2361 if (!preserve_reference)
2364 If E2 is declared to have type "reference to T", then ... the
2365 type of E1.E2 is T. */
2366 result = convert_from_reference (result);
2371 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2372 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2375 lookup_destructor (tree object, tree scope, tree dtor_name)
2377 tree object_type = TREE_TYPE (object);
2378 tree dtor_type = TREE_OPERAND (dtor_name, 0);
2381 if (scope && !check_dtor_name (scope, dtor_type))
2383 error ("qualified type %qT does not match destructor name ~%qT",
2385 return error_mark_node;
2387 if (TREE_CODE (dtor_type) == IDENTIFIER_NODE)
2389 /* In a template, names we can't find a match for are still accepted
2390 destructor names, and we check them here. */
2391 if (check_dtor_name (object_type, dtor_type))
2392 dtor_type = object_type;
2395 error ("object type %qT does not match destructor name ~%qT",
2396 object_type, dtor_type);
2397 return error_mark_node;
2401 else if (!DERIVED_FROM_P (dtor_type, TYPE_MAIN_VARIANT (object_type)))
2403 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2404 TYPE_MAIN_VARIANT (object_type), dtor_type);
2405 return error_mark_node;
2407 expr = lookup_member (dtor_type, complete_dtor_identifier,
2408 /*protect=*/1, /*want_type=*/false,
2409 tf_warning_or_error);
2410 expr = (adjust_result_of_qualified_name_lookup
2411 (expr, dtor_type, object_type));
2415 /* An expression of the form "A::template B" has been resolved to
2416 DECL. Issue a diagnostic if B is not a template or template
2420 check_template_keyword (tree decl)
2422 /* The standard says:
2426 If a name prefixed by the keyword template is not a member
2427 template, the program is ill-formed.
2429 DR 228 removed the restriction that the template be a member
2432 DR 96, if accepted would add the further restriction that explicit
2433 template arguments must be provided if the template keyword is
2434 used, but, as of 2005-10-16, that DR is still in "drafting". If
2435 this DR is accepted, then the semantic checks here can be
2436 simplified, as the entity named must in fact be a template
2437 specialization, rather than, as at present, a set of overloaded
2438 functions containing at least one template function. */
2439 if (TREE_CODE (decl) != TEMPLATE_DECL
2440 && TREE_CODE (decl) != TEMPLATE_ID_EXPR)
2442 if (!is_overloaded_fn (decl))
2443 permerror (input_location, "%qD is not a template", decl);
2448 if (BASELINK_P (fns))
2449 fns = BASELINK_FUNCTIONS (fns);
2452 tree fn = OVL_CURRENT (fns);
2453 if (TREE_CODE (fn) == TEMPLATE_DECL
2454 || TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2456 if (TREE_CODE (fn) == FUNCTION_DECL
2457 && DECL_USE_TEMPLATE (fn)
2458 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
2460 fns = OVL_NEXT (fns);
2463 permerror (input_location, "%qD is not a template", decl);
2468 /* This function is called by the parser to process a class member
2469 access expression of the form OBJECT.NAME. NAME is a node used by
2470 the parser to represent a name; it is not yet a DECL. It may,
2471 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2472 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2473 there is no reason to do the lookup twice, so the parser keeps the
2474 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2475 be a template via the use of the "A::template B" syntax. */
2478 finish_class_member_access_expr (tree object, tree name, bool template_p,
2479 tsubst_flags_t complain)
2484 tree access_path = NULL_TREE;
2485 tree orig_object = object;
2486 tree orig_name = name;
2488 if (object == error_mark_node || name == error_mark_node)
2489 return error_mark_node;
2491 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2492 if (!objc_is_public (object, name))
2493 return error_mark_node;
2495 object_type = TREE_TYPE (object);
2497 if (processing_template_decl)
2499 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2500 dependent_type_p (object_type)
2501 /* If NAME is just an IDENTIFIER_NODE, then the expression
2503 || TREE_CODE (object) == IDENTIFIER_NODE
2504 /* If NAME is "f<args>", where either 'f' or 'args' is
2505 dependent, then the expression is dependent. */
2506 || (TREE_CODE (name) == TEMPLATE_ID_EXPR
2507 && dependent_template_id_p (TREE_OPERAND (name, 0),
2508 TREE_OPERAND (name, 1)))
2509 /* If NAME is "T::X" where "T" is dependent, then the
2510 expression is dependent. */
2511 || (TREE_CODE (name) == SCOPE_REF
2512 && TYPE_P (TREE_OPERAND (name, 0))
2513 && dependent_type_p (TREE_OPERAND (name, 0))))
2514 return build_min_nt (COMPONENT_REF, object, name, NULL_TREE);
2515 object = build_non_dependent_expr (object);
2517 else if (c_dialect_objc ()
2518 && TREE_CODE (name) == IDENTIFIER_NODE
2519 && (expr = objc_maybe_build_component_ref (object, name)))
2524 The type of the first expression shall be "class object" (of a
2526 if (!currently_open_class (object_type)
2527 && !complete_type_or_maybe_complain (object_type, object, complain))
2528 return error_mark_node;
2529 if (!CLASS_TYPE_P (object_type))
2531 if (complain & tf_error)
2533 if (POINTER_TYPE_P (object_type)
2534 && CLASS_TYPE_P (TREE_TYPE (object_type)))
2535 error ("request for member %qD in %qE, which is of pointer "
2536 "type %qT (maybe you meant to use %<->%> ?)",
2537 name, object, object_type);
2539 error ("request for member %qD in %qE, which is of non-class "
2540 "type %qT", name, object, object_type);
2542 return error_mark_node;
2545 if (BASELINK_P (name))
2546 /* A member function that has already been looked up. */
2550 bool is_template_id = false;
2551 tree template_args = NULL_TREE;
2554 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
2556 is_template_id = true;
2557 template_args = TREE_OPERAND (name, 1);
2558 name = TREE_OPERAND (name, 0);
2560 if (TREE_CODE (name) == OVERLOAD)
2561 name = DECL_NAME (get_first_fn (name));
2562 else if (DECL_P (name))
2563 name = DECL_NAME (name);
2566 if (TREE_CODE (name) == SCOPE_REF)
2568 /* A qualified name. The qualifying class or namespace `S'
2569 has already been looked up; it is either a TYPE or a
2571 scope = TREE_OPERAND (name, 0);
2572 name = TREE_OPERAND (name, 1);
2574 /* If SCOPE is a namespace, then the qualified name does not
2575 name a member of OBJECT_TYPE. */
2576 if (TREE_CODE (scope) == NAMESPACE_DECL)
2578 if (complain & tf_error)
2579 error ("%<%D::%D%> is not a member of %qT",
2580 scope, name, object_type);
2581 return error_mark_node;
2584 gcc_assert (CLASS_TYPE_P (scope));
2585 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE
2586 || TREE_CODE (name) == BIT_NOT_EXPR);
2588 if (constructor_name_p (name, scope))
2590 if (complain & tf_error)
2591 error ("cannot call constructor %<%T::%D%> directly",
2593 return error_mark_node;
2596 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2597 access_path = lookup_base (object_type, scope, ba_check, NULL);
2598 if (access_path == error_mark_node)
2599 return error_mark_node;
2602 if (complain & tf_error)
2603 error ("%qT is not a base of %qT", scope, object_type);
2604 return error_mark_node;
2610 access_path = object_type;
2613 if (TREE_CODE (name) == BIT_NOT_EXPR)
2614 member = lookup_destructor (object, scope, name);
2617 /* Look up the member. */
2618 member = lookup_member (access_path, name, /*protect=*/1,
2619 /*want_type=*/false, complain);
2620 if (member == NULL_TREE)
2622 if (complain & tf_error)
2623 error ("%qD has no member named %qE",
2624 TREE_CODE (access_path) == TREE_BINFO
2625 ? TREE_TYPE (access_path) : object_type, name);
2626 return error_mark_node;
2628 if (member == error_mark_node)
2629 return error_mark_node;
2634 tree templ = member;
2636 if (BASELINK_P (templ))
2637 templ = lookup_template_function (templ, template_args);
2640 if (complain & tf_error)
2641 error ("%qD is not a member template function", name);
2642 return error_mark_node;
2647 if (TREE_DEPRECATED (member))
2648 warn_deprecated_use (member, NULL_TREE);
2651 check_template_keyword (member);
2653 expr = build_class_member_access_expr (object, member, access_path,
2654 /*preserve_reference=*/false,
2656 if (processing_template_decl && expr != error_mark_node)
2658 if (BASELINK_P (member))
2660 if (TREE_CODE (orig_name) == SCOPE_REF)
2661 BASELINK_QUALIFIED_P (member) = 1;
2664 return build_min_non_dep (COMPONENT_REF, expr,
2665 orig_object, orig_name,
2672 /* Return an expression for the MEMBER_NAME field in the internal
2673 representation of PTRMEM, a pointer-to-member function. (Each
2674 pointer-to-member function type gets its own RECORD_TYPE so it is
2675 more convenient to access the fields by name than by FIELD_DECL.)
2676 This routine converts the NAME to a FIELD_DECL and then creates the
2677 node for the complete expression. */
2680 build_ptrmemfunc_access_expr (tree ptrmem, tree member_name)
2686 /* This code is a stripped down version of
2687 build_class_member_access_expr. It does not work to use that
2688 routine directly because it expects the object to be of class
2690 ptrmem_type = TREE_TYPE (ptrmem);
2691 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type));
2692 member = lookup_member (ptrmem_type, member_name, /*protect=*/0,
2693 /*want_type=*/false, tf_warning_or_error);
2694 member_type = cp_build_qualified_type (TREE_TYPE (member),
2695 cp_type_quals (ptrmem_type));
2696 return fold_build3_loc (input_location,
2697 COMPONENT_REF, member_type,
2698 ptrmem, member, NULL_TREE);
2701 /* Given an expression PTR for a pointer, return an expression
2702 for the value pointed to.
2703 ERRORSTRING is the name of the operator to appear in error messages.
2705 This function may need to overload OPERATOR_FNNAME.
2706 Must also handle REFERENCE_TYPEs for C++. */
2709 build_x_indirect_ref (tree expr, ref_operator errorstring,
2710 tsubst_flags_t complain)
2712 tree orig_expr = expr;
2715 if (processing_template_decl)
2717 /* Retain the type if we know the operand is a pointer. */
2718 if (TREE_TYPE (expr) && POINTER_TYPE_P (TREE_TYPE (expr)))
2719 return build_min (INDIRECT_REF, TREE_TYPE (TREE_TYPE (expr)), expr);
2720 if (type_dependent_expression_p (expr))
2721 return build_min_nt (INDIRECT_REF, expr);
2722 expr = build_non_dependent_expr (expr);
2725 rval = build_new_op (INDIRECT_REF, LOOKUP_NORMAL, expr, NULL_TREE,
2726 NULL_TREE, /*overload=*/NULL, complain);
2728 rval = cp_build_indirect_ref (expr, errorstring, complain);
2730 if (processing_template_decl && rval != error_mark_node)
2731 return build_min_non_dep (INDIRECT_REF, rval, orig_expr);
2736 /* Helper function called from c-common. */
2738 build_indirect_ref (location_t loc ATTRIBUTE_UNUSED,
2739 tree ptr, ref_operator errorstring)
2741 return cp_build_indirect_ref (ptr, errorstring, tf_warning_or_error);
2745 cp_build_indirect_ref (tree ptr, ref_operator errorstring,
2746 tsubst_flags_t complain)
2750 if (ptr == error_mark_node)
2751 return error_mark_node;
2753 if (ptr == current_class_ptr)
2754 return current_class_ref;
2756 pointer = (TREE_CODE (TREE_TYPE (ptr)) == REFERENCE_TYPE
2757 ? ptr : decay_conversion (ptr));
2758 type = TREE_TYPE (pointer);
2760 if (POINTER_TYPE_P (type))
2764 If the type of the expression is "pointer to T," the type
2765 of the result is "T." */
2766 tree t = TREE_TYPE (type);
2768 if (CONVERT_EXPR_P (ptr)
2769 || TREE_CODE (ptr) == VIEW_CONVERT_EXPR)
2771 /* If a warning is issued, mark it to avoid duplicates from
2772 the backend. This only needs to be done at
2773 warn_strict_aliasing > 2. */
2774 if (warn_strict_aliasing > 2)
2775 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr, 0)),
2776 type, TREE_OPERAND (ptr, 0)))
2777 TREE_NO_WARNING (ptr) = 1;
2780 if (VOID_TYPE_P (t))
2782 /* A pointer to incomplete type (other than cv void) can be
2783 dereferenced [expr.unary.op]/1 */
2784 if (complain & tf_error)
2785 error ("%qT is not a pointer-to-object type", type);
2786 return error_mark_node;
2788 else if (TREE_CODE (pointer) == ADDR_EXPR
2789 && same_type_p (t, TREE_TYPE (TREE_OPERAND (pointer, 0))))
2790 /* The POINTER was something like `&x'. We simplify `*&x' to
2792 return TREE_OPERAND (pointer, 0);
2795 tree ref = build1 (INDIRECT_REF, t, pointer);
2797 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2798 so that we get the proper error message if the result is used
2799 to assign to. Also, &* is supposed to be a no-op. */
2800 TREE_READONLY (ref) = CP_TYPE_CONST_P (t);
2801 TREE_THIS_VOLATILE (ref) = CP_TYPE_VOLATILE_P (t);
2802 TREE_SIDE_EFFECTS (ref)
2803 = (TREE_THIS_VOLATILE (ref) || TREE_SIDE_EFFECTS (pointer));
2807 else if (!(complain & tf_error))
2808 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2810 /* `pointer' won't be an error_mark_node if we were given a
2811 pointer to member, so it's cool to check for this here. */
2812 else if (TYPE_PTR_TO_MEMBER_P (type))
2813 switch (errorstring)
2815 case RO_ARRAY_INDEXING:
2816 error ("invalid use of array indexing on pointer to member");
2819 error ("invalid use of unary %<*%> on pointer to member");
2821 case RO_IMPLICIT_CONVERSION:
2822 error ("invalid use of implicit conversion on pointer to member");
2827 else if (pointer != error_mark_node)
2828 invalid_indirection_error (input_location, type, errorstring);
2830 return error_mark_node;
2833 /* This handles expressions of the form "a[i]", which denotes
2836 This is logically equivalent in C to *(a+i), but we may do it differently.
2837 If A is a variable or a member, we generate a primitive ARRAY_REF.
2838 This avoids forcing the array out of registers, and can work on
2839 arrays that are not lvalues (for example, members of structures returned
2842 If INDEX is of some user-defined type, it must be converted to
2843 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2844 will inherit the type of the array, which will be some pointer type.
2846 LOC is the location to use in building the array reference. */
2849 cp_build_array_ref (location_t loc, tree array, tree idx,
2850 tsubst_flags_t complain)
2856 if (complain & tf_error)
2857 error_at (loc, "subscript missing in array reference");
2858 return error_mark_node;
2861 if (TREE_TYPE (array) == error_mark_node
2862 || TREE_TYPE (idx) == error_mark_node)
2863 return error_mark_node;
2865 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2867 switch (TREE_CODE (array))
2871 tree value = cp_build_array_ref (loc, TREE_OPERAND (array, 1), idx,
2873 ret = build2 (COMPOUND_EXPR, TREE_TYPE (value),
2874 TREE_OPERAND (array, 0), value);
2875 SET_EXPR_LOCATION (ret, loc);
2880 ret = build_conditional_expr
2881 (TREE_OPERAND (array, 0),
2882 cp_build_array_ref (loc, TREE_OPERAND (array, 1), idx,
2884 cp_build_array_ref (loc, TREE_OPERAND (array, 2), idx,
2886 tf_warning_or_error);
2887 protected_set_expr_location (ret, loc);
2894 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
2898 warn_array_subscript_with_type_char (idx);
2900 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx)))
2902 if (complain & tf_error)
2903 error_at (loc, "array subscript is not an integer");
2904 return error_mark_node;
2907 /* Apply integral promotions *after* noticing character types.
2908 (It is unclear why we do these promotions -- the standard
2909 does not say that we should. In fact, the natural thing would
2910 seem to be to convert IDX to ptrdiff_t; we're performing
2911 pointer arithmetic.) */
2912 idx = perform_integral_promotions (idx);
2914 /* An array that is indexed by a non-constant
2915 cannot be stored in a register; we must be able to do
2916 address arithmetic on its address.
2917 Likewise an array of elements of variable size. */
2918 if (TREE_CODE (idx) != INTEGER_CST
2919 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
2920 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array))))
2923 if (!cxx_mark_addressable (array))
2924 return error_mark_node;
2927 /* An array that is indexed by a constant value which is not within
2928 the array bounds cannot be stored in a register either; because we
2929 would get a crash in store_bit_field/extract_bit_field when trying
2930 to access a non-existent part of the register. */
2931 if (TREE_CODE (idx) == INTEGER_CST
2932 && TYPE_DOMAIN (TREE_TYPE (array))
2933 && ! int_fits_type_p (idx, TYPE_DOMAIN (TREE_TYPE (array))))
2935 if (!cxx_mark_addressable (array))
2936 return error_mark_node;
2939 if (!lvalue_p (array) && (complain & tf_error))
2940 pedwarn (loc, OPT_pedantic,
2941 "ISO C++ forbids subscripting non-lvalue array");
2943 /* Note in C++ it is valid to subscript a `register' array, since
2944 it is valid to take the address of something with that
2945 storage specification. */
2949 while (TREE_CODE (foo) == COMPONENT_REF)
2950 foo = TREE_OPERAND (foo, 0);
2951 if (TREE_CODE (foo) == VAR_DECL && DECL_REGISTER (foo)
2952 && (complain & tf_warning))
2953 warning_at (loc, OPT_Wextra,
2954 "subscripting array declared %<register%>");
2957 type = TREE_TYPE (TREE_TYPE (array));
2958 rval = build4 (ARRAY_REF, type, array, idx, NULL_TREE, NULL_TREE);
2959 /* Array ref is const/volatile if the array elements are
2960 or if the array is.. */
2961 TREE_READONLY (rval)
2962 |= (CP_TYPE_CONST_P (type) | TREE_READONLY (array));
2963 TREE_SIDE_EFFECTS (rval)
2964 |= (CP_TYPE_VOLATILE_P (type) | TREE_SIDE_EFFECTS (array));
2965 TREE_THIS_VOLATILE (rval)
2966 |= (CP_TYPE_VOLATILE_P (type) | TREE_THIS_VOLATILE (array));
2967 ret = require_complete_type_sfinae (fold_if_not_in_template (rval),
2969 protected_set_expr_location (ret, loc);
2974 tree ar = default_conversion (array);
2975 tree ind = default_conversion (idx);
2977 /* Put the integer in IND to simplify error checking. */
2978 if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
2985 if (ar == error_mark_node)
2988 if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE)
2990 if (complain & tf_error)
2991 error_at (loc, "subscripted value is neither array nor pointer");
2992 return error_mark_node;
2994 if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
2996 if (complain & tf_error)
2997 error_at (loc, "array subscript is not an integer");
2998 return error_mark_node;
3001 warn_array_subscript_with_type_char (idx);
3003 ret = cp_build_indirect_ref (cp_build_binary_op (input_location,
3008 protected_set_expr_location (ret, loc);
3013 /* Entry point for Obj-C++. */
3016 build_array_ref (location_t loc, tree array, tree idx)
3018 return cp_build_array_ref (loc, array, idx, tf_warning_or_error);
3021 /* Resolve a pointer to member function. INSTANCE is the object
3022 instance to use, if the member points to a virtual member.
3024 This used to avoid checking for virtual functions if basetype
3025 has no virtual functions, according to an earlier ANSI draft.
3026 With the final ISO C++ rules, such an optimization is
3027 incorrect: A pointer to a derived member can be static_cast
3028 to pointer-to-base-member, as long as the dynamic object
3029 later has the right member. */
3032 get_member_function_from_ptrfunc (tree *instance_ptrptr, tree function)
3034 if (TREE_CODE (function) == OFFSET_REF)
3035 function = TREE_OPERAND (function, 1);
3037 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function)))
3039 tree idx, delta, e1, e2, e3, vtbl, basetype;
3040 tree fntype = TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function));
3042 tree instance_ptr = *instance_ptrptr;
3043 tree instance_save_expr = 0;
3044 if (instance_ptr == error_mark_node)
3046 if (TREE_CODE (function) == PTRMEM_CST)
3048 /* Extracting the function address from a pmf is only
3049 allowed with -Wno-pmf-conversions. It only works for
3051 e1 = build_addr_func (PTRMEM_CST_MEMBER (function));
3052 e1 = convert (fntype, e1);
3057 error ("object missing in use of %qE", function);
3058 return error_mark_node;
3062 if (TREE_SIDE_EFFECTS (instance_ptr))
3063 instance_ptr = instance_save_expr = save_expr (instance_ptr);
3065 if (TREE_SIDE_EFFECTS (function))
3066 function = save_expr (function);
3068 /* Start by extracting all the information from the PMF itself. */
3069 e3 = pfn_from_ptrmemfunc (function);
3070 delta = delta_from_ptrmemfunc (function);
3071 idx = build1 (NOP_EXPR, vtable_index_type, e3);
3072 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
3074 case ptrmemfunc_vbit_in_pfn:
3075 e1 = cp_build_binary_op (input_location,
3076 BIT_AND_EXPR, idx, integer_one_node,
3077 tf_warning_or_error);
3078 idx = cp_build_binary_op (input_location,
3079 MINUS_EXPR, idx, integer_one_node,
3080 tf_warning_or_error);
3083 case ptrmemfunc_vbit_in_delta:
3084 e1 = cp_build_binary_op (input_location,
3085 BIT_AND_EXPR, delta, integer_one_node,
3086 tf_warning_or_error);
3087 delta = cp_build_binary_op (input_location,
3088 RSHIFT_EXPR, delta, integer_one_node,
3089 tf_warning_or_error);
3096 /* Convert down to the right base before using the instance. A
3097 special case is that in a pointer to member of class C, C may
3098 be incomplete. In that case, the function will of course be
3099 a member of C, and no conversion is required. In fact,
3100 lookup_base will fail in that case, because incomplete
3101 classes do not have BINFOs. */
3102 basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (fntype));
3103 if (!same_type_ignoring_top_level_qualifiers_p
3104 (basetype, TREE_TYPE (TREE_TYPE (instance_ptr))))
3106 basetype = lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr)),
3107 basetype, ba_check, NULL);
3108 instance_ptr = build_base_path (PLUS_EXPR, instance_ptr, basetype,
3109 1, tf_warning_or_error);
3110 if (instance_ptr == error_mark_node)
3111 return error_mark_node;
3113 /* ...and then the delta in the PMF. */
3114 instance_ptr = fold_build_pointer_plus (instance_ptr, delta);
3116 /* Hand back the adjusted 'this' argument to our caller. */
3117 *instance_ptrptr = instance_ptr;
3119 /* Next extract the vtable pointer from the object. */
3120 vtbl = build1 (NOP_EXPR, build_pointer_type (vtbl_ptr_type_node),
3122 vtbl = cp_build_indirect_ref (vtbl, RO_NULL, tf_warning_or_error);
3123 /* If the object is not dynamic the access invokes undefined
3124 behavior. As it is not executed in this case silence the
3125 spurious warnings it may provoke. */
3126 TREE_NO_WARNING (vtbl) = 1;
3128 /* Finally, extract the function pointer from the vtable. */
3129 e2 = fold_build_pointer_plus_loc (input_location, vtbl, idx);
3130 e2 = cp_build_indirect_ref (e2, RO_NULL, tf_warning_or_error);
3131 TREE_CONSTANT (e2) = 1;
3133 /* When using function descriptors, the address of the
3134 vtable entry is treated as a function pointer. */
3135 if (TARGET_VTABLE_USES_DESCRIPTORS)
3136 e2 = build1 (NOP_EXPR, TREE_TYPE (e2),
3137 cp_build_addr_expr (e2, tf_warning_or_error));
3139 e2 = fold_convert (TREE_TYPE (e3), e2);
3140 e1 = build_conditional_expr (e1, e2, e3, tf_warning_or_error);
3142 /* Make sure this doesn't get evaluated first inside one of the
3143 branches of the COND_EXPR. */
3144 if (instance_save_expr)
3145 e1 = build2 (COMPOUND_EXPR, TREE_TYPE (e1),
3146 instance_save_expr, e1);
3153 /* Used by the C-common bits. */
3155 build_function_call (location_t loc ATTRIBUTE_UNUSED,
3156 tree function, tree params)
3158 return cp_build_function_call (function, params, tf_warning_or_error);
3161 /* Used by the C-common bits. */
3163 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED,
3164 tree function, VEC(tree,gc) *params,
3165 VEC(tree,gc) *origtypes ATTRIBUTE_UNUSED)
3167 VEC(tree,gc) *orig_params = params;
3168 tree ret = cp_build_function_call_vec (function, ¶ms,
3169 tf_warning_or_error);
3171 /* cp_build_function_call_vec can reallocate PARAMS by adding
3172 default arguments. That should never happen here. Verify
3174 gcc_assert (params == orig_params);
3179 /* Build a function call using a tree list of arguments. */
3182 cp_build_function_call (tree function, tree params, tsubst_flags_t complain)
3187 vec = make_tree_vector ();
3188 for (; params != NULL_TREE; params = TREE_CHAIN (params))
3189 VEC_safe_push (tree, gc, vec, TREE_VALUE (params));
3190 ret = cp_build_function_call_vec (function, &vec, complain);
3191 release_tree_vector (vec);
3195 /* Build a function call using varargs. */
3198 cp_build_function_call_nary (tree function, tsubst_flags_t complain, ...)
3204 vec = make_tree_vector ();
3205 va_start (args, complain);
3206 for (t = va_arg (args, tree); t != NULL_TREE; t = va_arg (args, tree))
3207 VEC_safe_push (tree, gc, vec, t);
3209 ret = cp_build_function_call_vec (function, &vec, complain);
3210 release_tree_vector (vec);
3214 /* Build a function call using a vector of arguments. PARAMS may be
3215 NULL if there are no parameters. This changes the contents of
3219 cp_build_function_call_vec (tree function, VEC(tree,gc) **params,
3220 tsubst_flags_t complain)
3222 tree fntype, fndecl;
3224 tree original = function;
3228 VEC(tree,gc) *allocated = NULL;
3231 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3232 expressions, like those used for ObjC messenger dispatches. */
3233 if (params != NULL && !VEC_empty (tree, *params))
3234 function = objc_rewrite_function_call (function,
3235 VEC_index (tree, *params, 0));
3237 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3238 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3239 if (TREE_CODE (function) == NOP_EXPR
3240 && TREE_TYPE (function) == TREE_TYPE (TREE_OPERAND (function, 0)))
3241 function = TREE_OPERAND (function, 0);
3243 if (TREE_CODE (function) == FUNCTION_DECL)
3245 mark_used (function);
3248 /* Convert anything with function type to a pointer-to-function. */
3249 if (DECL_MAIN_P (function) && (complain & tf_error))
3250 pedwarn (input_location, OPT_pedantic,
3251 "ISO C++ forbids calling %<::main%> from within program");
3253 function = build_addr_func (function);
3259 function = build_addr_func (function);
3262 if (function == error_mark_node)
3263 return error_mark_node;
3265 fntype = TREE_TYPE (function);
3267 if (TYPE_PTRMEMFUNC_P (fntype))
3269 if (complain & tf_error)
3270 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3271 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3272 original, original);
3273 return error_mark_node;
3276 is_method = (TREE_CODE (fntype) == POINTER_TYPE
3277 && TREE_CODE (TREE_TYPE (fntype)) == METHOD_TYPE);
3279 if (!((TREE_CODE (fntype) == POINTER_TYPE
3280 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE)
3282 || TREE_CODE (function) == TEMPLATE_ID_EXPR))
3284 if (complain & tf_error)
3285 error ("%qE cannot be used as a function", original);
3286 return error_mark_node;
3289 /* fntype now gets the type of function pointed to. */
3290 fntype = TREE_TYPE (fntype);
3291 parm_types = TYPE_ARG_TYPES (fntype);
3295 allocated = make_tree_vector ();
3296 params = &allocated;
3299 nargs = convert_arguments (parm_types, params, fndecl, LOOKUP_NORMAL,
3302 return error_mark_node;
3304 argarray = VEC_address (tree, *params);
3306 /* Check for errors in format strings and inappropriately
3308 check_function_arguments (fntype, nargs, argarray);
3310 ret = build_cxx_call (function, nargs, argarray);
3312 if (allocated != NULL)
3313 release_tree_vector (allocated);
3318 /* Subroutine of convert_arguments.
3319 Warn about wrong number of args are genereted. */
3322 warn_args_num (location_t loc, tree fndecl, bool too_many_p)
3326 if (TREE_CODE (TREE_TYPE (fndecl)) == METHOD_TYPE)
3328 if (DECL_NAME (fndecl) == NULL_TREE
3329 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl)))
3332 ? G_("too many arguments to constructor %q#D")
3333 : G_("too few arguments to constructor %q#D"),
3338 ? G_("too many arguments to member function %q#D")
3339 : G_("too few arguments to member function %q#D"),
3345 ? G_("too many arguments to function %q#D")
3346 : G_("too few arguments to function %q#D"),
3348 inform (DECL_SOURCE_LOCATION (fndecl),
3353 if (c_dialect_objc () && objc_message_selector ())
3356 ? G_("too many arguments to method %q#D")
3357 : G_("too few arguments to method %q#D"),
3358 objc_message_selector ());
3360 error_at (loc, too_many_p ? G_("too many arguments to function")
3361 : G_("too few arguments to function"));
3365 /* Convert the actual parameter expressions in the list VALUES to the
3366 types in the list TYPELIST. The converted expressions are stored
3367 back in the VALUES vector.
3368 If parmdecls is exhausted, or when an element has NULL as its type,
3369 perform the default conversions.
3371 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3373 This is also where warnings about wrong number of args are generated.
3375 Returns the actual number of arguments processed (which might be less
3376 than the length of the vector), or -1 on error.
3378 In C++, unspecified trailing parameters can be filled in with their
3379 default arguments, if such were specified. Do so here. */
3382 convert_arguments (tree typelist, VEC(tree,gc) **values, tree fndecl,
3383 int flags, tsubst_flags_t complain)
3388 /* Argument passing is always copy-initialization. */
3389 flags |= LOOKUP_ONLYCONVERTING;
3391 for (i = 0, typetail = typelist;
3392 i < VEC_length (tree, *values);
3395 tree type = typetail ? TREE_VALUE (typetail) : 0;
3396 tree val = VEC_index (tree, *values, i);
3398 if (val == error_mark_node || type == error_mark_node)
3401 if (type == void_type_node)
3403 if (complain & tf_error)
3405 warn_args_num (input_location, fndecl, /*too_many_p=*/true);
3412 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3413 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3414 if (TREE_CODE (val) == NOP_EXPR
3415 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0))
3416 && (type == 0 || TREE_CODE (type) != REFERENCE_TYPE))
3417 val = TREE_OPERAND (val, 0);
3419 if (type == 0 || TREE_CODE (type) != REFERENCE_TYPE)
3421 if (TREE_CODE (TREE_TYPE (val)) == ARRAY_TYPE
3422 || TREE_CODE (TREE_TYPE (val)) == FUNCTION_TYPE
3423 || TREE_CODE (TREE_TYPE (val)) == METHOD_TYPE)
3424 val = decay_conversion (val);
3427 if (val == error_mark_node)
3432 /* Formal parm type is specified by a function prototype. */
3435 if (!COMPLETE_TYPE_P (complete_type (type)))
3437 if (complain & tf_error)
3440 error ("parameter %P of %qD has incomplete type %qT",
3443 error ("parameter %P has incomplete type %qT", i, type);
3445 parmval = error_mark_node;
3449 parmval = convert_for_initialization
3450 (NULL_TREE, type, val, flags,
3451 ICR_ARGPASS, fndecl, i, complain);
3452 parmval = convert_for_arg_passing (type, parmval);
3455 if (parmval == error_mark_node)
3458 VEC_replace (tree, *values, i, parmval);
3462 if (fndecl && DECL_BUILT_IN (fndecl)
3463 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CONSTANT_P)
3464 /* Don't do ellipsis conversion for __built_in_constant_p
3465 as this will result in spurious errors for non-trivial
3467 val = require_complete_type_sfinae (val, complain);
3469 val = convert_arg_to_ellipsis (val);
3471 VEC_replace (tree, *values, i, val);
3475 typetail = TREE_CHAIN (typetail);
3478 if (typetail != 0 && typetail != void_list_node)
3480 /* See if there are default arguments that can be used. Because
3481 we hold default arguments in the FUNCTION_TYPE (which is so
3482 wrong), we can see default parameters here from deduced
3483 contexts (and via typeof) for indirect function calls.
3484 Fortunately we know whether we have a function decl to
3485 provide default arguments in a language conformant
3487 if (fndecl && TREE_PURPOSE (typetail)
3488 && TREE_CODE (TREE_PURPOSE (typetail)) != DEFAULT_ARG)
3490 for (; typetail != void_list_node; ++i)
3493 = convert_default_arg (TREE_VALUE (typetail),
3494 TREE_PURPOSE (typetail),
3497 if (parmval == error_mark_node)
3500 VEC_safe_push (tree, gc, *values, parmval);
3501 typetail = TREE_CHAIN (typetail);
3502 /* ends with `...'. */
3503 if (typetail == NULL_TREE)
3509 if (complain & tf_error)
3510 warn_args_num (input_location, fndecl, /*too_many_p=*/false);
3518 /* Build a binary-operation expression, after performing default
3519 conversions on the operands. CODE is the kind of expression to
3520 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3521 are the tree codes which correspond to ARG1 and ARG2 when issuing
3522 warnings about possibly misplaced parentheses. They may differ
3523 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3524 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3525 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3526 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3527 ARG2_CODE as ERROR_MARK. */
3530 build_x_binary_op (enum tree_code code, tree arg1, enum tree_code arg1_code,
3531 tree arg2, enum tree_code arg2_code, tree *overload,
3532 tsubst_flags_t complain)
3541 if (processing_template_decl)
3543 if (type_dependent_expression_p (arg1)
3544 || type_dependent_expression_p (arg2))
3545 return build_min_nt (code, arg1, arg2);
3546 arg1 = build_non_dependent_expr (arg1);
3547 arg2 = build_non_dependent_expr (arg2);
3550 if (code == DOTSTAR_EXPR)
3551 expr = build_m_component_ref (arg1, arg2);
3553 expr = build_new_op (code, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
3554 overload, complain);
3556 /* Check for cases such as x+y<<z which users are likely to
3557 misinterpret. But don't warn about obj << x + y, since that is a
3558 common idiom for I/O. */
3559 if (warn_parentheses
3560 && (complain & tf_warning)
3561 && !processing_template_decl
3562 && !error_operand_p (arg1)
3563 && !error_operand_p (arg2)
3564 && (code != LSHIFT_EXPR
3565 || !CLASS_TYPE_P (TREE_TYPE (arg1))))
3566 warn_about_parentheses (code, arg1_code, orig_arg1, arg2_code, orig_arg2);
3568 if (processing_template_decl && expr != error_mark_node)
3569 return build_min_non_dep (code, expr, orig_arg1, orig_arg2);
3574 /* Build and return an ARRAY_REF expression. */
3577 build_x_array_ref (tree arg1, tree arg2, tsubst_flags_t complain)
3579 tree orig_arg1 = arg1;
3580 tree orig_arg2 = arg2;
3583 if (processing_template_decl)
3585 if (type_dependent_expression_p (arg1)
3586 || type_dependent_expression_p (arg2))
3587 return build_min_nt (ARRAY_REF, arg1, arg2,
3588 NULL_TREE, NULL_TREE);
3589 arg1 = build_non_dependent_expr (arg1);
3590 arg2 = build_non_dependent_expr (arg2);
3593 expr = build_new_op (ARRAY_REF, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
3594 /*overload=*/NULL, complain);
3596 if (processing_template_decl && expr != error_mark_node)
3597 return build_min_non_dep (ARRAY_REF, expr, orig_arg1, orig_arg2,
3598 NULL_TREE, NULL_TREE);
3602 /* For the c-common bits. */
3604 build_binary_op (location_t location, enum tree_code code, tree op0, tree op1,
3605 int convert_p ATTRIBUTE_UNUSED)
3607 return cp_build_binary_op (location, code, op0, op1, tf_warning_or_error);
3611 /* Build a binary-operation expression without default conversions.
3612 CODE is the kind of expression to build.
3613 LOCATION is the location_t of the operator in the source code.
3614 This function differs from `build' in several ways:
3615 the data type of the result is computed and recorded in it,
3616 warnings are generated if arg data types are invalid,
3617 special handling for addition and subtraction of pointers is known,
3618 and some optimization is done (operations on narrow ints
3619 are done in the narrower type when that gives the same result).
3620 Constant folding is also done before the result is returned.
3622 Note that the operands will never have enumeral types
3623 because either they have just had the default conversions performed
3624 or they have both just been converted to some other type in which
3625 the arithmetic is to be done.
3627 C++: must do special pointer arithmetic when implementing
3628 multiple inheritance, and deal with pointer to member functions. */
3631 cp_build_binary_op (location_t location,
3632 enum tree_code code, tree orig_op0, tree orig_op1,
3633 tsubst_flags_t complain)
3636 enum tree_code code0, code1;
3638 const char *invalid_op_diag;
3640 /* Expression code to give to the expression when it is built.
3641 Normally this is CODE, which is what the caller asked for,
3642 but in some special cases we change it. */
3643 enum tree_code resultcode = code;
3645 /* Data type in which the computation is to be performed.
3646 In the simplest cases this is the common type of the arguments. */
3647 tree result_type = NULL;
3649 /* Nonzero means operands have already been type-converted
3650 in whatever way is necessary.
3651 Zero means they need to be converted to RESULT_TYPE. */
3654 /* Nonzero means create the expression with this type, rather than
3656 tree build_type = 0;
3658 /* Nonzero means after finally constructing the expression
3659 convert it to this type. */
3660 tree final_type = 0;
3664 /* Nonzero if this is an operation like MIN or MAX which can
3665 safely be computed in short if both args are promoted shorts.
3666 Also implies COMMON.
3667 -1 indicates a bitwise operation; this makes a difference
3668 in the exact conditions for when it is safe to do the operation
3669 in a narrower mode. */
3672 /* Nonzero if this is a comparison operation;
3673 if both args are promoted shorts, compare the original shorts.
3674 Also implies COMMON. */
3675 int short_compare = 0;
3677 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3680 /* True if both operands have arithmetic type. */
3681 bool arithmetic_types_p;
3683 /* Apply default conversions. */
3687 if (code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
3688 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
3689 || code == TRUTH_XOR_EXPR)
3691 if (!really_overloaded_fn (op0) && !VOID_TYPE_P (TREE_TYPE (op0)))
3692 op0 = decay_conversion (op0);
3693 if (!really_overloaded_fn (op1) && !VOID_TYPE_P (TREE_TYPE (op1)))
3694 op1 = decay_conversion (op1);
3698 if (!really_overloaded_fn (op0) && !VOID_TYPE_P (TREE_TYPE (op0)))
3699 op0 = default_conversion (op0);
3700 if (!really_overloaded_fn (op1) && !VOID_TYPE_P (TREE_TYPE (op1)))
3701 op1 = default_conversion (op1);
3704 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3705 STRIP_TYPE_NOPS (op0);
3706 STRIP_TYPE_NOPS (op1);
3708 /* DTRT if one side is an overloaded function, but complain about it. */
3709 if (type_unknown_p (op0))
3711 tree t = instantiate_type (TREE_TYPE (op1), op0, tf_none);
3712 if (t != error_mark_node)
3714 if (complain & tf_error)
3715 permerror (input_location, "assuming cast to type %qT from overloaded function",
3720 if (type_unknown_p (op1))
3722 tree t = instantiate_type (TREE_TYPE (op0), op1, tf_none);
3723 if (t != error_mark_node)
3725 if (complain & tf_error)
3726 permerror (input_location, "assuming cast to type %qT from overloaded function",
3732 type0 = TREE_TYPE (op0);
3733 type1 = TREE_TYPE (op1);
3735 /* The expression codes of the data types of the arguments tell us
3736 whether the arguments are integers, floating, pointers, etc. */
3737 code0 = TREE_CODE (type0);
3738 code1 = TREE_CODE (type1);
3740 /* If an error was already reported for one of the arguments,
3741 avoid reporting another error. */
3742 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
3743 return error_mark_node;
3745 if ((invalid_op_diag
3746 = targetm.invalid_binary_op (code, type0, type1)))
3748 error (invalid_op_diag);
3749 return error_mark_node;
3752 /* Issue warnings about peculiar, but valid, uses of NULL. */
3753 if ((orig_op0 == null_node || orig_op1 == null_node)
3754 /* It's reasonable to use pointer values as operands of &&
3755 and ||, so NULL is no exception. */
3756 && code != TRUTH_ANDIF_EXPR && code != TRUTH_ORIF_EXPR
3757 && ( /* Both are NULL (or 0) and the operation was not a
3758 comparison or a pointer subtraction. */
3759 (null_ptr_cst_p (orig_op0) && null_ptr_cst_p (orig_op1)
3760 && code != EQ_EXPR && code != NE_EXPR && code != MINUS_EXPR)
3761 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3762 || (!null_ptr_cst_p (orig_op0)
3763 && !TYPE_PTR_P (type0) && !TYPE_PTR_TO_MEMBER_P (type0))
3764 || (!null_ptr_cst_p (orig_op1)
3765 && !TYPE_PTR_P (type1) && !TYPE_PTR_TO_MEMBER_P (type1)))
3766 && (complain & tf_warning))
3767 /* Some sort of arithmetic operation involving NULL was
3769 warning (OPT_Wpointer_arith, "NULL used in arithmetic");
3774 /* Subtraction of two similar pointers.
3775 We must subtract them as integers, then divide by object size. */
3776 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
3777 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0),
3779 return pointer_diff (op0, op1, common_pointer_type (type0, type1));
3780 /* In all other cases except pointer - int, the usual arithmetic
3782 else if (!(code0 == POINTER_TYPE && code1 == INTEGER_TYPE))
3787 /* The pointer - int case is just like pointer + int; fall
3790 if ((code0 == POINTER_TYPE || code1 == POINTER_TYPE)
3791 && (code0 == INTEGER_TYPE || code1 == INTEGER_TYPE))
3795 ptr_operand = ((code0 == POINTER_TYPE) ? op0 : op1);
3796 int_operand = ((code0 == INTEGER_TYPE) ? op0 : op1);
3797 if (processing_template_decl)
3799 result_type = TREE_TYPE (ptr_operand);
3802 return cp_pointer_int_sum (code,
3813 case TRUNC_DIV_EXPR:
3815 case FLOOR_DIV_EXPR:
3816 case ROUND_DIV_EXPR:
3817 case EXACT_DIV_EXPR:
3818 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
3819 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
3820 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3821 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
3823 enum tree_code tcode0 = code0, tcode1 = code1;
3825 warn_for_div_by_zero (location, op1);
3827 if (tcode0 == COMPLEX_TYPE || tcode0 == VECTOR_TYPE)
3828 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
3829 if (tcode1 == COMPLEX_TYPE || tcode1 == VECTOR_TYPE)
3830 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
3832 if (!(tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE))
3833 resultcode = RDIV_EXPR;
3835 /* When dividing two signed integers, we have to promote to int.
3836 unless we divide by a constant != -1. Note that default
3837 conversion will have been performed on the operands at this
3838 point, so we have to dig out the original type to find out if
3840 shorten = ((TREE_CODE (op0) == NOP_EXPR
3841 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3842 || (TREE_CODE (op1) == INTEGER_CST
3843 && ! integer_all_onesp (op1)));
3852 if ((code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3853 || (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
3854 && !VECTOR_FLOAT_TYPE_P (type0)
3855 && !VECTOR_FLOAT_TYPE_P (type1)))
3859 case TRUNC_MOD_EXPR:
3860 case FLOOR_MOD_EXPR:
3861 warn_for_div_by_zero (location, op1);
3863 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
3864 && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE
3865 && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE)
3867 else if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3869 /* Although it would be tempting to shorten always here, that loses
3870 on some targets, since the modulo instruction is undefined if the
3871 quotient can't be represented in the computation mode. We shorten
3872 only if unsigned or if dividing by something we know != -1. */
3873 shorten = ((TREE_CODE (op0) == NOP_EXPR
3874 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3875 || (TREE_CODE (op1) == INTEGER_CST
3876 && ! integer_all_onesp (op1)));
3881 case TRUTH_ANDIF_EXPR:
3882 case TRUTH_ORIF_EXPR:
3883 case TRUTH_AND_EXPR:
3885 result_type = boolean_type_node;
3888 /* Shift operations: result has same type as first operand;
3889 always convert second operand to int.
3890 Also set SHORT_SHIFT if shifting rightward. */
3893 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3895 result_type = type0;
3896 if (TREE_CODE (op1) == INTEGER_CST)
3898 if (tree_int_cst_lt (op1, integer_zero_node))
3900 if ((complain & tf_warning)
3901 && c_inhibit_evaluation_warnings == 0)
3902 warning (0, "right shift count is negative");
3906 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0
3907 && (complain & tf_warning)
3908 && c_inhibit_evaluation_warnings == 0)
3909 warning (0, "right shift count >= width of type");
3912 /* Convert the shift-count to an integer, regardless of
3913 size of value being shifted. */
3914 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3915 op1 = cp_convert (integer_type_node, op1);
3916 /* Avoid converting op1 to result_type later. */
3922 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3924 result_type = type0;
3925 if (TREE_CODE (op1) == INTEGER_CST)
3927 if (tree_int_cst_lt (op1, integer_zero_node))
3929 if ((complain & tf_warning)
3930 && c_inhibit_evaluation_warnings == 0)
3931 warning (0, "left shift count is negative");
3933 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3935 if ((complain & tf_warning)
3936 && c_inhibit_evaluation_warnings == 0)
3937 warning (0, "left shift count >= width of type");
3940 /* Convert the shift-count to an integer, regardless of
3941 size of value being shifted. */
3942 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3943 op1 = cp_convert (integer_type_node, op1);
3944 /* Avoid converting op1 to result_type later. */
3951 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3953 result_type = type0;
3954 if (TREE_CODE (op1) == INTEGER_CST)
3956 if (tree_int_cst_lt (op1, integer_zero_node))
3958 if (complain & tf_warning)
3959 warning (0, (code == LROTATE_EXPR)
3960 ? G_("left rotate count is negative")
3961 : G_("right rotate count is negative"));
3963 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3965 if (complain & tf_warning)
3966 warning (0, (code == LROTATE_EXPR)
3967 ? G_("left rotate count >= width of type")
3968 : G_("right rotate count >= width of type"));
3971 /* Convert the shift-count to an integer, regardless of
3972 size of value being shifted. */
3973 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3974 op1 = cp_convert (integer_type_node, op1);
3980 if ((complain & tf_warning)
3981 && (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1)))
3982 warning (OPT_Wfloat_equal,
3983 "comparing floating point with == or != is unsafe");
3984 if ((complain & tf_warning)
3985 && ((TREE_CODE (orig_op0) == STRING_CST && !integer_zerop (op1))
3986 || (TREE_CODE (orig_op1) == STRING_CST && !integer_zerop (op0))))
3987 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
3989 build_type = boolean_type_node;
3990 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
3991 || code0 == COMPLEX_TYPE || code0 == ENUMERAL_TYPE)
3992 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3993 || code1 == COMPLEX_TYPE || code1 == ENUMERAL_TYPE))
3995 else if ((code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3996 || (TYPE_PTRMEM_P (type0) && TYPE_PTRMEM_P (type1)))
3997 result_type = composite_pointer_type (type0, type1, op0, op1,
3998 CPO_COMPARISON, complain);
3999 else if ((code0 == POINTER_TYPE || TYPE_PTRMEM_P (type0))
4000 && null_ptr_cst_p (op1))
4002 if (TREE_CODE (op0) == ADDR_EXPR
4003 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
4005 if (complain & tf_warning)
4006 warning (OPT_Waddress, "the address of %qD will never be NULL",
4007 TREE_OPERAND (op0, 0));
4009 result_type = type0;
4011 else if ((code1 == POINTER_TYPE || TYPE_PTRMEM_P (type1))
4012 && null_ptr_cst_p (op0))
4014 if (TREE_CODE (op1) == ADDR_EXPR
4015 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
4017 if (complain & tf_warning)
4018 warning (OPT_Waddress, "the address of %qD will never be NULL",
4019 TREE_OPERAND (op1, 0));
4021 result_type = type1;
4023 else if (null_ptr_cst_p (op0) && null_ptr_cst_p (op1))
4024 /* One of the operands must be of nullptr_t type. */
4025 result_type = TREE_TYPE (nullptr_node);
4026 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
4028 result_type = type0;
4029 if (complain & tf_error)
4030 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4032 return error_mark_node;
4034 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
4036 result_type = type1;
4037 if (complain & tf_error)
4038 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4040 return error_mark_node;
4042 else if (TYPE_PTRMEMFUNC_P (type0) && null_ptr_cst_p (op1))
4044 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4045 == ptrmemfunc_vbit_in_delta)
4047 tree pfn0 = pfn_from_ptrmemfunc (op0);
4048 tree delta0 = delta_from_ptrmemfunc (op0);
4049 tree e1 = cp_build_binary_op (location,
4052 build_zero_cst (TREE_TYPE (pfn0)),
4054 tree e2 = cp_build_binary_op (location,
4059 e2 = cp_build_binary_op (location,
4060 EQ_EXPR, e2, integer_zero_node,
4062 op0 = cp_build_binary_op (location,
4063 TRUTH_ANDIF_EXPR, e1, e2,
4065 op1 = cp_convert (TREE_TYPE (op0), integer_one_node);
4069 op0 = build_ptrmemfunc_access_expr (op0, pfn_identifier);
4070 op1 = cp_convert (TREE_TYPE (op0), op1);
4072 result_type = TREE_TYPE (op0);
4074 else if (TYPE_PTRMEMFUNC_P (type1) && null_ptr_cst_p (op0))
4075 return cp_build_binary_op (location, code, op1, op0, complain);
4076 else if (TYPE_PTRMEMFUNC_P (type0) && TYPE_PTRMEMFUNC_P (type1))
4079 /* E will be the final comparison. */
4081 /* E1 and E2 are for scratch. */
4089 type = composite_pointer_type (type0, type1, op0, op1,
4090 CPO_COMPARISON, complain);
4092 if (!same_type_p (TREE_TYPE (op0), type))
4093 op0 = cp_convert_and_check (type, op0);
4094 if (!same_type_p (TREE_TYPE (op1), type))
4095 op1 = cp_convert_and_check (type, op1);
4097 if (op0 == error_mark_node || op1 == error_mark_node)
4098 return error_mark_node;
4100 if (TREE_SIDE_EFFECTS (op0))
4101 op0 = save_expr (op0);
4102 if (TREE_SIDE_EFFECTS (op1))
4103 op1 = save_expr (op1);
4105 pfn0 = pfn_from_ptrmemfunc (op0);
4106 pfn1 = pfn_from_ptrmemfunc (op1);
4107 delta0 = delta_from_ptrmemfunc (op0);
4108 delta1 = delta_from_ptrmemfunc (op1);
4109 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4110 == ptrmemfunc_vbit_in_delta)
4115 && ((op0.delta == op1.delta)
4116 || (!op0.pfn && op0.delta & 1 == 0
4117 && op1.delta & 1 == 0))
4119 The reason for the `!op0.pfn' bit is that a NULL
4120 pointer-to-member is any member with a zero PFN and
4121 LSB of the DELTA field is 0. */
4123 e1 = cp_build_binary_op (location, BIT_AND_EXPR,
4127 e1 = cp_build_binary_op (location,
4128 EQ_EXPR, e1, integer_zero_node,
4130 e2 = cp_build_binary_op (location, BIT_AND_EXPR,
4134 e2 = cp_build_binary_op (location,
4135 EQ_EXPR, e2, integer_zero_node,
4137 e1 = cp_build_binary_op (location,
4138 TRUTH_ANDIF_EXPR, e2, e1,
4140 e2 = cp_build_binary_op (location, EQ_EXPR,
4142 build_zero_cst (TREE_TYPE (pfn0)),
4144 e2 = cp_build_binary_op (location,
4145 TRUTH_ANDIF_EXPR, e2, e1, complain);
4146 e1 = cp_build_binary_op (location,
4147 EQ_EXPR, delta0, delta1, complain);
4148 e1 = cp_build_binary_op (location,
4149 TRUTH_ORIF_EXPR, e1, e2, complain);
4156 && (!op0.pfn || op0.delta == op1.delta))
4158 The reason for the `!op0.pfn' bit is that a NULL
4159 pointer-to-member is any member with a zero PFN; the
4160 DELTA field is unspecified. */
4162 e1 = cp_build_binary_op (location,
4163 EQ_EXPR, delta0, delta1, complain);
4164 e2 = cp_build_binary_op (location,
4167 build_zero_cst (TREE_TYPE (pfn0)),
4169 e1 = cp_build_binary_op (location,
4170 TRUTH_ORIF_EXPR, e1, e2, complain);
4172 e2 = build2 (EQ_EXPR, boolean_type_node, pfn0, pfn1);
4173 e = cp_build_binary_op (location,
4174 TRUTH_ANDIF_EXPR, e2, e1, complain);
4175 if (code == EQ_EXPR)
4177 return cp_build_binary_op (location,
4178 EQ_EXPR, e, integer_zero_node, complain);
4182 gcc_assert (!TYPE_PTRMEMFUNC_P (type0)
4183 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0),
4185 gcc_assert (!TYPE_PTRMEMFUNC_P (type1)
4186 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1),
4194 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
4195 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
4197 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
4198 result_type = composite_pointer_type (type0, type1, op0, op1,
4199 CPO_COMPARISON, complain);
4206 if (TREE_CODE (orig_op0) == STRING_CST
4207 || TREE_CODE (orig_op1) == STRING_CST)
4209 if (complain & tf_warning)
4210 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
4213 build_type = boolean_type_node;
4214 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
4215 || code0 == ENUMERAL_TYPE)
4216 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4217 || code1 == ENUMERAL_TYPE))
4219 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
4220 result_type = composite_pointer_type (type0, type1, op0, op1,
4221 CPO_COMPARISON, complain);
4222 else if (code0 == POINTER_TYPE && null_ptr_cst_p (op1))
4224 result_type = type0;
4225 if (extra_warnings && (complain & tf_warning))
4226 warning (OPT_Wextra,
4227 "ordered comparison of pointer with integer zero");
4229 else if (code1 == POINTER_TYPE && null_ptr_cst_p (op0))
4231 result_type = type1;
4232 if (extra_warnings && (complain & tf_warning))
4233 warning (OPT_Wextra,
4234 "ordered comparison of pointer with integer zero");
4236 else if (null_ptr_cst_p (op0) && null_ptr_cst_p (op1))
4237 /* One of the operands must be of nullptr_t type. */
4238 result_type = TREE_TYPE (nullptr_node);
4239 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
4241 result_type = type0;
4242 if (complain & tf_error)
4243 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4245 return error_mark_node;
4247 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
4249 result_type = type1;
4250 if (complain & tf_error)
4251 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4253 return error_mark_node;
4257 case UNORDERED_EXPR:
4264 build_type = integer_type_node;
4265 if (code0 != REAL_TYPE || code1 != REAL_TYPE)
4267 if (complain & tf_error)
4268 error ("unordered comparison on non-floating point argument");
4269 return error_mark_node;
4278 if (((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
4279 || code0 == ENUMERAL_TYPE)
4280 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4281 || code1 == COMPLEX_TYPE || code1 == ENUMERAL_TYPE)))
4282 arithmetic_types_p = 1;
4285 arithmetic_types_p = 0;
4286 /* Vector arithmetic is only allowed when both sides are vectors. */
4287 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
4289 if (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
4290 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
4293 binary_op_error (location, code, type0, type1);
4294 return error_mark_node;
4296 arithmetic_types_p = 1;
4299 /* Determine the RESULT_TYPE, if it is not already known. */
4301 && arithmetic_types_p
4302 && (shorten || common || short_compare))
4304 result_type = cp_common_type (type0, type1);
4305 do_warn_double_promotion (result_type, type0, type1,
4306 "implicit conversion from %qT to %qT "
4307 "to match other operand of binary "
4314 if (complain & tf_error)
4315 error ("invalid operands of types %qT and %qT to binary %qO",
4316 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1), code);
4317 return error_mark_node;
4320 /* If we're in a template, the only thing we need to know is the
4322 if (processing_template_decl)
4324 /* Since the middle-end checks the type when doing a build2, we
4325 need to build the tree in pieces. This built tree will never
4326 get out of the front-end as we replace it when instantiating
4328 tree tmp = build2 (resultcode,
4329 build_type ? build_type : result_type,
4331 TREE_OPERAND (tmp, 0) = op0;
4335 if (arithmetic_types_p)
4337 bool first_complex = (code0 == COMPLEX_TYPE);
4338 bool second_complex = (code1 == COMPLEX_TYPE);
4339 int none_complex = (!first_complex && !second_complex);
4341 /* Adapted from patch for c/24581. */
4342 if (first_complex != second_complex
4343 && (code == PLUS_EXPR
4344 || code == MINUS_EXPR
4345 || code == MULT_EXPR
4346 || (code == TRUNC_DIV_EXPR && first_complex))
4347 && TREE_CODE (TREE_TYPE (result_type)) == REAL_TYPE
4348 && flag_signed_zeros)
4350 /* An operation on mixed real/complex operands must be
4351 handled specially, but the language-independent code can
4352 more easily optimize the plain complex arithmetic if
4353 -fno-signed-zeros. */
4354 tree real_type = TREE_TYPE (result_type);
4358 if (TREE_TYPE (op0) != result_type)
4359 op0 = cp_convert_and_check (result_type, op0);
4360 if (TREE_TYPE (op1) != real_type)
4361 op1 = cp_convert_and_check (real_type, op1);
4365 if (TREE_TYPE (op0) != real_type)
4366 op0 = cp_convert_and_check (real_type, op0);
4367 if (TREE_TYPE (op1) != result_type)
4368 op1 = cp_convert_and_check (result_type, op1);
4370 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
4371 return error_mark_node;
4374 op0 = save_expr (op0);
4375 real = cp_build_unary_op (REALPART_EXPR, op0, 1, complain);
4376 imag = cp_build_unary_op (IMAGPART_EXPR, op0, 1, complain);
4380 case TRUNC_DIV_EXPR:
4381 op1 = save_expr (op1);
4382 imag = build2 (resultcode, real_type, imag, op1);
4386 real = build2 (resultcode, real_type, real, op1);
4394 op1 = save_expr (op1);
4395 real = cp_build_unary_op (REALPART_EXPR, op1, 1, complain);
4396 imag = cp_build_unary_op (IMAGPART_EXPR, op1, 1, complain);
4400 op0 = save_expr (op0);
4401 imag = build2 (resultcode, real_type, op0, imag);
4404 real = build2 (resultcode, real_type, op0, real);
4407 real = build2 (resultcode, real_type, op0, real);
4408 imag = build1 (NEGATE_EXPR, real_type, imag);
4414 real = fold_if_not_in_template (real);
4415 imag = fold_if_not_in_template (imag);
4416 result = build2 (COMPLEX_EXPR, result_type, real, imag);
4417 result = fold_if_not_in_template (result);
4421 /* For certain operations (which identify themselves by shorten != 0)
4422 if both args were extended from the same smaller type,
4423 do the arithmetic in that type and then extend.
4425 shorten !=0 and !=1 indicates a bitwise operation.
4426 For them, this optimization is safe only if
4427 both args are zero-extended or both are sign-extended.
4428 Otherwise, we might change the result.
4429 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4430 but calculated in (unsigned short) it would be (unsigned short)-1. */
4432 if (shorten && none_complex)
4434 final_type = result_type;
4435 result_type = shorten_binary_op (result_type, op0, op1,
4439 /* Comparison operations are shortened too but differently.
4440 They identify themselves by setting short_compare = 1. */
4444 /* Don't write &op0, etc., because that would prevent op0
4445 from being kept in a register.
4446 Instead, make copies of the our local variables and
4447 pass the copies by reference, then copy them back afterward. */
4448 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
4449 enum tree_code xresultcode = resultcode;
4451 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
4453 return cp_convert (boolean_type_node, val);
4454 op0 = xop0, op1 = xop1;
4456 resultcode = xresultcode;
4459 if ((short_compare || code == MIN_EXPR || code == MAX_EXPR)
4460 && warn_sign_compare
4461 && !TREE_NO_WARNING (orig_op0)
4462 && !TREE_NO_WARNING (orig_op1)
4463 /* Do not warn until the template is instantiated; we cannot
4464 bound the ranges of the arguments until that point. */
4465 && !processing_template_decl
4466 && (complain & tf_warning)
4467 && c_inhibit_evaluation_warnings == 0)
4469 warn_for_sign_compare (location, orig_op0, orig_op1, op0, op1,
4470 result_type, resultcode);
4474 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4475 Then the expression will be built.
4476 It will be given type FINAL_TYPE if that is nonzero;
4477 otherwise, it will be given type RESULT_TYPE. */
4480 if (TREE_TYPE (op0) != result_type)
4481 op0 = cp_convert_and_check (result_type, op0);
4482 if (TREE_TYPE (op1) != result_type)
4483 op1 = cp_convert_and_check (result_type, op1);
4485 if (op0 == error_mark_node || op1 == error_mark_node)
4486 return error_mark_node;
4489 if (build_type == NULL_TREE)
4490 build_type = result_type;
4492 result = build2 (resultcode, build_type, op0, op1);
4493 result = fold_if_not_in_template (result);
4494 if (final_type != 0)
4495 result = cp_convert (final_type, result);
4497 if (TREE_OVERFLOW_P (result)
4498 && !TREE_OVERFLOW_P (op0)
4499 && !TREE_OVERFLOW_P (op1))
4500 overflow_warning (location, result);
4505 /* Return a tree for the sum or difference (RESULTCODE says which)
4506 of pointer PTROP and integer INTOP. */
4509 cp_pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
4511 tree res_type = TREE_TYPE (ptrop);
4513 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4514 in certain circumstance (when it's valid to do so). So we need
4515 to make sure it's complete. We don't need to check here, if we
4516 can actually complete it at all, as those checks will be done in
4517 pointer_int_sum() anyway. */
4518 complete_type (TREE_TYPE (res_type));
4520 return pointer_int_sum (input_location, resultcode, ptrop,
4521 fold_if_not_in_template (intop));
4524 /* Return a tree for the difference of pointers OP0 and OP1.
4525 The resulting tree has type int. */
4528 pointer_diff (tree op0, tree op1, tree ptrtype)
4531 tree restype = ptrdiff_type_node;
4532 tree target_type = TREE_TYPE (ptrtype);
4534 if (!complete_type_or_else (target_type, NULL_TREE))
4535 return error_mark_node;
4537 if (TREE_CODE (target_type) == VOID_TYPE)
4538 permerror (input_location, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4539 if (TREE_CODE (target_type) == FUNCTION_TYPE)
4540 permerror (input_location, "ISO C++ forbids using pointer to a function in subtraction");
4541 if (TREE_CODE (target_type) == METHOD_TYPE)
4542 permerror (input_location, "ISO C++ forbids using pointer to a method in subtraction");
4544 /* First do the subtraction as integers;
4545 then drop through to build the divide operator. */
4547 op0 = cp_build_binary_op (input_location,
4549 cp_convert (restype, op0),
4550 cp_convert (restype, op1),
4551 tf_warning_or_error);
4553 /* This generates an error if op1 is a pointer to an incomplete type. */
4554 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1))))
4555 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4557 op1 = (TYPE_PTROB_P (ptrtype)
4558 ? size_in_bytes (target_type)
4559 : integer_one_node);
4561 /* Do the division. */
4563 result = build2 (EXACT_DIV_EXPR, restype, op0, cp_convert (restype, op1));
4564 return fold_if_not_in_template (result);
4567 /* Construct and perhaps optimize a tree representation
4568 for a unary operation. CODE, a tree_code, specifies the operation
4569 and XARG is the operand. */
4572 build_x_unary_op (enum tree_code code, tree xarg, tsubst_flags_t complain)
4574 tree orig_expr = xarg;
4578 if (processing_template_decl)
4580 if (type_dependent_expression_p (xarg))
4581 return build_min_nt (code, xarg, NULL_TREE);
4583 xarg = build_non_dependent_expr (xarg);
4588 /* [expr.unary.op] says:
4590 The address of an object of incomplete type can be taken.
4592 (And is just the ordinary address operator, not an overloaded
4593 "operator &".) However, if the type is a template
4594 specialization, we must complete the type at this point so that
4595 an overloaded "operator &" will be available if required. */
4596 if (code == ADDR_EXPR
4597 && TREE_CODE (xarg) != TEMPLATE_ID_EXPR
4598 && ((CLASS_TYPE_P (TREE_TYPE (xarg))
4599 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg))))
4600 || (TREE_CODE (xarg) == OFFSET_REF)))
4601 /* Don't look for a function. */;
4603 exp = build_new_op (code, LOOKUP_NORMAL, xarg, NULL_TREE, NULL_TREE,
4604 /*overload=*/NULL, complain);
4605 if (!exp && code == ADDR_EXPR)
4607 if (is_overloaded_fn (xarg))
4609 tree fn = get_first_fn (xarg);
4610 if (DECL_CONSTRUCTOR_P (fn) || DECL_DESTRUCTOR_P (fn))
4612 error (DECL_CONSTRUCTOR_P (fn)
4613 ? G_("taking address of constructor %qE")
4614 : G_("taking address of destructor %qE"),
4616 return error_mark_node;
4620 /* A pointer to member-function can be formed only by saying
4622 if (!flag_ms_extensions && TREE_CODE (TREE_TYPE (xarg)) == METHOD_TYPE
4623 && (TREE_CODE (xarg) != OFFSET_REF || !PTRMEM_OK_P (xarg)))
4625 if (TREE_CODE (xarg) != OFFSET_REF
4626 || !TYPE_P (TREE_OPERAND (xarg, 0)))
4628 error ("invalid use of %qE to form a pointer-to-member-function",
4630 if (TREE_CODE (xarg) != OFFSET_REF)
4631 inform (input_location, " a qualified-id is required");
4632 return error_mark_node;
4636 error ("parentheses around %qE cannot be used to form a"
4637 " pointer-to-member-function",
4639 PTRMEM_OK_P (xarg) = 1;
4643 if (TREE_CODE (xarg) == OFFSET_REF)
4645 ptrmem = PTRMEM_OK_P (xarg);
4647 if (!ptrmem && !flag_ms_extensions
4648 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg, 1))) == METHOD_TYPE)
4650 /* A single non-static member, make sure we don't allow a
4651 pointer-to-member. */
4652 xarg = build2 (OFFSET_REF, TREE_TYPE (xarg),
4653 TREE_OPERAND (xarg, 0),
4654 ovl_cons (TREE_OPERAND (xarg, 1), NULL_TREE));
4655 PTRMEM_OK_P (xarg) = ptrmem;
4659 exp = cp_build_addr_expr_strict (xarg, complain);
4662 if (processing_template_decl && exp != error_mark_node)
4663 exp = build_min_non_dep (code, exp, orig_expr,
4664 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE);
4665 if (TREE_CODE (exp) == ADDR_EXPR)
4666 PTRMEM_OK_P (exp) = ptrmem;
4670 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4671 constants, where a null value is represented by an INTEGER_CST of
4675 cp_truthvalue_conversion (tree expr)
4677 tree type = TREE_TYPE (expr);
4678 if (TYPE_PTRMEM_P (type))
4679 return build_binary_op (EXPR_LOCATION (expr),
4680 NE_EXPR, expr, nullptr_node, 1);
4681 else if (TYPE_PTR_P (type) || TYPE_PTRMEMFUNC_P (type))
4683 /* With -Wzero-as-null-pointer-constant do not warn for an
4684 'if (p)' or a 'while (!p)', where p is a pointer. */
4686 ++c_inhibit_evaluation_warnings;
4687 ret = c_common_truthvalue_conversion (input_location, expr);
4688 --c_inhibit_evaluation_warnings;
4692 return c_common_truthvalue_conversion (input_location, expr);
4695 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4698 condition_conversion (tree expr)
4701 if (processing_template_decl)
4703 t = perform_implicit_conversion_flags (boolean_type_node, expr,
4704 tf_warning_or_error, LOOKUP_NORMAL);
4705 t = fold_build_cleanup_point_expr (boolean_type_node, t);
4709 /* Returns the address of T. This function will fold away
4710 ADDR_EXPR of INDIRECT_REF. */
4713 build_address (tree t)
4715 if (error_operand_p (t) || !cxx_mark_addressable (t))
4716 return error_mark_node;
4717 t = build_fold_addr_expr (t);
4718 if (TREE_CODE (t) != ADDR_EXPR)
4723 /* Returns the address of T with type TYPE. */
4726 build_typed_address (tree t, tree type)
4728 if (error_operand_p (t) || !cxx_mark_addressable (t))
4729 return error_mark_node;
4730 t = build_fold_addr_expr_with_type (t, type);
4731 if (TREE_CODE (t) != ADDR_EXPR)
4736 /* Return a NOP_EXPR converting EXPR to TYPE. */
4739 build_nop (tree type, tree expr)
4741 if (type == error_mark_node || error_operand_p (expr))
4743 return build1 (NOP_EXPR, type, expr);
4746 /* Take the address of ARG, whatever that means under C++ semantics.
4747 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
4748 and class rvalues as well.
4750 Nothing should call this function directly; instead, callers should use
4751 cp_build_addr_expr or cp_build_addr_expr_strict. */
4754 cp_build_addr_expr_1 (tree arg, bool strict_lvalue, tsubst_flags_t complain)
4759 if (!arg || error_operand_p (arg))
4760 return error_mark_node;
4762 arg = mark_lvalue_use (arg);
4763 argtype = lvalue_type (arg);
4765 gcc_assert (TREE_CODE (arg) != IDENTIFIER_NODE
4766 || !IDENTIFIER_OPNAME_P (arg));
4768 if (TREE_CODE (arg) == COMPONENT_REF && type_unknown_p (arg)
4769 && !really_overloaded_fn (TREE_OPERAND (arg, 1)))
4771 /* They're trying to take the address of a unique non-static
4772 member function. This is ill-formed (except in MS-land),
4773 but let's try to DTRT.
4774 Note: We only handle unique functions here because we don't
4775 want to complain if there's a static overload; non-unique
4776 cases will be handled by instantiate_type. But we need to
4777 handle this case here to allow casts on the resulting PMF.
4778 We could defer this in non-MS mode, but it's easier to give
4779 a useful error here. */
4781 /* Inside constant member functions, the `this' pointer
4782 contains an extra const qualifier. TYPE_MAIN_VARIANT
4783 is used here to remove this const from the diagnostics
4784 and the created OFFSET_REF. */
4785 tree base = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg, 0)));
4786 tree fn = get_first_fn (TREE_OPERAND (arg, 1));
4789 if (! flag_ms_extensions)
4791 tree name = DECL_NAME (fn);
4792 if (!(complain & tf_error))
4793 return error_mark_node;
4794 else if (current_class_type
4795 && TREE_OPERAND (arg, 0) == current_class_ref)
4796 /* An expression like &memfn. */
4797 permerror (input_location, "ISO C++ forbids taking the address of an unqualified"
4798 " or parenthesized non-static member function to form"
4799 " a pointer to member function. Say %<&%T::%D%>",
4802 permerror (input_location, "ISO C++ forbids taking the address of a bound member"
4803 " function to form a pointer to member function."
4807 arg = build_offset_ref (base, fn, /*address_p=*/true);
4810 /* Uninstantiated types are all functions. Taking the
4811 address of a function is a no-op, so just return the
4813 if (type_unknown_p (arg))
4814 return build1 (ADDR_EXPR, unknown_type_node, arg);
4816 if (TREE_CODE (arg) == OFFSET_REF)
4817 /* We want a pointer to member; bypass all the code for actually taking
4818 the address of something. */
4821 /* Anything not already handled and not a true memory reference
4823 if (TREE_CODE (argtype) != FUNCTION_TYPE
4824 && TREE_CODE (argtype) != METHOD_TYPE)
4826 cp_lvalue_kind kind = lvalue_kind (arg);
4827 if (kind == clk_none)
4829 if (complain & tf_error)
4830 lvalue_error (input_location, lv_addressof);
4831 return error_mark_node;
4833 if (strict_lvalue && (kind & (clk_rvalueref|clk_class)))
4835 if (!(complain & tf_error))
4836 return error_mark_node;
4837 if (kind & clk_class)
4838 /* Make this a permerror because we used to accept it. */
4839 permerror (input_location, "taking address of temporary");
4841 error ("taking address of xvalue (rvalue reference)");
4845 if (TREE_CODE (argtype) == REFERENCE_TYPE)
4847 tree type = build_pointer_type (TREE_TYPE (argtype));
4848 arg = build1 (CONVERT_EXPR, type, arg);
4851 else if (pedantic && DECL_MAIN_P (arg))
4854 /* Apparently a lot of autoconf scripts for C++ packages do this,
4855 so only complain if -pedantic. */
4856 if (complain & (flag_pedantic_errors ? tf_error : tf_warning))
4857 pedwarn (input_location, OPT_pedantic,
4858 "ISO C++ forbids taking address of function %<::main%>");
4859 else if (flag_pedantic_errors)
4860 return error_mark_node;
4863 /* Let &* cancel out to simplify resulting code. */
4864 if (TREE_CODE (arg) == INDIRECT_REF)
4866 /* We don't need to have `current_class_ptr' wrapped in a
4867 NON_LVALUE_EXPR node. */
4868 if (arg == current_class_ref)
4869 return current_class_ptr;
4871 arg = TREE_OPERAND (arg, 0);
4872 if (TREE_CODE (TREE_TYPE (arg)) == REFERENCE_TYPE)
4874 tree type = build_pointer_type (TREE_TYPE (TREE_TYPE (arg)));
4875 arg = build1 (CONVERT_EXPR, type, arg);
4878 /* Don't let this be an lvalue. */
4883 /* ??? Cope with user tricks that amount to offsetof. */
4884 if (TREE_CODE (argtype) != FUNCTION_TYPE
4885 && TREE_CODE (argtype) != METHOD_TYPE
4886 && argtype != unknown_type_node
4887 && (val = get_base_address (arg))
4888 && COMPLETE_TYPE_P (TREE_TYPE (val))
4889 && TREE_CODE (val) == INDIRECT_REF
4890 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
4892 tree type = build_pointer_type (argtype);
4893 return fold_convert (type, fold_offsetof_1 (arg));
4896 /* Handle complex lvalues (when permitted)
4897 by reduction to simpler cases. */
4898 val = unary_complex_lvalue (ADDR_EXPR, arg);
4902 switch (TREE_CODE (arg))
4906 case FIX_TRUNC_EXPR:
4907 /* Even if we're not being pedantic, we cannot allow this
4908 extension when we're instantiating in a SFINAE
4910 if (! lvalue_p (arg) && complain == tf_none)
4912 if (complain & tf_error)
4913 permerror (input_location, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4915 return error_mark_node;
4920 arg = BASELINK_FUNCTIONS (arg);
4924 arg = OVL_CURRENT (arg);
4929 /* Turn a reference to a non-static data member into a
4930 pointer-to-member. */
4935 gcc_assert (PTRMEM_OK_P (arg));
4937 t = TREE_OPERAND (arg, 1);
4938 if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
4940 if (complain & tf_error)
4941 error ("cannot create pointer to reference member %qD", t);
4942 return error_mark_node;
4945 type = build_ptrmem_type (context_for_name_lookup (t),
4947 t = make_ptrmem_cst (type, TREE_OPERAND (arg, 1));
4955 if (argtype != error_mark_node)
4956 argtype = build_pointer_type (argtype);
4958 /* In a template, we are processing a non-dependent expression
4959 so we can just form an ADDR_EXPR with the correct type. */
4960 if (processing_template_decl || TREE_CODE (arg) != COMPONENT_REF)
4962 val = build_address (arg);
4963 if (TREE_CODE (arg) == OFFSET_REF)
4964 PTRMEM_OK_P (val) = PTRMEM_OK_P (arg);
4966 else if (BASELINK_P (TREE_OPERAND (arg, 1)))
4968 tree fn = BASELINK_FUNCTIONS (TREE_OPERAND (arg, 1));
4970 /* We can only get here with a single static member
4972 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
4973 && DECL_STATIC_FUNCTION_P (fn));
4975 val = build_address (fn);
4976 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg, 0)))
4977 /* Do not lose object's side effects. */
4978 val = build2 (COMPOUND_EXPR, TREE_TYPE (val),
4979 TREE_OPERAND (arg, 0), val);
4981 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)))
4983 if (complain & tf_error)
4984 error ("attempt to take address of bit-field structure member %qD",
4985 TREE_OPERAND (arg, 1));
4986 return error_mark_node;
4990 tree object = TREE_OPERAND (arg, 0);
4991 tree field = TREE_OPERAND (arg, 1);
4992 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4993 (TREE_TYPE (object), decl_type_context (field)));
4994 val = build_address (arg);
4997 if (TREE_CODE (argtype) == POINTER_TYPE
4998 && TREE_CODE (TREE_TYPE (argtype)) == METHOD_TYPE)
5000 build_ptrmemfunc_type (argtype);
5001 val = build_ptrmemfunc (argtype, val, 0,
5003 tf_warning_or_error);
5009 /* Take the address of ARG if it has one, even if it's an rvalue. */
5012 cp_build_addr_expr (tree arg, tsubst_flags_t complain)
5014 return cp_build_addr_expr_1 (arg, 0, complain);
5017 /* Take the address of ARG, but only if it's an lvalue. */
5020 cp_build_addr_expr_strict (tree arg, tsubst_flags_t complain)
5022 return cp_build_addr_expr_1 (arg, 1, complain);
5025 /* C++: Must handle pointers to members.
5027 Perhaps type instantiation should be extended to handle conversion
5028 from aggregates to types we don't yet know we want? (Or are those
5029 cases typically errors which should be reported?)
5031 NOCONVERT nonzero suppresses the default promotions
5032 (such as from short to int). */
5035 cp_build_unary_op (enum tree_code code, tree xarg, int noconvert,
5036 tsubst_flags_t complain)
5038 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
5041 const char *errstring = NULL;
5043 const char *invalid_op_diag;
5045 if (!arg || error_operand_p (arg))
5046 return error_mark_node;
5048 if ((invalid_op_diag
5049 = targetm.invalid_unary_op ((code == UNARY_PLUS_EXPR
5054 error (invalid_op_diag);
5055 return error_mark_node;
5060 case UNARY_PLUS_EXPR:
5063 int flags = WANT_ARITH | WANT_ENUM;
5064 /* Unary plus (but not unary minus) is allowed on pointers. */
5065 if (code == UNARY_PLUS_EXPR)
5066 flags |= WANT_POINTER;
5067 arg = build_expr_type_conversion (flags, arg, true);
5069 errstring = (code == NEGATE_EXPR
5070 ? _("wrong type argument to unary minus")
5071 : _("wrong type argument to unary plus"));
5074 if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
5075 arg = perform_integral_promotions (arg);
5077 /* Make sure the result is not an lvalue: a unary plus or minus
5078 expression is always a rvalue. */
5085 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
5089 arg = default_conversion (arg);
5091 else if (!(arg = build_expr_type_conversion (WANT_INT | WANT_ENUM
5092 | WANT_VECTOR_OR_COMPLEX,
5094 errstring = _("wrong type argument to bit-complement");
5095 else if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
5096 arg = perform_integral_promotions (arg);
5100 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
5101 errstring = _("wrong type argument to abs");
5102 else if (!noconvert)
5103 arg = default_conversion (arg);
5107 /* Conjugating a real value is a no-op, but allow it anyway. */
5108 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
5109 errstring = _("wrong type argument to conjugation");
5110 else if (!noconvert)
5111 arg = default_conversion (arg);
5114 case TRUTH_NOT_EXPR:
5115 arg = perform_implicit_conversion (boolean_type_node, arg,
5117 val = invert_truthvalue_loc (input_location, arg);
5118 if (arg != error_mark_node)
5120 errstring = _("in argument to unary !");
5128 arg = build_real_imag_expr (input_location, code, arg);
5129 if (arg == error_mark_node)
5132 return fold_if_not_in_template (arg);
5134 case PREINCREMENT_EXPR:
5135 case POSTINCREMENT_EXPR:
5136 case PREDECREMENT_EXPR:
5137 case POSTDECREMENT_EXPR:
5138 /* Handle complex lvalues (when permitted)
5139 by reduction to simpler cases. */
5141 val = unary_complex_lvalue (code, arg);
5145 arg = mark_lvalue_use (arg);
5147 /* Increment or decrement the real part of the value,
5148 and don't change the imaginary part. */
5149 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
5153 arg = stabilize_reference (arg);
5154 real = cp_build_unary_op (REALPART_EXPR, arg, 1, complain);
5155 imag = cp_build_unary_op (IMAGPART_EXPR, arg, 1, complain);
5156 real = cp_build_unary_op (code, real, 1, complain);
5157 if (real == error_mark_node || imag == error_mark_node)
5158 return error_mark_node;
5159 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
5163 /* Report invalid types. */
5165 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_POINTER,
5168 if (code == PREINCREMENT_EXPR)
5169 errstring = _("no pre-increment operator for type");
5170 else if (code == POSTINCREMENT_EXPR)
5171 errstring = _("no post-increment operator for type");
5172 else if (code == PREDECREMENT_EXPR)
5173 errstring = _("no pre-decrement operator for type");
5175 errstring = _("no post-decrement operator for type");
5178 else if (arg == error_mark_node)
5179 return error_mark_node;
5181 /* Report something read-only. */
5183 if (CP_TYPE_CONST_P (TREE_TYPE (arg))
5184 || TREE_READONLY (arg))
5186 if (complain & tf_error)
5187 cxx_readonly_error (arg, ((code == PREINCREMENT_EXPR
5188 || code == POSTINCREMENT_EXPR)
5189 ? lv_increment : lv_decrement));
5191 return error_mark_node;
5196 tree declared_type = unlowered_expr_type (arg);
5198 argtype = TREE_TYPE (arg);
5200 /* ARM $5.2.5 last annotation says this should be forbidden. */
5201 if (TREE_CODE (argtype) == ENUMERAL_TYPE)
5203 if (complain & tf_error)
5204 permerror (input_location, (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
5205 ? G_("ISO C++ forbids incrementing an enum")
5206 : G_("ISO C++ forbids decrementing an enum"));
5208 return error_mark_node;
5211 /* Compute the increment. */
5213 if (TREE_CODE (argtype) == POINTER_TYPE)
5215 tree type = complete_type (TREE_TYPE (argtype));
5217 if (!COMPLETE_OR_VOID_TYPE_P (type))
5219 if (complain & tf_error)
5220 error (((code == PREINCREMENT_EXPR
5221 || code == POSTINCREMENT_EXPR))
5222 ? G_("cannot increment a pointer to incomplete type %qT")
5223 : G_("cannot decrement a pointer to incomplete type %qT"),
5224 TREE_TYPE (argtype));
5226 return error_mark_node;
5228 else if ((pedantic || warn_pointer_arith)
5229 && !TYPE_PTROB_P (argtype))
5231 if (complain & tf_error)
5232 permerror (input_location, (code == PREINCREMENT_EXPR
5233 || code == POSTINCREMENT_EXPR)
5234 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
5235 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
5238 return error_mark_node;
5241 inc = cxx_sizeof_nowarn (TREE_TYPE (argtype));
5244 inc = integer_one_node;
5246 inc = cp_convert (argtype, inc);
5248 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
5249 need to ask Objective-C to build the increment or decrement
5250 expression for it. */
5251 if (objc_is_property_ref (arg))
5252 return objc_build_incr_expr_for_property_ref (input_location, code,
5255 /* Complain about anything else that is not a true lvalue. */
5256 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
5257 || code == POSTINCREMENT_EXPR)
5258 ? lv_increment : lv_decrement),
5260 return error_mark_node;
5262 /* Forbid using -- on `bool'. */
5263 if (TREE_CODE (declared_type) == BOOLEAN_TYPE)
5265 if (code == POSTDECREMENT_EXPR || code == PREDECREMENT_EXPR)
5267 if (complain & tf_error)
5268 error ("invalid use of Boolean expression as operand "
5269 "to %<operator--%>");
5270 return error_mark_node;
5272 val = boolean_increment (code, arg);
5274 else if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
5275 /* An rvalue has no cv-qualifiers. */
5276 val = build2 (code, cv_unqualified (TREE_TYPE (arg)), arg, inc);
5278 val = build2 (code, TREE_TYPE (arg), arg, inc);
5280 TREE_SIDE_EFFECTS (val) = 1;
5285 /* Note that this operation never does default_conversion
5286 regardless of NOCONVERT. */
5287 return cp_build_addr_expr (arg, complain);
5296 argtype = TREE_TYPE (arg);
5297 return fold_if_not_in_template (build1 (code, argtype, arg));
5300 if (complain & tf_error)
5301 error ("%s", errstring);
5302 return error_mark_node;
5305 /* Hook for the c-common bits that build a unary op. */
5307 build_unary_op (location_t location ATTRIBUTE_UNUSED,
5308 enum tree_code code, tree xarg, int noconvert)
5310 return cp_build_unary_op (code, xarg, noconvert, tf_warning_or_error);
5313 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5314 for certain kinds of expressions which are not really lvalues
5315 but which we can accept as lvalues.
5317 If ARG is not a kind of expression we can handle, return
5321 unary_complex_lvalue (enum tree_code code, tree arg)
5323 /* Inside a template, making these kinds of adjustments is
5324 pointless; we are only concerned with the type of the
5326 if (processing_template_decl)
5329 /* Handle (a, b) used as an "lvalue". */
5330 if (TREE_CODE (arg) == COMPOUND_EXPR)
5332 tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 1), 0,
5333 tf_warning_or_error);
5334 return build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
5335 TREE_OPERAND (arg, 0), real_result);
5338 /* Handle (a ? b : c) used as an "lvalue". */
5339 if (TREE_CODE (arg) == COND_EXPR
5340 || TREE_CODE (arg) == MIN_EXPR || TREE_CODE (arg) == MAX_EXPR)
5341 return rationalize_conditional_expr (code, arg, tf_warning_or_error);
5343 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5344 if (TREE_CODE (arg) == MODIFY_EXPR
5345 || TREE_CODE (arg) == PREINCREMENT_EXPR
5346 || TREE_CODE (arg) == PREDECREMENT_EXPR)
5348 tree lvalue = TREE_OPERAND (arg, 0);
5349 if (TREE_SIDE_EFFECTS (lvalue))
5351 lvalue = stabilize_reference (lvalue);
5352 arg = build2 (TREE_CODE (arg), TREE_TYPE (arg),
5353 lvalue, TREE_OPERAND (arg, 1));
5355 return unary_complex_lvalue
5356 (code, build2 (COMPOUND_EXPR, TREE_TYPE (lvalue), arg, lvalue));
5359 if (code != ADDR_EXPR)
5362 /* Handle (a = b) used as an "lvalue" for `&'. */
5363 if (TREE_CODE (arg) == MODIFY_EXPR
5364 || TREE_CODE (arg) == INIT_EXPR)
5366 tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 0), 0,
5367 tf_warning_or_error);
5368 arg = build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
5370 TREE_NO_WARNING (arg) = 1;
5374 if (TREE_CODE (TREE_TYPE (arg)) == FUNCTION_TYPE
5375 || TREE_CODE (TREE_TYPE (arg)) == METHOD_TYPE
5376 || TREE_CODE (arg) == OFFSET_REF)
5379 /* We permit compiler to make function calls returning
5380 objects of aggregate type look like lvalues. */
5384 if (TREE_CODE (targ) == SAVE_EXPR)
5385 targ = TREE_OPERAND (targ, 0);
5387 if (TREE_CODE (targ) == CALL_EXPR && MAYBE_CLASS_TYPE_P (TREE_TYPE (targ)))
5389 if (TREE_CODE (arg) == SAVE_EXPR)
5392 targ = build_cplus_new (TREE_TYPE (arg), arg, tf_warning_or_error);
5393 return build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (arg)), targ);
5396 if (TREE_CODE (arg) == SAVE_EXPR && TREE_CODE (targ) == INDIRECT_REF)
5397 return build3 (SAVE_EXPR, build_pointer_type (TREE_TYPE (arg)),
5398 TREE_OPERAND (targ, 0), current_function_decl, NULL);
5401 /* Don't let anything else be handled specially. */
5405 /* Mark EXP saying that we need to be able to take the
5406 address of it; it should not be allocated in a register.
5407 Value is true if successful.
5409 C++: we do not allow `current_class_ptr' to be addressable. */
5412 cxx_mark_addressable (tree exp)
5417 switch (TREE_CODE (x))
5424 x = TREE_OPERAND (x, 0);
5428 if (x == current_class_ptr)
5430 error ("cannot take the address of %<this%>, which is an rvalue expression");
5431 TREE_ADDRESSABLE (x) = 1; /* so compiler doesn't die later. */
5437 /* Caller should not be trying to mark initialized
5438 constant fields addressable. */
5439 gcc_assert (DECL_LANG_SPECIFIC (x) == 0
5440 || DECL_IN_AGGR_P (x) == 0
5442 || DECL_EXTERNAL (x));
5446 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
5447 && !DECL_ARTIFICIAL (x))
5449 if (TREE_CODE (x) == VAR_DECL && DECL_HARD_REGISTER (x))
5452 ("address of explicit register variable %qD requested", x);
5455 else if (extra_warnings)
5457 (OPT_Wextra, "address requested for %qD, which is declared %<register%>", x);
5459 TREE_ADDRESSABLE (x) = 1;
5464 TREE_ADDRESSABLE (x) = 1;
5468 TREE_ADDRESSABLE (x) = 1;
5472 TREE_ADDRESSABLE (x) = 1;
5473 cxx_mark_addressable (TREE_OPERAND (x, 0));
5481 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5484 build_x_conditional_expr (tree ifexp, tree op1, tree op2,
5485 tsubst_flags_t complain)
5487 tree orig_ifexp = ifexp;
5488 tree orig_op1 = op1;
5489 tree orig_op2 = op2;
5492 if (processing_template_decl)
5494 /* The standard says that the expression is type-dependent if
5495 IFEXP is type-dependent, even though the eventual type of the
5496 expression doesn't dependent on IFEXP. */
5497 if (type_dependent_expression_p (ifexp)
5498 /* As a GNU extension, the middle operand may be omitted. */
5499 || (op1 && type_dependent_expression_p (op1))
5500 || type_dependent_expression_p (op2))
5501 return build_min_nt (COND_EXPR, ifexp, op1, op2);
5502 ifexp = build_non_dependent_expr (ifexp);
5504 op1 = build_non_dependent_expr (op1);
5505 op2 = build_non_dependent_expr (op2);
5508 expr = build_conditional_expr (ifexp, op1, op2, complain);
5509 if (processing_template_decl && expr != error_mark_node)
5511 tree min = build_min_non_dep (COND_EXPR, expr,
5512 orig_ifexp, orig_op1, orig_op2);
5513 /* Remember that the result is an lvalue or xvalue. */
5514 if (lvalue_or_rvalue_with_address_p (expr)
5515 && !lvalue_or_rvalue_with_address_p (min))
5516 TREE_TYPE (min) = cp_build_reference_type (TREE_TYPE (min),
5517 !real_lvalue_p (expr));
5518 expr = convert_from_reference (min);
5523 /* Given a list of expressions, return a compound expression
5524 that performs them all and returns the value of the last of them. */
5527 build_x_compound_expr_from_list (tree list, expr_list_kind exp,
5528 tsubst_flags_t complain)
5530 tree expr = TREE_VALUE (list);
5532 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
5533 && !CONSTRUCTOR_IS_DIRECT_INIT (expr))
5535 if (complain & tf_error)
5536 pedwarn (EXPR_LOC_OR_HERE (expr), 0, "list-initializer for "
5537 "non-class type must not be parenthesized");
5539 return error_mark_node;
5542 if (TREE_CHAIN (list))
5544 if (complain & tf_error)
5548 permerror (input_location, "expression list treated as compound "
5549 "expression in initializer");
5552 permerror (input_location, "expression list treated as compound "
5553 "expression in mem-initializer");
5556 permerror (input_location, "expression list treated as compound "
5557 "expression in functional cast");
5563 return error_mark_node;
5565 for (list = TREE_CHAIN (list); list; list = TREE_CHAIN (list))
5566 expr = build_x_compound_expr (expr, TREE_VALUE (list),
5573 /* Like build_x_compound_expr_from_list, but using a VEC. */
5576 build_x_compound_expr_from_vec (VEC(tree,gc) *vec, const char *msg)
5578 if (VEC_empty (tree, vec))
5580 else if (VEC_length (tree, vec) == 1)
5581 return VEC_index (tree, vec, 0);
5589 permerror (input_location,
5590 "%s expression list treated as compound expression",
5593 expr = VEC_index (tree, vec, 0);
5594 for (ix = 1; VEC_iterate (tree, vec, ix, t); ++ix)
5595 expr = build_x_compound_expr (expr, t, tf_warning_or_error);
5601 /* Handle overloading of the ',' operator when needed. */
5604 build_x_compound_expr (tree op1, tree op2, tsubst_flags_t complain)
5607 tree orig_op1 = op1;
5608 tree orig_op2 = op2;
5610 if (processing_template_decl)
5612 if (type_dependent_expression_p (op1)
5613 || type_dependent_expression_p (op2))
5614 return build_min_nt (COMPOUND_EXPR, op1, op2);
5615 op1 = build_non_dependent_expr (op1);
5616 op2 = build_non_dependent_expr (op2);
5619 result = build_new_op (COMPOUND_EXPR, LOOKUP_NORMAL, op1, op2, NULL_TREE,
5620 /*overload=*/NULL, complain);
5622 result = cp_build_compound_expr (op1, op2, complain);
5624 if (processing_template_decl && result != error_mark_node)
5625 return build_min_non_dep (COMPOUND_EXPR, result, orig_op1, orig_op2);
5630 /* Like cp_build_compound_expr, but for the c-common bits. */
5633 build_compound_expr (location_t loc ATTRIBUTE_UNUSED, tree lhs, tree rhs)
5635 return cp_build_compound_expr (lhs, rhs, tf_warning_or_error);
5638 /* Build a compound expression. */
5641 cp_build_compound_expr (tree lhs, tree rhs, tsubst_flags_t complain)
5643 lhs = convert_to_void (lhs, ICV_LEFT_OF_COMMA, complain);
5645 if (lhs == error_mark_node || rhs == error_mark_node)
5646 return error_mark_node;
5648 if (TREE_CODE (rhs) == TARGET_EXPR)
5650 /* If the rhs is a TARGET_EXPR, then build the compound
5651 expression inside the target_expr's initializer. This
5652 helps the compiler to eliminate unnecessary temporaries. */
5653 tree init = TREE_OPERAND (rhs, 1);
5655 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), lhs, init);
5656 TREE_OPERAND (rhs, 1) = init;
5661 if (type_unknown_p (rhs))
5663 error ("no context to resolve type of %qE", rhs);
5664 return error_mark_node;
5667 return build2 (COMPOUND_EXPR, TREE_TYPE (rhs), lhs, rhs);
5670 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5671 casts away constness. CAST gives the type of cast. Returns true
5672 if the cast is ill-formed, false if it is well-formed.
5674 ??? This function warns for casting away any qualifier not just
5675 const. We would like to specify exactly what qualifiers are casted
5680 check_for_casting_away_constness (tree src_type, tree dest_type,
5681 enum tree_code cast, tsubst_flags_t complain)
5683 /* C-style casts are allowed to cast away constness. With
5684 WARN_CAST_QUAL, we still want to issue a warning. */
5685 if (cast == CAST_EXPR && !warn_cast_qual)
5688 if (!casts_away_constness (src_type, dest_type))
5694 if (complain & tf_warning)
5695 warning (OPT_Wcast_qual,
5696 "cast from type %qT to type %qT casts away qualifiers",
5697 src_type, dest_type);
5700 case STATIC_CAST_EXPR:
5701 if (complain & tf_error)
5702 error ("static_cast from type %qT to type %qT casts away qualifiers",
5703 src_type, dest_type);
5706 case REINTERPRET_CAST_EXPR:
5707 if (complain & tf_error)
5708 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5709 src_type, dest_type);
5717 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5718 (another pointer-to-member type in the same hierarchy) and return
5719 the converted expression. If ALLOW_INVERSE_P is permitted, a
5720 pointer-to-derived may be converted to pointer-to-base; otherwise,
5721 only the other direction is permitted. If C_CAST_P is true, this
5722 conversion is taking place as part of a C-style cast. */
5725 convert_ptrmem (tree type, tree expr, bool allow_inverse_p,
5726 bool c_cast_p, tsubst_flags_t complain)
5728 if (TYPE_PTRMEM_P (type))
5732 if (TREE_CODE (expr) == PTRMEM_CST)
5733 expr = cplus_expand_constant (expr);
5734 delta = get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr)),
5735 TYPE_PTRMEM_CLASS_TYPE (type),
5737 c_cast_p, complain);
5738 if (delta == error_mark_node)
5739 return error_mark_node;
5741 if (!integer_zerop (delta))
5743 tree cond, op1, op2;
5745 cond = cp_build_binary_op (input_location,
5748 build_int_cst (TREE_TYPE (expr), -1),
5749 tf_warning_or_error);
5750 op1 = build_nop (ptrdiff_type_node, expr);
5751 op2 = cp_build_binary_op (input_location,
5752 PLUS_EXPR, op1, delta,
5753 tf_warning_or_error);
5755 expr = fold_build3_loc (input_location,
5756 COND_EXPR, ptrdiff_type_node, cond, op1, op2);
5760 return build_nop (type, expr);
5763 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), expr,
5764 allow_inverse_p, c_cast_p, complain);
5767 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5768 this static_cast is being attempted as one of the possible casts
5769 allowed by a C-style cast. (In that case, accessibility of base
5770 classes is not considered, and it is OK to cast away
5771 constness.) Return the result of the cast. *VALID_P is set to
5772 indicate whether or not the cast was valid. */
5775 build_static_cast_1 (tree type, tree expr, bool c_cast_p,
5776 bool *valid_p, tsubst_flags_t complain)
5781 /* Assume the cast is valid. */
5784 intype = TREE_TYPE (expr);
5786 /* Save casted types in the function's used types hash table. */
5787 used_types_insert (type);
5789 /* [expr.static.cast]
5791 An lvalue of type "cv1 B", where B is a class type, can be cast
5792 to type "reference to cv2 D", where D is a class derived (clause
5793 _class.derived_) from B, if a valid standard conversion from
5794 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5795 same cv-qualification as, or greater cv-qualification than, cv1,
5796 and B is not a virtual base class of D. */
5797 /* We check this case before checking the validity of "TYPE t =
5798 EXPR;" below because for this case:
5801 struct D : public B { D(const B&); };
5803 void f() { static_cast<const D&>(b); }
5805 we want to avoid constructing a new D. The standard is not
5806 completely clear about this issue, but our interpretation is
5807 consistent with other compilers. */
5808 if (TREE_CODE (type) == REFERENCE_TYPE
5809 && CLASS_TYPE_P (TREE_TYPE (type))
5810 && CLASS_TYPE_P (intype)
5811 && (TYPE_REF_IS_RVALUE (type) || real_lvalue_p (expr))
5812 && DERIVED_FROM_P (intype, TREE_TYPE (type))
5813 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype)),
5814 build_pointer_type (TYPE_MAIN_VARIANT
5815 (TREE_TYPE (type))))
5817 || at_least_as_qualified_p (TREE_TYPE (type), intype)))
5821 /* There is a standard conversion from "D*" to "B*" even if "B"
5822 is ambiguous or inaccessible. If this is really a
5823 static_cast, then we check both for inaccessibility and
5824 ambiguity. However, if this is a static_cast being performed
5825 because the user wrote a C-style cast, then accessibility is
5827 base = lookup_base (TREE_TYPE (type), intype,
5828 c_cast_p ? ba_unique : ba_check,
5831 /* Convert from "B*" to "D*". This function will check that "B"
5832 is not a virtual base of "D". */
5833 expr = build_base_path (MINUS_EXPR, build_address (expr),
5834 base, /*nonnull=*/false, complain);
5835 /* Convert the pointer to a reference -- but then remember that
5836 there are no expressions with reference type in C++.
5838 We call rvalue so that there's an actual tree code
5839 (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
5840 is a variable with the same type, the conversion would get folded
5841 away, leaving just the variable and causing lvalue_kind to give
5842 the wrong answer. */
5843 return convert_from_reference (rvalue (cp_fold_convert (type, expr)));
5846 /* "A glvalue of type cv1 T1 can be cast to type rvalue reference to
5847 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5848 if (TREE_CODE (type) == REFERENCE_TYPE
5849 && TYPE_REF_IS_RVALUE (type)
5850 && lvalue_or_rvalue_with_address_p (expr)
5851 && reference_related_p (TREE_TYPE (type), intype)
5852 && (c_cast_p || at_least_as_qualified_p (TREE_TYPE (type), intype)))
5854 expr = build_typed_address (expr, type);
5855 return convert_from_reference (expr);
5858 /* Resolve overloaded address here rather than once in
5859 implicit_conversion and again in the inverse code below. */
5860 if (TYPE_PTRMEMFUNC_P (type) && type_unknown_p (expr))
5862 expr = instantiate_type (type, expr, complain);
5863 intype = TREE_TYPE (expr);
5866 /* [expr.static.cast]
5868 An expression e can be explicitly converted to a type T using a
5869 static_cast of the form static_cast<T>(e) if the declaration T
5870 t(e);" is well-formed, for some invented temporary variable
5872 result = perform_direct_initialization_if_possible (type, expr,
5873 c_cast_p, complain);
5876 result = convert_from_reference (result);
5878 /* [expr.static.cast]
5880 If T is a reference type, the result is an lvalue; otherwise,
5881 the result is an rvalue. */
5882 if (TREE_CODE (type) != REFERENCE_TYPE)
5883 result = rvalue (result);
5887 /* [expr.static.cast]
5889 Any expression can be explicitly converted to type cv void. */
5890 if (TREE_CODE (type) == VOID_TYPE)
5891 return convert_to_void (expr, ICV_CAST, complain);
5893 /* [expr.static.cast]
5895 The inverse of any standard conversion sequence (clause _conv_),
5896 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5897 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5898 (_conv.bool_) conversions, can be performed explicitly using
5899 static_cast subject to the restriction that the explicit
5900 conversion does not cast away constness (_expr.const.cast_), and
5901 the following additional rules for specific cases: */
5902 /* For reference, the conversions not excluded are: integral
5903 promotions, floating point promotion, integral conversions,
5904 floating point conversions, floating-integral conversions,
5905 pointer conversions, and pointer to member conversions. */
5908 A value of integral _or enumeration_ type can be explicitly
5909 converted to an enumeration type. */
5910 /* The effect of all that is that any conversion between any two
5911 types which are integral, floating, or enumeration types can be
5913 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type)
5914 || SCALAR_FLOAT_TYPE_P (type))
5915 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype)
5916 || SCALAR_FLOAT_TYPE_P (intype)))
5917 return ocp_convert (type, expr, CONV_C_CAST, LOOKUP_NORMAL);
5919 if (TYPE_PTR_P (type) && TYPE_PTR_P (intype)
5920 && CLASS_TYPE_P (TREE_TYPE (type))
5921 && CLASS_TYPE_P (TREE_TYPE (intype))
5922 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5923 (TREE_TYPE (intype))),
5924 build_pointer_type (TYPE_MAIN_VARIANT
5925 (TREE_TYPE (type)))))
5930 && check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR,
5932 return error_mark_node;
5933 base = lookup_base (TREE_TYPE (type), TREE_TYPE (intype),
5934 c_cast_p ? ba_unique : ba_check,
5936 expr = build_base_path (MINUS_EXPR, expr, base, /*nonnull=*/false,
5938 return cp_fold_convert(type, expr);
5941 if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
5942 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
5949 c1 = TYPE_PTRMEM_CLASS_TYPE (intype);
5950 c2 = TYPE_PTRMEM_CLASS_TYPE (type);
5952 if (TYPE_PTRMEM_P (type))
5954 t1 = (build_ptrmem_type
5956 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype))));
5957 t2 = (build_ptrmem_type
5959 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type))));
5966 if (can_convert (t1, t2) || can_convert (t2, t1))
5969 && check_for_casting_away_constness (intype, type,
5972 return error_mark_node;
5973 return convert_ptrmem (type, expr, /*allow_inverse_p=*/1,
5974 c_cast_p, complain);
5978 /* [expr.static.cast]
5980 An rvalue of type "pointer to cv void" can be explicitly
5981 converted to a pointer to object type. A value of type pointer
5982 to object converted to "pointer to cv void" and back to the
5983 original pointer type will have its original value. */
5984 if (TREE_CODE (intype) == POINTER_TYPE
5985 && VOID_TYPE_P (TREE_TYPE (intype))
5986 && TYPE_PTROB_P (type))
5989 && check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR,
5991 return error_mark_node;
5992 return build_nop (type, expr);
5996 return error_mark_node;
5999 /* Return an expression representing static_cast<TYPE>(EXPR). */
6002 build_static_cast (tree type, tree expr, tsubst_flags_t complain)
6007 if (type == error_mark_node || expr == error_mark_node)
6008 return error_mark_node;
6010 if (processing_template_decl)
6012 expr = build_min (STATIC_CAST_EXPR, type, expr);
6013 /* We don't know if it will or will not have side effects. */
6014 TREE_SIDE_EFFECTS (expr) = 1;
6015 return convert_from_reference (expr);
6018 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6019 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6020 if (TREE_CODE (type) != REFERENCE_TYPE
6021 && TREE_CODE (expr) == NOP_EXPR
6022 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
6023 expr = TREE_OPERAND (expr, 0);
6025 result = build_static_cast_1 (type, expr, /*c_cast_p=*/false, &valid_p,
6030 if (complain & tf_error)
6031 error ("invalid static_cast from type %qT to type %qT",
6032 TREE_TYPE (expr), type);
6033 return error_mark_node;
6036 /* EXPR is an expression with member function or pointer-to-member
6037 function type. TYPE is a pointer type. Converting EXPR to TYPE is
6038 not permitted by ISO C++, but we accept it in some modes. If we
6039 are not in one of those modes, issue a diagnostic. Return the
6040 converted expression. */
6043 convert_member_func_to_ptr (tree type, tree expr)
6048 intype = TREE_TYPE (expr);
6049 gcc_assert (TYPE_PTRMEMFUNC_P (intype)
6050 || TREE_CODE (intype) == METHOD_TYPE);
6052 if (pedantic || warn_pmf2ptr)
6053 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpmf_conversions,
6054 "converting from %qT to %qT", intype, type);
6056 if (TREE_CODE (intype) == METHOD_TYPE)
6057 expr = build_addr_func (expr);
6058 else if (TREE_CODE (expr) == PTRMEM_CST)
6059 expr = build_address (PTRMEM_CST_MEMBER (expr));
6062 decl = maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype), 0);
6063 decl = build_address (decl);
6064 expr = get_member_function_from_ptrfunc (&decl, expr);
6067 return build_nop (type, expr);
6070 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
6071 If C_CAST_P is true, this reinterpret cast is being done as part of
6072 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
6073 indicate whether or not reinterpret_cast was valid. */
6076 build_reinterpret_cast_1 (tree type, tree expr, bool c_cast_p,
6077 bool *valid_p, tsubst_flags_t complain)
6081 /* Assume the cast is invalid. */
6085 if (type == error_mark_node || error_operand_p (expr))
6086 return error_mark_node;
6088 intype = TREE_TYPE (expr);
6090 /* Save casted types in the function's used types hash table. */
6091 used_types_insert (type);
6093 /* [expr.reinterpret.cast]
6094 An lvalue expression of type T1 can be cast to the type
6095 "reference to T2" if an expression of type "pointer to T1" can be
6096 explicitly converted to the type "pointer to T2" using a
6097 reinterpret_cast. */
6098 if (TREE_CODE (type) == REFERENCE_TYPE)
6100 if (! real_lvalue_p (expr))
6102 if (complain & tf_error)
6103 error ("invalid cast of an rvalue expression of type "
6106 return error_mark_node;
6109 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6110 "B" are related class types; the reinterpret_cast does not
6111 adjust the pointer. */
6112 if (TYPE_PTR_P (intype)
6113 && (complain & tf_warning)
6114 && (comptypes (TREE_TYPE (intype), TREE_TYPE (type),
6115 COMPARE_BASE | COMPARE_DERIVED)))
6116 warning (0, "casting %qT to %qT does not dereference pointer",
6119 expr = cp_build_addr_expr (expr, complain);
6121 if (warn_strict_aliasing > 2)
6122 strict_aliasing_warning (TREE_TYPE (expr), type, expr);
6124 if (expr != error_mark_node)
6125 expr = build_reinterpret_cast_1
6126 (build_pointer_type (TREE_TYPE (type)), expr, c_cast_p,
6128 if (expr != error_mark_node)
6129 /* cp_build_indirect_ref isn't right for rvalue refs. */
6130 expr = convert_from_reference (fold_convert (type, expr));
6134 /* As a G++ extension, we consider conversions from member
6135 functions, and pointers to member functions to
6136 pointer-to-function and pointer-to-void types. If
6137 -Wno-pmf-conversions has not been specified,
6138 convert_member_func_to_ptr will issue an error message. */
6139 if ((TYPE_PTRMEMFUNC_P (intype)
6140 || TREE_CODE (intype) == METHOD_TYPE)
6141 && TYPE_PTR_P (type)
6142 && (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
6143 || VOID_TYPE_P (TREE_TYPE (type))))
6144 return convert_member_func_to_ptr (type, expr);
6146 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6147 array-to-pointer, and function-to-pointer conversions are
6149 expr = decay_conversion (expr);
6151 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6152 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6153 if (TREE_CODE (expr) == NOP_EXPR
6154 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
6155 expr = TREE_OPERAND (expr, 0);
6157 if (error_operand_p (expr))
6158 return error_mark_node;
6160 intype = TREE_TYPE (expr);
6162 /* [expr.reinterpret.cast]
6163 A pointer can be converted to any integral type large enough to
6164 hold it. ... A value of type std::nullptr_t can be converted to
6165 an integral type; the conversion has the same meaning and
6166 validity as a conversion of (void*)0 to the integral type. */
6167 if (CP_INTEGRAL_TYPE_P (type)
6168 && (TYPE_PTR_P (intype) || NULLPTR_TYPE_P (intype)))
6170 if (TYPE_PRECISION (type) < TYPE_PRECISION (intype))
6172 if (complain & tf_error)
6173 permerror (input_location, "cast from %qT to %qT loses precision",
6176 return error_mark_node;
6178 if (NULLPTR_TYPE_P (intype))
6179 return build_int_cst (type, 0);
6181 /* [expr.reinterpret.cast]
6182 A value of integral or enumeration type can be explicitly
6183 converted to a pointer. */
6184 else if (TYPE_PTR_P (type) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype))
6187 else if ((TYPE_PTRFN_P (type) && TYPE_PTRFN_P (intype))
6188 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
6189 return fold_if_not_in_template (build_nop (type, expr));
6190 else if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
6191 || (TYPE_PTROBV_P (type) && TYPE_PTROBV_P (intype)))
6196 && check_for_casting_away_constness (intype, type,
6197 REINTERPRET_CAST_EXPR,
6199 return error_mark_node;
6200 /* Warn about possible alignment problems. */
6201 if (STRICT_ALIGNMENT && warn_cast_align
6202 && (complain & tf_warning)
6203 && !VOID_TYPE_P (type)
6204 && TREE_CODE (TREE_TYPE (intype)) != FUNCTION_TYPE
6205 && COMPLETE_TYPE_P (TREE_TYPE (type))
6206 && COMPLETE_TYPE_P (TREE_TYPE (intype))
6207 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (intype)))
6208 warning (OPT_Wcast_align, "cast from %qT to %qT "
6209 "increases required alignment of target type", intype, type);
6211 /* We need to strip nops here, because the front end likes to
6212 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6214 if (warn_strict_aliasing <= 2)
6215 strict_aliasing_warning (intype, type, sexpr);
6217 return fold_if_not_in_template (build_nop (type, expr));
6219 else if ((TYPE_PTRFN_P (type) && TYPE_PTROBV_P (intype))
6220 || (TYPE_PTRFN_P (intype) && TYPE_PTROBV_P (type)))
6222 if (pedantic && (complain & tf_warning))
6223 /* Only issue a warning, as we have always supported this
6224 where possible, and it is necessary in some cases. DR 195
6225 addresses this issue, but as of 2004/10/26 is still in
6227 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6228 return fold_if_not_in_template (build_nop (type, expr));
6230 else if (TREE_CODE (type) == VECTOR_TYPE)
6231 return fold_if_not_in_template (convert_to_vector (type, expr));
6232 else if (TREE_CODE (intype) == VECTOR_TYPE
6233 && INTEGRAL_OR_ENUMERATION_TYPE_P (type))
6234 return fold_if_not_in_template (convert_to_integer (type, expr));
6239 if (complain & tf_error)
6240 error ("invalid cast from type %qT to type %qT", intype, type);
6241 return error_mark_node;
6244 return cp_convert (type, expr);
6248 build_reinterpret_cast (tree type, tree expr, tsubst_flags_t complain)
6250 if (type == error_mark_node || expr == error_mark_node)
6251 return error_mark_node;
6253 if (processing_template_decl)
6255 tree t = build_min (REINTERPRET_CAST_EXPR, type, expr);
6257 if (!TREE_SIDE_EFFECTS (t)
6258 && type_dependent_expression_p (expr))
6259 /* There might turn out to be side effects inside expr. */
6260 TREE_SIDE_EFFECTS (t) = 1;
6261 return convert_from_reference (t);
6264 return build_reinterpret_cast_1 (type, expr, /*c_cast_p=*/false,
6265 /*valid_p=*/NULL, complain);
6268 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6269 return an appropriate expression. Otherwise, return
6270 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6271 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6272 performing a C-style cast, its value upon return will indicate
6273 whether or not the conversion succeeded. */
6276 build_const_cast_1 (tree dst_type, tree expr, tsubst_flags_t complain,
6280 tree reference_type;
6282 /* Callers are responsible for handling error_mark_node as a
6283 destination type. */
6284 gcc_assert (dst_type != error_mark_node);
6285 /* In a template, callers should be building syntactic
6286 representations of casts, not using this machinery. */
6287 gcc_assert (!processing_template_decl);
6289 /* Assume the conversion is invalid. */
6293 if (!POINTER_TYPE_P (dst_type) && !TYPE_PTRMEM_P (dst_type))
6295 if (complain & tf_error)
6296 error ("invalid use of const_cast with type %qT, "
6297 "which is not a pointer, "
6298 "reference, nor a pointer-to-data-member type", dst_type);
6299 return error_mark_node;
6302 if (TREE_CODE (TREE_TYPE (dst_type)) == FUNCTION_TYPE)
6304 if (complain & tf_error)
6305 error ("invalid use of const_cast with type %qT, which is a pointer "
6306 "or reference to a function type", dst_type);
6307 return error_mark_node;
6310 /* Save casted types in the function's used types hash table. */
6311 used_types_insert (dst_type);
6313 src_type = TREE_TYPE (expr);
6314 /* Expressions do not really have reference types. */
6315 if (TREE_CODE (src_type) == REFERENCE_TYPE)
6316 src_type = TREE_TYPE (src_type);
6318 /* [expr.const.cast]
6320 For two object types T1 and T2, if a pointer to T1 can be explicitly
6321 converted to the type "pointer to T2" using a const_cast, then the
6322 following conversions can also be made:
6324 -- an lvalue of type T1 can be explicitly converted to an lvalue of
6325 type T2 using the cast const_cast<T2&>;
6327 -- a glvalue of type T1 can be explicitly converted to an xvalue of
6328 type T2 using the cast const_cast<T2&&>; and
6330 -- if T1 is a class type, a prvalue of type T1 can be explicitly
6331 converted to an xvalue of type T2 using the cast const_cast<T2&&>. */
6333 if (TREE_CODE (dst_type) == REFERENCE_TYPE)
6335 reference_type = dst_type;
6336 if (!TYPE_REF_IS_RVALUE (dst_type)
6337 ? real_lvalue_p (expr)
6338 : (CLASS_TYPE_P (TREE_TYPE (dst_type))
6340 : lvalue_or_rvalue_with_address_p (expr)))
6344 if (complain & tf_error)
6345 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6346 src_type, dst_type);
6347 return error_mark_node;
6349 dst_type = build_pointer_type (TREE_TYPE (dst_type));
6350 src_type = build_pointer_type (src_type);
6354 reference_type = NULL_TREE;
6355 /* If the destination type is not a reference type, the
6356 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6357 conversions are performed. */
6358 src_type = type_decays_to (src_type);
6359 if (src_type == error_mark_node)
6360 return error_mark_node;
6363 if (TYPE_PTR_P (src_type) || TYPE_PTRMEM_P (src_type))
6365 if (comp_ptr_ttypes_const (dst_type, src_type))
6370 /* This cast is actually a C-style cast. Issue a warning if
6371 the user is making a potentially unsafe cast. */
6372 check_for_casting_away_constness (src_type, dst_type,
6373 CAST_EXPR, complain);
6377 expr = cp_build_addr_expr (expr, complain);
6378 expr = build_nop (reference_type, expr);
6379 return convert_from_reference (expr);
6383 expr = decay_conversion (expr);
6384 /* build_c_cast puts on a NOP_EXPR to make the result not an
6385 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6386 non-lvalue context. */
6387 if (TREE_CODE (expr) == NOP_EXPR
6388 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
6389 expr = TREE_OPERAND (expr, 0);
6390 return build_nop (dst_type, expr);
6394 && !at_least_as_qualified_p (TREE_TYPE (dst_type),
6395 TREE_TYPE (src_type)))
6396 check_for_casting_away_constness (src_type, dst_type, CAST_EXPR,
6400 if (complain & tf_error)
6401 error ("invalid const_cast from type %qT to type %qT",
6402 src_type, dst_type);
6403 return error_mark_node;
6407 build_const_cast (tree type, tree expr, tsubst_flags_t complain)
6409 if (type == error_mark_node || error_operand_p (expr))
6410 return error_mark_node;
6412 if (processing_template_decl)
6414 tree t = build_min (CONST_CAST_EXPR, type, expr);
6416 if (!TREE_SIDE_EFFECTS (t)
6417 && type_dependent_expression_p (expr))
6418 /* There might turn out to be side effects inside expr. */
6419 TREE_SIDE_EFFECTS (t) = 1;
6420 return convert_from_reference (t);
6423 return build_const_cast_1 (type, expr, complain,
6427 /* Like cp_build_c_cast, but for the c-common bits. */
6430 build_c_cast (location_t loc ATTRIBUTE_UNUSED, tree type, tree expr)
6432 return cp_build_c_cast (type, expr, tf_warning_or_error);
6435 /* Build an expression representing an explicit C-style cast to type
6436 TYPE of expression EXPR. */
6439 cp_build_c_cast (tree type, tree expr, tsubst_flags_t complain)
6445 if (type == error_mark_node || error_operand_p (expr))
6446 return error_mark_node;
6448 if (processing_template_decl)
6450 tree t = build_min (CAST_EXPR, type,
6451 tree_cons (NULL_TREE, value, NULL_TREE));
6452 /* We don't know if it will or will not have side effects. */
6453 TREE_SIDE_EFFECTS (t) = 1;
6454 return convert_from_reference (t);
6457 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6458 'Class') should always be retained, because this information aids
6459 in method lookup. */
6460 if (objc_is_object_ptr (type)
6461 && objc_is_object_ptr (TREE_TYPE (expr)))
6462 return build_nop (type, expr);
6464 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6465 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6466 if (TREE_CODE (type) != REFERENCE_TYPE
6467 && TREE_CODE (value) == NOP_EXPR
6468 && TREE_TYPE (value) == TREE_TYPE (TREE_OPERAND (value, 0)))
6469 value = TREE_OPERAND (value, 0);
6471 if (TREE_CODE (type) == ARRAY_TYPE)
6473 /* Allow casting from T1* to T2[] because Cfront allows it.
6474 NIHCL uses it. It is not valid ISO C++ however. */
6475 if (TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE)
6477 if (complain & tf_error)
6478 permerror (input_location, "ISO C++ forbids casting to an array type %qT", type);
6480 return error_mark_node;
6481 type = build_pointer_type (TREE_TYPE (type));
6485 if (complain & tf_error)
6486 error ("ISO C++ forbids casting to an array type %qT", type);
6487 return error_mark_node;
6491 if (TREE_CODE (type) == FUNCTION_TYPE
6492 || TREE_CODE (type) == METHOD_TYPE)
6494 if (complain & tf_error)
6495 error ("invalid cast to function type %qT", type);
6496 return error_mark_node;
6499 if (TREE_CODE (type) == POINTER_TYPE
6500 && TREE_CODE (TREE_TYPE (value)) == INTEGER_TYPE
6501 /* Casting to an integer of smaller size is an error detected elsewhere. */
6502 && TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (value))
6503 /* Don't warn about converting any constant. */
6504 && !TREE_CONSTANT (value))
6505 warning_at (input_location, OPT_Wint_to_pointer_cast,
6506 "cast to pointer from integer of different size");
6508 /* A C-style cast can be a const_cast. */
6509 result = build_const_cast_1 (type, value, complain & tf_warning,
6514 /* Or a static cast. */
6515 result = build_static_cast_1 (type, value, /*c_cast_p=*/true,
6516 &valid_p, complain);
6517 /* Or a reinterpret_cast. */
6519 result = build_reinterpret_cast_1 (type, value, /*c_cast_p=*/true,
6520 &valid_p, complain);
6521 /* The static_cast or reinterpret_cast may be followed by a
6524 /* A valid cast may result in errors if, for example, a
6525 conversion to am ambiguous base class is required. */
6526 && !error_operand_p (result))
6530 /* Non-class rvalues always have cv-unqualified type. */
6531 if (!CLASS_TYPE_P (type))
6532 type = TYPE_MAIN_VARIANT (type);
6533 result_type = TREE_TYPE (result);
6534 if (!CLASS_TYPE_P (result_type) && TREE_CODE (type) != REFERENCE_TYPE)
6535 result_type = TYPE_MAIN_VARIANT (result_type);
6536 /* If the type of RESULT does not match TYPE, perform a
6537 const_cast to make it match. If the static_cast or
6538 reinterpret_cast succeeded, we will differ by at most
6539 cv-qualification, so the follow-on const_cast is guaranteed
6541 if (!same_type_p (non_reference (type), non_reference (result_type)))
6543 result = build_const_cast_1 (type, result, false, &valid_p);
6544 gcc_assert (valid_p);
6549 return error_mark_node;
6552 /* For use from the C common bits. */
6554 build_modify_expr (location_t location ATTRIBUTE_UNUSED,
6555 tree lhs, tree lhs_origtype ATTRIBUTE_UNUSED,
6556 enum tree_code modifycode,
6557 location_t rhs_location ATTRIBUTE_UNUSED, tree rhs,
6558 tree rhs_origtype ATTRIBUTE_UNUSED)
6560 return cp_build_modify_expr (lhs, modifycode, rhs, tf_warning_or_error);
6563 /* Build an assignment expression of lvalue LHS from value RHS.
6564 MODIFYCODE is the code for a binary operator that we use
6565 to combine the old value of LHS with RHS to get the new value.
6566 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6568 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6571 cp_build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs,
6572 tsubst_flags_t complain)
6576 tree lhstype = TREE_TYPE (lhs);
6577 tree olhstype = lhstype;
6578 bool plain_assign = (modifycode == NOP_EXPR);
6580 /* Avoid duplicate error messages from operands that had errors. */
6581 if (error_operand_p (lhs) || error_operand_p (rhs))
6582 return error_mark_node;
6584 /* Handle control structure constructs used as "lvalues". */
6585 switch (TREE_CODE (lhs))
6587 /* Handle --foo = 5; as these are valid constructs in C++. */
6588 case PREDECREMENT_EXPR:
6589 case PREINCREMENT_EXPR:
6590 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
6591 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
6592 stabilize_reference (TREE_OPERAND (lhs, 0)),
6593 TREE_OPERAND (lhs, 1));
6594 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 0),
6595 modifycode, rhs, complain);
6596 if (newrhs == error_mark_node)
6597 return error_mark_node;
6598 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
6600 /* Handle (a, b) used as an "lvalue". */
6602 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 1),
6603 modifycode, rhs, complain);
6604 if (newrhs == error_mark_node)
6605 return error_mark_node;
6606 return build2 (COMPOUND_EXPR, lhstype,
6607 TREE_OPERAND (lhs, 0), newrhs);
6610 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
6611 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
6612 stabilize_reference (TREE_OPERAND (lhs, 0)),
6613 TREE_OPERAND (lhs, 1));
6614 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 0), modifycode, rhs,
6616 if (newrhs == error_mark_node)
6617 return error_mark_node;
6618 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
6622 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6623 when neither operand has side-effects. */
6624 if (!lvalue_or_else (lhs, lv_assign, complain))
6625 return error_mark_node;
6627 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0))
6628 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 1)));
6630 lhs = build3 (COND_EXPR, TREE_TYPE (lhs),
6631 build2 (TREE_CODE (lhs) == MIN_EXPR ? LE_EXPR : GE_EXPR,
6633 TREE_OPERAND (lhs, 0),
6634 TREE_OPERAND (lhs, 1)),
6635 TREE_OPERAND (lhs, 0),
6636 TREE_OPERAND (lhs, 1));
6639 /* Handle (a ? b : c) used as an "lvalue". */
6642 /* Produce (a ? (b = rhs) : (c = rhs))
6643 except that the RHS goes through a save-expr
6644 so the code to compute it is only emitted once. */
6646 tree preeval = NULL_TREE;
6648 if (VOID_TYPE_P (TREE_TYPE (rhs)))
6650 if (complain & tf_error)
6651 error ("void value not ignored as it ought to be");
6652 return error_mark_node;
6655 rhs = stabilize_expr (rhs, &preeval);
6657 /* Check this here to avoid odd errors when trying to convert
6658 a throw to the type of the COND_EXPR. */
6659 if (!lvalue_or_else (lhs, lv_assign, complain))
6660 return error_mark_node;
6662 cond = build_conditional_expr
6663 (TREE_OPERAND (lhs, 0),
6664 cp_build_modify_expr (TREE_OPERAND (lhs, 1),
6665 modifycode, rhs, complain),
6666 cp_build_modify_expr (TREE_OPERAND (lhs, 2),
6667 modifycode, rhs, complain),
6670 if (cond == error_mark_node)
6672 /* Make sure the code to compute the rhs comes out
6673 before the split. */
6675 cond = build2 (COMPOUND_EXPR, TREE_TYPE (lhs), preeval, cond);
6683 if (modifycode == INIT_EXPR)
6685 if (BRACE_ENCLOSED_INITIALIZER_P (rhs))
6686 /* Do the default thing. */;
6687 else if (TREE_CODE (rhs) == CONSTRUCTOR)
6689 /* Compound literal. */
6690 if (! same_type_p (TREE_TYPE (rhs), lhstype))
6691 /* Call convert to generate an error; see PR 11063. */
6692 rhs = convert (lhstype, rhs);
6693 result = build2 (INIT_EXPR, lhstype, lhs, rhs);
6694 TREE_SIDE_EFFECTS (result) = 1;
6697 else if (! MAYBE_CLASS_TYPE_P (lhstype))
6698 /* Do the default thing. */;
6701 VEC(tree,gc) *rhs_vec = make_tree_vector_single (rhs);
6702 result = build_special_member_call (lhs, complete_ctor_identifier,
6703 &rhs_vec, lhstype, LOOKUP_NORMAL,
6705 release_tree_vector (rhs_vec);
6706 if (result == NULL_TREE)
6707 return error_mark_node;
6713 lhs = require_complete_type_sfinae (lhs, complain);
6714 if (lhs == error_mark_node)
6715 return error_mark_node;
6717 if (modifycode == NOP_EXPR)
6719 if (c_dialect_objc ())
6721 result = objc_maybe_build_modify_expr (lhs, rhs);
6726 /* `operator=' is not an inheritable operator. */
6727 if (! MAYBE_CLASS_TYPE_P (lhstype))
6728 /* Do the default thing. */;
6731 result = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL,
6732 lhs, rhs, make_node (NOP_EXPR),
6735 if (result == NULL_TREE)
6736 return error_mark_node;
6743 tree init = NULL_TREE;
6745 /* A binary op has been requested. Combine the old LHS
6746 value with the RHS producing the value we should actually
6747 store into the LHS. */
6748 gcc_assert (!((TREE_CODE (lhstype) == REFERENCE_TYPE
6749 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype)))
6750 || MAYBE_CLASS_TYPE_P (lhstype)));
6752 /* Preevaluate the RHS to make sure its evaluation is complete
6753 before the lvalue-to-rvalue conversion of the LHS:
6755 [expr.ass] With respect to an indeterminately-sequenced
6756 function call, the operation of a compound assignment is a
6757 single evaluation. [ Note: Therefore, a function call shall
6758 not intervene between the lvalue-to-rvalue conversion and the
6759 side effect associated with any single compound assignment
6760 operator. -- end note ] */
6761 lhs = stabilize_reference (lhs);
6762 if (TREE_SIDE_EFFECTS (rhs))
6763 rhs = mark_rvalue_use (rhs);
6764 rhs = stabilize_expr (rhs, &init);
6765 newrhs = cp_build_binary_op (input_location,
6766 modifycode, lhs, rhs,
6768 if (newrhs == error_mark_node)
6770 if (complain & tf_error)
6771 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode,
6772 TREE_TYPE (lhs), TREE_TYPE (rhs));
6773 return error_mark_node;
6777 newrhs = build2 (COMPOUND_EXPR, TREE_TYPE (newrhs), init, newrhs);
6779 /* Now it looks like a plain assignment. */
6780 modifycode = NOP_EXPR;
6781 if (c_dialect_objc ())
6783 result = objc_maybe_build_modify_expr (lhs, newrhs);
6788 gcc_assert (TREE_CODE (lhstype) != REFERENCE_TYPE);
6789 gcc_assert (TREE_CODE (TREE_TYPE (newrhs)) != REFERENCE_TYPE);
6792 /* The left-hand side must be an lvalue. */
6793 if (!lvalue_or_else (lhs, lv_assign, complain))
6794 return error_mark_node;
6796 /* Warn about modifying something that is `const'. Don't warn if
6797 this is initialization. */
6798 if (modifycode != INIT_EXPR
6799 && (TREE_READONLY (lhs) || CP_TYPE_CONST_P (lhstype)
6800 /* Functions are not modifiable, even though they are
6802 || TREE_CODE (TREE_TYPE (lhs)) == FUNCTION_TYPE
6803 || TREE_CODE (TREE_TYPE (lhs)) == METHOD_TYPE
6804 /* If it's an aggregate and any field is const, then it is
6805 effectively const. */
6806 || (CLASS_TYPE_P (lhstype)
6807 && C_TYPE_FIELDS_READONLY (lhstype))))
6809 if (complain & tf_error)
6810 cxx_readonly_error (lhs, lv_assign);
6812 return error_mark_node;
6815 /* If storing into a structure or union member, it may have been given a
6816 lowered bitfield type. We need to convert to the declared type first,
6817 so retrieve it now. */
6819 olhstype = unlowered_expr_type (lhs);
6821 /* Convert new value to destination type. */
6823 if (TREE_CODE (lhstype) == ARRAY_TYPE)
6827 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs))
6829 if (modifycode != INIT_EXPR)
6831 if (complain & tf_error)
6832 error ("assigning to an array from an initializer list");
6833 return error_mark_node;
6835 if (check_array_initializer (lhs, lhstype, newrhs))
6836 return error_mark_node;
6837 newrhs = digest_init (lhstype, newrhs, complain);
6838 if (newrhs == error_mark_node)
6839 return error_mark_node;
6842 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype),
6843 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs))))
6845 if (complain & tf_error)
6846 error ("incompatible types in assignment of %qT to %qT",
6847 TREE_TYPE (rhs), lhstype);
6848 return error_mark_node;
6851 /* Allow array assignment in compiler-generated code. */
6852 else if (!current_function_decl
6853 || !DECL_DEFAULTED_FN (current_function_decl))
6855 /* This routine is used for both initialization and assignment.
6856 Make sure the diagnostic message differentiates the context. */
6857 if (complain & tf_error)
6859 if (modifycode == INIT_EXPR)
6860 error ("array used as initializer");
6862 error ("invalid array assignment");
6864 return error_mark_node;
6867 from_array = TREE_CODE (TREE_TYPE (newrhs)) == ARRAY_TYPE
6868 ? 1 + (modifycode != INIT_EXPR): 0;
6869 return build_vec_init (lhs, NULL_TREE, newrhs,
6870 /*explicit_value_init_p=*/false,
6871 from_array, complain);
6874 if (modifycode == INIT_EXPR)
6875 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6876 LOOKUP_ONLYCONVERTING. */
6877 newrhs = convert_for_initialization (lhs, olhstype, newrhs, LOOKUP_NORMAL,
6878 ICR_INIT, NULL_TREE, 0,
6881 newrhs = convert_for_assignment (olhstype, newrhs, ICR_ASSIGN,
6882 NULL_TREE, 0, complain, LOOKUP_IMPLICIT);
6884 if (!same_type_p (lhstype, olhstype))
6885 newrhs = cp_convert_and_check (lhstype, newrhs);
6887 if (modifycode != INIT_EXPR)
6889 if (TREE_CODE (newrhs) == CALL_EXPR
6890 && TYPE_NEEDS_CONSTRUCTING (lhstype))
6891 newrhs = build_cplus_new (lhstype, newrhs, complain);
6893 /* Can't initialize directly from a TARGET_EXPR, since that would
6894 cause the lhs to be constructed twice, and possibly result in
6895 accidental self-initialization. So we force the TARGET_EXPR to be
6896 expanded without a target. */
6897 if (TREE_CODE (newrhs) == TARGET_EXPR)
6898 newrhs = build2 (COMPOUND_EXPR, TREE_TYPE (newrhs), newrhs,
6899 TREE_OPERAND (newrhs, 0));
6902 if (newrhs == error_mark_node)
6903 return error_mark_node;
6905 if (c_dialect_objc () && flag_objc_gc)
6907 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
6913 result = build2 (modifycode == NOP_EXPR ? MODIFY_EXPR : INIT_EXPR,
6914 lhstype, lhs, newrhs);
6916 TREE_SIDE_EFFECTS (result) = 1;
6918 TREE_NO_WARNING (result) = 1;
6924 build_x_modify_expr (tree lhs, enum tree_code modifycode, tree rhs,
6925 tsubst_flags_t complain)
6927 if (processing_template_decl)
6928 return build_min_nt (MODOP_EXPR, lhs,
6929 build_min_nt (modifycode, NULL_TREE, NULL_TREE), rhs);
6931 if (modifycode != NOP_EXPR)
6933 tree rval = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL, lhs, rhs,
6934 make_node (modifycode),
6939 TREE_NO_WARNING (rval) = 1;
6943 return cp_build_modify_expr (lhs, modifycode, rhs, complain);
6946 /* Helper function for get_delta_difference which assumes FROM is a base
6947 class of TO. Returns a delta for the conversion of pointer-to-member
6948 of FROM to pointer-to-member of TO. If the conversion is invalid and
6949 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
6950 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6951 If C_CAST_P is true, this conversion is taking place as part of a
6955 get_delta_difference_1 (tree from, tree to, bool c_cast_p,
6956 tsubst_flags_t complain)
6960 base_access access = c_cast_p ? ba_unique : ba_check;
6962 /* Note: ba_quiet does not distinguish between access control and
6964 if (!(complain & tf_error))
6967 binfo = lookup_base (to, from, access, &kind);
6969 if (kind == bk_inaccessible || kind == bk_ambig)
6971 if (!(complain & tf_error))
6972 return error_mark_node;
6974 error (" in pointer to member function conversion");
6975 return size_zero_node;
6979 if (kind != bk_via_virtual)
6980 return BINFO_OFFSET (binfo);
6982 /* FROM is a virtual base class of TO. Issue an error or warning
6983 depending on whether or not this is a reinterpret cast. */
6985 if (!(complain & tf_error))
6986 return error_mark_node;
6988 error ("pointer to member conversion via virtual base %qT",
6989 BINFO_TYPE (binfo_from_vbase (binfo)));
6991 return size_zero_node;
6998 /* Get difference in deltas for different pointer to member function
6999 types. If the conversion is invalid and tf_error is not set in
7000 COMPLAIN, returns error_mark_node, otherwise returns an integer
7001 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
7002 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
7003 conversions as well. If C_CAST_P is true this conversion is taking
7004 place as part of a C-style cast.
7006 Note that the naming of FROM and TO is kind of backwards; the return
7007 value is what we add to a TO in order to get a FROM. They are named
7008 this way because we call this function to find out how to convert from
7009 a pointer to member of FROM to a pointer to member of TO. */
7012 get_delta_difference (tree from, tree to,
7013 bool allow_inverse_p,
7014 bool c_cast_p, tsubst_flags_t complain)
7018 if (same_type_ignoring_top_level_qualifiers_p (from, to))
7019 /* Pointer to member of incomplete class is permitted*/
7020 result = size_zero_node;
7022 result = get_delta_difference_1 (from, to, c_cast_p, complain);
7024 if (result == error_mark_node)
7025 return error_mark_node;
7029 if (!allow_inverse_p)
7031 if (!(complain & tf_error))
7032 return error_mark_node;
7034 error_not_base_type (from, to);
7035 error (" in pointer to member conversion");
7036 result = size_zero_node;
7040 result = get_delta_difference_1 (to, from, c_cast_p, complain);
7042 if (result == error_mark_node)
7043 return error_mark_node;
7046 result = size_diffop_loc (input_location,
7047 size_zero_node, result);
7050 if (!(complain & tf_error))
7051 return error_mark_node;
7053 error_not_base_type (from, to);
7054 error (" in pointer to member conversion");
7055 result = size_zero_node;
7060 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node,
7064 /* Return a constructor for the pointer-to-member-function TYPE using
7065 the other components as specified. */
7068 build_ptrmemfunc1 (tree type, tree delta, tree pfn)
7073 VEC(constructor_elt, gc) *v;
7075 /* Pull the FIELD_DECLs out of the type. */
7076 pfn_field = TYPE_FIELDS (type);
7077 delta_field = DECL_CHAIN (pfn_field);
7079 /* Make sure DELTA has the type we want. */
7080 delta = convert_and_check (delta_type_node, delta);
7082 /* Convert to the correct target type if necessary. */
7083 pfn = fold_convert (TREE_TYPE (pfn_field), pfn);
7085 /* Finish creating the initializer. */
7086 v = VEC_alloc(constructor_elt, gc, 2);
7087 CONSTRUCTOR_APPEND_ELT(v, pfn_field, pfn);
7088 CONSTRUCTOR_APPEND_ELT(v, delta_field, delta);
7089 u = build_constructor (type, v);
7090 TREE_CONSTANT (u) = TREE_CONSTANT (pfn) & TREE_CONSTANT (delta);
7091 TREE_STATIC (u) = (TREE_CONSTANT (u)
7092 && (initializer_constant_valid_p (pfn, TREE_TYPE (pfn))
7094 && (initializer_constant_valid_p (delta, TREE_TYPE (delta))
7099 /* Build a constructor for a pointer to member function. It can be
7100 used to initialize global variables, local variable, or used
7101 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
7104 If FORCE is nonzero, then force this conversion, even if
7105 we would rather not do it. Usually set when using an explicit
7106 cast. A C-style cast is being processed iff C_CAST_P is true.
7108 Return error_mark_node, if something goes wrong. */
7111 build_ptrmemfunc (tree type, tree pfn, int force, bool c_cast_p,
7112 tsubst_flags_t complain)
7118 if (error_operand_p (pfn))
7119 return error_mark_node;
7121 pfn_type = TREE_TYPE (pfn);
7122 to_type = build_ptrmemfunc_type (type);
7124 /* Handle multiple conversions of pointer to member functions. */
7125 if (TYPE_PTRMEMFUNC_P (pfn_type))
7127 tree delta = NULL_TREE;
7128 tree npfn = NULL_TREE;
7132 && !can_convert_arg (to_type, TREE_TYPE (pfn), pfn, LOOKUP_NORMAL))
7133 error ("invalid conversion to type %qT from type %qT",
7136 n = get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type),
7137 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type),
7139 c_cast_p, complain);
7140 if (n == error_mark_node)
7141 return error_mark_node;
7143 /* We don't have to do any conversion to convert a
7144 pointer-to-member to its own type. But, we don't want to
7145 just return a PTRMEM_CST if there's an explicit cast; that
7146 cast should make the expression an invalid template argument. */
7147 if (TREE_CODE (pfn) != PTRMEM_CST)
7149 if (same_type_p (to_type, pfn_type))
7151 else if (integer_zerop (n))
7152 return build_reinterpret_cast (to_type, pfn,
7153 tf_warning_or_error);
7156 if (TREE_SIDE_EFFECTS (pfn))
7157 pfn = save_expr (pfn);
7159 /* Obtain the function pointer and the current DELTA. */
7160 if (TREE_CODE (pfn) == PTRMEM_CST)
7161 expand_ptrmemfunc_cst (pfn, &delta, &npfn);
7164 npfn = build_ptrmemfunc_access_expr (pfn, pfn_identifier);
7165 delta = build_ptrmemfunc_access_expr (pfn, delta_identifier);
7168 /* Just adjust the DELTA field. */
7169 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7170 (TREE_TYPE (delta), ptrdiff_type_node));
7171 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_delta)
7172 n = cp_build_binary_op (input_location,
7173 LSHIFT_EXPR, n, integer_one_node,
7174 tf_warning_or_error);
7175 delta = cp_build_binary_op (input_location,
7176 PLUS_EXPR, delta, n, tf_warning_or_error);
7177 return build_ptrmemfunc1 (to_type, delta, npfn);
7180 /* Handle null pointer to member function conversions. */
7181 if (null_ptr_cst_p (pfn))
7183 pfn = build_c_cast (input_location, type, nullptr_node);
7184 return build_ptrmemfunc1 (to_type,
7189 if (type_unknown_p (pfn))
7190 return instantiate_type (type, pfn, tf_warning_or_error);
7192 fn = TREE_OPERAND (pfn, 0);
7193 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
7194 /* In a template, we will have preserved the
7196 || (processing_template_decl && TREE_CODE (fn) == OFFSET_REF));
7197 return make_ptrmem_cst (to_type, fn);
7200 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7203 ??? There is no consistency as to the types returned for the above
7204 values. Some code acts as if it were a sizetype and some as if it were
7205 integer_type_node. */
7208 expand_ptrmemfunc_cst (tree cst, tree *delta, tree *pfn)
7210 tree type = TREE_TYPE (cst);
7211 tree fn = PTRMEM_CST_MEMBER (cst);
7212 tree ptr_class, fn_class;
7214 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
7216 /* The class that the function belongs to. */
7217 fn_class = DECL_CONTEXT (fn);
7219 /* The class that we're creating a pointer to member of. */
7220 ptr_class = TYPE_PTRMEMFUNC_OBJECT_TYPE (type);
7222 /* First, calculate the adjustment to the function's class. */
7223 *delta = get_delta_difference (fn_class, ptr_class, /*force=*/0,
7224 /*c_cast_p=*/0, tf_warning_or_error);
7226 if (!DECL_VIRTUAL_P (fn))
7227 *pfn = convert (TYPE_PTRMEMFUNC_FN_TYPE (type), build_addr_func (fn));
7230 /* If we're dealing with a virtual function, we have to adjust 'this'
7231 again, to point to the base which provides the vtable entry for
7232 fn; the call will do the opposite adjustment. */
7233 tree orig_class = DECL_CONTEXT (fn);
7234 tree binfo = binfo_or_else (orig_class, fn_class);
7235 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
7236 *delta, BINFO_OFFSET (binfo));
7237 *delta = fold_if_not_in_template (*delta);
7239 /* We set PFN to the vtable offset at which the function can be
7240 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7241 case delta is shifted left, and then incremented). */
7242 *pfn = DECL_VINDEX (fn);
7243 *pfn = build2 (MULT_EXPR, integer_type_node, *pfn,
7244 TYPE_SIZE_UNIT (vtable_entry_type));
7245 *pfn = fold_if_not_in_template (*pfn);
7247 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
7249 case ptrmemfunc_vbit_in_pfn:
7250 *pfn = build2 (PLUS_EXPR, integer_type_node, *pfn,
7252 *pfn = fold_if_not_in_template (*pfn);
7255 case ptrmemfunc_vbit_in_delta:
7256 *delta = build2 (LSHIFT_EXPR, TREE_TYPE (*delta),
7257 *delta, integer_one_node);
7258 *delta = fold_if_not_in_template (*delta);
7259 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
7260 *delta, integer_one_node);
7261 *delta = fold_if_not_in_template (*delta);
7268 *pfn = build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type), *pfn);
7269 *pfn = fold_if_not_in_template (*pfn);
7273 /* Return an expression for PFN from the pointer-to-member function
7277 pfn_from_ptrmemfunc (tree t)
7279 if (TREE_CODE (t) == PTRMEM_CST)
7284 expand_ptrmemfunc_cst (t, &delta, &pfn);
7289 return build_ptrmemfunc_access_expr (t, pfn_identifier);
7292 /* Return an expression for DELTA from the pointer-to-member function
7296 delta_from_ptrmemfunc (tree t)
7298 if (TREE_CODE (t) == PTRMEM_CST)
7303 expand_ptrmemfunc_cst (t, &delta, &pfn);
7308 return build_ptrmemfunc_access_expr (t, delta_identifier);
7311 /* Convert value RHS to type TYPE as preparation for an assignment to
7312 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
7313 implicit conversion is. If FNDECL is non-NULL, we are doing the
7314 conversion in order to pass the PARMNUMth argument of FNDECL.
7315 If FNDECL is NULL, we are doing the conversion in function pointer
7316 argument passing, conversion in initialization, etc. */
7319 convert_for_assignment (tree type, tree rhs,
7320 impl_conv_rhs errtype, tree fndecl, int parmnum,
7321 tsubst_flags_t complain, int flags)
7324 enum tree_code coder;
7326 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7327 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
7328 rhs = TREE_OPERAND (rhs, 0);
7330 rhstype = TREE_TYPE (rhs);
7331 coder = TREE_CODE (rhstype);
7333 if (TREE_CODE (type) == VECTOR_TYPE && coder == VECTOR_TYPE
7334 && vector_types_convertible_p (type, rhstype, true))
7336 rhs = mark_rvalue_use (rhs);
7337 return convert (type, rhs);
7340 if (rhs == error_mark_node || rhstype == error_mark_node)
7341 return error_mark_node;
7342 if (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node)
7343 return error_mark_node;
7345 /* The RHS of an assignment cannot have void type. */
7346 if (coder == VOID_TYPE)
7348 if (complain & tf_error)
7349 error ("void value not ignored as it ought to be");
7350 return error_mark_node;
7353 /* Simplify the RHS if possible. */
7354 if (TREE_CODE (rhs) == CONST_DECL)
7355 rhs = DECL_INITIAL (rhs);
7357 if (c_dialect_objc ())
7361 tree rname = fndecl;
7372 selector = objc_message_selector ();
7374 if (selector && parmno > 1)
7381 if (objc_compare_types (type, rhstype, parmno, rname))
7383 rhs = mark_rvalue_use (rhs);
7384 return convert (type, rhs);
7390 The expression is implicitly converted (clause _conv_) to the
7391 cv-unqualified type of the left operand.
7393 We allow bad conversions here because by the time we get to this point
7394 we are committed to doing the conversion. If we end up doing a bad
7395 conversion, convert_like will complain. */
7396 if (!can_convert_arg_bad (type, rhstype, rhs, flags))
7398 /* When -Wno-pmf-conversions is use, we just silently allow
7399 conversions from pointers-to-members to plain pointers. If
7400 the conversion doesn't work, cp_convert will complain. */
7402 && TYPE_PTR_P (type)
7403 && TYPE_PTRMEMFUNC_P (rhstype))
7404 rhs = cp_convert (strip_top_quals (type), rhs);
7407 if (complain & tf_error)
7409 /* If the right-hand side has unknown type, then it is an
7410 overloaded function. Call instantiate_type to get error
7412 if (rhstype == unknown_type_node)
7413 instantiate_type (type, rhs, tf_warning_or_error);
7415 error ("cannot convert %qT to %qT for argument %qP to %qD",
7416 rhstype, type, parmnum, fndecl);
7420 case ICR_DEFAULT_ARGUMENT:
7421 error ("cannot convert %qT to %qT in default argument",
7425 error ("cannot convert %qT to %qT in argument passing",
7428 case ICR_CONVERTING:
7429 error ("cannot convert %qT to %qT",
7433 error ("cannot convert %qT to %qT in initialization",
7437 error ("cannot convert %qT to %qT in return",
7441 error ("cannot convert %qT to %qT in assignment",
7448 return error_mark_node;
7451 if (warn_missing_format_attribute)
7453 const enum tree_code codel = TREE_CODE (type);
7454 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
7456 && check_missing_format_attribute (type, rhstype)
7457 && (complain & tf_warning))
7461 case ICR_DEFAULT_ARGUMENT:
7463 warning (OPT_Wmissing_format_attribute,
7464 "parameter %qP of %qD might be a candidate "
7465 "for a format attribute", parmnum, fndecl);
7467 warning (OPT_Wmissing_format_attribute,
7468 "parameter might be a candidate "
7469 "for a format attribute");
7471 case ICR_CONVERTING:
7472 warning (OPT_Wmissing_format_attribute,
7473 "target of conversion might be a candidate "
7474 "for a format attribute");
7477 warning (OPT_Wmissing_format_attribute,
7478 "target of initialization might be a candidate "
7479 "for a format attribute");
7482 warning (OPT_Wmissing_format_attribute,
7483 "return type might be a candidate "
7484 "for a format attribute");
7487 warning (OPT_Wmissing_format_attribute,
7488 "left-hand side of assignment might be a candidate "
7489 "for a format attribute");
7496 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7498 if (warn_parentheses
7499 && TREE_CODE (type) == BOOLEAN_TYPE
7500 && TREE_CODE (rhs) == MODIFY_EXPR
7501 && !TREE_NO_WARNING (rhs)
7502 && TREE_CODE (TREE_TYPE (rhs)) != BOOLEAN_TYPE
7503 && (complain & tf_warning))
7505 location_t loc = EXPR_LOC_OR_HERE (rhs);
7507 warning_at (loc, OPT_Wparentheses,
7508 "suggest parentheses around assignment used as truth value");
7509 TREE_NO_WARNING (rhs) = 1;
7512 return perform_implicit_conversion_flags (strip_top_quals (type), rhs,
7516 /* Convert RHS to be of type TYPE.
7517 If EXP is nonzero, it is the target of the initialization.
7518 ERRTYPE indicates what kind of error the implicit conversion is.
7520 Two major differences between the behavior of
7521 `convert_for_assignment' and `convert_for_initialization'
7522 are that references are bashed in the former, while
7523 copied in the latter, and aggregates are assigned in
7524 the former (operator=) while initialized in the
7527 If using constructor make sure no conversion operator exists, if one does
7528 exist, an ambiguity exists.
7530 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7533 convert_for_initialization (tree exp, tree type, tree rhs, int flags,
7534 impl_conv_rhs errtype, tree fndecl, int parmnum,
7535 tsubst_flags_t complain)
7537 enum tree_code codel = TREE_CODE (type);
7539 enum tree_code coder;
7541 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7542 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7543 if (TREE_CODE (rhs) == NOP_EXPR
7544 && TREE_TYPE (rhs) == TREE_TYPE (TREE_OPERAND (rhs, 0))
7545 && codel != REFERENCE_TYPE)
7546 rhs = TREE_OPERAND (rhs, 0);
7548 if (type == error_mark_node
7549 || rhs == error_mark_node
7550 || (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node))
7551 return error_mark_node;
7553 if ((TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
7554 && TREE_CODE (type) != ARRAY_TYPE
7555 && (TREE_CODE (type) != REFERENCE_TYPE
7556 || TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE))
7557 || (TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE
7558 && (TREE_CODE (type) != REFERENCE_TYPE
7559 || TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE))
7560 || TREE_CODE (TREE_TYPE (rhs)) == METHOD_TYPE)
7561 rhs = decay_conversion (rhs);
7563 rhstype = TREE_TYPE (rhs);
7564 coder = TREE_CODE (rhstype);
7566 if (coder == ERROR_MARK)
7567 return error_mark_node;
7569 /* We accept references to incomplete types, so we can
7570 return here before checking if RHS is of complete type. */
7572 if (codel == REFERENCE_TYPE)
7574 /* This should eventually happen in convert_arguments. */
7575 int savew = 0, savee = 0;
7578 savew = warningcount, savee = errorcount;
7579 rhs = initialize_reference (type, rhs, flags, complain);
7582 if (warningcount > savew)
7583 warning (0, "in passing argument %P of %q+D", parmnum, fndecl);
7584 else if (errorcount > savee)
7585 error ("in passing argument %P of %q+D", parmnum, fndecl);
7591 exp = require_complete_type_sfinae (exp, complain);
7592 if (exp == error_mark_node)
7593 return error_mark_node;
7595 rhstype = non_reference (rhstype);
7597 type = complete_type (type);
7599 if (DIRECT_INIT_EXPR_P (type, rhs))
7600 /* Don't try to do copy-initialization if we already have
7601 direct-initialization. */
7604 if (MAYBE_CLASS_TYPE_P (type))
7605 return perform_implicit_conversion_flags (type, rhs, complain, flags);
7607 return convert_for_assignment (type, rhs, errtype, fndecl, parmnum,
7611 /* If RETVAL is the address of, or a reference to, a local variable or
7612 temporary give an appropriate warning. */
7615 maybe_warn_about_returning_address_of_local (tree retval)
7617 tree valtype = TREE_TYPE (DECL_RESULT (current_function_decl));
7618 tree whats_returned = retval;
7622 if (TREE_CODE (whats_returned) == COMPOUND_EXPR)
7623 whats_returned = TREE_OPERAND (whats_returned, 1);
7624 else if (CONVERT_EXPR_P (whats_returned)
7625 || TREE_CODE (whats_returned) == NON_LVALUE_EXPR)
7626 whats_returned = TREE_OPERAND (whats_returned, 0);
7631 if (TREE_CODE (whats_returned) != ADDR_EXPR)
7633 whats_returned = TREE_OPERAND (whats_returned, 0);
7635 if (TREE_CODE (valtype) == REFERENCE_TYPE)
7637 if (TREE_CODE (whats_returned) == AGGR_INIT_EXPR
7638 || TREE_CODE (whats_returned) == TARGET_EXPR)
7640 warning (0, "returning reference to temporary");
7643 if (TREE_CODE (whats_returned) == VAR_DECL
7644 && DECL_NAME (whats_returned)
7645 && TEMP_NAME_P (DECL_NAME (whats_returned)))
7647 warning (0, "reference to non-lvalue returned");
7652 while (TREE_CODE (whats_returned) == COMPONENT_REF
7653 || TREE_CODE (whats_returned) == ARRAY_REF)
7654 whats_returned = TREE_OPERAND (whats_returned, 0);
7656 if (DECL_P (whats_returned)
7657 && DECL_NAME (whats_returned)
7658 && DECL_FUNCTION_SCOPE_P (whats_returned)
7659 && !(TREE_STATIC (whats_returned)
7660 || TREE_PUBLIC (whats_returned)))
7662 if (TREE_CODE (valtype) == REFERENCE_TYPE)
7663 warning (0, "reference to local variable %q+D returned",
7666 warning (0, "address of local variable %q+D returned",
7672 /* Check that returning RETVAL from the current function is valid.
7673 Return an expression explicitly showing all conversions required to
7674 change RETVAL into the function return type, and to assign it to
7675 the DECL_RESULT for the function. Set *NO_WARNING to true if
7676 code reaches end of non-void function warning shouldn't be issued
7677 on this RETURN_EXPR. */
7680 check_return_expr (tree retval, bool *no_warning)
7683 /* The type actually returned by the function, after any
7686 int fn_returns_value_p;
7687 bool named_return_value_okay_p;
7689 *no_warning = false;
7691 /* A `volatile' function is one that isn't supposed to return, ever.
7692 (This is a G++ extension, used to get better code for functions
7693 that call the `volatile' function.) */
7694 if (TREE_THIS_VOLATILE (current_function_decl))
7695 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7697 /* Check for various simple errors. */
7698 if (DECL_DESTRUCTOR_P (current_function_decl))
7701 error ("returning a value from a destructor");
7704 else if (DECL_CONSTRUCTOR_P (current_function_decl))
7706 if (in_function_try_handler)
7707 /* If a return statement appears in a handler of the
7708 function-try-block of a constructor, the program is ill-formed. */
7709 error ("cannot return from a handler of a function-try-block of a constructor");
7711 /* You can't return a value from a constructor. */
7712 error ("returning a value from a constructor");
7716 /* As an extension, deduce lambda return type from a return statement
7717 anywhere in the body. */
7718 if (retval && LAMBDA_FUNCTION_P (current_function_decl))
7720 tree lambda = CLASSTYPE_LAMBDA_EXPR (current_class_type);
7721 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda))
7723 tree type = lambda_return_type (retval);
7724 tree oldtype = LAMBDA_EXPR_RETURN_TYPE (lambda);
7726 if (oldtype == NULL_TREE)
7727 apply_lambda_return_type (lambda, type);
7728 /* If one of the answers is type-dependent, we can't do any
7729 better until instantiation time. */
7730 else if (oldtype == dependent_lambda_return_type_node)
7732 else if (type == dependent_lambda_return_type_node)
7733 apply_lambda_return_type (lambda, type);
7734 else if (!same_type_p (type, oldtype))
7735 error ("inconsistent types %qT and %qT deduced for "
7736 "lambda return type", type, oldtype);
7740 if (processing_template_decl)
7742 current_function_returns_value = 1;
7743 if (check_for_bare_parameter_packs (retval))
7744 retval = error_mark_node;
7748 /* When no explicit return-value is given in a function with a named
7749 return value, the named return value is used. */
7750 result = DECL_RESULT (current_function_decl);
7751 valtype = TREE_TYPE (result);
7752 gcc_assert (valtype != NULL_TREE);
7753 fn_returns_value_p = !VOID_TYPE_P (valtype);
7754 if (!retval && DECL_NAME (result) && fn_returns_value_p)
7757 /* Check for a return statement with no return value in a function
7758 that's supposed to return a value. */
7759 if (!retval && fn_returns_value_p)
7761 permerror (input_location, "return-statement with no value, in function returning %qT",
7763 /* Clear this, so finish_function won't say that we reach the
7764 end of a non-void function (which we don't, we gave a
7766 current_function_returns_null = 0;
7767 /* And signal caller that TREE_NO_WARNING should be set on the
7768 RETURN_EXPR to avoid control reaches end of non-void function
7769 warnings in tree-cfg.c. */
7772 /* Check for a return statement with a value in a function that
7773 isn't supposed to return a value. */
7774 else if (retval && !fn_returns_value_p)
7776 if (VOID_TYPE_P (TREE_TYPE (retval)))
7777 /* You can return a `void' value from a function of `void'
7778 type. In that case, we have to evaluate the expression for
7779 its side-effects. */
7780 finish_expr_stmt (retval);
7782 permerror (input_location, "return-statement with a value, in function "
7783 "returning 'void'");
7784 current_function_returns_null = 1;
7786 /* There's really no value to return, after all. */
7790 /* Remember that this function can sometimes return without a
7792 current_function_returns_null = 1;
7794 /* Remember that this function did return a value. */
7795 current_function_returns_value = 1;
7797 /* Check for erroneous operands -- but after giving ourselves a
7798 chance to provide an error about returning a value from a void
7800 if (error_operand_p (retval))
7802 current_function_return_value = error_mark_node;
7803 return error_mark_node;
7806 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7807 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl) == NEW_EXPR
7808 || DECL_OVERLOADED_OPERATOR_P (current_function_decl) == VEC_NEW_EXPR)
7809 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl))
7811 && retval && null_ptr_cst_p (retval))
7812 warning (0, "%<operator new%> must not return NULL unless it is "
7813 "declared %<throw()%> (or -fcheck-new is in effect)");
7815 /* Effective C++ rule 15. See also start_function. */
7817 && DECL_NAME (current_function_decl) == ansi_assopname(NOP_EXPR))
7821 /* The function return type must be a reference to the current
7823 if (TREE_CODE (valtype) == REFERENCE_TYPE
7824 && same_type_ignoring_top_level_qualifiers_p
7825 (TREE_TYPE (valtype), TREE_TYPE (current_class_ref)))
7827 /* Returning '*this' is obviously OK. */
7828 if (retval == current_class_ref)
7830 /* If we are calling a function whose return type is the same of
7831 the current class reference, it is ok. */
7832 else if (TREE_CODE (retval) == INDIRECT_REF
7833 && TREE_CODE (TREE_OPERAND (retval, 0)) == CALL_EXPR)
7838 warning (OPT_Weffc__, "%<operator=%> should return a reference to %<*this%>");
7841 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7843 [...] For a function with a class return type, if the expression
7844 in the return statement is the name of a local object, and the cv-
7845 unqualified type of the local object is the same as the function
7846 return type, an implementation is permitted to omit creating the tem-
7847 porary object to hold the function return value [...]
7849 So, if this is a value-returning function that always returns the same
7850 local variable, remember it.
7852 It might be nice to be more flexible, and choose the first suitable
7853 variable even if the function sometimes returns something else, but
7854 then we run the risk of clobbering the variable we chose if the other
7855 returned expression uses the chosen variable somehow. And people expect
7856 this restriction, anyway. (jason 2000-11-19)
7858 See finish_function and finalize_nrv for the rest of this optimization. */
7860 named_return_value_okay_p =
7861 (retval != NULL_TREE
7862 /* Must be a local, automatic variable. */
7863 && TREE_CODE (retval) == VAR_DECL
7864 && DECL_CONTEXT (retval) == current_function_decl
7865 && ! TREE_STATIC (retval)
7866 && ! DECL_ANON_UNION_VAR_P (retval)
7867 && (DECL_ALIGN (retval)
7868 >= DECL_ALIGN (DECL_RESULT (current_function_decl)))
7869 /* The cv-unqualified type of the returned value must be the
7870 same as the cv-unqualified return type of the
7872 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval))),
7874 (TREE_TYPE (TREE_TYPE (current_function_decl)))))
7875 /* And the returned value must be non-volatile. */
7876 && ! TYPE_VOLATILE (TREE_TYPE (retval)));
7878 if (fn_returns_value_p && flag_elide_constructors)
7880 if (named_return_value_okay_p
7881 && (current_function_return_value == NULL_TREE
7882 || current_function_return_value == retval))
7883 current_function_return_value = retval;
7885 current_function_return_value = error_mark_node;
7888 /* We don't need to do any conversions when there's nothing being
7893 /* Do any required conversions. */
7894 if (retval == result || DECL_CONSTRUCTOR_P (current_function_decl))
7895 /* No conversions are required. */
7899 /* The type the function is declared to return. */
7900 tree functype = TREE_TYPE (TREE_TYPE (current_function_decl));
7901 int flags = LOOKUP_NORMAL | LOOKUP_ONLYCONVERTING;
7903 /* The functype's return type will have been set to void, if it
7904 was an incomplete type. Just treat this as 'return;' */
7905 if (VOID_TYPE_P (functype))
7906 return error_mark_node;
7908 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7909 treated as an rvalue for the purposes of overload resolution to
7910 favor move constructors over copy constructors.
7912 Note that these conditions are similar to, but not as strict as,
7913 the conditions for the named return value optimization. */
7914 if ((cxx_dialect != cxx98)
7915 && (TREE_CODE (retval) == VAR_DECL
7916 || TREE_CODE (retval) == PARM_DECL)
7917 && DECL_CONTEXT (retval) == current_function_decl
7918 && !TREE_STATIC (retval)
7919 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval))),
7921 (TREE_TYPE (TREE_TYPE (current_function_decl)))))
7922 /* This is only interesting for class type. */
7923 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
7924 flags = flags | LOOKUP_PREFER_RVALUE;
7926 /* First convert the value to the function's return type, then
7927 to the type of return value's location to handle the
7928 case that functype is smaller than the valtype. */
7929 retval = convert_for_initialization
7930 (NULL_TREE, functype, retval, flags, ICR_RETURN, NULL_TREE, 0,
7931 tf_warning_or_error);
7932 retval = convert (valtype, retval);
7934 /* If the conversion failed, treat this just like `return;'. */
7935 if (retval == error_mark_node)
7937 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7938 else if (! cfun->returns_struct
7939 && TREE_CODE (retval) == TARGET_EXPR
7940 && TREE_CODE (TREE_OPERAND (retval, 1)) == AGGR_INIT_EXPR)
7941 retval = build2 (COMPOUND_EXPR, TREE_TYPE (retval), retval,
7942 TREE_OPERAND (retval, 0));
7944 maybe_warn_about_returning_address_of_local (retval);
7947 /* Actually copy the value returned into the appropriate location. */
7948 if (retval && retval != result)
7949 retval = build2 (INIT_EXPR, TREE_TYPE (result), result, retval);
7955 /* Returns nonzero if the pointer-type FROM can be converted to the
7956 pointer-type TO via a qualification conversion. If CONSTP is -1,
7957 then we return nonzero if the pointers are similar, and the
7958 cv-qualification signature of FROM is a proper subset of that of TO.
7960 If CONSTP is positive, then all outer pointers have been
7964 comp_ptr_ttypes_real (tree to, tree from, int constp)
7966 bool to_more_cv_qualified = false;
7967 bool is_opaque_pointer = false;
7969 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7971 if (TREE_CODE (to) != TREE_CODE (from))
7974 if (TREE_CODE (from) == OFFSET_TYPE
7975 && !same_type_p (TYPE_OFFSET_BASETYPE (from),
7976 TYPE_OFFSET_BASETYPE (to)))
7979 /* Const and volatile mean something different for function types,
7980 so the usual checks are not appropriate. */
7981 if (TREE_CODE (to) != FUNCTION_TYPE && TREE_CODE (to) != METHOD_TYPE)
7983 if (!at_least_as_qualified_p (to, from))
7986 if (!at_least_as_qualified_p (from, to))
7990 to_more_cv_qualified = true;
7994 constp &= TYPE_READONLY (to);
7997 if (TREE_CODE (to) == VECTOR_TYPE)
7998 is_opaque_pointer = vector_targets_convertible_p (to, from);
8000 if (TREE_CODE (to) != POINTER_TYPE && !TYPE_PTRMEM_P (to))
8001 return ((constp >= 0 || to_more_cv_qualified)
8002 && (is_opaque_pointer
8003 || same_type_ignoring_top_level_qualifiers_p (to, from)));
8007 /* When comparing, say, char ** to char const **, this function takes
8008 the 'char *' and 'char const *'. Do not pass non-pointer/reference
8009 types to this function. */
8012 comp_ptr_ttypes (tree to, tree from)
8014 return comp_ptr_ttypes_real (to, from, 1);
8017 /* Returns true iff FNTYPE is a non-class type that involves
8018 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
8019 if a parameter type is ill-formed. */
8022 error_type_p (const_tree type)
8026 switch (TREE_CODE (type))
8032 case REFERENCE_TYPE:
8034 return error_type_p (TREE_TYPE (type));
8038 if (error_type_p (TREE_TYPE (type)))
8040 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
8041 if (error_type_p (TREE_VALUE (t)))
8046 if (TYPE_PTRMEMFUNC_P (type))
8047 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type));
8055 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
8056 type or inheritance-related types, regardless of cv-quals. */
8059 ptr_reasonably_similar (const_tree to, const_tree from)
8061 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
8063 /* Any target type is similar enough to void. */
8064 if (TREE_CODE (to) == VOID_TYPE)
8065 return !error_type_p (from);
8066 if (TREE_CODE (from) == VOID_TYPE)
8067 return !error_type_p (to);
8069 if (TREE_CODE (to) != TREE_CODE (from))
8072 if (TREE_CODE (from) == OFFSET_TYPE
8073 && comptypes (TYPE_OFFSET_BASETYPE (to),
8074 TYPE_OFFSET_BASETYPE (from),
8075 COMPARE_BASE | COMPARE_DERIVED))
8078 if (TREE_CODE (to) == VECTOR_TYPE
8079 && vector_types_convertible_p (to, from, false))
8082 if (TREE_CODE (to) == INTEGER_TYPE
8083 && TYPE_PRECISION (to) == TYPE_PRECISION (from))
8086 if (TREE_CODE (to) == FUNCTION_TYPE)
8087 return !error_type_p (to) && !error_type_p (from);
8089 if (TREE_CODE (to) != POINTER_TYPE)
8091 (TYPE_MAIN_VARIANT (to), TYPE_MAIN_VARIANT (from),
8092 COMPARE_BASE | COMPARE_DERIVED);
8096 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
8097 pointer-to-member types) are the same, ignoring cv-qualification at
8101 comp_ptr_ttypes_const (tree to, tree from)
8103 bool is_opaque_pointer = false;
8105 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
8107 if (TREE_CODE (to) != TREE_CODE (from))
8110 if (TREE_CODE (from) == OFFSET_TYPE
8111 && same_type_p (TYPE_OFFSET_BASETYPE (from),
8112 TYPE_OFFSET_BASETYPE (to)))
8115 if (TREE_CODE (to) == VECTOR_TYPE)
8116 is_opaque_pointer = vector_targets_convertible_p (to, from);
8118 if (TREE_CODE (to) != POINTER_TYPE)
8119 return (is_opaque_pointer
8120 || same_type_ignoring_top_level_qualifiers_p (to, from));
8124 /* Returns the type qualifiers for this type, including the qualifiers on the
8125 elements for an array type. */
8128 cp_type_quals (const_tree type)
8131 /* This CONST_CAST is okay because strip_array_types returns its
8132 argument unmodified and we assign it to a const_tree. */
8133 type = strip_array_types (CONST_CAST_TREE (type));
8134 if (type == error_mark_node
8135 /* Quals on a FUNCTION_TYPE are memfn quals. */
8136 || TREE_CODE (type) == FUNCTION_TYPE)
8137 return TYPE_UNQUALIFIED;
8138 quals = TYPE_QUALS (type);
8139 /* METHOD and REFERENCE_TYPEs should never have quals. */
8140 gcc_assert ((TREE_CODE (type) != METHOD_TYPE
8141 && TREE_CODE (type) != REFERENCE_TYPE)
8142 || ((quals & (TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE))
8143 == TYPE_UNQUALIFIED));
8147 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
8151 type_memfn_quals (const_tree type)
8153 if (TREE_CODE (type) == FUNCTION_TYPE)
8154 return TYPE_QUALS (type);
8155 else if (TREE_CODE (type) == METHOD_TYPE)
8156 return cp_type_quals (class_of_this_parm (type));
8161 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
8165 apply_memfn_quals (tree type, cp_cv_quals memfn_quals)
8167 /* Could handle METHOD_TYPE here if necessary. */
8168 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
8169 if (TYPE_QUALS (type) == memfn_quals)
8171 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
8173 return build_qualified_type (type, memfn_quals);
8176 /* Returns nonzero if TYPE is const or volatile. */
8179 cv_qualified_p (const_tree type)
8181 int quals = cp_type_quals (type);
8182 return (quals & (TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE)) != 0;
8185 /* Returns nonzero if the TYPE contains a mutable member. */
8188 cp_has_mutable_p (const_tree type)
8190 /* This CONST_CAST is okay because strip_array_types returns its
8191 argument unmodified and we assign it to a const_tree. */
8192 type = strip_array_types (CONST_CAST_TREE(type));
8194 return CLASS_TYPE_P (type) && CLASSTYPE_HAS_MUTABLE (type);
8197 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
8198 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
8199 approximation. In particular, consider:
8202 struct S { int i; };
8203 const S s = { f(); }
8205 Here, we will make "s" as TREE_READONLY (because it is declared
8206 "const") -- only to reverse ourselves upon seeing that the
8207 initializer is non-constant. */
8210 cp_apply_type_quals_to_decl (int type_quals, tree decl)
8212 tree type = TREE_TYPE (decl);
8214 if (type == error_mark_node)
8217 if (TREE_CODE (decl) == TYPE_DECL)
8220 gcc_assert (!(TREE_CODE (type) == FUNCTION_TYPE
8221 && type_quals != TYPE_UNQUALIFIED));
8223 /* Avoid setting TREE_READONLY incorrectly. */
8224 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
8225 constructor can produce constant init, so rely on cp_finish_decl to
8226 clear TREE_READONLY if the variable has non-constant init. */
8228 /* If the type has a mutable component, that component might be
8230 if (TYPE_HAS_MUTABLE_P (type))
8231 type_quals &= ~TYPE_QUAL_CONST;
8233 c_apply_type_quals_to_decl (type_quals, decl);
8236 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8237 exemplar types such that casting T1 to T2 is casting away constness
8238 if and only if there is no implicit conversion from T1 to T2. */
8241 casts_away_constness_r (tree *t1, tree *t2)
8246 /* [expr.const.cast]
8248 For multi-level pointer to members and multi-level mixed pointers
8249 and pointers to members (conv.qual), the "member" aspect of a
8250 pointer to member level is ignored when determining if a const
8251 cv-qualifier has been cast away. */
8252 /* [expr.const.cast]
8254 For two pointer types:
8256 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8257 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8260 casting from X1 to X2 casts away constness if, for a non-pointer
8261 type T there does not exist an implicit conversion (clause
8264 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8268 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8269 if ((!TYPE_PTR_P (*t1) && !TYPE_PTRMEM_P (*t1))
8270 || (!TYPE_PTR_P (*t2) && !TYPE_PTRMEM_P (*t2)))
8272 *t1 = cp_build_qualified_type (void_type_node,
8273 cp_type_quals (*t1));
8274 *t2 = cp_build_qualified_type (void_type_node,
8275 cp_type_quals (*t2));
8279 quals1 = cp_type_quals (*t1);
8280 quals2 = cp_type_quals (*t2);
8282 if (TYPE_PTRMEM_P (*t1))
8283 *t1 = TYPE_PTRMEM_POINTED_TO_TYPE (*t1);
8285 *t1 = TREE_TYPE (*t1);
8286 if (TYPE_PTRMEM_P (*t2))
8287 *t2 = TYPE_PTRMEM_POINTED_TO_TYPE (*t2);
8289 *t2 = TREE_TYPE (*t2);
8291 casts_away_constness_r (t1, t2);
8292 *t1 = build_pointer_type (*t1);
8293 *t2 = build_pointer_type (*t2);
8294 *t1 = cp_build_qualified_type (*t1, quals1);
8295 *t2 = cp_build_qualified_type (*t2, quals2);
8298 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8301 ??? This function returns non-zero if casting away qualifiers not
8302 just const. We would like to return to the caller exactly which
8303 qualifiers are casted away to give more accurate diagnostics.
8307 casts_away_constness (tree t1, tree t2)
8309 if (TREE_CODE (t2) == REFERENCE_TYPE)
8311 /* [expr.const.cast]
8313 Casting from an lvalue of type T1 to an lvalue of type T2
8314 using a reference cast casts away constness if a cast from an
8315 rvalue of type "pointer to T1" to the type "pointer to T2"
8316 casts away constness. */
8317 t1 = (TREE_CODE (t1) == REFERENCE_TYPE ? TREE_TYPE (t1) : t1);
8318 return casts_away_constness (build_pointer_type (t1),
8319 build_pointer_type (TREE_TYPE (t2)));
8322 if (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2))
8323 /* [expr.const.cast]
8325 Casting from an rvalue of type "pointer to data member of X
8326 of type T1" to the type "pointer to data member of Y of type
8327 T2" casts away constness if a cast from an rvalue of type
8328 "pointer to T1" to the type "pointer to T2" casts away
8330 return casts_away_constness
8331 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1)),
8332 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2)));
8334 /* Casting away constness is only something that makes sense for
8335 pointer or reference types. */
8336 if (TREE_CODE (t1) != POINTER_TYPE
8337 || TREE_CODE (t2) != POINTER_TYPE)
8340 /* Top-level qualifiers don't matter. */
8341 t1 = TYPE_MAIN_VARIANT (t1);
8342 t2 = TYPE_MAIN_VARIANT (t2);
8343 casts_away_constness_r (&t1, &t2);
8344 if (!can_convert (t2, t1))
8350 /* If T is a REFERENCE_TYPE return the type to which T refers.
8351 Otherwise, return T itself. */
8354 non_reference (tree t)
8356 if (t && TREE_CODE (t) == REFERENCE_TYPE)
8362 /* Return nonzero if REF is an lvalue valid for this language;
8363 otherwise, print an error message and return zero. USE says
8364 how the lvalue is being used and so selects the error message. */
8367 lvalue_or_else (tree ref, enum lvalue_use use, tsubst_flags_t complain)
8369 cp_lvalue_kind kind = lvalue_kind (ref);
8371 if (kind == clk_none)
8373 if (complain & tf_error)
8374 lvalue_error (input_location, use);
8377 else if (kind & (clk_rvalueref|clk_class))
8379 if (!(complain & tf_error))
8381 if (kind & clk_class)
8382 /* Make this a permerror because we used to accept it. */
8383 permerror (input_location, "using temporary as lvalue");
8385 error ("using xvalue (rvalue reference) as lvalue");
8390 /* Return true if a user-defined literal operator is a raw operator. */
8393 check_raw_literal_operator (const_tree decl)
8395 tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl));
8398 bool maybe_raw_p = false;
8400 /* Count the number and type of arguments and check for ellipsis. */
8401 for (argtype = argtypes, arity = 0;
8402 argtype && argtype != void_list_node;
8403 ++arity, argtype = TREE_CHAIN (argtype))
8405 tree t = TREE_VALUE (argtype);
8407 if (same_type_p (t, const_string_type_node))
8411 return false; /* Found ellipsis. */
8413 if (!maybe_raw_p || arity != 1)
8420 /* Return true if a user-defined literal operator has one of the allowed
8424 check_literal_operator_args (const_tree decl,
8425 bool *long_long_unsigned_p, bool *long_double_p)
8427 tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl));
8428 if (processing_template_decl || processing_specialization)
8429 return argtypes == void_list_node;
8436 *long_long_unsigned_p = false;
8437 *long_double_p = false;
8439 /* Count the number and type of arguments and check for ellipsis. */
8440 for (argtype = argtypes, arity = 0;
8441 argtype && argtype != void_list_node;
8442 argtype = TREE_CHAIN (argtype))
8444 tree t = TREE_VALUE (argtype);
8447 if (TREE_CODE (t) == POINTER_TYPE)
8449 bool maybe_raw_p = false;
8451 if (cp_type_quals (t) != TYPE_QUAL_CONST)
8453 t = TYPE_MAIN_VARIANT (t);
8454 if ((maybe_raw_p = same_type_p (t, char_type_node))
8455 || same_type_p (t, wchar_type_node)
8456 || same_type_p (t, char16_type_node)
8457 || same_type_p (t, char32_type_node))
8459 argtype = TREE_CHAIN (argtype);
8462 t = TREE_VALUE (argtype);
8463 if (maybe_raw_p && argtype == void_list_node)
8465 else if (same_type_p (t, size_type_node))
8474 else if (same_type_p (t, long_long_unsigned_type_node))
8477 *long_long_unsigned_p = true;
8479 else if (same_type_p (t, long_double_type_node))
8482 *long_double_p = true;
8484 else if (same_type_p (t, char_type_node))
8486 else if (same_type_p (t, wchar_type_node))
8488 else if (same_type_p (t, char16_type_node))
8490 else if (same_type_p (t, char32_type_node))
8496 return false; /* Found ellipsis. */
8498 if (arity != max_arity)