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
)))
513 result_type
= composite_pointer_type_r (pointee1
, pointee2
, operation
,
517 if (complain
& tf_error
)
518 composite_pointer_error (DK_PERMERROR
, t1
, t2
, operation
);
520 return error_mark_node
;
521 result_type
= void_type_node
;
523 result_type
= cp_build_qualified_type (result_type
,
524 (cp_type_quals (pointee1
)
525 | cp_type_quals (pointee2
)));
526 /* If the original types were pointers to members, so is the
528 if (TYPE_PTR_TO_MEMBER_P (t1
))
530 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
531 TYPE_PTRMEM_CLASS_TYPE (t2
)))
533 if (complain
& tf_error
)
534 composite_pointer_error (DK_PERMERROR
, t1
, t2
, operation
);
536 return error_mark_node
;
538 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
542 result_type
= build_pointer_type (result_type
);
544 /* Merge the attributes. */
545 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
546 return build_type_attribute_variant (result_type
, attributes
);
549 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
550 ARG1 and ARG2 are the values with those types. The OPERATION is to
551 describe the operation between the pointer types,
552 in case an error occurs.
554 This routine also implements the computation of a common type for
555 pointers-to-members as per [expr.eq]. */
558 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
559 composite_pointer_operation operation
,
560 tsubst_flags_t complain
)
567 If one operand is a null pointer constant, the composite pointer
568 type is the type of the other operand. */
569 if (null_ptr_cst_p (arg1
))
571 if (null_ptr_cst_p (arg2
))
578 If one of the operands has type "pointer to cv1 void*", then
579 the other has type "pointer to cv2T", and the composite pointer
580 type is "pointer to cv12 void", where cv12 is the union of cv1
583 If either type is a pointer to void, make sure it is T1. */
584 if (TREE_CODE (t2
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t2
)))
592 /* Now, if T1 is a pointer to void, merge the qualifiers. */
593 if (TREE_CODE (t1
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t1
)))
598 if (TYPE_PTRFN_P (t2
) && (complain
& tf_error
))
603 pedwarn (input_location
, OPT_pedantic
,
604 "ISO C++ forbids comparison between "
605 "pointer of type %<void *%> and pointer-to-function");
608 pedwarn (input_location
, OPT_pedantic
,
609 "ISO C++ forbids conversion between "
610 "pointer of type %<void *%> and pointer-to-function");
612 case CPO_CONDITIONAL_EXPR
:
613 pedwarn (input_location
, OPT_pedantic
,
614 "ISO C++ forbids conditional expression between "
615 "pointer of type %<void *%> and pointer-to-function");
622 = cp_build_qualified_type (void_type_node
,
623 (cp_type_quals (TREE_TYPE (t1
))
624 | cp_type_quals (TREE_TYPE (t2
))));
625 result_type
= build_pointer_type (result_type
);
626 /* Merge the attributes. */
627 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
628 return build_type_attribute_variant (result_type
, attributes
);
631 if (c_dialect_objc () && TREE_CODE (t1
) == POINTER_TYPE
632 && TREE_CODE (t2
) == POINTER_TYPE
)
634 if (objc_have_common_type (t1
, t2
, -3, NULL_TREE
))
635 return objc_common_type (t1
, t2
);
638 /* [expr.eq] permits the application of a pointer conversion to
639 bring the pointers to a common type. */
640 if (TREE_CODE (t1
) == POINTER_TYPE
&& TREE_CODE (t2
) == POINTER_TYPE
641 && CLASS_TYPE_P (TREE_TYPE (t1
))
642 && CLASS_TYPE_P (TREE_TYPE (t2
))
643 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
646 class1
= TREE_TYPE (t1
);
647 class2
= TREE_TYPE (t2
);
649 if (DERIVED_FROM_P (class1
, class2
))
650 t2
= (build_pointer_type
651 (cp_build_qualified_type (class1
, cp_type_quals (class2
))));
652 else if (DERIVED_FROM_P (class2
, class1
))
653 t1
= (build_pointer_type
654 (cp_build_qualified_type (class2
, cp_type_quals (class1
))));
657 if (complain
& tf_error
)
658 composite_pointer_error (DK_ERROR
, t1
, t2
, operation
);
659 return error_mark_node
;
662 /* [expr.eq] permits the application of a pointer-to-member
663 conversion to change the class type of one of the types. */
664 else if (TYPE_PTR_TO_MEMBER_P (t1
)
665 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
666 TYPE_PTRMEM_CLASS_TYPE (t2
)))
668 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
669 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
671 if (DERIVED_FROM_P (class1
, class2
))
672 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
673 else if (DERIVED_FROM_P (class2
, class1
))
674 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
677 if (complain
& tf_error
)
681 error ("comparison between distinct "
682 "pointer-to-member types %qT and %qT lacks a cast",
686 error ("conversion between distinct "
687 "pointer-to-member types %qT and %qT lacks a cast",
690 case CPO_CONDITIONAL_EXPR
:
691 error ("conditional expression between distinct "
692 "pointer-to-member types %qT and %qT lacks a cast",
698 return error_mark_node
;
702 return composite_pointer_type_r (t1
, t2
, operation
, complain
);
705 /* Return the merged type of two types.
706 We assume that comptypes has already been done and returned 1;
707 if that isn't so, this may crash.
709 This just combines attributes and default arguments; any other
710 differences would cause the two types to compare unalike. */
713 merge_types (tree t1
, tree t2
)
715 enum tree_code code1
;
716 enum tree_code code2
;
719 /* Save time if the two types are the same. */
722 if (original_type (t1
) == original_type (t2
))
725 /* If one type is nonsense, use the other. */
726 if (t1
== error_mark_node
)
728 if (t2
== error_mark_node
)
731 /* Merge the attributes. */
732 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
734 if (TYPE_PTRMEMFUNC_P (t1
))
735 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
736 if (TYPE_PTRMEMFUNC_P (t2
))
737 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
739 code1
= TREE_CODE (t1
);
740 code2
= TREE_CODE (t2
);
743 gcc_assert (code1
== TYPENAME_TYPE
|| code2
== TYPENAME_TYPE
);
744 if (code1
== TYPENAME_TYPE
)
746 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
747 code1
= TREE_CODE (t1
);
751 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
752 code2
= TREE_CODE (t2
);
760 /* For two pointers, do this recursively on the target type. */
762 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
763 int quals
= cp_type_quals (t1
);
765 if (code1
== POINTER_TYPE
)
766 t1
= build_pointer_type (target
);
768 t1
= cp_build_reference_type (target
, TYPE_REF_IS_RVALUE (t1
));
769 t1
= build_type_attribute_variant (t1
, attributes
);
770 t1
= cp_build_qualified_type (t1
, quals
);
772 if (TREE_CODE (target
) == METHOD_TYPE
)
773 t1
= build_ptrmemfunc_type (t1
);
782 quals
= cp_type_quals (t1
);
783 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
784 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
785 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
787 t1
= cp_build_qualified_type (t1
, quals
);
793 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
794 /* Save space: see if the result is identical to one of the args. */
795 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
796 return build_type_attribute_variant (t1
, attributes
);
797 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
798 return build_type_attribute_variant (t2
, attributes
);
799 /* Merge the element types, and have a size if either arg has one. */
800 t1
= build_cplus_array_type
801 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
806 /* Function types: prefer the one that specified arg types.
807 If both do, merge the arg types. Also merge the return types. */
809 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
810 tree p1
= TYPE_ARG_TYPES (t1
);
811 tree p2
= TYPE_ARG_TYPES (t2
);
815 /* Save space: see if the result is identical to one of the args. */
816 if (valtype
== TREE_TYPE (t1
) && ! p2
)
817 return cp_build_type_attribute_variant (t1
, attributes
);
818 if (valtype
== TREE_TYPE (t2
) && ! p1
)
819 return cp_build_type_attribute_variant (t2
, attributes
);
821 /* Simple way if one arg fails to specify argument types. */
822 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
824 else if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
827 parms
= commonparms (p1
, p2
);
829 rval
= build_function_type (valtype
, parms
);
830 gcc_assert (type_memfn_quals (t1
) == type_memfn_quals (t2
));
831 rval
= apply_memfn_quals (rval
, type_memfn_quals (t1
));
832 raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
833 TYPE_RAISES_EXCEPTIONS (t2
),
835 t1
= build_exception_variant (rval
, raises
);
841 /* Get this value the long way, since TYPE_METHOD_BASETYPE
842 is just the main variant of this. */
843 tree basetype
= class_of_this_parm (t2
);
844 tree raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
845 TYPE_RAISES_EXCEPTIONS (t2
),
849 /* If this was a member function type, get back to the
850 original type of type member function (i.e., without
851 the class instance variable up front. */
852 t1
= build_function_type (TREE_TYPE (t1
),
853 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
854 t2
= build_function_type (TREE_TYPE (t2
),
855 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
856 t3
= merge_types (t1
, t2
);
857 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
858 TYPE_ARG_TYPES (t3
));
859 t1
= build_exception_variant (t3
, raises
);
864 /* There is no need to merge attributes into a TYPENAME_TYPE.
865 When the type is instantiated it will have whatever
866 attributes result from the instantiation. */
872 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
874 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
877 return cp_build_type_attribute_variant (t1
, attributes
);
880 /* Return the ARRAY_TYPE type without its domain. */
883 strip_array_domain (tree type
)
886 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
887 if (TYPE_DOMAIN (type
) == NULL_TREE
)
889 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
890 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
893 /* Wrapper around cp_common_type that is used by c-common.c and other
894 front end optimizations that remove promotions.
896 Return the common type for two arithmetic types T1 and T2 under the
897 usual arithmetic conversions. The default conversions have already
898 been applied, and enumerated types converted to their compatible
902 common_type (tree t1
, tree t2
)
904 /* If one type is nonsense, use the other */
905 if (t1
== error_mark_node
)
907 if (t2
== error_mark_node
)
910 return cp_common_type (t1
, t2
);
913 /* Return the common type of two pointer types T1 and T2. This is the
914 type for the result of most arithmetic operations if the operands
915 have the given two types.
917 We assume that comp_target_types has already been done and returned
918 nonzero; if that isn't so, this may crash. */
921 common_pointer_type (tree t1
, tree t2
)
923 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
924 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
925 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
927 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
928 CPO_CONVERSION
, tf_warning_or_error
);
931 /* Compare two exception specifier types for exactness or subsetness, if
932 allowed. Returns false for mismatch, true for match (same, or
935 [except.spec] "If a class X ... objects of class X or any class publicly
936 and unambiguously derived from X. Similarly, if a pointer type Y * ...
937 exceptions of type Y * or that are pointers to any type publicly and
938 unambiguously derived from Y. Otherwise a function only allows exceptions
939 that have the same type ..."
940 This does not mention cv qualifiers and is different to what throw
941 [except.throw] and catch [except.catch] will do. They will ignore the
942 top level cv qualifiers, and allow qualifiers in the pointer to class
945 We implement the letter of the standard. */
948 comp_except_types (tree a
, tree b
, bool exact
)
950 if (same_type_p (a
, b
))
954 if (cp_type_quals (a
) || cp_type_quals (b
))
957 if (TREE_CODE (a
) == POINTER_TYPE
958 && TREE_CODE (b
) == POINTER_TYPE
)
962 if (cp_type_quals (a
) || cp_type_quals (b
))
966 if (TREE_CODE (a
) != RECORD_TYPE
967 || TREE_CODE (b
) != RECORD_TYPE
)
970 if (PUBLICLY_UNIQUELY_DERIVED_P (a
, b
))
976 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
977 If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
978 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
979 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
980 are unordered, but we've already filtered out duplicates. Most lists will
981 be in order, we should try to make use of that. */
984 comp_except_specs (const_tree t1
, const_tree t2
, int exact
)
993 /* First handle noexcept. */
994 if (exact
< ce_exact
)
996 /* noexcept(false) is compatible with no exception-specification,
997 and stricter than any spec. */
998 if (t1
== noexcept_false_spec
)
999 return t2
== NULL_TREE
|| exact
== ce_derived
;
1000 /* Even a derived noexcept(false) is compatible with no
1001 exception-specification. */
1002 if (t2
== noexcept_false_spec
)
1003 return t1
== NULL_TREE
;
1005 /* Otherwise, if we aren't looking for an exact match, noexcept is
1006 equivalent to throw(). */
1007 if (t1
== noexcept_true_spec
)
1008 t1
= empty_except_spec
;
1009 if (t2
== noexcept_true_spec
)
1010 t2
= empty_except_spec
;
1013 /* If any noexcept is left, it is only comparable to itself;
1014 either we're looking for an exact match or we're redeclaring a
1015 template with dependent noexcept. */
1016 if ((t1
&& TREE_PURPOSE (t1
))
1017 || (t2
&& TREE_PURPOSE (t2
)))
1019 && cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)));
1021 if (t1
== NULL_TREE
) /* T1 is ... */
1022 return t2
== NULL_TREE
|| exact
== ce_derived
;
1023 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1024 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1025 if (t2
== NULL_TREE
) /* T2 is ... */
1027 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1028 return exact
== ce_derived
;
1030 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1031 Count how many we find, to determine exactness. For exact matching and
1032 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1034 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1036 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1038 tree a
= TREE_VALUE (probe
);
1039 tree b
= TREE_VALUE (t2
);
1041 if (comp_except_types (a
, b
, exact
))
1043 if (probe
== base
&& exact
> ce_derived
)
1044 base
= TREE_CHAIN (probe
);
1049 if (probe
== NULL_TREE
)
1052 return exact
== ce_derived
|| base
== NULL_TREE
|| length
== list_length (t1
);
1055 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1056 [] can match [size]. */
1059 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1068 /* The type of the array elements must be the same. */
1069 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1072 d1
= TYPE_DOMAIN (t1
);
1073 d2
= TYPE_DOMAIN (t2
);
1078 /* If one of the arrays is dimensionless, and the other has a
1079 dimension, they are of different types. However, it is valid to
1087 declarations for an array object can specify
1088 array types that differ by the presence or absence of a major
1089 array bound (_dcl.array_). */
1091 return allow_redeclaration
;
1093 /* Check that the dimensions are the same. */
1095 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1097 max1
= TYPE_MAX_VALUE (d1
);
1098 max2
= TYPE_MAX_VALUE (d2
);
1099 if (processing_template_decl
&& !abi_version_at_least (2)
1100 && !value_dependent_expression_p (max1
)
1101 && !value_dependent_expression_p (max2
))
1103 /* With abi-1 we do not fold non-dependent array bounds, (and
1104 consequently mangle them incorrectly). We must therefore
1105 fold them here, to verify the domains have the same
1111 if (!cp_tree_equal (max1
, max2
))
1117 /* Compare the relative position of T1 and T2 into their respective
1118 template parameter list.
1119 T1 and T2 must be template parameter types.
1120 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1123 comp_template_parms_position (tree t1
, tree t2
)
1125 tree index1
, index2
;
1126 gcc_assert (t1
&& t2
1127 && TREE_CODE (t1
) == TREE_CODE (t2
)
1128 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1129 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1130 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1132 index1
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t1
));
1133 index2
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t2
));
1135 /* If T1 and T2 belong to template parm lists of different size,
1136 let's assume they are different. */
1137 if (TEMPLATE_PARM_NUM_SIBLINGS (index1
)
1138 != TEMPLATE_PARM_NUM_SIBLINGS (index2
))
1141 /* Then compare their relative position. */
1142 if (TEMPLATE_PARM_IDX (index1
) != TEMPLATE_PARM_IDX (index2
)
1143 || TEMPLATE_PARM_LEVEL (index1
) != TEMPLATE_PARM_LEVEL (index2
)
1144 || (TEMPLATE_PARM_PARAMETER_PACK (index1
)
1145 != TEMPLATE_PARM_PARAMETER_PACK (index2
)))
1151 /* Subroutine in comptypes. */
1154 structural_comptypes (tree t1
, tree t2
, int strict
)
1159 /* Suppress errors caused by previously reported errors. */
1160 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1163 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1165 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1166 current instantiation. */
1167 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1168 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1170 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1171 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1173 if (TYPE_PTRMEMFUNC_P (t1
))
1174 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1175 if (TYPE_PTRMEMFUNC_P (t2
))
1176 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1178 /* Different classes of types can't be compatible. */
1179 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1182 /* Qualifiers must match. For array types, we will check when we
1183 recur on the array element types. */
1184 if (TREE_CODE (t1
) != ARRAY_TYPE
1185 && cp_type_quals (t1
) != cp_type_quals (t2
))
1187 if (TREE_CODE (t1
) == FUNCTION_TYPE
1188 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1190 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1193 /* Allow for two different type nodes which have essentially the same
1194 definition. Note that we already checked for equality of the type
1195 qualifiers (just above). */
1197 if (TREE_CODE (t1
) != ARRAY_TYPE
1198 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1202 /* Compare the types. Break out if they could be the same. */
1203 switch (TREE_CODE (t1
))
1207 /* All void and bool types are the same. */
1211 case FIXED_POINT_TYPE
:
1213 /* With these nodes, we can't determine type equivalence by
1214 looking at what is stored in the nodes themselves, because
1215 two nodes might have different TYPE_MAIN_VARIANTs but still
1216 represent the same type. For example, wchar_t and int could
1217 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1218 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1219 and are distinct types. On the other hand, int and the
1222 typedef int INT __attribute((may_alias));
1224 have identical properties, different TYPE_MAIN_VARIANTs, but
1225 represent the same type. The canonical type system keeps
1226 track of equivalence in this case, so we fall back on it. */
1227 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1229 case TEMPLATE_TEMPLATE_PARM
:
1230 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1231 if (!comp_template_parms_position (t1
, t2
))
1233 if (!comp_template_parms
1234 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1235 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1237 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1239 /* Don't check inheritance. */
1240 strict
= COMPARE_STRICT
;
1245 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1246 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1247 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1248 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1251 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1253 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1259 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1260 strict
& ~COMPARE_REDECLARATION
))
1262 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1266 case REFERENCE_TYPE
:
1267 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1269 /* fall through to checks for pointer types */
1272 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1273 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
)
1274 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1280 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1282 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1287 /* Target types must match incl. qualifiers. */
1288 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1292 case TEMPLATE_TYPE_PARM
:
1293 /* If T1 and T2 don't have the same relative position in their
1294 template parameters set, they can't be equal. */
1295 if (!comp_template_parms_position (t1
, t2
))
1300 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1301 TYPENAME_TYPE_FULLNAME (t2
)))
1303 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1307 case UNBOUND_CLASS_TEMPLATE
:
1308 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1310 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1315 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1320 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1321 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1325 case TYPE_PACK_EXPANSION
:
1326 return same_type_p (PACK_EXPANSION_PATTERN (t1
),
1327 PACK_EXPANSION_PATTERN (t2
));
1330 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1331 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1332 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1333 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1334 || (DECLTYPE_FOR_LAMBDA_RETURN (t1
)
1335 != DECLTYPE_FOR_LAMBDA_RETURN (t2
))
1336 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1337 DECLTYPE_TYPE_EXPR (t2
)))
1341 case UNDERLYING_TYPE
:
1342 return same_type_p (UNDERLYING_TYPE_TYPE (t1
),
1343 UNDERLYING_TYPE_TYPE (t2
));
1349 /* If we get here, we know that from a target independent POV the
1350 types are the same. Make sure the target attributes are also
1352 return comp_type_attributes (t1
, t2
);
1355 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1356 is a bitwise-or of the COMPARE_* flags. */
1359 comptypes (tree t1
, tree t2
, int strict
)
1361 if (strict
== COMPARE_STRICT
)
1366 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1369 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1370 /* At least one of the types requires structural equality, so
1371 perform a deep check. */
1372 return structural_comptypes (t1
, t2
, strict
);
1374 #ifdef ENABLE_CHECKING
1375 if (USE_CANONICAL_TYPES
)
1377 bool result
= structural_comptypes (t1
, t2
, strict
);
1379 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1380 /* The two types are structurally equivalent, but their
1381 canonical types were different. This is a failure of the
1382 canonical type propagation code.*/
1384 ("canonical types differ for identical types %T and %T",
1386 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1387 /* Two types are structurally different, but the canonical
1388 types are the same. This means we were over-eager in
1389 assigning canonical types. */
1391 ("same canonical type node for different types %T and %T",
1397 if (USE_CANONICAL_TYPES
)
1398 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1401 return structural_comptypes (t1
, t2
, strict
);
1403 else if (strict
== COMPARE_STRUCTURAL
)
1404 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1406 return structural_comptypes (t1
, t2
, strict
);
1409 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1410 top-level qualifiers. */
1413 same_type_ignoring_top_level_qualifiers_p (tree type1
, tree type2
)
1415 if (type1
== error_mark_node
|| type2
== error_mark_node
)
1418 return same_type_p (TYPE_MAIN_VARIANT (type1
), TYPE_MAIN_VARIANT (type2
));
1421 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1424 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1426 int q1
= cp_type_quals (type1
);
1427 int q2
= cp_type_quals (type2
);
1429 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1430 return (q1
& q2
) == q2
;
1433 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1434 more cv-qualified that TYPE1, and 0 otherwise. */
1437 comp_cv_qualification (const_tree type1
, const_tree type2
)
1439 int q1
= cp_type_quals (type1
);
1440 int q2
= cp_type_quals (type2
);
1445 if ((q1
& q2
) == q2
)
1447 else if ((q1
& q2
) == q1
)
1453 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1454 subset of the cv-qualification signature of TYPE2, and the types
1455 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1458 comp_cv_qual_signature (tree type1
, tree type2
)
1460 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1462 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1468 /* Subroutines of `comptypes'. */
1470 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1471 equivalent in the sense that functions with those parameter types
1472 can have equivalent types. The two lists must be equivalent,
1473 element by element. */
1476 compparms (const_tree parms1
, const_tree parms2
)
1480 /* An unspecified parmlist matches any specified parmlist
1481 whose argument types don't need default promotions. */
1483 for (t1
= parms1
, t2
= parms2
;
1485 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1487 /* If one parmlist is shorter than the other,
1488 they fail to match. */
1491 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1498 /* Process a sizeof or alignof expression where the operand is a
1502 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1507 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1508 if (type
== error_mark_node
)
1509 return error_mark_node
;
1511 type
= non_reference (type
);
1512 if (TREE_CODE (type
) == METHOD_TYPE
)
1515 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
1516 "invalid application of %qs to a member function",
1517 operator_name_info
[(int) op
].name
);
1518 value
= size_one_node
;
1521 dependent_p
= dependent_type_p (type
);
1523 complete_type (type
);
1525 /* VLA types will have a non-constant size. In the body of an
1526 uninstantiated template, we don't need to try to compute the
1527 value, because the sizeof expression is not an integral
1528 constant expression in that case. And, if we do try to
1529 compute the value, we'll likely end up with SAVE_EXPRs, which
1530 the template substitution machinery does not expect to see. */
1531 || (processing_template_decl
1532 && COMPLETE_TYPE_P (type
)
1533 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1535 value
= build_min (op
, size_type_node
, type
);
1536 TREE_READONLY (value
) = 1;
1540 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1545 /* Return the size of the type, without producing any warnings for
1546 types whose size cannot be taken. This routine should be used only
1547 in some other routine that has already produced a diagnostic about
1548 using the size of such a type. */
1550 cxx_sizeof_nowarn (tree type
)
1552 if (TREE_CODE (type
) == FUNCTION_TYPE
1553 || TREE_CODE (type
) == VOID_TYPE
1554 || TREE_CODE (type
) == ERROR_MARK
)
1555 return size_one_node
;
1556 else if (!COMPLETE_TYPE_P (type
))
1557 return size_zero_node
;
1559 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1562 /* Process a sizeof expression where the operand is an expression. */
1565 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1567 if (e
== error_mark_node
)
1568 return error_mark_node
;
1570 if (processing_template_decl
)
1572 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1573 TREE_SIDE_EFFECTS (e
) = 0;
1574 TREE_READONLY (e
) = 1;
1579 /* To get the size of a static data member declared as an array of
1580 unknown bound, we need to instantiate it. */
1581 if (TREE_CODE (e
) == VAR_DECL
1582 && VAR_HAD_UNKNOWN_BOUND (e
)
1583 && DECL_TEMPLATE_INSTANTIATION (e
))
1584 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1586 e
= mark_type_use (e
);
1588 if (TREE_CODE (e
) == COMPONENT_REF
1589 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1590 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1592 if (complain
& tf_error
)
1593 error ("invalid application of %<sizeof%> to a bit-field");
1595 return error_mark_node
;
1598 else if (is_overloaded_fn (e
))
1600 if (complain
& tf_error
)
1601 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1604 return error_mark_node
;
1607 else if (type_unknown_p (e
))
1609 if (complain
& tf_error
)
1610 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1612 return error_mark_node
;
1618 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1621 /* Implement the __alignof keyword: Return the minimum required
1622 alignment of E, measured in bytes. For VAR_DECL's and
1623 FIELD_DECL's return DECL_ALIGN (which can be set from an
1624 "aligned" __attribute__ specification). */
1627 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1631 if (e
== error_mark_node
)
1632 return error_mark_node
;
1634 if (processing_template_decl
)
1636 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1637 TREE_SIDE_EFFECTS (e
) = 0;
1638 TREE_READONLY (e
) = 1;
1643 e
= mark_type_use (e
);
1645 if (TREE_CODE (e
) == VAR_DECL
)
1646 t
= size_int (DECL_ALIGN_UNIT (e
));
1647 else if (TREE_CODE (e
) == COMPONENT_REF
1648 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1649 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1651 if (complain
& tf_error
)
1652 error ("invalid application of %<__alignof%> to a bit-field");
1654 return error_mark_node
;
1657 else if (TREE_CODE (e
) == COMPONENT_REF
1658 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1659 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1660 else if (is_overloaded_fn (e
))
1662 if (complain
& tf_error
)
1663 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1666 return error_mark_node
;
1667 if (TREE_CODE (e
) == FUNCTION_DECL
)
1668 t
= size_int (DECL_ALIGN_UNIT (e
));
1672 else if (type_unknown_p (e
))
1674 if (complain
& tf_error
)
1675 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1677 return error_mark_node
;
1681 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1682 complain
& tf_error
);
1684 return fold_convert (size_type_node
, t
);
1687 /* Process a sizeof or alignof expression E with code OP where the operand
1688 is an expression. */
1691 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1693 if (op
== SIZEOF_EXPR
)
1694 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1696 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1699 /* EXPR is being used in a context that is not a function call.
1704 The expression can be used only as the left-hand operand of a
1705 member function call.
1707 [expr.mptr.operator]
1709 If the result of .* or ->* is a function, then that result can be
1710 used only as the operand for the function call operator ().
1712 by issuing an error message if appropriate. Returns true iff EXPR
1713 violates these rules. */
1716 invalid_nonstatic_memfn_p (const_tree expr
, tsubst_flags_t complain
)
1718 if (expr
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1720 if (complain
& tf_error
)
1721 error ("invalid use of non-static member function");
1727 /* If EXP is a reference to a bitfield, and the type of EXP does not
1728 match the declared type of the bitfield, return the declared type
1729 of the bitfield. Otherwise, return NULL_TREE. */
1732 is_bitfield_expr_with_lowered_type (const_tree exp
)
1734 switch (TREE_CODE (exp
))
1737 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1738 ? TREE_OPERAND (exp
, 1)
1739 : TREE_OPERAND (exp
, 0)))
1741 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1744 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1748 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1754 field
= TREE_OPERAND (exp
, 1);
1755 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1757 if (same_type_ignoring_top_level_qualifiers_p
1758 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1760 return DECL_BIT_FIELD_TYPE (field
);
1764 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1765 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1766 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1774 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1775 bitfield with a lowered type, the type of EXP is returned, rather
1779 unlowered_expr_type (const_tree exp
)
1782 tree etype
= TREE_TYPE (exp
);
1784 type
= is_bitfield_expr_with_lowered_type (exp
);
1786 type
= cp_build_qualified_type (type
, cp_type_quals (etype
));
1793 /* Perform the conversions in [expr] that apply when an lvalue appears
1794 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1795 function-to-pointer conversions. In addition, manifest constants
1796 are replaced by their values, and bitfield references are converted
1797 to their declared types. Note that this function does not perform the
1798 lvalue-to-rvalue conversion for class types. If you need that conversion
1799 to for class types, then you probably need to use force_rvalue.
1801 Although the returned value is being used as an rvalue, this
1802 function does not wrap the returned expression in a
1803 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1804 that the return value is no longer an lvalue. */
1807 decay_conversion (tree exp
)
1810 enum tree_code code
;
1812 type
= TREE_TYPE (exp
);
1813 if (type
== error_mark_node
)
1814 return error_mark_node
;
1816 exp
= mark_rvalue_use (exp
);
1818 exp
= resolve_nondeduced_context (exp
);
1819 if (type_unknown_p (exp
))
1821 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1822 return error_mark_node
;
1825 /* FIXME remove? at least need to remember that this isn't really a
1826 constant expression if EXP isn't decl_constant_var_p, like with
1827 C_MAYBE_CONST_EXPR. */
1828 exp
= decl_constant_value (exp
);
1829 if (error_operand_p (exp
))
1830 return error_mark_node
;
1832 if (NULLPTR_TYPE_P (type
))
1833 return nullptr_node
;
1835 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1836 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1837 code
= TREE_CODE (type
);
1838 if (code
== VOID_TYPE
)
1840 error ("void value not ignored as it ought to be");
1841 return error_mark_node
;
1843 if (invalid_nonstatic_memfn_p (exp
, tf_warning_or_error
))
1844 return error_mark_node
;
1845 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1846 return cp_build_addr_expr (exp
, tf_warning_or_error
);
1847 if (code
== ARRAY_TYPE
)
1852 if (TREE_CODE (exp
) == INDIRECT_REF
)
1853 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1854 TREE_OPERAND (exp
, 0));
1856 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1858 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1859 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1860 TREE_OPERAND (exp
, 0), op1
);
1864 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1866 error ("invalid use of non-lvalue array");
1867 return error_mark_node
;
1870 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1872 if (TREE_CODE (exp
) == VAR_DECL
)
1874 if (!cxx_mark_addressable (exp
))
1875 return error_mark_node
;
1876 adr
= build_nop (ptrtype
, build_address (exp
));
1879 /* This way is better for a COMPONENT_REF since it can
1880 simplify the offset for a component. */
1881 adr
= cp_build_addr_expr (exp
, tf_warning_or_error
);
1882 return cp_convert (ptrtype
, adr
);
1885 /* If a bitfield is used in a context where integral promotion
1886 applies, then the caller is expected to have used
1887 default_conversion. That function promotes bitfields correctly
1888 before calling this function. At this point, if we have a
1889 bitfield referenced, we may assume that is not subject to
1890 promotion, and that, therefore, the type of the resulting rvalue
1891 is the declared type of the bitfield. */
1892 exp
= convert_bitfield_to_declared_type (exp
);
1894 /* We do not call rvalue() here because we do not want to wrap EXP
1895 in a NON_LVALUE_EXPR. */
1899 Non-class rvalues always have cv-unqualified types. */
1900 type
= TREE_TYPE (exp
);
1901 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
1902 exp
= build_nop (cv_unqualified (type
), exp
);
1907 /* Perform preparatory conversions, as part of the "usual arithmetic
1908 conversions". In particular, as per [expr]:
1910 Whenever an lvalue expression appears as an operand of an
1911 operator that expects the rvalue for that operand, the
1912 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1913 standard conversions are applied to convert the expression to an
1916 In addition, we perform integral promotions here, as those are
1917 applied to both operands to a binary operator before determining
1918 what additional conversions should apply. */
1921 default_conversion (tree exp
)
1923 /* Check for target-specific promotions. */
1924 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
1926 exp
= cp_convert (promoted_type
, exp
);
1927 /* Perform the integral promotions first so that bitfield
1928 expressions (which may promote to "int", even if the bitfield is
1929 declared "unsigned") are promoted correctly. */
1930 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
1931 exp
= perform_integral_promotions (exp
);
1932 /* Perform the other conversions. */
1933 exp
= decay_conversion (exp
);
1938 /* EXPR is an expression with an integral or enumeration type.
1939 Perform the integral promotions in [conv.prom], and return the
1943 perform_integral_promotions (tree expr
)
1948 expr
= mark_rvalue_use (expr
);
1952 If the bitfield has an enumerated type, it is treated as any
1953 other value of that type for promotion purposes. */
1954 type
= is_bitfield_expr_with_lowered_type (expr
);
1955 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
1956 type
= TREE_TYPE (expr
);
1957 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
1958 /* Scoped enums don't promote. */
1959 if (SCOPED_ENUM_P (type
))
1961 promoted_type
= type_promotes_to (type
);
1962 if (type
!= promoted_type
)
1963 expr
= cp_convert (promoted_type
, expr
);
1967 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1968 decay_conversion to one. */
1971 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
1975 if (TREE_CODE (totype
) != POINTER_TYPE
)
1978 t
= TREE_TYPE (totype
);
1979 if (!same_type_p (t
, char_type_node
)
1980 && !same_type_p (t
, char16_type_node
)
1981 && !same_type_p (t
, char32_type_node
)
1982 && !same_type_p (t
, wchar_type_node
))
1985 if (TREE_CODE (exp
) == STRING_CST
)
1987 /* Make sure that we don't try to convert between char and wide chars. */
1988 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
1993 /* Is this a string constant which has decayed to 'const char *'? */
1994 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
1995 if (!same_type_p (TREE_TYPE (exp
), t
))
1998 if (TREE_CODE (exp
) != ADDR_EXPR
1999 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2003 /* This warning is not very useful, as it complains about printf. */
2005 warning (OPT_Wwrite_strings
,
2006 "deprecated conversion from string constant to %qT",
2012 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2013 can, for example, use as an lvalue. This code used to be in
2014 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2015 expressions, where we're dealing with aggregates. But now it's again only
2016 called from unary_complex_lvalue. The case (in particular) that led to
2017 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2021 rationalize_conditional_expr (enum tree_code code
, tree t
,
2022 tsubst_flags_t complain
)
2024 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2025 the first operand is always the one to be used if both operands
2026 are equal, so we know what conditional expression this used to be. */
2027 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2029 tree op0
= TREE_OPERAND (t
, 0);
2030 tree op1
= TREE_OPERAND (t
, 1);
2032 /* The following code is incorrect if either operand side-effects. */
2033 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2034 && !TREE_SIDE_EFFECTS (op1
));
2036 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
2037 ? LE_EXPR
: GE_EXPR
),
2038 op0
, TREE_CODE (op0
),
2039 op1
, TREE_CODE (op1
),
2042 cp_build_unary_op (code
, op0
, 0, complain
),
2043 cp_build_unary_op (code
, op1
, 0, complain
),
2048 build_conditional_expr (TREE_OPERAND (t
, 0),
2049 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2051 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2056 /* Given the TYPE of an anonymous union field inside T, return the
2057 FIELD_DECL for the field. If not found return NULL_TREE. Because
2058 anonymous unions can nest, we must also search all anonymous unions
2059 that are directly reachable. */
2062 lookup_anon_field (tree t
, tree type
)
2066 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2068 if (TREE_STATIC (field
))
2070 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2073 /* If we find it directly, return the field. */
2074 if (DECL_NAME (field
) == NULL_TREE
2075 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2080 /* Otherwise, it could be nested, search harder. */
2081 if (DECL_NAME (field
) == NULL_TREE
2082 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2084 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2092 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2093 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2094 non-NULL, it indicates the path to the base used to name MEMBER.
2095 If PRESERVE_REFERENCE is true, the expression returned will have
2096 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2097 returned will have the type referred to by the reference.
2099 This function does not perform access control; that is either done
2100 earlier by the parser when the name of MEMBER is resolved to MEMBER
2101 itself, or later when overload resolution selects one of the
2102 functions indicated by MEMBER. */
2105 build_class_member_access_expr (tree object
, tree member
,
2106 tree access_path
, bool preserve_reference
,
2107 tsubst_flags_t complain
)
2111 tree result
= NULL_TREE
;
2113 if (error_operand_p (object
) || error_operand_p (member
))
2114 return error_mark_node
;
2116 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2120 The type of the first expression shall be "class object" (of a
2122 object_type
= TREE_TYPE (object
);
2123 if (!currently_open_class (object_type
)
2124 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2125 return error_mark_node
;
2126 if (!CLASS_TYPE_P (object_type
))
2128 if (complain
& tf_error
)
2129 error ("request for member %qD in %qE, which is of non-class type %qT",
2130 member
, object
, object_type
);
2131 return error_mark_node
;
2134 /* The standard does not seem to actually say that MEMBER must be a
2135 member of OBJECT_TYPE. However, that is clearly what is
2137 if (DECL_P (member
))
2139 member_scope
= DECL_CLASS_CONTEXT (member
);
2141 if (TREE_DEPRECATED (member
))
2142 warn_deprecated_use (member
, NULL_TREE
);
2145 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2146 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2147 presently be the anonymous union. Go outwards until we find a
2148 type related to OBJECT_TYPE. */
2149 while (ANON_AGGR_TYPE_P (member_scope
)
2150 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2152 member_scope
= TYPE_CONTEXT (member_scope
);
2153 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2155 if (complain
& tf_error
)
2157 if (TREE_CODE (member
) == FIELD_DECL
)
2158 error ("invalid use of nonstatic data member %qE", member
);
2160 error ("%qD is not a member of %qT", member
, object_type
);
2162 return error_mark_node
;
2165 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2166 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2167 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2169 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2171 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2174 /* In [expr.ref], there is an explicit list of the valid choices for
2175 MEMBER. We check for each of those cases here. */
2176 if (TREE_CODE (member
) == VAR_DECL
)
2178 /* A static data member. */
2180 mark_exp_read (object
);
2181 /* If OBJECT has side-effects, they are supposed to occur. */
2182 if (TREE_SIDE_EFFECTS (object
))
2183 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2185 else if (TREE_CODE (member
) == FIELD_DECL
)
2187 /* A non-static data member. */
2192 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
2193 && integer_zerop (TREE_OPERAND (object
, 0)));
2195 /* Convert OBJECT to the type of MEMBER. */
2196 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2197 TYPE_MAIN_VARIANT (member_scope
)))
2202 binfo
= lookup_base (access_path
? access_path
: object_type
,
2203 member_scope
, ba_unique
, &kind
);
2204 if (binfo
== error_mark_node
)
2205 return error_mark_node
;
2207 /* It is invalid to try to get to a virtual base of a
2208 NULL object. The most common cause is invalid use of
2210 if (null_object_p
&& kind
== bk_via_virtual
)
2212 if (complain
& tf_error
)
2214 error ("invalid access to non-static data member %qD of "
2217 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2219 return error_mark_node
;
2222 /* Convert to the base. */
2223 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2225 /* If we found the base successfully then we should be able
2226 to convert to it successfully. */
2227 gcc_assert (object
!= error_mark_node
);
2230 /* Complain about other invalid uses of offsetof, even though they will
2231 give the right answer. Note that we complain whether or not they
2232 actually used the offsetof macro, since there's no way to know at this
2233 point. So we just give a warning, instead of a pedwarn. */
2234 /* Do not produce this warning for base class field references, because
2235 we know for a fact that didn't come from offsetof. This does occur
2236 in various testsuite cases where a null object is passed where a
2237 vtable access is required. */
2238 if (null_object_p
&& warn_invalid_offsetof
2239 && CLASSTYPE_NON_STD_LAYOUT (object_type
)
2240 && !DECL_FIELD_IS_BASE (member
)
2241 && cp_unevaluated_operand
== 0
2242 && (complain
& tf_warning
))
2244 warning (OPT_Winvalid_offsetof
,
2245 "invalid access to non-static data member %qD "
2246 " of NULL object", member
);
2247 warning (OPT_Winvalid_offsetof
,
2248 "(perhaps the %<offsetof%> macro was used incorrectly)");
2251 /* If MEMBER is from an anonymous aggregate, we have converted
2252 OBJECT so that it refers to the class containing the
2253 anonymous union. Generate a reference to the anonymous union
2254 itself, and recur to find MEMBER. */
2255 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2256 /* When this code is called from build_field_call, the
2257 object already has the type of the anonymous union.
2258 That is because the COMPONENT_REF was already
2259 constructed, and was then disassembled before calling
2260 build_field_call. After the function-call code is
2261 cleaned up, this waste can be eliminated. */
2262 && (!same_type_ignoring_top_level_qualifiers_p
2263 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2265 tree anonymous_union
;
2267 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2268 DECL_CONTEXT (member
));
2269 object
= build_class_member_access_expr (object
,
2271 /*access_path=*/NULL_TREE
,
2276 /* Compute the type of the field, as described in [expr.ref]. */
2277 type_quals
= TYPE_UNQUALIFIED
;
2278 member_type
= TREE_TYPE (member
);
2279 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2281 type_quals
= (cp_type_quals (member_type
)
2282 | cp_type_quals (object_type
));
2284 /* A field is const (volatile) if the enclosing object, or the
2285 field itself, is const (volatile). But, a mutable field is
2286 not const, even within a const object. */
2287 if (DECL_MUTABLE_P (member
))
2288 type_quals
&= ~TYPE_QUAL_CONST
;
2289 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2292 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
2294 result
= fold_if_not_in_template (result
);
2296 /* Mark the expression const or volatile, as appropriate. Even
2297 though we've dealt with the type above, we still have to mark the
2298 expression itself. */
2299 if (type_quals
& TYPE_QUAL_CONST
)
2300 TREE_READONLY (result
) = 1;
2301 if (type_quals
& TYPE_QUAL_VOLATILE
)
2302 TREE_THIS_VOLATILE (result
) = 1;
2304 else if (BASELINK_P (member
))
2306 /* The member is a (possibly overloaded) member function. */
2310 /* If the MEMBER is exactly one static member function, then we
2311 know the type of the expression. Otherwise, we must wait
2312 until overload resolution has been performed. */
2313 functions
= BASELINK_FUNCTIONS (member
);
2314 if (TREE_CODE (functions
) == FUNCTION_DECL
2315 && DECL_STATIC_FUNCTION_P (functions
))
2316 type
= TREE_TYPE (functions
);
2318 type
= unknown_type_node
;
2319 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2320 base. That will happen when the function is called. */
2321 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2323 else if (TREE_CODE (member
) == CONST_DECL
)
2325 /* The member is an enumerator. */
2327 /* If OBJECT has side-effects, they are supposed to occur. */
2328 if (TREE_SIDE_EFFECTS (object
))
2329 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2334 if (complain
& tf_error
)
2335 error ("invalid use of %qD", member
);
2336 return error_mark_node
;
2339 if (!preserve_reference
)
2342 If E2 is declared to have type "reference to T", then ... the
2343 type of E1.E2 is T. */
2344 result
= convert_from_reference (result
);
2349 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2350 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2353 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2355 tree object_type
= TREE_TYPE (object
);
2356 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2359 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2361 error ("qualified type %qT does not match destructor name ~%qT",
2363 return error_mark_node
;
2365 if (TREE_CODE (dtor_type
) == IDENTIFIER_NODE
)
2367 /* In a template, names we can't find a match for are still accepted
2368 destructor names, and we check them here. */
2369 if (check_dtor_name (object_type
, dtor_type
))
2370 dtor_type
= object_type
;
2373 error ("object type %qT does not match destructor name ~%qT",
2374 object_type
, dtor_type
);
2375 return error_mark_node
;
2379 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2381 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2382 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2383 return error_mark_node
;
2385 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2386 /*protect=*/1, /*want_type=*/false);
2387 expr
= (adjust_result_of_qualified_name_lookup
2388 (expr
, dtor_type
, object_type
));
2392 /* An expression of the form "A::template B" has been resolved to
2393 DECL. Issue a diagnostic if B is not a template or template
2397 check_template_keyword (tree decl
)
2399 /* The standard says:
2403 If a name prefixed by the keyword template is not a member
2404 template, the program is ill-formed.
2406 DR 228 removed the restriction that the template be a member
2409 DR 96, if accepted would add the further restriction that explicit
2410 template arguments must be provided if the template keyword is
2411 used, but, as of 2005-10-16, that DR is still in "drafting". If
2412 this DR is accepted, then the semantic checks here can be
2413 simplified, as the entity named must in fact be a template
2414 specialization, rather than, as at present, a set of overloaded
2415 functions containing at least one template function. */
2416 if (TREE_CODE (decl
) != TEMPLATE_DECL
2417 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2419 if (!is_overloaded_fn (decl
))
2420 permerror (input_location
, "%qD is not a template", decl
);
2425 if (BASELINK_P (fns
))
2426 fns
= BASELINK_FUNCTIONS (fns
);
2429 tree fn
= OVL_CURRENT (fns
);
2430 if (TREE_CODE (fn
) == TEMPLATE_DECL
2431 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2433 if (TREE_CODE (fn
) == FUNCTION_DECL
2434 && DECL_USE_TEMPLATE (fn
)
2435 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2437 fns
= OVL_NEXT (fns
);
2440 permerror (input_location
, "%qD is not a template", decl
);
2445 /* This function is called by the parser to process a class member
2446 access expression of the form OBJECT.NAME. NAME is a node used by
2447 the parser to represent a name; it is not yet a DECL. It may,
2448 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2449 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2450 there is no reason to do the lookup twice, so the parser keeps the
2451 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2452 be a template via the use of the "A::template B" syntax. */
2455 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2456 tsubst_flags_t complain
)
2461 tree access_path
= NULL_TREE
;
2462 tree orig_object
= object
;
2463 tree orig_name
= name
;
2465 if (object
== error_mark_node
|| name
== error_mark_node
)
2466 return error_mark_node
;
2468 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2469 if (!objc_is_public (object
, name
))
2470 return error_mark_node
;
2472 object_type
= TREE_TYPE (object
);
2474 if (processing_template_decl
)
2476 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2477 dependent_type_p (object_type
)
2478 /* If NAME is just an IDENTIFIER_NODE, then the expression
2480 || TREE_CODE (object
) == IDENTIFIER_NODE
2481 /* If NAME is "f<args>", where either 'f' or 'args' is
2482 dependent, then the expression is dependent. */
2483 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2484 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2485 TREE_OPERAND (name
, 1)))
2486 /* If NAME is "T::X" where "T" is dependent, then the
2487 expression is dependent. */
2488 || (TREE_CODE (name
) == SCOPE_REF
2489 && TYPE_P (TREE_OPERAND (name
, 0))
2490 && dependent_type_p (TREE_OPERAND (name
, 0))))
2491 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2492 object
= build_non_dependent_expr (object
);
2494 else if (c_dialect_objc ()
2495 && TREE_CODE (name
) == IDENTIFIER_NODE
2496 && (expr
= objc_maybe_build_component_ref (object
, name
)))
2501 The type of the first expression shall be "class object" (of a
2503 if (!currently_open_class (object_type
)
2504 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2505 return error_mark_node
;
2506 if (!CLASS_TYPE_P (object_type
))
2508 if (complain
& tf_error
)
2509 error ("request for member %qD in %qE, which is of non-class type %qT",
2510 name
, object
, object_type
);
2511 return error_mark_node
;
2514 if (BASELINK_P (name
))
2515 /* A member function that has already been looked up. */
2519 bool is_template_id
= false;
2520 tree template_args
= NULL_TREE
;
2523 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2525 is_template_id
= true;
2526 template_args
= TREE_OPERAND (name
, 1);
2527 name
= TREE_OPERAND (name
, 0);
2529 if (TREE_CODE (name
) == OVERLOAD
)
2530 name
= DECL_NAME (get_first_fn (name
));
2531 else if (DECL_P (name
))
2532 name
= DECL_NAME (name
);
2535 if (TREE_CODE (name
) == SCOPE_REF
)
2537 /* A qualified name. The qualifying class or namespace `S'
2538 has already been looked up; it is either a TYPE or a
2540 scope
= TREE_OPERAND (name
, 0);
2541 name
= TREE_OPERAND (name
, 1);
2543 /* If SCOPE is a namespace, then the qualified name does not
2544 name a member of OBJECT_TYPE. */
2545 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2547 if (complain
& tf_error
)
2548 error ("%<%D::%D%> is not a member of %qT",
2549 scope
, name
, object_type
);
2550 return error_mark_node
;
2553 gcc_assert (CLASS_TYPE_P (scope
));
2554 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2555 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2557 if (constructor_name_p (name
, scope
))
2559 if (complain
& tf_error
)
2560 error ("cannot call constructor %<%T::%D%> directly",
2562 return error_mark_node
;
2565 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2566 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2567 if (access_path
== error_mark_node
)
2568 return error_mark_node
;
2571 if (complain
& tf_error
)
2572 error ("%qT is not a base of %qT", scope
, object_type
);
2573 return error_mark_node
;
2579 access_path
= object_type
;
2582 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2583 member
= lookup_destructor (object
, scope
, name
);
2586 /* Look up the member. */
2587 member
= lookup_member (access_path
, name
, /*protect=*/1,
2588 /*want_type=*/false);
2589 if (member
== NULL_TREE
)
2591 if (complain
& tf_error
)
2592 error ("%qD has no member named %qE", object_type
, name
);
2593 return error_mark_node
;
2595 if (member
== error_mark_node
)
2596 return error_mark_node
;
2601 tree templ
= member
;
2603 if (BASELINK_P (templ
))
2604 templ
= lookup_template_function (templ
, template_args
);
2607 if (complain
& tf_error
)
2608 error ("%qD is not a member template function", name
);
2609 return error_mark_node
;
2614 if (TREE_DEPRECATED (member
))
2615 warn_deprecated_use (member
, NULL_TREE
);
2618 check_template_keyword (member
);
2620 expr
= build_class_member_access_expr (object
, member
, access_path
,
2621 /*preserve_reference=*/false,
2623 if (processing_template_decl
&& expr
!= error_mark_node
)
2625 if (BASELINK_P (member
))
2627 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2628 BASELINK_QUALIFIED_P (member
) = 1;
2631 return build_min_non_dep (COMPONENT_REF
, expr
,
2632 orig_object
, orig_name
,
2639 /* Return an expression for the MEMBER_NAME field in the internal
2640 representation of PTRMEM, a pointer-to-member function. (Each
2641 pointer-to-member function type gets its own RECORD_TYPE so it is
2642 more convenient to access the fields by name than by FIELD_DECL.)
2643 This routine converts the NAME to a FIELD_DECL and then creates the
2644 node for the complete expression. */
2647 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2653 /* This code is a stripped down version of
2654 build_class_member_access_expr. It does not work to use that
2655 routine directly because it expects the object to be of class
2657 ptrmem_type
= TREE_TYPE (ptrmem
);
2658 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2659 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2660 /*want_type=*/false);
2661 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2662 cp_type_quals (ptrmem_type
));
2663 return fold_build3_loc (input_location
,
2664 COMPONENT_REF
, member_type
,
2665 ptrmem
, member
, NULL_TREE
);
2668 /* Given an expression PTR for a pointer, return an expression
2669 for the value pointed to.
2670 ERRORSTRING is the name of the operator to appear in error messages.
2672 This function may need to overload OPERATOR_FNNAME.
2673 Must also handle REFERENCE_TYPEs for C++. */
2676 build_x_indirect_ref (tree expr
, ref_operator errorstring
,
2677 tsubst_flags_t complain
)
2679 tree orig_expr
= expr
;
2682 if (processing_template_decl
)
2684 /* Retain the type if we know the operand is a pointer so that
2685 describable_type doesn't make auto deduction break. */
2686 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2687 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2688 if (type_dependent_expression_p (expr
))
2689 return build_min_nt (INDIRECT_REF
, expr
);
2690 expr
= build_non_dependent_expr (expr
);
2693 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2694 NULL_TREE
, /*overload=*/NULL
, complain
);
2696 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2698 if (processing_template_decl
&& rval
!= error_mark_node
)
2699 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2704 /* Helper function called from c-common. */
2706 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2707 tree ptr
, ref_operator errorstring
)
2709 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2713 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2714 tsubst_flags_t complain
)
2718 if (ptr
== error_mark_node
)
2719 return error_mark_node
;
2721 if (ptr
== current_class_ptr
)
2722 return current_class_ref
;
2724 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2725 ? ptr
: decay_conversion (ptr
));
2726 type
= TREE_TYPE (pointer
);
2728 if (POINTER_TYPE_P (type
))
2732 If the type of the expression is "pointer to T," the type
2733 of the result is "T." */
2734 tree t
= TREE_TYPE (type
);
2736 if (CONVERT_EXPR_P (ptr
)
2737 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2739 /* If a warning is issued, mark it to avoid duplicates from
2740 the backend. This only needs to be done at
2741 warn_strict_aliasing > 2. */
2742 if (warn_strict_aliasing
> 2)
2743 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2744 type
, TREE_OPERAND (ptr
, 0)))
2745 TREE_NO_WARNING (ptr
) = 1;
2748 if (VOID_TYPE_P (t
))
2750 /* A pointer to incomplete type (other than cv void) can be
2751 dereferenced [expr.unary.op]/1 */
2752 if (complain
& tf_error
)
2753 error ("%qT is not a pointer-to-object type", type
);
2754 return error_mark_node
;
2756 else if (TREE_CODE (pointer
) == ADDR_EXPR
2757 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2758 /* The POINTER was something like `&x'. We simplify `*&x' to
2760 return TREE_OPERAND (pointer
, 0);
2763 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2765 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2766 so that we get the proper error message if the result is used
2767 to assign to. Also, &* is supposed to be a no-op. */
2768 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2769 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2770 TREE_SIDE_EFFECTS (ref
)
2771 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2775 else if (!(complain
& tf_error
))
2776 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2778 /* `pointer' won't be an error_mark_node if we were given a
2779 pointer to member, so it's cool to check for this here. */
2780 else if (TYPE_PTR_TO_MEMBER_P (type
))
2781 switch (errorstring
)
2783 case RO_ARRAY_INDEXING
:
2784 error ("invalid use of array indexing on pointer to member");
2787 error ("invalid use of unary %<*%> on pointer to member");
2789 case RO_IMPLICIT_CONVERSION
:
2790 error ("invalid use of implicit conversion on pointer to member");
2795 else if (pointer
!= error_mark_node
)
2796 invalid_indirection_error (input_location
, type
, errorstring
);
2798 return error_mark_node
;
2801 /* This handles expressions of the form "a[i]", which denotes
2804 This is logically equivalent in C to *(a+i), but we may do it differently.
2805 If A is a variable or a member, we generate a primitive ARRAY_REF.
2806 This avoids forcing the array out of registers, and can work on
2807 arrays that are not lvalues (for example, members of structures returned
2810 If INDEX is of some user-defined type, it must be converted to
2811 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2812 will inherit the type of the array, which will be some pointer type.
2814 LOC is the location to use in building the array reference. */
2817 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
2818 tsubst_flags_t complain
)
2824 if (complain
& tf_error
)
2825 error_at (loc
, "subscript missing in array reference");
2826 return error_mark_node
;
2829 if (TREE_TYPE (array
) == error_mark_node
2830 || TREE_TYPE (idx
) == error_mark_node
)
2831 return error_mark_node
;
2833 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2835 switch (TREE_CODE (array
))
2839 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2841 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2842 TREE_OPERAND (array
, 0), value
);
2843 SET_EXPR_LOCATION (ret
, loc
);
2848 ret
= build_conditional_expr
2849 (TREE_OPERAND (array
, 0),
2850 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2852 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
2854 tf_warning_or_error
);
2855 protected_set_expr_location (ret
, loc
);
2862 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2866 warn_array_subscript_with_type_char (idx
);
2868 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2870 if (complain
& tf_error
)
2871 error_at (loc
, "array subscript is not an integer");
2872 return error_mark_node
;
2875 /* Apply integral promotions *after* noticing character types.
2876 (It is unclear why we do these promotions -- the standard
2877 does not say that we should. In fact, the natural thing would
2878 seem to be to convert IDX to ptrdiff_t; we're performing
2879 pointer arithmetic.) */
2880 idx
= perform_integral_promotions (idx
);
2882 /* An array that is indexed by a non-constant
2883 cannot be stored in a register; we must be able to do
2884 address arithmetic on its address.
2885 Likewise an array of elements of variable size. */
2886 if (TREE_CODE (idx
) != INTEGER_CST
2887 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2888 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2891 if (!cxx_mark_addressable (array
))
2892 return error_mark_node
;
2895 /* An array that is indexed by a constant value which is not within
2896 the array bounds cannot be stored in a register either; because we
2897 would get a crash in store_bit_field/extract_bit_field when trying
2898 to access a non-existent part of the register. */
2899 if (TREE_CODE (idx
) == INTEGER_CST
2900 && TYPE_DOMAIN (TREE_TYPE (array
))
2901 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
2903 if (!cxx_mark_addressable (array
))
2904 return error_mark_node
;
2907 if (!lvalue_p (array
) && (complain
& tf_error
))
2908 pedwarn (loc
, OPT_pedantic
,
2909 "ISO C++ forbids subscripting non-lvalue array");
2911 /* Note in C++ it is valid to subscript a `register' array, since
2912 it is valid to take the address of something with that
2913 storage specification. */
2917 while (TREE_CODE (foo
) == COMPONENT_REF
)
2918 foo
= TREE_OPERAND (foo
, 0);
2919 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
)
2920 && (complain
& tf_warning
))
2921 warning_at (loc
, OPT_Wextra
,
2922 "subscripting array declared %<register%>");
2925 type
= TREE_TYPE (TREE_TYPE (array
));
2926 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
2927 /* Array ref is const/volatile if the array elements are
2928 or if the array is.. */
2929 TREE_READONLY (rval
)
2930 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
2931 TREE_SIDE_EFFECTS (rval
)
2932 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
2933 TREE_THIS_VOLATILE (rval
)
2934 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
2935 ret
= require_complete_type_sfinae (fold_if_not_in_template (rval
),
2937 protected_set_expr_location (ret
, loc
);
2942 tree ar
= default_conversion (array
);
2943 tree ind
= default_conversion (idx
);
2945 /* Put the integer in IND to simplify error checking. */
2946 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
2953 if (ar
== error_mark_node
)
2956 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
2958 if (complain
& tf_error
)
2959 error_at (loc
, "subscripted value is neither array nor pointer");
2960 return error_mark_node
;
2962 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
2964 if (complain
& tf_error
)
2965 error_at (loc
, "array subscript is not an integer");
2966 return error_mark_node
;
2969 warn_array_subscript_with_type_char (idx
);
2971 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
2976 protected_set_expr_location (ret
, loc
);
2981 /* Entry point for Obj-C++. */
2984 build_array_ref (location_t loc
, tree array
, tree idx
)
2986 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
2989 /* Resolve a pointer to member function. INSTANCE is the object
2990 instance to use, if the member points to a virtual member.
2992 This used to avoid checking for virtual functions if basetype
2993 has no virtual functions, according to an earlier ANSI draft.
2994 With the final ISO C++ rules, such an optimization is
2995 incorrect: A pointer to a derived member can be static_cast
2996 to pointer-to-base-member, as long as the dynamic object
2997 later has the right member. */
3000 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
3002 if (TREE_CODE (function
) == OFFSET_REF
)
3003 function
= TREE_OPERAND (function
, 1);
3005 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3007 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
3008 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3010 tree instance_ptr
= *instance_ptrptr
;
3011 tree instance_save_expr
= 0;
3012 if (instance_ptr
== error_mark_node
)
3014 if (TREE_CODE (function
) == PTRMEM_CST
)
3016 /* Extracting the function address from a pmf is only
3017 allowed with -Wno-pmf-conversions. It only works for
3019 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
3020 e1
= convert (fntype
, e1
);
3025 error ("object missing in use of %qE", function
);
3026 return error_mark_node
;
3030 if (TREE_SIDE_EFFECTS (instance_ptr
))
3031 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3033 if (TREE_SIDE_EFFECTS (function
))
3034 function
= save_expr (function
);
3036 /* Start by extracting all the information from the PMF itself. */
3037 e3
= pfn_from_ptrmemfunc (function
);
3038 delta
= delta_from_ptrmemfunc (function
);
3039 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3040 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3042 case ptrmemfunc_vbit_in_pfn
:
3043 e1
= cp_build_binary_op (input_location
,
3044 BIT_AND_EXPR
, idx
, integer_one_node
,
3045 tf_warning_or_error
);
3046 idx
= cp_build_binary_op (input_location
,
3047 MINUS_EXPR
, idx
, integer_one_node
,
3048 tf_warning_or_error
);
3051 case ptrmemfunc_vbit_in_delta
:
3052 e1
= cp_build_binary_op (input_location
,
3053 BIT_AND_EXPR
, delta
, integer_one_node
,
3054 tf_warning_or_error
);
3055 delta
= cp_build_binary_op (input_location
,
3056 RSHIFT_EXPR
, delta
, integer_one_node
,
3057 tf_warning_or_error
);
3064 /* Convert down to the right base before using the instance. A
3065 special case is that in a pointer to member of class C, C may
3066 be incomplete. In that case, the function will of course be
3067 a member of C, and no conversion is required. In fact,
3068 lookup_base will fail in that case, because incomplete
3069 classes do not have BINFOs. */
3070 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3071 if (!same_type_ignoring_top_level_qualifiers_p
3072 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3074 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3075 basetype
, ba_check
, NULL
);
3076 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3078 if (instance_ptr
== error_mark_node
)
3079 return error_mark_node
;
3081 /* ...and then the delta in the PMF. */
3082 instance_ptr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (instance_ptr
),
3083 instance_ptr
, fold_convert (sizetype
, delta
));
3085 /* Hand back the adjusted 'this' argument to our caller. */
3086 *instance_ptrptr
= instance_ptr
;
3088 /* Next extract the vtable pointer from the object. */
3089 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3091 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, tf_warning_or_error
);
3092 /* If the object is not dynamic the access invokes undefined
3093 behavior. As it is not executed in this case silence the
3094 spurious warnings it may provoke. */
3095 TREE_NO_WARNING (vtbl
) = 1;
3097 /* Finally, extract the function pointer from the vtable. */
3098 e2
= fold_build2_loc (input_location
,
3099 POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
,
3100 fold_convert (sizetype
, idx
));
3101 e2
= cp_build_indirect_ref (e2
, RO_NULL
, tf_warning_or_error
);
3102 TREE_CONSTANT (e2
) = 1;
3104 /* When using function descriptors, the address of the
3105 vtable entry is treated as a function pointer. */
3106 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3107 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3108 cp_build_addr_expr (e2
, tf_warning_or_error
));
3110 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3111 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
3113 /* Make sure this doesn't get evaluated first inside one of the
3114 branches of the COND_EXPR. */
3115 if (instance_save_expr
)
3116 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3117 instance_save_expr
, e1
);
3124 /* Used by the C-common bits. */
3126 build_function_call (location_t loc ATTRIBUTE_UNUSED
,
3127 tree function
, tree params
)
3129 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3132 /* Used by the C-common bits. */
3134 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED
,
3135 tree function
, VEC(tree
,gc
) *params
,
3136 VEC(tree
,gc
) *origtypes ATTRIBUTE_UNUSED
)
3138 VEC(tree
,gc
) *orig_params
= params
;
3139 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3140 tf_warning_or_error
);
3142 /* cp_build_function_call_vec can reallocate PARAMS by adding
3143 default arguments. That should never happen here. Verify
3145 gcc_assert (params
== orig_params
);
3150 /* Build a function call using a tree list of arguments. */
3153 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3158 vec
= make_tree_vector ();
3159 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3160 VEC_safe_push (tree
, gc
, vec
, TREE_VALUE (params
));
3161 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3162 release_tree_vector (vec
);
3166 /* Build a function call using varargs. */
3169 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3175 vec
= make_tree_vector ();
3176 va_start (args
, complain
);
3177 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3178 VEC_safe_push (tree
, gc
, vec
, t
);
3180 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3181 release_tree_vector (vec
);
3185 /* Build a function call using a vector of arguments. PARAMS may be
3186 NULL if there are no parameters. This changes the contents of
3190 cp_build_function_call_vec (tree function
, VEC(tree
,gc
) **params
,
3191 tsubst_flags_t complain
)
3193 tree fntype
, fndecl
;
3195 tree original
= function
;
3199 VEC(tree
,gc
) *allocated
= NULL
;
3202 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3203 expressions, like those used for ObjC messenger dispatches. */
3204 if (params
!= NULL
&& !VEC_empty (tree
, *params
))
3205 function
= objc_rewrite_function_call (function
,
3206 VEC_index (tree
, *params
, 0));
3208 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3209 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3210 if (TREE_CODE (function
) == NOP_EXPR
3211 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3212 function
= TREE_OPERAND (function
, 0);
3214 if (TREE_CODE (function
) == FUNCTION_DECL
)
3216 mark_used (function
);
3219 /* Convert anything with function type to a pointer-to-function. */
3220 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
3221 pedwarn (input_location
, OPT_pedantic
,
3222 "ISO C++ forbids calling %<::main%> from within program");
3224 function
= build_addr_func (function
);
3230 function
= build_addr_func (function
);
3233 if (function
== error_mark_node
)
3234 return error_mark_node
;
3236 fntype
= TREE_TYPE (function
);
3238 if (TYPE_PTRMEMFUNC_P (fntype
))
3240 if (complain
& tf_error
)
3241 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3242 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3243 original
, original
);
3244 return error_mark_node
;
3247 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
3248 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3250 if (!((TREE_CODE (fntype
) == POINTER_TYPE
3251 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
3253 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3255 if (complain
& tf_error
)
3256 error ("%qE cannot be used as a function", original
);
3257 return error_mark_node
;
3260 /* fntype now gets the type of function pointed to. */
3261 fntype
= TREE_TYPE (fntype
);
3262 parm_types
= TYPE_ARG_TYPES (fntype
);
3266 allocated
= make_tree_vector ();
3267 params
= &allocated
;
3270 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3273 return error_mark_node
;
3275 argarray
= VEC_address (tree
, *params
);
3277 /* Check for errors in format strings and inappropriately
3279 check_function_arguments (fntype
, nargs
, argarray
);
3281 ret
= build_cxx_call (function
, nargs
, argarray
);
3283 if (allocated
!= NULL
)
3284 release_tree_vector (allocated
);
3289 /* Subroutine of convert_arguments.
3290 Warn about wrong number of args are genereted. */
3293 warn_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3297 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3299 if (DECL_NAME (fndecl
) == NULL_TREE
3300 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3303 ? G_("too many arguments to constructor %q#D")
3304 : G_("too few arguments to constructor %q#D"),
3309 ? G_("too many arguments to member function %q#D")
3310 : G_("too few arguments to member function %q#D"),
3316 ? G_("too many arguments to function %q#D")
3317 : G_("too few arguments to function %q#D"),
3319 inform (DECL_SOURCE_LOCATION (fndecl
),
3324 if (c_dialect_objc () && objc_message_selector ())
3327 ? G_("too many arguments to method %q#D")
3328 : G_("too few arguments to method %q#D"),
3329 objc_message_selector ());
3331 error_at (loc
, too_many_p
? G_("too many arguments to function")
3332 : G_("too few arguments to function"));
3336 /* Convert the actual parameter expressions in the list VALUES to the
3337 types in the list TYPELIST. The converted expressions are stored
3338 back in the VALUES vector.
3339 If parmdecls is exhausted, or when an element has NULL as its type,
3340 perform the default conversions.
3342 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3344 This is also where warnings about wrong number of args are generated.
3346 Returns the actual number of arguments processed (which might be less
3347 than the length of the vector), or -1 on error.
3349 In C++, unspecified trailing parameters can be filled in with their
3350 default arguments, if such were specified. Do so here. */
3353 convert_arguments (tree typelist
, VEC(tree
,gc
) **values
, tree fndecl
,
3354 int flags
, tsubst_flags_t complain
)
3359 /* Argument passing is always copy-initialization. */
3360 flags
|= LOOKUP_ONLYCONVERTING
;
3362 for (i
= 0, typetail
= typelist
;
3363 i
< VEC_length (tree
, *values
);
3366 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3367 tree val
= VEC_index (tree
, *values
, i
);
3369 if (val
== error_mark_node
|| type
== error_mark_node
)
3372 if (type
== void_type_node
)
3374 if (complain
& tf_error
)
3376 warn_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3383 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3384 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3385 if (TREE_CODE (val
) == NOP_EXPR
3386 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3387 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3388 val
= TREE_OPERAND (val
, 0);
3390 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3392 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3393 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3394 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3395 val
= decay_conversion (val
);
3398 if (val
== error_mark_node
)
3403 /* Formal parm type is specified by a function prototype. */
3406 if (!COMPLETE_TYPE_P (complete_type (type
)))
3408 if (complain
& tf_error
)
3411 error ("parameter %P of %qD has incomplete type %qT",
3414 error ("parameter %P has incomplete type %qT", i
, type
);
3416 parmval
= error_mark_node
;
3420 parmval
= convert_for_initialization
3421 (NULL_TREE
, type
, val
, flags
,
3422 ICR_ARGPASS
, fndecl
, i
, complain
);
3423 parmval
= convert_for_arg_passing (type
, parmval
);
3426 if (parmval
== error_mark_node
)
3429 VEC_replace (tree
, *values
, i
, parmval
);
3433 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3434 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3435 /* Don't do ellipsis conversion for __built_in_constant_p
3436 as this will result in spurious errors for non-trivial
3438 val
= require_complete_type_sfinae (val
, complain
);
3440 val
= convert_arg_to_ellipsis (val
);
3442 VEC_replace (tree
, *values
, i
, val
);
3446 typetail
= TREE_CHAIN (typetail
);
3449 if (typetail
!= 0 && typetail
!= void_list_node
)
3451 /* See if there are default arguments that can be used. Because
3452 we hold default arguments in the FUNCTION_TYPE (which is so
3453 wrong), we can see default parameters here from deduced
3454 contexts (and via typeof) for indirect function calls.
3455 Fortunately we know whether we have a function decl to
3456 provide default arguments in a language conformant
3458 if (fndecl
&& TREE_PURPOSE (typetail
)
3459 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3461 for (; typetail
!= void_list_node
; ++i
)
3464 = convert_default_arg (TREE_VALUE (typetail
),
3465 TREE_PURPOSE (typetail
),
3468 if (parmval
== error_mark_node
)
3471 VEC_safe_push (tree
, gc
, *values
, parmval
);
3472 typetail
= TREE_CHAIN (typetail
);
3473 /* ends with `...'. */
3474 if (typetail
== NULL_TREE
)
3480 if (complain
& tf_error
)
3481 warn_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3489 /* Build a binary-operation expression, after performing default
3490 conversions on the operands. CODE is the kind of expression to
3491 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3492 are the tree codes which correspond to ARG1 and ARG2 when issuing
3493 warnings about possibly misplaced parentheses. They may differ
3494 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3495 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3496 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3497 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3498 ARG2_CODE as ERROR_MARK. */
3501 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3502 tree arg2
, enum tree_code arg2_code
, tree
*overload
,
3503 tsubst_flags_t complain
)
3512 if (processing_template_decl
)
3514 if (type_dependent_expression_p (arg1
)
3515 || type_dependent_expression_p (arg2
))
3516 return build_min_nt (code
, arg1
, arg2
);
3517 arg1
= build_non_dependent_expr (arg1
);
3518 arg2
= build_non_dependent_expr (arg2
);
3521 if (code
== DOTSTAR_EXPR
)
3522 expr
= build_m_component_ref (arg1
, arg2
);
3524 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3525 overload
, complain
);
3527 /* Check for cases such as x+y<<z which users are likely to
3528 misinterpret. But don't warn about obj << x + y, since that is a
3529 common idiom for I/O. */
3530 if (warn_parentheses
3531 && (complain
& tf_warning
)
3532 && !processing_template_decl
3533 && !error_operand_p (arg1
)
3534 && !error_operand_p (arg2
)
3535 && (code
!= LSHIFT_EXPR
3536 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3537 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3539 if (processing_template_decl
&& expr
!= error_mark_node
)
3540 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3545 /* Build and return an ARRAY_REF expression. */
3548 build_x_array_ref (tree arg1
, tree arg2
, tsubst_flags_t complain
)
3550 tree orig_arg1
= arg1
;
3551 tree orig_arg2
= arg2
;
3554 if (processing_template_decl
)
3556 if (type_dependent_expression_p (arg1
)
3557 || type_dependent_expression_p (arg2
))
3558 return build_min_nt (ARRAY_REF
, arg1
, arg2
,
3559 NULL_TREE
, NULL_TREE
);
3560 arg1
= build_non_dependent_expr (arg1
);
3561 arg2
= build_non_dependent_expr (arg2
);
3564 expr
= build_new_op (ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3565 /*overload=*/NULL
, complain
);
3567 if (processing_template_decl
&& expr
!= error_mark_node
)
3568 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3569 NULL_TREE
, NULL_TREE
);
3573 /* For the c-common bits. */
3575 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3576 int convert_p ATTRIBUTE_UNUSED
)
3578 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3582 /* Build a binary-operation expression without default conversions.
3583 CODE is the kind of expression to build.
3584 LOCATION is the location_t of the operator in the source code.
3585 This function differs from `build' in several ways:
3586 the data type of the result is computed and recorded in it,
3587 warnings are generated if arg data types are invalid,
3588 special handling for addition and subtraction of pointers is known,
3589 and some optimization is done (operations on narrow ints
3590 are done in the narrower type when that gives the same result).
3591 Constant folding is also done before the result is returned.
3593 Note that the operands will never have enumeral types
3594 because either they have just had the default conversions performed
3595 or they have both just been converted to some other type in which
3596 the arithmetic is to be done.
3598 C++: must do special pointer arithmetic when implementing
3599 multiple inheritance, and deal with pointer to member functions. */
3602 cp_build_binary_op (location_t location
,
3603 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3604 tsubst_flags_t complain
)
3607 enum tree_code code0
, code1
;
3609 const char *invalid_op_diag
;
3611 /* Expression code to give to the expression when it is built.
3612 Normally this is CODE, which is what the caller asked for,
3613 but in some special cases we change it. */
3614 enum tree_code resultcode
= code
;
3616 /* Data type in which the computation is to be performed.
3617 In the simplest cases this is the common type of the arguments. */
3618 tree result_type
= NULL
;
3620 /* Nonzero means operands have already been type-converted
3621 in whatever way is necessary.
3622 Zero means they need to be converted to RESULT_TYPE. */
3625 /* Nonzero means create the expression with this type, rather than
3627 tree build_type
= 0;
3629 /* Nonzero means after finally constructing the expression
3630 convert it to this type. */
3631 tree final_type
= 0;
3635 /* Nonzero if this is an operation like MIN or MAX which can
3636 safely be computed in short if both args are promoted shorts.
3637 Also implies COMMON.
3638 -1 indicates a bitwise operation; this makes a difference
3639 in the exact conditions for when it is safe to do the operation
3640 in a narrower mode. */
3643 /* Nonzero if this is a comparison operation;
3644 if both args are promoted shorts, compare the original shorts.
3645 Also implies COMMON. */
3646 int short_compare
= 0;
3648 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3651 /* True if both operands have arithmetic type. */
3652 bool arithmetic_types_p
;
3654 /* Apply default conversions. */
3658 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3659 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3660 || code
== TRUTH_XOR_EXPR
)
3662 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
3663 op0
= decay_conversion (op0
);
3664 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
3665 op1
= decay_conversion (op1
);
3669 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
3670 op0
= default_conversion (op0
);
3671 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
3672 op1
= default_conversion (op1
);
3675 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3676 STRIP_TYPE_NOPS (op0
);
3677 STRIP_TYPE_NOPS (op1
);
3679 /* DTRT if one side is an overloaded function, but complain about it. */
3680 if (type_unknown_p (op0
))
3682 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3683 if (t
!= error_mark_node
)
3685 if (complain
& tf_error
)
3686 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3691 if (type_unknown_p (op1
))
3693 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3694 if (t
!= error_mark_node
)
3696 if (complain
& tf_error
)
3697 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3703 type0
= TREE_TYPE (op0
);
3704 type1
= TREE_TYPE (op1
);
3706 /* The expression codes of the data types of the arguments tell us
3707 whether the arguments are integers, floating, pointers, etc. */
3708 code0
= TREE_CODE (type0
);
3709 code1
= TREE_CODE (type1
);
3711 /* If an error was already reported for one of the arguments,
3712 avoid reporting another error. */
3713 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3714 return error_mark_node
;
3716 if ((invalid_op_diag
3717 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3719 error (invalid_op_diag
);
3720 return error_mark_node
;
3723 /* Issue warnings about peculiar, but valid, uses of NULL. */
3724 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3725 /* It's reasonable to use pointer values as operands of &&
3726 and ||, so NULL is no exception. */
3727 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3728 && ( /* Both are NULL (or 0) and the operation was not a
3729 comparison or a pointer subtraction. */
3730 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3731 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
3732 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3733 || (!null_ptr_cst_p (orig_op0
)
3734 && !TYPE_PTR_P (type0
) && !TYPE_PTR_TO_MEMBER_P (type0
))
3735 || (!null_ptr_cst_p (orig_op1
)
3736 && !TYPE_PTR_P (type1
) && !TYPE_PTR_TO_MEMBER_P (type1
)))
3737 && (complain
& tf_warning
))
3738 /* Some sort of arithmetic operation involving NULL was
3740 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3745 /* Subtraction of two similar pointers.
3746 We must subtract them as integers, then divide by object size. */
3747 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3748 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3750 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3751 /* In all other cases except pointer - int, the usual arithmetic
3753 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3758 /* The pointer - int case is just like pointer + int; fall
3761 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3762 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3766 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3767 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3768 if (processing_template_decl
)
3770 result_type
= TREE_TYPE (ptr_operand
);
3773 return cp_pointer_int_sum (code
,
3784 case TRUNC_DIV_EXPR
:
3786 case FLOOR_DIV_EXPR
:
3787 case ROUND_DIV_EXPR
:
3788 case EXACT_DIV_EXPR
:
3789 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3790 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3791 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3792 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3794 enum tree_code tcode0
= code0
, tcode1
= code1
;
3796 warn_for_div_by_zero (location
, op1
);
3798 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3799 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3800 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3801 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3803 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3804 resultcode
= RDIV_EXPR
;
3806 /* When dividing two signed integers, we have to promote to int.
3807 unless we divide by a constant != -1. Note that default
3808 conversion will have been performed on the operands at this
3809 point, so we have to dig out the original type to find out if
3811 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3812 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3813 || (TREE_CODE (op1
) == INTEGER_CST
3814 && ! integer_all_onesp (op1
)));
3823 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3824 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3825 && !VECTOR_FLOAT_TYPE_P (type0
)
3826 && !VECTOR_FLOAT_TYPE_P (type1
)))
3830 case TRUNC_MOD_EXPR
:
3831 case FLOOR_MOD_EXPR
:
3832 warn_for_div_by_zero (location
, op1
);
3834 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3835 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
3836 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
3838 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3840 /* Although it would be tempting to shorten always here, that loses
3841 on some targets, since the modulo instruction is undefined if the
3842 quotient can't be represented in the computation mode. We shorten
3843 only if unsigned or if dividing by something we know != -1. */
3844 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3845 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3846 || (TREE_CODE (op1
) == INTEGER_CST
3847 && ! integer_all_onesp (op1
)));
3852 case TRUTH_ANDIF_EXPR
:
3853 case TRUTH_ORIF_EXPR
:
3854 case TRUTH_AND_EXPR
:
3856 result_type
= boolean_type_node
;
3859 /* Shift operations: result has same type as first operand;
3860 always convert second operand to int.
3861 Also set SHORT_SHIFT if shifting rightward. */
3864 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3866 result_type
= type0
;
3867 if (TREE_CODE (op1
) == INTEGER_CST
)
3869 if (tree_int_cst_lt (op1
, integer_zero_node
))
3871 if ((complain
& tf_warning
)
3872 && c_inhibit_evaluation_warnings
== 0)
3873 warning (0, "right shift count is negative");
3877 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3878 && (complain
& tf_warning
)
3879 && c_inhibit_evaluation_warnings
== 0)
3880 warning (0, "right shift count >= width of type");
3883 /* Convert the shift-count to an integer, regardless of
3884 size of value being shifted. */
3885 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3886 op1
= cp_convert (integer_type_node
, op1
);
3887 /* Avoid converting op1 to result_type later. */
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, "left shift count is negative");
3904 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3906 if ((complain
& tf_warning
)
3907 && c_inhibit_evaluation_warnings
== 0)
3908 warning (0, "left shift count >= width of type");
3911 /* Convert the shift-count to an integer, regardless of
3912 size of value being shifted. */
3913 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3914 op1
= cp_convert (integer_type_node
, op1
);
3915 /* 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 warning (0, (code
== LROTATE_EXPR
)
3931 ? G_("left rotate count is negative")
3932 : G_("right rotate count is negative"));
3934 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3936 if (complain
& tf_warning
)
3937 warning (0, (code
== LROTATE_EXPR
)
3938 ? G_("left rotate count >= width of type")
3939 : G_("right rotate count >= width of type"));
3942 /* Convert the shift-count to an integer, regardless of
3943 size of value being shifted. */
3944 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3945 op1
= cp_convert (integer_type_node
, op1
);
3951 if ((complain
& tf_warning
)
3952 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
3953 warning (OPT_Wfloat_equal
,
3954 "comparing floating point with == or != is unsafe");
3955 if ((complain
& tf_warning
)
3956 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
3957 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
3958 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
3960 build_type
= boolean_type_node
;
3961 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3962 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
3963 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3964 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
3966 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3967 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
3968 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3969 CPO_COMPARISON
, complain
);
3970 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
3971 && null_ptr_cst_p (op1
))
3973 if (TREE_CODE (op0
) == ADDR_EXPR
3974 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
3976 if (complain
& tf_warning
)
3977 warning (OPT_Waddress
, "the address of %qD will never be NULL",
3978 TREE_OPERAND (op0
, 0));
3980 result_type
= type0
;
3982 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
3983 && null_ptr_cst_p (op0
))
3985 if (TREE_CODE (op1
) == ADDR_EXPR
3986 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
3988 if (complain
& tf_warning
)
3989 warning (OPT_Waddress
, "the address of %qD will never be NULL",
3990 TREE_OPERAND (op1
, 0));
3992 result_type
= type1
;
3994 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
3995 /* One of the operands must be of nullptr_t type. */
3996 result_type
= TREE_TYPE (nullptr_node
);
3997 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3999 result_type
= type0
;
4000 if (complain
& tf_error
)
4001 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4003 return error_mark_node
;
4005 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4007 result_type
= type1
;
4008 if (complain
& tf_error
)
4009 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4011 return error_mark_node
;
4013 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
4015 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4016 == ptrmemfunc_vbit_in_delta
)
4018 tree pfn0
= pfn_from_ptrmemfunc (op0
);
4019 tree delta0
= delta_from_ptrmemfunc (op0
);
4020 tree e1
= cp_build_binary_op (location
,
4023 build_zero_cst (TREE_TYPE (pfn0
)),
4025 tree e2
= cp_build_binary_op (location
,
4030 e2
= cp_build_binary_op (location
,
4031 EQ_EXPR
, e2
, integer_zero_node
,
4033 op0
= cp_build_binary_op (location
,
4034 TRUTH_ANDIF_EXPR
, e1
, e2
,
4036 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
4040 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4041 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
4043 result_type
= TREE_TYPE (op0
);
4045 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4046 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4047 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4050 /* E will be the final comparison. */
4052 /* E1 and E2 are for scratch. */
4060 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4061 CPO_COMPARISON
, complain
);
4063 if (!same_type_p (TREE_TYPE (op0
), type
))
4064 op0
= cp_convert_and_check (type
, op0
);
4065 if (!same_type_p (TREE_TYPE (op1
), type
))
4066 op1
= cp_convert_and_check (type
, op1
);
4068 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4069 return error_mark_node
;
4071 if (TREE_SIDE_EFFECTS (op0
))
4072 op0
= save_expr (op0
);
4073 if (TREE_SIDE_EFFECTS (op1
))
4074 op1
= save_expr (op1
);
4076 pfn0
= pfn_from_ptrmemfunc (op0
);
4077 pfn1
= pfn_from_ptrmemfunc (op1
);
4078 delta0
= delta_from_ptrmemfunc (op0
);
4079 delta1
= delta_from_ptrmemfunc (op1
);
4080 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4081 == ptrmemfunc_vbit_in_delta
)
4086 && ((op0.delta == op1.delta)
4087 || (!op0.pfn && op0.delta & 1 == 0
4088 && op1.delta & 1 == 0))
4090 The reason for the `!op0.pfn' bit is that a NULL
4091 pointer-to-member is any member with a zero PFN and
4092 LSB of the DELTA field is 0. */
4094 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4098 e1
= cp_build_binary_op (location
,
4099 EQ_EXPR
, e1
, integer_zero_node
,
4101 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4105 e2
= cp_build_binary_op (location
,
4106 EQ_EXPR
, e2
, integer_zero_node
,
4108 e1
= cp_build_binary_op (location
,
4109 TRUTH_ANDIF_EXPR
, e2
, e1
,
4111 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4113 build_zero_cst (TREE_TYPE (pfn0
)),
4115 e2
= cp_build_binary_op (location
,
4116 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4117 e1
= cp_build_binary_op (location
,
4118 EQ_EXPR
, delta0
, delta1
, complain
);
4119 e1
= cp_build_binary_op (location
,
4120 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4127 && (!op0.pfn || op0.delta == op1.delta))
4129 The reason for the `!op0.pfn' bit is that a NULL
4130 pointer-to-member is any member with a zero PFN; the
4131 DELTA field is unspecified. */
4133 e1
= cp_build_binary_op (location
,
4134 EQ_EXPR
, delta0
, delta1
, complain
);
4135 e2
= cp_build_binary_op (location
,
4138 build_zero_cst (TREE_TYPE (pfn0
)),
4140 e1
= cp_build_binary_op (location
,
4141 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4143 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4144 e
= cp_build_binary_op (location
,
4145 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4146 if (code
== EQ_EXPR
)
4148 return cp_build_binary_op (location
,
4149 EQ_EXPR
, e
, integer_zero_node
, complain
);
4153 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4154 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4156 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4157 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4165 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4166 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4168 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4169 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4170 CPO_COMPARISON
, complain
);
4177 if (TREE_CODE (orig_op0
) == STRING_CST
4178 || TREE_CODE (orig_op1
) == STRING_CST
)
4180 if (complain
& tf_warning
)
4181 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4184 build_type
= boolean_type_node
;
4185 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4186 || code0
== ENUMERAL_TYPE
)
4187 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4188 || code1
== ENUMERAL_TYPE
))
4190 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4191 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4192 CPO_COMPARISON
, complain
);
4193 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4194 result_type
= type0
;
4195 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4196 result_type
= type1
;
4197 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4198 /* One of the operands must be of nullptr_t type. */
4199 result_type
= TREE_TYPE (nullptr_node
);
4200 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4202 result_type
= type0
;
4203 if (complain
& tf_error
)
4204 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4206 return error_mark_node
;
4208 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4210 result_type
= type1
;
4211 if (complain
& tf_error
)
4212 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4214 return error_mark_node
;
4218 case UNORDERED_EXPR
:
4225 build_type
= integer_type_node
;
4226 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4228 if (complain
& tf_error
)
4229 error ("unordered comparison on non-floating point argument");
4230 return error_mark_node
;
4239 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4240 || code0
== ENUMERAL_TYPE
)
4241 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4242 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4243 arithmetic_types_p
= 1;
4246 arithmetic_types_p
= 0;
4247 /* Vector arithmetic is only allowed when both sides are vectors. */
4248 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4250 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4251 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4254 binary_op_error (location
, code
, type0
, type1
);
4255 return error_mark_node
;
4257 arithmetic_types_p
= 1;
4260 /* Determine the RESULT_TYPE, if it is not already known. */
4262 && arithmetic_types_p
4263 && (shorten
|| common
|| short_compare
))
4265 result_type
= cp_common_type (type0
, type1
);
4266 do_warn_double_promotion (result_type
, type0
, type1
,
4267 "implicit conversion from %qT to %qT "
4268 "to match other operand of binary "
4275 if (complain
& tf_error
)
4276 error ("invalid operands of types %qT and %qT to binary %qO",
4277 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4278 return error_mark_node
;
4281 /* If we're in a template, the only thing we need to know is the
4283 if (processing_template_decl
)
4285 /* Since the middle-end checks the type when doing a build2, we
4286 need to build the tree in pieces. This built tree will never
4287 get out of the front-end as we replace it when instantiating
4289 tree tmp
= build2 (resultcode
,
4290 build_type
? build_type
: result_type
,
4292 TREE_OPERAND (tmp
, 0) = op0
;
4296 if (arithmetic_types_p
)
4298 bool first_complex
= (code0
== COMPLEX_TYPE
);
4299 bool second_complex
= (code1
== COMPLEX_TYPE
);
4300 int none_complex
= (!first_complex
&& !second_complex
);
4302 /* Adapted from patch for c/24581. */
4303 if (first_complex
!= second_complex
4304 && (code
== PLUS_EXPR
4305 || code
== MINUS_EXPR
4306 || code
== MULT_EXPR
4307 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4308 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4309 && flag_signed_zeros
)
4311 /* An operation on mixed real/complex operands must be
4312 handled specially, but the language-independent code can
4313 more easily optimize the plain complex arithmetic if
4314 -fno-signed-zeros. */
4315 tree real_type
= TREE_TYPE (result_type
);
4319 if (TREE_TYPE (op0
) != result_type
)
4320 op0
= cp_convert_and_check (result_type
, op0
);
4321 if (TREE_TYPE (op1
) != real_type
)
4322 op1
= cp_convert_and_check (real_type
, op1
);
4326 if (TREE_TYPE (op0
) != real_type
)
4327 op0
= cp_convert_and_check (real_type
, op0
);
4328 if (TREE_TYPE (op1
) != result_type
)
4329 op1
= cp_convert_and_check (result_type
, op1
);
4331 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4332 return error_mark_node
;
4335 op0
= save_expr (op0
);
4336 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4337 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4341 case TRUNC_DIV_EXPR
:
4342 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4346 real
= build2 (resultcode
, real_type
, real
, op1
);
4354 op1
= save_expr (op1
);
4355 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4356 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4360 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4363 real
= build2 (resultcode
, real_type
, op0
, real
);
4366 real
= build2 (resultcode
, real_type
, op0
, real
);
4367 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4373 real
= fold_if_not_in_template (real
);
4374 imag
= fold_if_not_in_template (imag
);
4375 result
= build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4376 result
= fold_if_not_in_template (result
);
4380 /* For certain operations (which identify themselves by shorten != 0)
4381 if both args were extended from the same smaller type,
4382 do the arithmetic in that type and then extend.
4384 shorten !=0 and !=1 indicates a bitwise operation.
4385 For them, this optimization is safe only if
4386 both args are zero-extended or both are sign-extended.
4387 Otherwise, we might change the result.
4388 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4389 but calculated in (unsigned short) it would be (unsigned short)-1. */
4391 if (shorten
&& none_complex
)
4393 final_type
= result_type
;
4394 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4398 /* Comparison operations are shortened too but differently.
4399 They identify themselves by setting short_compare = 1. */
4403 /* Don't write &op0, etc., because that would prevent op0
4404 from being kept in a register.
4405 Instead, make copies of the our local variables and
4406 pass the copies by reference, then copy them back afterward. */
4407 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4408 enum tree_code xresultcode
= resultcode
;
4410 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4412 return cp_convert (boolean_type_node
, val
);
4413 op0
= xop0
, op1
= xop1
;
4415 resultcode
= xresultcode
;
4418 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4419 && warn_sign_compare
4420 && !TREE_NO_WARNING (orig_op0
)
4421 && !TREE_NO_WARNING (orig_op1
)
4422 /* Do not warn until the template is instantiated; we cannot
4423 bound the ranges of the arguments until that point. */
4424 && !processing_template_decl
4425 && (complain
& tf_warning
)
4426 && c_inhibit_evaluation_warnings
== 0)
4428 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4429 result_type
, resultcode
);
4433 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4434 Then the expression will be built.
4435 It will be given type FINAL_TYPE if that is nonzero;
4436 otherwise, it will be given type RESULT_TYPE. */
4439 if (TREE_TYPE (op0
) != result_type
)
4440 op0
= cp_convert_and_check (result_type
, op0
);
4441 if (TREE_TYPE (op1
) != result_type
)
4442 op1
= cp_convert_and_check (result_type
, op1
);
4444 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4445 return error_mark_node
;
4448 if (build_type
== NULL_TREE
)
4449 build_type
= result_type
;
4451 result
= build2 (resultcode
, build_type
, op0
, op1
);
4452 result
= fold_if_not_in_template (result
);
4453 if (final_type
!= 0)
4454 result
= cp_convert (final_type
, result
);
4456 if (TREE_OVERFLOW_P (result
)
4457 && !TREE_OVERFLOW_P (op0
)
4458 && !TREE_OVERFLOW_P (op1
))
4459 overflow_warning (location
, result
);
4464 /* Return a tree for the sum or difference (RESULTCODE says which)
4465 of pointer PTROP and integer INTOP. */
4468 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4470 tree res_type
= TREE_TYPE (ptrop
);
4472 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4473 in certain circumstance (when it's valid to do so). So we need
4474 to make sure it's complete. We don't need to check here, if we
4475 can actually complete it at all, as those checks will be done in
4476 pointer_int_sum() anyway. */
4477 complete_type (TREE_TYPE (res_type
));
4479 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4480 fold_if_not_in_template (intop
));
4483 /* Return a tree for the difference of pointers OP0 and OP1.
4484 The resulting tree has type int. */
4487 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4490 tree restype
= ptrdiff_type_node
;
4491 tree target_type
= TREE_TYPE (ptrtype
);
4493 if (!complete_type_or_else (target_type
, NULL_TREE
))
4494 return error_mark_node
;
4496 if (TREE_CODE (target_type
) == VOID_TYPE
)
4497 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4498 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4499 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4500 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4501 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4503 /* First do the subtraction as integers;
4504 then drop through to build the divide operator. */
4506 op0
= cp_build_binary_op (input_location
,
4508 cp_convert (restype
, op0
),
4509 cp_convert (restype
, op1
),
4510 tf_warning_or_error
);
4512 /* This generates an error if op1 is a pointer to an incomplete type. */
4513 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4514 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4516 op1
= (TYPE_PTROB_P (ptrtype
)
4517 ? size_in_bytes (target_type
)
4518 : integer_one_node
);
4520 /* Do the division. */
4522 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4523 return fold_if_not_in_template (result
);
4526 /* Construct and perhaps optimize a tree representation
4527 for a unary operation. CODE, a tree_code, specifies the operation
4528 and XARG is the operand. */
4531 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4533 tree orig_expr
= xarg
;
4537 if (processing_template_decl
)
4539 if (type_dependent_expression_p (xarg
))
4540 return build_min_nt (code
, xarg
, NULL_TREE
);
4542 xarg
= build_non_dependent_expr (xarg
);
4547 /* [expr.unary.op] says:
4549 The address of an object of incomplete type can be taken.
4551 (And is just the ordinary address operator, not an overloaded
4552 "operator &".) However, if the type is a template
4553 specialization, we must complete the type at this point so that
4554 an overloaded "operator &" will be available if required. */
4555 if (code
== ADDR_EXPR
4556 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4557 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4558 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4559 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4560 /* Don't look for a function. */;
4562 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4563 /*overload=*/NULL
, complain
);
4564 if (!exp
&& code
== ADDR_EXPR
)
4566 if (is_overloaded_fn (xarg
))
4568 tree fn
= get_first_fn (xarg
);
4569 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4571 error (DECL_CONSTRUCTOR_P (fn
)
4572 ? G_("taking address of constructor %qE")
4573 : G_("taking address of destructor %qE"),
4575 return error_mark_node
;
4579 /* A pointer to member-function can be formed only by saying
4581 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4582 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4584 if (TREE_CODE (xarg
) != OFFSET_REF
4585 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4587 error ("invalid use of %qE to form a pointer-to-member-function",
4589 if (TREE_CODE (xarg
) != OFFSET_REF
)
4590 inform (input_location
, " a qualified-id is required");
4591 return error_mark_node
;
4595 error ("parentheses around %qE cannot be used to form a"
4596 " pointer-to-member-function",
4598 PTRMEM_OK_P (xarg
) = 1;
4602 if (TREE_CODE (xarg
) == OFFSET_REF
)
4604 ptrmem
= PTRMEM_OK_P (xarg
);
4606 if (!ptrmem
&& !flag_ms_extensions
4607 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4609 /* A single non-static member, make sure we don't allow a
4610 pointer-to-member. */
4611 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4612 TREE_OPERAND (xarg
, 0),
4613 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4614 PTRMEM_OK_P (xarg
) = ptrmem
;
4618 exp
= cp_build_addr_expr_strict (xarg
, complain
);
4621 if (processing_template_decl
&& exp
!= error_mark_node
)
4622 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4623 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4624 if (TREE_CODE (exp
) == ADDR_EXPR
)
4625 PTRMEM_OK_P (exp
) = ptrmem
;
4629 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4630 constants, where a null value is represented by an INTEGER_CST of
4634 cp_truthvalue_conversion (tree expr
)
4636 tree type
= TREE_TYPE (expr
);
4637 if (TYPE_PTRMEM_P (type
))
4638 return build_binary_op (EXPR_LOCATION (expr
),
4639 NE_EXPR
, expr
, integer_zero_node
, 1);
4641 return c_common_truthvalue_conversion (input_location
, expr
);
4644 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4647 condition_conversion (tree expr
)
4650 if (processing_template_decl
)
4652 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4653 tf_warning_or_error
, LOOKUP_NORMAL
);
4654 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4658 /* Returns the address of T. This function will fold away
4659 ADDR_EXPR of INDIRECT_REF. */
4662 build_address (tree t
)
4664 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4665 return error_mark_node
;
4666 t
= build_fold_addr_expr (t
);
4667 if (TREE_CODE (t
) != ADDR_EXPR
)
4672 /* Returns the address of T with type TYPE. */
4675 build_typed_address (tree t
, tree type
)
4677 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4678 return error_mark_node
;
4679 t
= build_fold_addr_expr_with_type (t
, type
);
4680 if (TREE_CODE (t
) != ADDR_EXPR
)
4685 /* Return a NOP_EXPR converting EXPR to TYPE. */
4688 build_nop (tree type
, tree expr
)
4690 if (type
== error_mark_node
|| error_operand_p (expr
))
4692 return build1 (NOP_EXPR
, type
, expr
);
4695 /* Take the address of ARG, whatever that means under C++ semantics.
4696 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
4697 and class rvalues as well.
4699 Nothing should call this function directly; instead, callers should use
4700 cp_build_addr_expr or cp_build_addr_expr_strict. */
4703 cp_build_addr_expr_1 (tree arg
, bool strict_lvalue
, tsubst_flags_t complain
)
4708 if (!arg
|| error_operand_p (arg
))
4709 return error_mark_node
;
4711 arg
= mark_lvalue_use (arg
);
4712 argtype
= lvalue_type (arg
);
4714 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
4715 || !IDENTIFIER_OPNAME_P (arg
));
4717 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
4718 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
4720 /* They're trying to take the address of a unique non-static
4721 member function. This is ill-formed (except in MS-land),
4722 but let's try to DTRT.
4723 Note: We only handle unique functions here because we don't
4724 want to complain if there's a static overload; non-unique
4725 cases will be handled by instantiate_type. But we need to
4726 handle this case here to allow casts on the resulting PMF.
4727 We could defer this in non-MS mode, but it's easier to give
4728 a useful error here. */
4730 /* Inside constant member functions, the `this' pointer
4731 contains an extra const qualifier. TYPE_MAIN_VARIANT
4732 is used here to remove this const from the diagnostics
4733 and the created OFFSET_REF. */
4734 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
4735 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
4738 if (! flag_ms_extensions
)
4740 tree name
= DECL_NAME (fn
);
4741 if (!(complain
& tf_error
))
4742 return error_mark_node
;
4743 else if (current_class_type
4744 && TREE_OPERAND (arg
, 0) == current_class_ref
)
4745 /* An expression like &memfn. */
4746 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
4747 " or parenthesized non-static member function to form"
4748 " a pointer to member function. Say %<&%T::%D%>",
4751 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
4752 " function to form a pointer to member function."
4756 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
4759 /* Uninstantiated types are all functions. Taking the
4760 address of a function is a no-op, so just return the
4762 if (type_unknown_p (arg
))
4763 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4765 if (TREE_CODE (arg
) == OFFSET_REF
)
4766 /* We want a pointer to member; bypass all the code for actually taking
4767 the address of something. */
4770 /* Anything not already handled and not a true memory reference
4772 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4773 && TREE_CODE (argtype
) != METHOD_TYPE
)
4775 cp_lvalue_kind kind
= lvalue_kind (arg
);
4776 if (kind
== clk_none
)
4778 if (complain
& tf_error
)
4779 lvalue_error (input_location
, lv_addressof
);
4780 return error_mark_node
;
4782 if (strict_lvalue
&& (kind
& (clk_rvalueref
|clk_class
)))
4784 if (!(complain
& tf_error
))
4785 return error_mark_node
;
4786 if (kind
& clk_class
)
4787 /* Make this a permerror because we used to accept it. */
4788 permerror (input_location
, "taking address of temporary");
4790 error ("taking address of xvalue (rvalue reference)");
4794 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4796 tree type
= build_pointer_type (TREE_TYPE (argtype
));
4797 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4800 else if (pedantic
&& DECL_MAIN_P (arg
))
4803 /* Apparently a lot of autoconf scripts for C++ packages do this,
4804 so only complain if -pedantic. */
4805 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
4806 pedwarn (input_location
, OPT_pedantic
,
4807 "ISO C++ forbids taking address of function %<::main%>");
4808 else if (flag_pedantic_errors
)
4809 return error_mark_node
;
4812 /* Let &* cancel out to simplify resulting code. */
4813 if (TREE_CODE (arg
) == INDIRECT_REF
)
4815 /* We don't need to have `current_class_ptr' wrapped in a
4816 NON_LVALUE_EXPR node. */
4817 if (arg
== current_class_ref
)
4818 return current_class_ptr
;
4820 arg
= TREE_OPERAND (arg
, 0);
4821 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
4823 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
4824 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4827 /* Don't let this be an lvalue. */
4832 /* ??? Cope with user tricks that amount to offsetof. */
4833 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4834 && TREE_CODE (argtype
) != METHOD_TYPE
4835 && argtype
!= unknown_type_node
4836 && (val
= get_base_address (arg
))
4837 && COMPLETE_TYPE_P (TREE_TYPE (val
))
4838 && TREE_CODE (val
) == INDIRECT_REF
4839 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
4841 tree type
= build_pointer_type (argtype
);
4842 tree op0
= fold_convert (type
, TREE_OPERAND (val
, 0));
4843 tree op1
= fold_convert (sizetype
, fold_offsetof (arg
, val
));
4844 return fold_build2 (POINTER_PLUS_EXPR
, type
, op0
, op1
);
4847 /* Handle complex lvalues (when permitted)
4848 by reduction to simpler cases. */
4849 val
= unary_complex_lvalue (ADDR_EXPR
, arg
);
4853 switch (TREE_CODE (arg
))
4857 case FIX_TRUNC_EXPR
:
4858 /* Even if we're not being pedantic, we cannot allow this
4859 extension when we're instantiating in a SFINAE
4861 if (! lvalue_p (arg
) && complain
== tf_none
)
4863 if (complain
& tf_error
)
4864 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4866 return error_mark_node
;
4871 arg
= BASELINK_FUNCTIONS (arg
);
4875 arg
= OVL_CURRENT (arg
);
4880 /* Turn a reference to a non-static data member into a
4881 pointer-to-member. */
4886 gcc_assert (PTRMEM_OK_P (arg
));
4888 t
= TREE_OPERAND (arg
, 1);
4889 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
4891 if (complain
& tf_error
)
4892 error ("cannot create pointer to reference member %qD", t
);
4893 return error_mark_node
;
4896 type
= build_ptrmem_type (context_for_name_lookup (t
),
4898 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
4906 if (argtype
!= error_mark_node
)
4907 argtype
= build_pointer_type (argtype
);
4909 /* In a template, we are processing a non-dependent expression
4910 so we can just form an ADDR_EXPR with the correct type. */
4911 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
4913 val
= build_address (arg
);
4914 if (TREE_CODE (arg
) == OFFSET_REF
)
4915 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
4917 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
4919 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
4921 /* We can only get here with a single static member
4923 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4924 && DECL_STATIC_FUNCTION_P (fn
));
4926 val
= build_address (fn
);
4927 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
4928 /* Do not lose object's side effects. */
4929 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
4930 TREE_OPERAND (arg
, 0), val
);
4932 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
4934 if (complain
& tf_error
)
4935 error ("attempt to take address of bit-field structure member %qD",
4936 TREE_OPERAND (arg
, 1));
4937 return error_mark_node
;
4941 tree object
= TREE_OPERAND (arg
, 0);
4942 tree field
= TREE_OPERAND (arg
, 1);
4943 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4944 (TREE_TYPE (object
), decl_type_context (field
)));
4945 val
= build_address (arg
);
4948 if (TREE_CODE (argtype
) == POINTER_TYPE
4949 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
4951 build_ptrmemfunc_type (argtype
);
4952 val
= build_ptrmemfunc (argtype
, val
, 0,
4954 tf_warning_or_error
);
4960 /* Take the address of ARG if it has one, even if it's an rvalue. */
4963 cp_build_addr_expr (tree arg
, tsubst_flags_t complain
)
4965 return cp_build_addr_expr_1 (arg
, 0, complain
);
4968 /* Take the address of ARG, but only if it's an lvalue. */
4971 cp_build_addr_expr_strict (tree arg
, tsubst_flags_t complain
)
4973 return cp_build_addr_expr_1 (arg
, 1, complain
);
4976 /* C++: Must handle pointers to members.
4978 Perhaps type instantiation should be extended to handle conversion
4979 from aggregates to types we don't yet know we want? (Or are those
4980 cases typically errors which should be reported?)
4982 NOCONVERT nonzero suppresses the default promotions
4983 (such as from short to int). */
4986 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
4987 tsubst_flags_t complain
)
4989 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4992 const char *errstring
= NULL
;
4994 const char *invalid_op_diag
;
4996 if (!arg
|| error_operand_p (arg
))
4997 return error_mark_node
;
4999 if ((invalid_op_diag
5000 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
5005 error (invalid_op_diag
);
5006 return error_mark_node
;
5011 case UNARY_PLUS_EXPR
:
5014 int flags
= WANT_ARITH
| WANT_ENUM
;
5015 /* Unary plus (but not unary minus) is allowed on pointers. */
5016 if (code
== UNARY_PLUS_EXPR
)
5017 flags
|= WANT_POINTER
;
5018 arg
= build_expr_type_conversion (flags
, arg
, true);
5020 errstring
= (code
== NEGATE_EXPR
5021 ? _("wrong type argument to unary minus")
5022 : _("wrong type argument to unary plus"));
5025 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5026 arg
= perform_integral_promotions (arg
);
5028 /* Make sure the result is not an lvalue: a unary plus or minus
5029 expression is always a rvalue. */
5036 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5040 arg
= default_conversion (arg
);
5042 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
5043 | WANT_VECTOR_OR_COMPLEX
,
5045 errstring
= _("wrong type argument to bit-complement");
5046 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5047 arg
= perform_integral_promotions (arg
);
5051 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5052 errstring
= _("wrong type argument to abs");
5053 else if (!noconvert
)
5054 arg
= default_conversion (arg
);
5058 /* Conjugating a real value is a no-op, but allow it anyway. */
5059 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5060 errstring
= _("wrong type argument to conjugation");
5061 else if (!noconvert
)
5062 arg
= default_conversion (arg
);
5065 case TRUTH_NOT_EXPR
:
5066 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
5068 val
= invert_truthvalue_loc (input_location
, arg
);
5069 if (arg
!= error_mark_node
)
5071 errstring
= _("in argument to unary !");
5079 arg
= build_real_imag_expr (input_location
, code
, arg
);
5080 if (arg
== error_mark_node
)
5083 return fold_if_not_in_template (arg
);
5085 case PREINCREMENT_EXPR
:
5086 case POSTINCREMENT_EXPR
:
5087 case PREDECREMENT_EXPR
:
5088 case POSTDECREMENT_EXPR
:
5089 /* Handle complex lvalues (when permitted)
5090 by reduction to simpler cases. */
5092 val
= unary_complex_lvalue (code
, arg
);
5096 arg
= mark_lvalue_use (arg
);
5098 /* Increment or decrement the real part of the value,
5099 and don't change the imaginary part. */
5100 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5104 arg
= stabilize_reference (arg
);
5105 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
5106 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
5107 real
= cp_build_unary_op (code
, real
, 1, complain
);
5108 if (real
== error_mark_node
|| imag
== error_mark_node
)
5109 return error_mark_node
;
5110 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
5114 /* Report invalid types. */
5116 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
5119 if (code
== PREINCREMENT_EXPR
)
5120 errstring
= _("no pre-increment operator for type");
5121 else if (code
== POSTINCREMENT_EXPR
)
5122 errstring
= _("no post-increment operator for type");
5123 else if (code
== PREDECREMENT_EXPR
)
5124 errstring
= _("no pre-decrement operator for type");
5126 errstring
= _("no post-decrement operator for type");
5129 else if (arg
== error_mark_node
)
5130 return error_mark_node
;
5132 /* Report something read-only. */
5134 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
5135 || TREE_READONLY (arg
))
5137 if (complain
& tf_error
)
5138 cxx_readonly_error (arg
, ((code
== PREINCREMENT_EXPR
5139 || code
== POSTINCREMENT_EXPR
)
5140 ? lv_increment
: lv_decrement
));
5142 return error_mark_node
;
5147 tree declared_type
= unlowered_expr_type (arg
);
5149 argtype
= TREE_TYPE (arg
);
5151 /* ARM $5.2.5 last annotation says this should be forbidden. */
5152 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
5154 if (complain
& tf_error
)
5155 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
5156 ? G_("ISO C++ forbids incrementing an enum")
5157 : G_("ISO C++ forbids decrementing an enum"));
5159 return error_mark_node
;
5162 /* Compute the increment. */
5164 if (TREE_CODE (argtype
) == POINTER_TYPE
)
5166 tree type
= complete_type (TREE_TYPE (argtype
));
5168 if (!COMPLETE_OR_VOID_TYPE_P (type
))
5170 if (complain
& tf_error
)
5171 error (((code
== PREINCREMENT_EXPR
5172 || code
== POSTINCREMENT_EXPR
))
5173 ? G_("cannot increment a pointer to incomplete type %qT")
5174 : G_("cannot decrement a pointer to incomplete type %qT"),
5175 TREE_TYPE (argtype
));
5177 return error_mark_node
;
5179 else if ((pedantic
|| warn_pointer_arith
)
5180 && !TYPE_PTROB_P (argtype
))
5182 if (complain
& tf_error
)
5183 permerror (input_location
, (code
== PREINCREMENT_EXPR
5184 || code
== POSTINCREMENT_EXPR
)
5185 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
5186 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
5189 return error_mark_node
;
5192 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
5195 inc
= integer_one_node
;
5197 inc
= cp_convert (argtype
, inc
);
5199 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
5200 need to ask Objective-C to build the increment or decrement
5201 expression for it. */
5202 if (objc_is_property_ref (arg
))
5203 return objc_build_incr_expr_for_property_ref (input_location
, code
,
5206 /* Complain about anything else that is not a true lvalue. */
5207 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
5208 || code
== POSTINCREMENT_EXPR
)
5209 ? lv_increment
: lv_decrement
),
5211 return error_mark_node
;
5213 /* Forbid using -- on `bool'. */
5214 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
5216 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
5218 if (complain
& tf_error
)
5219 error ("invalid use of Boolean expression as operand "
5220 "to %<operator--%>");
5221 return error_mark_node
;
5223 val
= boolean_increment (code
, arg
);
5226 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
5228 TREE_SIDE_EFFECTS (val
) = 1;
5233 /* Note that this operation never does default_conversion
5234 regardless of NOCONVERT. */
5235 return cp_build_addr_expr (arg
, complain
);
5244 argtype
= TREE_TYPE (arg
);
5245 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5248 if (complain
& tf_error
)
5249 error ("%s", errstring
);
5250 return error_mark_node
;
5253 /* Hook for the c-common bits that build a unary op. */
5255 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5256 enum tree_code code
, tree xarg
, int noconvert
)
5258 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5261 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5262 for certain kinds of expressions which are not really lvalues
5263 but which we can accept as lvalues.
5265 If ARG is not a kind of expression we can handle, return
5269 unary_complex_lvalue (enum tree_code code
, tree arg
)
5271 /* Inside a template, making these kinds of adjustments is
5272 pointless; we are only concerned with the type of the
5274 if (processing_template_decl
)
5277 /* Handle (a, b) used as an "lvalue". */
5278 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5280 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5281 tf_warning_or_error
);
5282 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5283 TREE_OPERAND (arg
, 0), real_result
);
5286 /* Handle (a ? b : c) used as an "lvalue". */
5287 if (TREE_CODE (arg
) == COND_EXPR
5288 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5289 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5291 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5292 if (TREE_CODE (arg
) == MODIFY_EXPR
5293 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5294 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5296 tree lvalue
= TREE_OPERAND (arg
, 0);
5297 if (TREE_SIDE_EFFECTS (lvalue
))
5299 lvalue
= stabilize_reference (lvalue
);
5300 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5301 lvalue
, TREE_OPERAND (arg
, 1));
5303 return unary_complex_lvalue
5304 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5307 if (code
!= ADDR_EXPR
)
5310 /* Handle (a = b) used as an "lvalue" for `&'. */
5311 if (TREE_CODE (arg
) == MODIFY_EXPR
5312 || TREE_CODE (arg
) == INIT_EXPR
)
5314 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5315 tf_warning_or_error
);
5316 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5318 TREE_NO_WARNING (arg
) = 1;
5322 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5323 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5324 || TREE_CODE (arg
) == OFFSET_REF
)
5327 /* We permit compiler to make function calls returning
5328 objects of aggregate type look like lvalues. */
5332 if (TREE_CODE (targ
) == SAVE_EXPR
)
5333 targ
= TREE_OPERAND (targ
, 0);
5335 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5337 if (TREE_CODE (arg
) == SAVE_EXPR
)
5340 targ
= build_cplus_new (TREE_TYPE (arg
), arg
, tf_warning_or_error
);
5341 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5344 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5345 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5346 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5349 /* Don't let anything else be handled specially. */
5353 /* Mark EXP saying that we need to be able to take the
5354 address of it; it should not be allocated in a register.
5355 Value is true if successful.
5357 C++: we do not allow `current_class_ptr' to be addressable. */
5360 cxx_mark_addressable (tree exp
)
5365 switch (TREE_CODE (x
))
5372 x
= TREE_OPERAND (x
, 0);
5376 if (x
== current_class_ptr
)
5378 error ("cannot take the address of %<this%>, which is an rvalue expression");
5379 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5385 /* Caller should not be trying to mark initialized
5386 constant fields addressable. */
5387 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5388 || DECL_IN_AGGR_P (x
) == 0
5390 || DECL_EXTERNAL (x
));
5394 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5395 && !DECL_ARTIFICIAL (x
))
5397 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5400 ("address of explicit register variable %qD requested", x
);
5403 else if (extra_warnings
)
5405 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5407 TREE_ADDRESSABLE (x
) = 1;
5412 TREE_ADDRESSABLE (x
) = 1;
5416 TREE_ADDRESSABLE (x
) = 1;
5420 TREE_ADDRESSABLE (x
) = 1;
5421 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5429 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5432 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5433 tsubst_flags_t complain
)
5435 tree orig_ifexp
= ifexp
;
5436 tree orig_op1
= op1
;
5437 tree orig_op2
= op2
;
5440 if (processing_template_decl
)
5442 /* The standard says that the expression is type-dependent if
5443 IFEXP is type-dependent, even though the eventual type of the
5444 expression doesn't dependent on IFEXP. */
5445 if (type_dependent_expression_p (ifexp
)
5446 /* As a GNU extension, the middle operand may be omitted. */
5447 || (op1
&& type_dependent_expression_p (op1
))
5448 || type_dependent_expression_p (op2
))
5449 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5450 ifexp
= build_non_dependent_expr (ifexp
);
5452 op1
= build_non_dependent_expr (op1
);
5453 op2
= build_non_dependent_expr (op2
);
5456 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5457 if (processing_template_decl
&& expr
!= error_mark_node
)
5458 return build_min_non_dep (COND_EXPR
, expr
,
5459 orig_ifexp
, orig_op1
, orig_op2
);
5463 /* Given a list of expressions, return a compound expression
5464 that performs them all and returns the value of the last of them. */
5467 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
,
5468 tsubst_flags_t complain
)
5470 tree expr
= TREE_VALUE (list
);
5472 if (TREE_CHAIN (list
))
5474 if (complain
& tf_error
)
5478 permerror (input_location
, "expression list treated as compound "
5479 "expression in initializer");
5482 permerror (input_location
, "expression list treated as compound "
5483 "expression in mem-initializer");
5486 permerror (input_location
, "expression list treated as compound "
5487 "expression in functional cast");
5493 return error_mark_node
;
5495 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5496 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5503 /* Like build_x_compound_expr_from_list, but using a VEC. */
5506 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5508 if (VEC_empty (tree
, vec
))
5510 else if (VEC_length (tree
, vec
) == 1)
5511 return VEC_index (tree
, vec
, 0);
5519 permerror (input_location
,
5520 "%s expression list treated as compound expression",
5523 expr
= VEC_index (tree
, vec
, 0);
5524 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5525 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5531 /* Handle overloading of the ',' operator when needed. */
5534 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5537 tree orig_op1
= op1
;
5538 tree orig_op2
= op2
;
5540 if (processing_template_decl
)
5542 if (type_dependent_expression_p (op1
)
5543 || type_dependent_expression_p (op2
))
5544 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5545 op1
= build_non_dependent_expr (op1
);
5546 op2
= build_non_dependent_expr (op2
);
5549 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5550 /*overload=*/NULL
, complain
);
5552 result
= cp_build_compound_expr (op1
, op2
, complain
);
5554 if (processing_template_decl
&& result
!= error_mark_node
)
5555 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5560 /* Like cp_build_compound_expr, but for the c-common bits. */
5563 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5565 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5568 /* Build a compound expression. */
5571 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5573 lhs
= convert_to_void (lhs
, ICV_LEFT_OF_COMMA
, complain
);
5575 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5576 return error_mark_node
;
5578 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5580 /* If the rhs is a TARGET_EXPR, then build the compound
5581 expression inside the target_expr's initializer. This
5582 helps the compiler to eliminate unnecessary temporaries. */
5583 tree init
= TREE_OPERAND (rhs
, 1);
5585 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5586 TREE_OPERAND (rhs
, 1) = init
;
5591 if (type_unknown_p (rhs
))
5593 error ("no context to resolve type of %qE", rhs
);
5594 return error_mark_node
;
5597 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5600 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5601 casts away constness. CAST gives the type of cast. Returns true
5602 if the cast is ill-formed, false if it is well-formed.
5604 ??? This function warns for casting away any qualifier not just
5605 const. We would like to specify exactly what qualifiers are casted
5610 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5611 enum tree_code cast
, tsubst_flags_t complain
)
5613 /* C-style casts are allowed to cast away constness. With
5614 WARN_CAST_QUAL, we still want to issue a warning. */
5615 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5618 if (!casts_away_constness (src_type
, dest_type
))
5624 if (complain
& tf_warning
)
5625 warning (OPT_Wcast_qual
,
5626 "cast from type %qT to type %qT casts away qualifiers",
5627 src_type
, dest_type
);
5630 case STATIC_CAST_EXPR
:
5631 if (complain
& tf_error
)
5632 error ("static_cast from type %qT to type %qT casts away qualifiers",
5633 src_type
, dest_type
);
5636 case REINTERPRET_CAST_EXPR
:
5637 if (complain
& tf_error
)
5638 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5639 src_type
, dest_type
);
5647 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5648 (another pointer-to-member type in the same hierarchy) and return
5649 the converted expression. If ALLOW_INVERSE_P is permitted, a
5650 pointer-to-derived may be converted to pointer-to-base; otherwise,
5651 only the other direction is permitted. If C_CAST_P is true, this
5652 conversion is taking place as part of a C-style cast. */
5655 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5656 bool c_cast_p
, tsubst_flags_t complain
)
5658 if (TYPE_PTRMEM_P (type
))
5662 if (TREE_CODE (expr
) == PTRMEM_CST
)
5663 expr
= cplus_expand_constant (expr
);
5664 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5665 TYPE_PTRMEM_CLASS_TYPE (type
),
5667 c_cast_p
, complain
);
5668 if (delta
== error_mark_node
)
5669 return error_mark_node
;
5671 if (!integer_zerop (delta
))
5673 tree cond
, op1
, op2
;
5675 cond
= cp_build_binary_op (input_location
,
5678 build_int_cst (TREE_TYPE (expr
), -1),
5679 tf_warning_or_error
);
5680 op1
= build_nop (ptrdiff_type_node
, expr
);
5681 op2
= cp_build_binary_op (input_location
,
5682 PLUS_EXPR
, op1
, delta
,
5683 tf_warning_or_error
);
5685 expr
= fold_build3_loc (input_location
,
5686 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5690 return build_nop (type
, expr
);
5693 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5694 allow_inverse_p
, c_cast_p
, complain
);
5697 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5698 this static_cast is being attempted as one of the possible casts
5699 allowed by a C-style cast. (In that case, accessibility of base
5700 classes is not considered, and it is OK to cast away
5701 constness.) Return the result of the cast. *VALID_P is set to
5702 indicate whether or not the cast was valid. */
5705 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5706 bool *valid_p
, tsubst_flags_t complain
)
5711 /* Assume the cast is valid. */
5714 intype
= TREE_TYPE (expr
);
5716 /* Save casted types in the function's used types hash table. */
5717 used_types_insert (type
);
5719 /* [expr.static.cast]
5721 An lvalue of type "cv1 B", where B is a class type, can be cast
5722 to type "reference to cv2 D", where D is a class derived (clause
5723 _class.derived_) from B, if a valid standard conversion from
5724 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5725 same cv-qualification as, or greater cv-qualification than, cv1,
5726 and B is not a virtual base class of D. */
5727 /* We check this case before checking the validity of "TYPE t =
5728 EXPR;" below because for this case:
5731 struct D : public B { D(const B&); };
5733 void f() { static_cast<const D&>(b); }
5735 we want to avoid constructing a new D. The standard is not
5736 completely clear about this issue, but our interpretation is
5737 consistent with other compilers. */
5738 if (TREE_CODE (type
) == REFERENCE_TYPE
5739 && CLASS_TYPE_P (TREE_TYPE (type
))
5740 && CLASS_TYPE_P (intype
)
5741 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5742 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5743 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5744 build_pointer_type (TYPE_MAIN_VARIANT
5745 (TREE_TYPE (type
))))
5747 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5751 /* There is a standard conversion from "D*" to "B*" even if "B"
5752 is ambiguous or inaccessible. If this is really a
5753 static_cast, then we check both for inaccessibility and
5754 ambiguity. However, if this is a static_cast being performed
5755 because the user wrote a C-style cast, then accessibility is
5757 base
= lookup_base (TREE_TYPE (type
), intype
,
5758 c_cast_p
? ba_unique
: ba_check
,
5761 /* Convert from "B*" to "D*". This function will check that "B"
5762 is not a virtual base of "D". */
5763 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5764 base
, /*nonnull=*/false);
5765 /* Convert the pointer to a reference -- but then remember that
5766 there are no expressions with reference type in C++.
5768 We call rvalue so that there's an actual tree code
5769 (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
5770 is a variable with the same type, the conversion would get folded
5771 away, leaving just the variable and causing lvalue_kind to give
5772 the wrong answer. */
5773 return convert_from_reference (rvalue (cp_fold_convert (type
, expr
)));
5776 /* "A glvalue of type cv1 T1 can be cast to type rvalue reference to
5777 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5778 if (TREE_CODE (type
) == REFERENCE_TYPE
5779 && TYPE_REF_IS_RVALUE (type
)
5780 && lvalue_or_rvalue_with_address_p (expr
)
5781 && reference_related_p (TREE_TYPE (type
), intype
)
5782 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5784 expr
= build_typed_address (expr
, type
);
5785 return convert_from_reference (expr
);
5788 /* Resolve overloaded address here rather than once in
5789 implicit_conversion and again in the inverse code below. */
5790 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5792 expr
= instantiate_type (type
, expr
, complain
);
5793 intype
= TREE_TYPE (expr
);
5796 /* [expr.static.cast]
5798 An expression e can be explicitly converted to a type T using a
5799 static_cast of the form static_cast<T>(e) if the declaration T
5800 t(e);" is well-formed, for some invented temporary variable
5802 result
= perform_direct_initialization_if_possible (type
, expr
,
5803 c_cast_p
, complain
);
5806 result
= convert_from_reference (result
);
5808 /* [expr.static.cast]
5810 If T is a reference type, the result is an lvalue; otherwise,
5811 the result is an rvalue. */
5812 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5813 result
= rvalue (result
);
5817 /* [expr.static.cast]
5819 Any expression can be explicitly converted to type cv void. */
5820 if (TREE_CODE (type
) == VOID_TYPE
)
5821 return convert_to_void (expr
, ICV_CAST
, complain
);
5823 /* [expr.static.cast]
5825 The inverse of any standard conversion sequence (clause _conv_),
5826 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5827 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5828 (_conv.bool_) conversions, can be performed explicitly using
5829 static_cast subject to the restriction that the explicit
5830 conversion does not cast away constness (_expr.const.cast_), and
5831 the following additional rules for specific cases: */
5832 /* For reference, the conversions not excluded are: integral
5833 promotions, floating point promotion, integral conversions,
5834 floating point conversions, floating-integral conversions,
5835 pointer conversions, and pointer to member conversions. */
5838 A value of integral _or enumeration_ type can be explicitly
5839 converted to an enumeration type. */
5840 /* The effect of all that is that any conversion between any two
5841 types which are integral, floating, or enumeration types can be
5843 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5844 || SCALAR_FLOAT_TYPE_P (type
))
5845 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5846 || SCALAR_FLOAT_TYPE_P (intype
)))
5847 return ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5849 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5850 && CLASS_TYPE_P (TREE_TYPE (type
))
5851 && CLASS_TYPE_P (TREE_TYPE (intype
))
5852 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5853 (TREE_TYPE (intype
))),
5854 build_pointer_type (TYPE_MAIN_VARIANT
5855 (TREE_TYPE (type
)))))
5860 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
5862 return error_mark_node
;
5863 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
5864 c_cast_p
? ba_unique
: ba_check
,
5866 expr
= build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
5867 return cp_fold_convert(type
, expr
);
5870 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5871 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5878 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
5879 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
5881 if (TYPE_PTRMEM_P (type
))
5883 t1
= (build_ptrmem_type
5885 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
5886 t2
= (build_ptrmem_type
5888 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
5895 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
5898 && check_for_casting_away_constness (intype
, type
,
5901 return error_mark_node
;
5902 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
5903 c_cast_p
, complain
);
5907 /* [expr.static.cast]
5909 An rvalue of type "pointer to cv void" can be explicitly
5910 converted to a pointer to object type. A value of type pointer
5911 to object converted to "pointer to cv void" and back to the
5912 original pointer type will have its original value. */
5913 if (TREE_CODE (intype
) == POINTER_TYPE
5914 && VOID_TYPE_P (TREE_TYPE (intype
))
5915 && TYPE_PTROB_P (type
))
5918 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
5920 return error_mark_node
;
5921 return build_nop (type
, expr
);
5925 return error_mark_node
;
5928 /* Return an expression representing static_cast<TYPE>(EXPR). */
5931 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5936 if (type
== error_mark_node
|| expr
== error_mark_node
)
5937 return error_mark_node
;
5939 if (processing_template_decl
)
5941 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
5942 /* We don't know if it will or will not have side effects. */
5943 TREE_SIDE_EFFECTS (expr
) = 1;
5944 return convert_from_reference (expr
);
5947 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5948 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5949 if (TREE_CODE (type
) != REFERENCE_TYPE
5950 && TREE_CODE (expr
) == NOP_EXPR
5951 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5952 expr
= TREE_OPERAND (expr
, 0);
5954 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
5959 if (complain
& tf_error
)
5960 error ("invalid static_cast from type %qT to type %qT",
5961 TREE_TYPE (expr
), type
);
5962 return error_mark_node
;
5965 /* EXPR is an expression with member function or pointer-to-member
5966 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5967 not permitted by ISO C++, but we accept it in some modes. If we
5968 are not in one of those modes, issue a diagnostic. Return the
5969 converted expression. */
5972 convert_member_func_to_ptr (tree type
, tree expr
)
5977 intype
= TREE_TYPE (expr
);
5978 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
5979 || TREE_CODE (intype
) == METHOD_TYPE
);
5981 if (pedantic
|| warn_pmf2ptr
)
5982 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
5983 "converting from %qT to %qT", intype
, type
);
5985 if (TREE_CODE (intype
) == METHOD_TYPE
)
5986 expr
= build_addr_func (expr
);
5987 else if (TREE_CODE (expr
) == PTRMEM_CST
)
5988 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
5991 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
5992 decl
= build_address (decl
);
5993 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
5996 return build_nop (type
, expr
);
5999 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
6000 If C_CAST_P is true, this reinterpret cast is being done as part of
6001 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
6002 indicate whether or not reinterpret_cast was valid. */
6005 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6006 bool *valid_p
, tsubst_flags_t complain
)
6010 /* Assume the cast is invalid. */
6014 if (type
== error_mark_node
|| error_operand_p (expr
))
6015 return error_mark_node
;
6017 intype
= TREE_TYPE (expr
);
6019 /* Save casted types in the function's used types hash table. */
6020 used_types_insert (type
);
6022 /* [expr.reinterpret.cast]
6023 An lvalue expression of type T1 can be cast to the type
6024 "reference to T2" if an expression of type "pointer to T1" can be
6025 explicitly converted to the type "pointer to T2" using a
6026 reinterpret_cast. */
6027 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6029 if (! real_lvalue_p (expr
))
6031 if (complain
& tf_error
)
6032 error ("invalid cast of an rvalue expression of type "
6035 return error_mark_node
;
6038 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6039 "B" are related class types; the reinterpret_cast does not
6040 adjust the pointer. */
6041 if (TYPE_PTR_P (intype
)
6042 && (complain
& tf_warning
)
6043 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
6044 COMPARE_BASE
| COMPARE_DERIVED
)))
6045 warning (0, "casting %qT to %qT does not dereference pointer",
6048 expr
= cp_build_addr_expr (expr
, complain
);
6050 if (warn_strict_aliasing
> 2)
6051 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
6053 if (expr
!= error_mark_node
)
6054 expr
= build_reinterpret_cast_1
6055 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
6057 if (expr
!= error_mark_node
)
6058 /* cp_build_indirect_ref isn't right for rvalue refs. */
6059 expr
= convert_from_reference (fold_convert (type
, expr
));
6063 /* As a G++ extension, we consider conversions from member
6064 functions, and pointers to member functions to
6065 pointer-to-function and pointer-to-void types. If
6066 -Wno-pmf-conversions has not been specified,
6067 convert_member_func_to_ptr will issue an error message. */
6068 if ((TYPE_PTRMEMFUNC_P (intype
)
6069 || TREE_CODE (intype
) == METHOD_TYPE
)
6070 && TYPE_PTR_P (type
)
6071 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6072 || VOID_TYPE_P (TREE_TYPE (type
))))
6073 return convert_member_func_to_ptr (type
, expr
);
6075 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6076 array-to-pointer, and function-to-pointer conversions are
6078 expr
= decay_conversion (expr
);
6080 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6081 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6082 if (TREE_CODE (expr
) == NOP_EXPR
6083 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6084 expr
= TREE_OPERAND (expr
, 0);
6086 if (error_operand_p (expr
))
6087 return error_mark_node
;
6089 intype
= TREE_TYPE (expr
);
6091 /* [expr.reinterpret.cast]
6092 A pointer can be converted to any integral type large enough to
6093 hold it. ... A value of type std::nullptr_t can be converted to
6094 an integral type; the conversion has the same meaning and
6095 validity as a conversion of (void*)0 to the integral type. */
6096 if (CP_INTEGRAL_TYPE_P (type
)
6097 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
6099 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
6101 if (complain
& tf_error
)
6102 permerror (input_location
, "cast from %qT to %qT loses precision",
6105 return error_mark_node
;
6107 if (NULLPTR_TYPE_P (intype
))
6108 return build_int_cst (type
, 0);
6110 /* [expr.reinterpret.cast]
6111 A value of integral or enumeration type can be explicitly
6112 converted to a pointer. */
6113 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6116 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6117 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6118 return fold_if_not_in_template (build_nop (type
, expr
));
6119 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6120 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6125 && check_for_casting_away_constness (intype
, type
,
6126 REINTERPRET_CAST_EXPR
,
6128 return error_mark_node
;
6129 /* Warn about possible alignment problems. */
6130 if (STRICT_ALIGNMENT
&& warn_cast_align
6131 && (complain
& tf_warning
)
6132 && !VOID_TYPE_P (type
)
6133 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6134 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6135 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6136 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6137 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6138 "increases required alignment of target type", intype
, type
);
6140 /* We need to strip nops here, because the front end likes to
6141 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6143 if (warn_strict_aliasing
<= 2)
6144 strict_aliasing_warning (intype
, type
, sexpr
);
6146 return fold_if_not_in_template (build_nop (type
, expr
));
6148 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6149 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6151 if (pedantic
&& (complain
& tf_warning
))
6152 /* Only issue a warning, as we have always supported this
6153 where possible, and it is necessary in some cases. DR 195
6154 addresses this issue, but as of 2004/10/26 is still in
6156 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6157 return fold_if_not_in_template (build_nop (type
, expr
));
6159 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6160 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6161 else if (TREE_CODE (intype
) == VECTOR_TYPE
6162 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6163 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6168 if (complain
& tf_error
)
6169 error ("invalid cast from type %qT to type %qT", intype
, type
);
6170 return error_mark_node
;
6173 return cp_convert (type
, expr
);
6177 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6179 if (type
== error_mark_node
|| expr
== error_mark_node
)
6180 return error_mark_node
;
6182 if (processing_template_decl
)
6184 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6186 if (!TREE_SIDE_EFFECTS (t
)
6187 && type_dependent_expression_p (expr
))
6188 /* There might turn out to be side effects inside expr. */
6189 TREE_SIDE_EFFECTS (t
) = 1;
6190 return convert_from_reference (t
);
6193 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6194 /*valid_p=*/NULL
, complain
);
6197 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6198 return an appropriate expression. Otherwise, return
6199 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6200 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6201 performing a C-style cast, its value upon return will indicate
6202 whether or not the conversion succeeded. */
6205 build_const_cast_1 (tree dst_type
, tree expr
, tsubst_flags_t complain
,
6209 tree reference_type
;
6211 /* Callers are responsible for handling error_mark_node as a
6212 destination type. */
6213 gcc_assert (dst_type
!= error_mark_node
);
6214 /* In a template, callers should be building syntactic
6215 representations of casts, not using this machinery. */
6216 gcc_assert (!processing_template_decl
);
6218 /* Assume the conversion is invalid. */
6222 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6224 if (complain
& tf_error
)
6225 error ("invalid use of const_cast with type %qT, "
6226 "which is not a pointer, "
6227 "reference, nor a pointer-to-data-member type", dst_type
);
6228 return error_mark_node
;
6231 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6233 if (complain
& tf_error
)
6234 error ("invalid use of const_cast with type %qT, which is a pointer "
6235 "or reference to a function type", dst_type
);
6236 return error_mark_node
;
6239 /* Save casted types in the function's used types hash table. */
6240 used_types_insert (dst_type
);
6242 src_type
= TREE_TYPE (expr
);
6243 /* Expressions do not really have reference types. */
6244 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6245 src_type
= TREE_TYPE (src_type
);
6247 /* [expr.const.cast]
6249 For two object types T1 and T2, if a pointer to T1 can be explicitly
6250 converted to the type "pointer to T2" using a const_cast, then the
6251 following conversions can also be made:
6253 -- an lvalue of type T1 can be explicitly converted to an lvalue of
6254 type T2 using the cast const_cast<T2&>;
6256 -- a glvalue of type T1 can be explicitly converted to an xvalue of
6257 type T2 using the cast const_cast<T2&&>; and
6259 -- if T1 is a class type, a prvalue of type T1 can be explicitly
6260 converted to an xvalue of type T2 using the cast const_cast<T2&&>. */
6262 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6264 reference_type
= dst_type
;
6265 if (!TYPE_REF_IS_RVALUE (dst_type
)
6266 ? real_lvalue_p (expr
)
6267 : (CLASS_TYPE_P (TREE_TYPE (dst_type
))
6269 : lvalue_or_rvalue_with_address_p (expr
)))
6273 if (complain
& tf_error
)
6274 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6275 src_type
, dst_type
);
6276 return error_mark_node
;
6278 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6279 src_type
= build_pointer_type (src_type
);
6283 reference_type
= NULL_TREE
;
6284 /* If the destination type is not a reference type, the
6285 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6286 conversions are performed. */
6287 src_type
= type_decays_to (src_type
);
6288 if (src_type
== error_mark_node
)
6289 return error_mark_node
;
6292 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6293 && comp_ptr_ttypes_const (dst_type
, src_type
))
6298 /* This cast is actually a C-style cast. Issue a warning if
6299 the user is making a potentially unsafe cast. */
6300 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
,
6305 expr
= cp_build_addr_expr (expr
, complain
);
6306 expr
= build_nop (reference_type
, expr
);
6307 return convert_from_reference (expr
);
6311 expr
= decay_conversion (expr
);
6312 /* build_c_cast puts on a NOP_EXPR to make the result not an
6313 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6314 non-lvalue context. */
6315 if (TREE_CODE (expr
) == NOP_EXPR
6316 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6317 expr
= TREE_OPERAND (expr
, 0);
6318 return build_nop (dst_type
, expr
);
6322 if (complain
& tf_error
)
6323 error ("invalid const_cast from type %qT to type %qT",
6324 src_type
, dst_type
);
6325 return error_mark_node
;
6329 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6331 if (type
== error_mark_node
|| error_operand_p (expr
))
6332 return error_mark_node
;
6334 if (processing_template_decl
)
6336 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6338 if (!TREE_SIDE_EFFECTS (t
)
6339 && type_dependent_expression_p (expr
))
6340 /* There might turn out to be side effects inside expr. */
6341 TREE_SIDE_EFFECTS (t
) = 1;
6342 return convert_from_reference (t
);
6345 return build_const_cast_1 (type
, expr
, complain
,
6349 /* Like cp_build_c_cast, but for the c-common bits. */
6352 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6354 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6357 /* Build an expression representing an explicit C-style cast to type
6358 TYPE of expression EXPR. */
6361 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6367 if (type
== error_mark_node
|| error_operand_p (expr
))
6368 return error_mark_node
;
6370 if (processing_template_decl
)
6372 tree t
= build_min (CAST_EXPR
, type
,
6373 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6374 /* We don't know if it will or will not have side effects. */
6375 TREE_SIDE_EFFECTS (t
) = 1;
6376 return convert_from_reference (t
);
6379 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6380 'Class') should always be retained, because this information aids
6381 in method lookup. */
6382 if (objc_is_object_ptr (type
)
6383 && objc_is_object_ptr (TREE_TYPE (expr
)))
6384 return build_nop (type
, expr
);
6386 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6387 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6388 if (TREE_CODE (type
) != REFERENCE_TYPE
6389 && TREE_CODE (value
) == NOP_EXPR
6390 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6391 value
= TREE_OPERAND (value
, 0);
6393 if (TREE_CODE (type
) == ARRAY_TYPE
)
6395 /* Allow casting from T1* to T2[] because Cfront allows it.
6396 NIHCL uses it. It is not valid ISO C++ however. */
6397 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6399 if (complain
& tf_error
)
6400 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6402 return error_mark_node
;
6403 type
= build_pointer_type (TREE_TYPE (type
));
6407 if (complain
& tf_error
)
6408 error ("ISO C++ forbids casting to an array type %qT", type
);
6409 return error_mark_node
;
6413 if (TREE_CODE (type
) == FUNCTION_TYPE
6414 || TREE_CODE (type
) == METHOD_TYPE
)
6416 if (complain
& tf_error
)
6417 error ("invalid cast to function type %qT", type
);
6418 return error_mark_node
;
6421 if (TREE_CODE (type
) == POINTER_TYPE
6422 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
6423 /* Casting to an integer of smaller size is an error detected elsewhere. */
6424 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
6425 /* Don't warn about converting any constant. */
6426 && !TREE_CONSTANT (value
))
6427 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
6428 "cast to pointer from integer of different size");
6430 /* A C-style cast can be a const_cast. */
6431 result
= build_const_cast_1 (type
, value
, complain
& tf_warning
,
6436 /* Or a static cast. */
6437 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6438 &valid_p
, complain
);
6439 /* Or a reinterpret_cast. */
6441 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6442 &valid_p
, complain
);
6443 /* The static_cast or reinterpret_cast may be followed by a
6446 /* A valid cast may result in errors if, for example, a
6447 conversion to am ambiguous base class is required. */
6448 && !error_operand_p (result
))
6452 /* Non-class rvalues always have cv-unqualified type. */
6453 if (!CLASS_TYPE_P (type
))
6454 type
= TYPE_MAIN_VARIANT (type
);
6455 result_type
= TREE_TYPE (result
);
6456 if (!CLASS_TYPE_P (result_type
) && TREE_CODE (type
) != REFERENCE_TYPE
)
6457 result_type
= TYPE_MAIN_VARIANT (result_type
);
6458 /* If the type of RESULT does not match TYPE, perform a
6459 const_cast to make it match. If the static_cast or
6460 reinterpret_cast succeeded, we will differ by at most
6461 cv-qualification, so the follow-on const_cast is guaranteed
6463 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6465 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6466 gcc_assert (valid_p
);
6471 return error_mark_node
;
6474 /* For use from the C common bits. */
6476 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6477 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6478 enum tree_code modifycode
,
6479 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6480 tree rhs_origtype ATTRIBUTE_UNUSED
)
6482 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6485 /* Build an assignment expression of lvalue LHS from value RHS.
6486 MODIFYCODE is the code for a binary operator that we use
6487 to combine the old value of LHS with RHS to get the new value.
6488 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6490 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6493 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6494 tsubst_flags_t complain
)
6498 tree lhstype
= TREE_TYPE (lhs
);
6499 tree olhstype
= lhstype
;
6500 bool plain_assign
= (modifycode
== NOP_EXPR
);
6502 /* Avoid duplicate error messages from operands that had errors. */
6503 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6504 return error_mark_node
;
6506 /* Handle control structure constructs used as "lvalues". */
6507 switch (TREE_CODE (lhs
))
6509 /* Handle --foo = 5; as these are valid constructs in C++. */
6510 case PREDECREMENT_EXPR
:
6511 case PREINCREMENT_EXPR
:
6512 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6513 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6514 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6515 TREE_OPERAND (lhs
, 1));
6516 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6517 modifycode
, rhs
, complain
);
6518 if (newrhs
== error_mark_node
)
6519 return error_mark_node
;
6520 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6522 /* Handle (a, b) used as an "lvalue". */
6524 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6525 modifycode
, rhs
, complain
);
6526 if (newrhs
== error_mark_node
)
6527 return error_mark_node
;
6528 return build2 (COMPOUND_EXPR
, lhstype
,
6529 TREE_OPERAND (lhs
, 0), newrhs
);
6532 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6533 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6534 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6535 TREE_OPERAND (lhs
, 1));
6536 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6538 if (newrhs
== error_mark_node
)
6539 return error_mark_node
;
6540 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6544 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6545 when neither operand has side-effects. */
6546 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6547 return error_mark_node
;
6549 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6550 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6552 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6553 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6555 TREE_OPERAND (lhs
, 0),
6556 TREE_OPERAND (lhs
, 1)),
6557 TREE_OPERAND (lhs
, 0),
6558 TREE_OPERAND (lhs
, 1));
6561 /* Handle (a ? b : c) used as an "lvalue". */
6564 /* Produce (a ? (b = rhs) : (c = rhs))
6565 except that the RHS goes through a save-expr
6566 so the code to compute it is only emitted once. */
6568 tree preeval
= NULL_TREE
;
6570 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6572 if (complain
& tf_error
)
6573 error ("void value not ignored as it ought to be");
6574 return error_mark_node
;
6577 rhs
= stabilize_expr (rhs
, &preeval
);
6579 /* Check this here to avoid odd errors when trying to convert
6580 a throw to the type of the COND_EXPR. */
6581 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6582 return error_mark_node
;
6584 cond
= build_conditional_expr
6585 (TREE_OPERAND (lhs
, 0),
6586 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6587 modifycode
, rhs
, complain
),
6588 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6589 modifycode
, rhs
, complain
),
6592 if (cond
== error_mark_node
)
6594 /* Make sure the code to compute the rhs comes out
6595 before the split. */
6597 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6605 if (modifycode
== INIT_EXPR
)
6607 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6608 /* Do the default thing. */;
6609 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6611 /* Compound literal. */
6612 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6613 /* Call convert to generate an error; see PR 11063. */
6614 rhs
= convert (lhstype
, rhs
);
6615 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6616 TREE_SIDE_EFFECTS (result
) = 1;
6619 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6620 /* Do the default thing. */;
6623 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6624 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6625 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6627 release_tree_vector (rhs_vec
);
6628 if (result
== NULL_TREE
)
6629 return error_mark_node
;
6635 lhs
= require_complete_type_sfinae (lhs
, complain
);
6636 if (lhs
== error_mark_node
)
6637 return error_mark_node
;
6639 if (modifycode
== NOP_EXPR
)
6641 if (c_dialect_objc ())
6643 result
= objc_maybe_build_modify_expr (lhs
, rhs
);
6648 /* `operator=' is not an inheritable operator. */
6649 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6650 /* Do the default thing. */;
6653 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6654 lhs
, rhs
, make_node (NOP_EXPR
),
6657 if (result
== NULL_TREE
)
6658 return error_mark_node
;
6665 /* A binary op has been requested. Combine the old LHS
6666 value with the RHS producing the value we should actually
6667 store into the LHS. */
6668 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6669 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6670 || MAYBE_CLASS_TYPE_P (lhstype
)));
6672 lhs
= stabilize_reference (lhs
);
6673 newrhs
= cp_build_binary_op (input_location
,
6674 modifycode
, lhs
, rhs
,
6676 if (newrhs
== error_mark_node
)
6678 if (complain
& tf_error
)
6679 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6680 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6681 return error_mark_node
;
6684 /* Now it looks like a plain assignment. */
6685 modifycode
= NOP_EXPR
;
6686 if (c_dialect_objc ())
6688 result
= objc_maybe_build_modify_expr (lhs
, newrhs
);
6693 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6694 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6697 /* The left-hand side must be an lvalue. */
6698 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6699 return error_mark_node
;
6701 /* Warn about modifying something that is `const'. Don't warn if
6702 this is initialization. */
6703 if (modifycode
!= INIT_EXPR
6704 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6705 /* Functions are not modifiable, even though they are
6707 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6708 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6709 /* If it's an aggregate and any field is const, then it is
6710 effectively const. */
6711 || (CLASS_TYPE_P (lhstype
)
6712 && C_TYPE_FIELDS_READONLY (lhstype
))))
6714 if (complain
& tf_error
)
6715 cxx_readonly_error (lhs
, lv_assign
);
6717 return error_mark_node
;
6720 /* If storing into a structure or union member, it may have been given a
6721 lowered bitfield type. We need to convert to the declared type first,
6722 so retrieve it now. */
6724 olhstype
= unlowered_expr_type (lhs
);
6726 /* Convert new value to destination type. */
6728 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6732 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6734 if (modifycode
!= INIT_EXPR
)
6736 if (complain
& tf_error
)
6737 error ("assigning to an array from an initializer list");
6738 return error_mark_node
;
6740 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6741 return error_mark_node
;
6742 newrhs
= digest_init (lhstype
, newrhs
, complain
);
6745 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6746 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6748 if (complain
& tf_error
)
6749 error ("incompatible types in assignment of %qT to %qT",
6750 TREE_TYPE (rhs
), lhstype
);
6751 return error_mark_node
;
6754 /* Allow array assignment in compiler-generated code. */
6755 else if (!current_function_decl
6756 || !DECL_DEFAULTED_FN (current_function_decl
))
6758 /* This routine is used for both initialization and assignment.
6759 Make sure the diagnostic message differentiates the context. */
6760 if (complain
& tf_error
)
6762 if (modifycode
== INIT_EXPR
)
6763 error ("array used as initializer");
6765 error ("invalid array assignment");
6767 return error_mark_node
;
6770 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6771 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6772 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6773 /*explicit_value_init_p=*/false,
6774 from_array
, complain
);
6777 if (modifycode
== INIT_EXPR
)
6778 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6779 LOOKUP_ONLYCONVERTING. */
6780 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6781 ICR_INIT
, NULL_TREE
, 0,
6784 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
6785 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6787 if (!same_type_p (lhstype
, olhstype
))
6788 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6790 if (modifycode
!= INIT_EXPR
)
6792 if (TREE_CODE (newrhs
) == CALL_EXPR
6793 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6794 newrhs
= build_cplus_new (lhstype
, newrhs
, complain
);
6796 /* Can't initialize directly from a TARGET_EXPR, since that would
6797 cause the lhs to be constructed twice, and possibly result in
6798 accidental self-initialization. So we force the TARGET_EXPR to be
6799 expanded without a target. */
6800 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6801 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6802 TREE_OPERAND (newrhs
, 0));
6805 if (newrhs
== error_mark_node
)
6806 return error_mark_node
;
6808 if (c_dialect_objc () && flag_objc_gc
)
6810 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6816 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6817 lhstype
, lhs
, newrhs
);
6819 TREE_SIDE_EFFECTS (result
) = 1;
6821 TREE_NO_WARNING (result
) = 1;
6827 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6828 tsubst_flags_t complain
)
6830 if (processing_template_decl
)
6831 return build_min_nt (MODOP_EXPR
, lhs
,
6832 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6834 if (modifycode
!= NOP_EXPR
)
6836 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6837 make_node (modifycode
),
6842 TREE_NO_WARNING (rval
) = 1;
6846 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6849 /* Helper function for get_delta_difference which assumes FROM is a base
6850 class of TO. Returns a delta for the conversion of pointer-to-member
6851 of FROM to pointer-to-member of TO. If the conversion is invalid and
6852 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
6853 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6854 If C_CAST_P is true, this conversion is taking place as part of a
6858 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
,
6859 tsubst_flags_t complain
)
6863 base_access access
= c_cast_p
? ba_unique
: ba_check
;
6865 /* Note: ba_quiet does not distinguish between access control and
6867 if (!(complain
& tf_error
))
6870 binfo
= lookup_base (to
, from
, access
, &kind
);
6872 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6874 if (!(complain
& tf_error
))
6875 return error_mark_node
;
6877 error (" in pointer to member function conversion");
6878 return size_zero_node
;
6882 if (kind
!= bk_via_virtual
)
6883 return BINFO_OFFSET (binfo
);
6885 /* FROM is a virtual base class of TO. Issue an error or warning
6886 depending on whether or not this is a reinterpret cast. */
6888 if (!(complain
& tf_error
))
6889 return error_mark_node
;
6891 error ("pointer to member conversion via virtual base %qT",
6892 BINFO_TYPE (binfo_from_vbase (binfo
)));
6894 return size_zero_node
;
6901 /* Get difference in deltas for different pointer to member function
6902 types. If the conversion is invalid and tf_error is not set in
6903 COMPLAIN, returns error_mark_node, otherwise returns an integer
6904 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
6905 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
6906 conversions as well. If C_CAST_P is true this conversion is taking
6907 place as part of a C-style cast.
6909 Note that the naming of FROM and TO is kind of backwards; the return
6910 value is what we add to a TO in order to get a FROM. They are named
6911 this way because we call this function to find out how to convert from
6912 a pointer to member of FROM to a pointer to member of TO. */
6915 get_delta_difference (tree from
, tree to
,
6916 bool allow_inverse_p
,
6917 bool c_cast_p
, tsubst_flags_t complain
)
6921 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
6922 /* Pointer to member of incomplete class is permitted*/
6923 result
= size_zero_node
;
6925 result
= get_delta_difference_1 (from
, to
, c_cast_p
, complain
);
6927 if (result
== error_mark_node
)
6928 return error_mark_node
;
6932 if (!allow_inverse_p
)
6934 if (!(complain
& tf_error
))
6935 return error_mark_node
;
6937 error_not_base_type (from
, to
);
6938 error (" in pointer to member conversion");
6939 result
= size_zero_node
;
6943 result
= get_delta_difference_1 (to
, from
, c_cast_p
, complain
);
6945 if (result
== error_mark_node
)
6946 return error_mark_node
;
6949 result
= size_diffop_loc (input_location
,
6950 size_zero_node
, result
);
6953 if (!(complain
& tf_error
))
6954 return error_mark_node
;
6956 error_not_base_type (from
, to
);
6957 error (" in pointer to member conversion");
6958 result
= size_zero_node
;
6963 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
6967 /* Return a constructor for the pointer-to-member-function TYPE using
6968 the other components as specified. */
6971 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
6976 VEC(constructor_elt
, gc
) *v
;
6978 /* Pull the FIELD_DECLs out of the type. */
6979 pfn_field
= TYPE_FIELDS (type
);
6980 delta_field
= DECL_CHAIN (pfn_field
);
6982 /* Make sure DELTA has the type we want. */
6983 delta
= convert_and_check (delta_type_node
, delta
);
6985 /* Convert to the correct target type if necessary. */
6986 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
6988 /* Finish creating the initializer. */
6989 v
= VEC_alloc(constructor_elt
, gc
, 2);
6990 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
6991 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
6992 u
= build_constructor (type
, v
);
6993 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
6994 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
6995 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
6997 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
7002 /* Build a constructor for a pointer to member function. It can be
7003 used to initialize global variables, local variable, or used
7004 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
7007 If FORCE is nonzero, then force this conversion, even if
7008 we would rather not do it. Usually set when using an explicit
7009 cast. A C-style cast is being processed iff C_CAST_P is true.
7011 Return error_mark_node, if something goes wrong. */
7014 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
,
7015 tsubst_flags_t complain
)
7021 if (error_operand_p (pfn
))
7022 return error_mark_node
;
7024 pfn_type
= TREE_TYPE (pfn
);
7025 to_type
= build_ptrmemfunc_type (type
);
7027 /* Handle multiple conversions of pointer to member functions. */
7028 if (TYPE_PTRMEMFUNC_P (pfn_type
))
7030 tree delta
= NULL_TREE
;
7031 tree npfn
= NULL_TREE
;
7035 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
7036 error ("invalid conversion to type %qT from type %qT",
7039 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
7040 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
7042 c_cast_p
, complain
);
7043 if (n
== error_mark_node
)
7044 return error_mark_node
;
7046 /* We don't have to do any conversion to convert a
7047 pointer-to-member to its own type. But, we don't want to
7048 just return a PTRMEM_CST if there's an explicit cast; that
7049 cast should make the expression an invalid template argument. */
7050 if (TREE_CODE (pfn
) != PTRMEM_CST
)
7052 if (same_type_p (to_type
, pfn_type
))
7054 else if (integer_zerop (n
))
7055 return build_reinterpret_cast (to_type
, pfn
,
7056 tf_warning_or_error
);
7059 if (TREE_SIDE_EFFECTS (pfn
))
7060 pfn
= save_expr (pfn
);
7062 /* Obtain the function pointer and the current DELTA. */
7063 if (TREE_CODE (pfn
) == PTRMEM_CST
)
7064 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
7067 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
7068 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
7071 /* Just adjust the DELTA field. */
7072 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7073 (TREE_TYPE (delta
), ptrdiff_type_node
));
7074 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
7075 n
= cp_build_binary_op (input_location
,
7076 LSHIFT_EXPR
, n
, integer_one_node
,
7077 tf_warning_or_error
);
7078 delta
= cp_build_binary_op (input_location
,
7079 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
7080 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
7083 /* Handle null pointer to member function conversions. */
7084 if (null_ptr_cst_p (pfn
))
7086 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
7087 return build_ptrmemfunc1 (to_type
,
7092 if (type_unknown_p (pfn
))
7093 return instantiate_type (type
, pfn
, tf_warning_or_error
);
7095 fn
= TREE_OPERAND (pfn
, 0);
7096 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7097 /* In a template, we will have preserved the
7099 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
7100 return make_ptrmem_cst (to_type
, fn
);
7103 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7106 ??? There is no consistency as to the types returned for the above
7107 values. Some code acts as if it were a sizetype and some as if it were
7108 integer_type_node. */
7111 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
7113 tree type
= TREE_TYPE (cst
);
7114 tree fn
= PTRMEM_CST_MEMBER (cst
);
7115 tree ptr_class
, fn_class
;
7117 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7119 /* The class that the function belongs to. */
7120 fn_class
= DECL_CONTEXT (fn
);
7122 /* The class that we're creating a pointer to member of. */
7123 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
7125 /* First, calculate the adjustment to the function's class. */
7126 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
7127 /*c_cast_p=*/0, tf_warning_or_error
);
7129 if (!DECL_VIRTUAL_P (fn
))
7130 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
7133 /* If we're dealing with a virtual function, we have to adjust 'this'
7134 again, to point to the base which provides the vtable entry for
7135 fn; the call will do the opposite adjustment. */
7136 tree orig_class
= DECL_CONTEXT (fn
);
7137 tree binfo
= binfo_or_else (orig_class
, fn_class
);
7138 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7139 *delta
, BINFO_OFFSET (binfo
));
7140 *delta
= fold_if_not_in_template (*delta
);
7142 /* We set PFN to the vtable offset at which the function can be
7143 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7144 case delta is shifted left, and then incremented). */
7145 *pfn
= DECL_VINDEX (fn
);
7146 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
7147 TYPE_SIZE_UNIT (vtable_entry_type
));
7148 *pfn
= fold_if_not_in_template (*pfn
);
7150 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
7152 case ptrmemfunc_vbit_in_pfn
:
7153 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
7155 *pfn
= fold_if_not_in_template (*pfn
);
7158 case ptrmemfunc_vbit_in_delta
:
7159 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
7160 *delta
, integer_one_node
);
7161 *delta
= fold_if_not_in_template (*delta
);
7162 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7163 *delta
, integer_one_node
);
7164 *delta
= fold_if_not_in_template (*delta
);
7171 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
7172 *pfn
= fold_if_not_in_template (*pfn
);
7176 /* Return an expression for PFN from the pointer-to-member function
7180 pfn_from_ptrmemfunc (tree t
)
7182 if (TREE_CODE (t
) == PTRMEM_CST
)
7187 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7192 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
7195 /* Return an expression for DELTA from the pointer-to-member function
7199 delta_from_ptrmemfunc (tree t
)
7201 if (TREE_CODE (t
) == PTRMEM_CST
)
7206 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7211 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7214 /* Convert value RHS to type TYPE as preparation for an assignment to
7215 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
7216 implicit conversion is. If FNDECL is non-NULL, we are doing the
7217 conversion in order to pass the PARMNUMth argument of FNDECL.
7218 If FNDECL is NULL, we are doing the conversion in function pointer
7219 argument passing, conversion in initialization, etc. */
7222 convert_for_assignment (tree type
, tree rhs
,
7223 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7224 tsubst_flags_t complain
, int flags
)
7227 enum tree_code coder
;
7229 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7230 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7231 rhs
= TREE_OPERAND (rhs
, 0);
7233 rhstype
= TREE_TYPE (rhs
);
7234 coder
= TREE_CODE (rhstype
);
7236 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7237 && vector_types_convertible_p (type
, rhstype
, true))
7239 rhs
= mark_rvalue_use (rhs
);
7240 return convert (type
, rhs
);
7243 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7244 return error_mark_node
;
7245 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7246 return error_mark_node
;
7248 /* The RHS of an assignment cannot have void type. */
7249 if (coder
== VOID_TYPE
)
7251 if (complain
& tf_error
)
7252 error ("void value not ignored as it ought to be");
7253 return error_mark_node
;
7256 /* Simplify the RHS if possible. */
7257 if (TREE_CODE (rhs
) == CONST_DECL
)
7258 rhs
= DECL_INITIAL (rhs
);
7260 if (c_dialect_objc ())
7264 tree rname
= fndecl
;
7275 selector
= objc_message_selector ();
7277 if (selector
&& parmno
> 1)
7284 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7286 rhs
= mark_rvalue_use (rhs
);
7287 return convert (type
, rhs
);
7293 The expression is implicitly converted (clause _conv_) to the
7294 cv-unqualified type of the left operand.
7296 We allow bad conversions here because by the time we get to this point
7297 we are committed to doing the conversion. If we end up doing a bad
7298 conversion, convert_like will complain. */
7299 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7301 /* When -Wno-pmf-conversions is use, we just silently allow
7302 conversions from pointers-to-members to plain pointers. If
7303 the conversion doesn't work, cp_convert will complain. */
7305 && TYPE_PTR_P (type
)
7306 && TYPE_PTRMEMFUNC_P (rhstype
))
7307 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7310 if (complain
& tf_error
)
7312 /* If the right-hand side has unknown type, then it is an
7313 overloaded function. Call instantiate_type to get error
7315 if (rhstype
== unknown_type_node
)
7316 instantiate_type (type
, rhs
, tf_warning_or_error
);
7318 error ("cannot convert %qT to %qT for argument %qP to %qD",
7319 rhstype
, type
, parmnum
, fndecl
);
7323 case ICR_DEFAULT_ARGUMENT
:
7324 error ("cannot convert %qT to %qT in default argument",
7328 error ("cannot convert %qT to %qT in argument passing",
7331 case ICR_CONVERTING
:
7332 error ("cannot convert %qT to %qT",
7336 error ("cannot convert %qT to %qT in initialization",
7340 error ("cannot convert %qT to %qT in return",
7344 error ("cannot convert %qT to %qT in assignment",
7351 return error_mark_node
;
7354 if (warn_missing_format_attribute
)
7356 const enum tree_code codel
= TREE_CODE (type
);
7357 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7359 && check_missing_format_attribute (type
, rhstype
)
7360 && (complain
& tf_warning
))
7364 case ICR_DEFAULT_ARGUMENT
:
7366 warning (OPT_Wmissing_format_attribute
,
7367 "parameter %qP of %qD might be a candidate "
7368 "for a format attribute", parmnum
, fndecl
);
7370 warning (OPT_Wmissing_format_attribute
,
7371 "parameter might be a candidate "
7372 "for a format attribute");
7374 case ICR_CONVERTING
:
7375 warning (OPT_Wmissing_format_attribute
,
7376 "target of conversion might be a candidate "
7377 "for a format attribute");
7380 warning (OPT_Wmissing_format_attribute
,
7381 "target of initialization might be a candidate "
7382 "for a format attribute");
7385 warning (OPT_Wmissing_format_attribute
,
7386 "return type might be a candidate "
7387 "for a format attribute");
7390 warning (OPT_Wmissing_format_attribute
,
7391 "left-hand side of assignment might be a candidate "
7392 "for a format attribute");
7399 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7401 if (warn_parentheses
7402 && TREE_CODE (type
) == BOOLEAN_TYPE
7403 && TREE_CODE (rhs
) == MODIFY_EXPR
7404 && !TREE_NO_WARNING (rhs
)
7405 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7406 && (complain
& tf_warning
))
7408 location_t loc
= EXPR_LOC_OR_HERE (rhs
);
7410 warning_at (loc
, OPT_Wparentheses
,
7411 "suggest parentheses around assignment used as truth value");
7412 TREE_NO_WARNING (rhs
) = 1;
7415 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7419 /* Convert RHS to be of type TYPE.
7420 If EXP is nonzero, it is the target of the initialization.
7421 ERRTYPE indicates what kind of error the implicit conversion is.
7423 Two major differences between the behavior of
7424 `convert_for_assignment' and `convert_for_initialization'
7425 are that references are bashed in the former, while
7426 copied in the latter, and aggregates are assigned in
7427 the former (operator=) while initialized in the
7430 If using constructor make sure no conversion operator exists, if one does
7431 exist, an ambiguity exists.
7433 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7436 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7437 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7438 tsubst_flags_t complain
)
7440 enum tree_code codel
= TREE_CODE (type
);
7442 enum tree_code coder
;
7444 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7445 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7446 if (TREE_CODE (rhs
) == NOP_EXPR
7447 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7448 && codel
!= REFERENCE_TYPE
)
7449 rhs
= TREE_OPERAND (rhs
, 0);
7451 if (type
== error_mark_node
7452 || rhs
== error_mark_node
7453 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7454 return error_mark_node
;
7456 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7457 && TREE_CODE (type
) != ARRAY_TYPE
7458 && (TREE_CODE (type
) != REFERENCE_TYPE
7459 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7460 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7461 && (TREE_CODE (type
) != REFERENCE_TYPE
7462 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7463 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7464 rhs
= decay_conversion (rhs
);
7466 rhstype
= TREE_TYPE (rhs
);
7467 coder
= TREE_CODE (rhstype
);
7469 if (coder
== ERROR_MARK
)
7470 return error_mark_node
;
7472 /* We accept references to incomplete types, so we can
7473 return here before checking if RHS is of complete type. */
7475 if (codel
== REFERENCE_TYPE
)
7477 /* This should eventually happen in convert_arguments. */
7478 int savew
= 0, savee
= 0;
7481 savew
= warningcount
, savee
= errorcount
;
7482 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7483 /*cleanup=*/NULL
, complain
);
7486 if (warningcount
> savew
)
7487 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7488 else if (errorcount
> savee
)
7489 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7495 exp
= require_complete_type_sfinae (exp
, complain
);
7496 if (exp
== error_mark_node
)
7497 return error_mark_node
;
7499 rhstype
= non_reference (rhstype
);
7501 type
= complete_type (type
);
7503 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7504 /* Don't try to do copy-initialization if we already have
7505 direct-initialization. */
7508 if (MAYBE_CLASS_TYPE_P (type
))
7509 return perform_implicit_conversion_flags (type
, rhs
, complain
, flags
);
7511 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7515 /* If RETVAL is the address of, or a reference to, a local variable or
7516 temporary give an appropriate warning. */
7519 maybe_warn_about_returning_address_of_local (tree retval
)
7521 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7522 tree whats_returned
= retval
;
7526 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7527 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7528 else if (CONVERT_EXPR_P (whats_returned
)
7529 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7530 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7535 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7537 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7539 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7541 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7542 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7544 warning (0, "returning reference to temporary");
7547 if (TREE_CODE (whats_returned
) == VAR_DECL
7548 && DECL_NAME (whats_returned
)
7549 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7551 warning (0, "reference to non-lvalue returned");
7556 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7557 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7558 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7560 if (DECL_P (whats_returned
)
7561 && DECL_NAME (whats_returned
)
7562 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7563 && !(TREE_STATIC (whats_returned
)
7564 || TREE_PUBLIC (whats_returned
)))
7566 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7567 warning (0, "reference to local variable %q+D returned",
7570 warning (0, "address of local variable %q+D returned",
7576 /* Check that returning RETVAL from the current function is valid.
7577 Return an expression explicitly showing all conversions required to
7578 change RETVAL into the function return type, and to assign it to
7579 the DECL_RESULT for the function. Set *NO_WARNING to true if
7580 code reaches end of non-void function warning shouldn't be issued
7581 on this RETURN_EXPR. */
7584 check_return_expr (tree retval
, bool *no_warning
)
7587 /* The type actually returned by the function, after any
7590 int fn_returns_value_p
;
7591 bool named_return_value_okay_p
;
7593 *no_warning
= false;
7595 /* A `volatile' function is one that isn't supposed to return, ever.
7596 (This is a G++ extension, used to get better code for functions
7597 that call the `volatile' function.) */
7598 if (TREE_THIS_VOLATILE (current_function_decl
))
7599 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7601 /* Check for various simple errors. */
7602 if (DECL_DESTRUCTOR_P (current_function_decl
))
7605 error ("returning a value from a destructor");
7608 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7610 if (in_function_try_handler
)
7611 /* If a return statement appears in a handler of the
7612 function-try-block of a constructor, the program is ill-formed. */
7613 error ("cannot return from a handler of a function-try-block of a constructor");
7615 /* You can't return a value from a constructor. */
7616 error ("returning a value from a constructor");
7620 /* As an extension, deduce lambda return type from a return statement
7621 anywhere in the body. */
7622 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7624 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7625 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7627 tree type
= lambda_return_type (retval
);
7628 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7630 if (VOID_TYPE_P (type
))
7632 else if (oldtype
== NULL_TREE
)
7634 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7635 "can only be deduced when the return statement is "
7636 "the only statement in the function body");
7637 apply_lambda_return_type (lambda
, type
);
7639 else if (!same_type_p (type
, oldtype
))
7640 error ("inconsistent types %qT and %qT deduced for "
7641 "lambda return type", type
, oldtype
);
7645 if (processing_template_decl
)
7647 current_function_returns_value
= 1;
7648 if (check_for_bare_parameter_packs (retval
))
7649 retval
= error_mark_node
;
7653 /* When no explicit return-value is given in a function with a named
7654 return value, the named return value is used. */
7655 result
= DECL_RESULT (current_function_decl
);
7656 valtype
= TREE_TYPE (result
);
7657 gcc_assert (valtype
!= NULL_TREE
);
7658 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7659 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7662 /* Check for a return statement with no return value in a function
7663 that's supposed to return a value. */
7664 if (!retval
&& fn_returns_value_p
)
7666 permerror (input_location
, "return-statement with no value, in function returning %qT",
7668 /* Clear this, so finish_function won't say that we reach the
7669 end of a non-void function (which we don't, we gave a
7671 current_function_returns_null
= 0;
7672 /* And signal caller that TREE_NO_WARNING should be set on the
7673 RETURN_EXPR to avoid control reaches end of non-void function
7674 warnings in tree-cfg.c. */
7677 /* Check for a return statement with a value in a function that
7678 isn't supposed to return a value. */
7679 else if (retval
&& !fn_returns_value_p
)
7681 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7682 /* You can return a `void' value from a function of `void'
7683 type. In that case, we have to evaluate the expression for
7684 its side-effects. */
7685 finish_expr_stmt (retval
);
7687 permerror (input_location
, "return-statement with a value, in function "
7688 "returning 'void'");
7689 current_function_returns_null
= 1;
7691 /* There's really no value to return, after all. */
7695 /* Remember that this function can sometimes return without a
7697 current_function_returns_null
= 1;
7699 /* Remember that this function did return a value. */
7700 current_function_returns_value
= 1;
7702 /* Check for erroneous operands -- but after giving ourselves a
7703 chance to provide an error about returning a value from a void
7705 if (error_operand_p (retval
))
7707 current_function_return_value
= error_mark_node
;
7708 return error_mark_node
;
7711 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7712 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7713 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7714 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7716 && retval
&& null_ptr_cst_p (retval
))
7717 warning (0, "%<operator new%> must not return NULL unless it is "
7718 "declared %<throw()%> (or -fcheck-new is in effect)");
7720 /* Effective C++ rule 15. See also start_function. */
7722 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7726 /* The function return type must be a reference to the current
7728 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7729 && same_type_ignoring_top_level_qualifiers_p
7730 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7732 /* Returning '*this' is obviously OK. */
7733 if (retval
== current_class_ref
)
7735 /* If we are calling a function whose return type is the same of
7736 the current class reference, it is ok. */
7737 else if (TREE_CODE (retval
) == INDIRECT_REF
7738 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7743 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7746 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7748 [...] For a function with a class return type, if the expression
7749 in the return statement is the name of a local object, and the cv-
7750 unqualified type of the local object is the same as the function
7751 return type, an implementation is permitted to omit creating the tem-
7752 porary object to hold the function return value [...]
7754 So, if this is a value-returning function that always returns the same
7755 local variable, remember it.
7757 It might be nice to be more flexible, and choose the first suitable
7758 variable even if the function sometimes returns something else, but
7759 then we run the risk of clobbering the variable we chose if the other
7760 returned expression uses the chosen variable somehow. And people expect
7761 this restriction, anyway. (jason 2000-11-19)
7763 See finish_function and finalize_nrv for the rest of this optimization. */
7765 named_return_value_okay_p
=
7766 (retval
!= NULL_TREE
7767 /* Must be a local, automatic variable. */
7768 && TREE_CODE (retval
) == VAR_DECL
7769 && DECL_CONTEXT (retval
) == current_function_decl
7770 && ! TREE_STATIC (retval
)
7771 && ! DECL_ANON_UNION_VAR_P (retval
)
7772 && (DECL_ALIGN (retval
)
7773 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7774 /* The cv-unqualified type of the returned value must be the
7775 same as the cv-unqualified return type of the
7777 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7779 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7780 /* And the returned value must be non-volatile. */
7781 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7783 if (fn_returns_value_p
&& flag_elide_constructors
)
7785 if (named_return_value_okay_p
7786 && (current_function_return_value
== NULL_TREE
7787 || current_function_return_value
== retval
))
7788 current_function_return_value
= retval
;
7790 current_function_return_value
= error_mark_node
;
7793 /* We don't need to do any conversions when there's nothing being
7798 /* Do any required conversions. */
7799 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7800 /* No conversions are required. */
7804 /* The type the function is declared to return. */
7805 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7806 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7808 /* The functype's return type will have been set to void, if it
7809 was an incomplete type. Just treat this as 'return;' */
7810 if (VOID_TYPE_P (functype
))
7811 return error_mark_node
;
7813 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7814 treated as an rvalue for the purposes of overload resolution to
7815 favor move constructors over copy constructors.
7817 Note that these conditions are similar to, but not as strict as,
7818 the conditions for the named return value optimization. */
7819 if ((cxx_dialect
!= cxx98
)
7820 && (TREE_CODE (retval
) == VAR_DECL
7821 || TREE_CODE (retval
) == PARM_DECL
)
7822 && DECL_CONTEXT (retval
) == current_function_decl
7823 && !TREE_STATIC (retval
)
7824 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7826 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7827 /* This is only interesting for class type. */
7828 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7829 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7831 /* First convert the value to the function's return type, then
7832 to the type of return value's location to handle the
7833 case that functype is smaller than the valtype. */
7834 retval
= convert_for_initialization
7835 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
7836 tf_warning_or_error
);
7837 retval
= convert (valtype
, retval
);
7839 /* If the conversion failed, treat this just like `return;'. */
7840 if (retval
== error_mark_node
)
7842 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7843 else if (! cfun
->returns_struct
7844 && TREE_CODE (retval
) == TARGET_EXPR
7845 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7846 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7847 TREE_OPERAND (retval
, 0));
7849 maybe_warn_about_returning_address_of_local (retval
);
7852 /* Actually copy the value returned into the appropriate location. */
7853 if (retval
&& retval
!= result
)
7854 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7860 /* Returns nonzero if the pointer-type FROM can be converted to the
7861 pointer-type TO via a qualification conversion. If CONSTP is -1,
7862 then we return nonzero if the pointers are similar, and the
7863 cv-qualification signature of FROM is a proper subset of that of TO.
7865 If CONSTP is positive, then all outer pointers have been
7869 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7871 bool to_more_cv_qualified
= false;
7872 bool is_opaque_pointer
= false;
7874 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7876 if (TREE_CODE (to
) != TREE_CODE (from
))
7879 if (TREE_CODE (from
) == OFFSET_TYPE
7880 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7881 TYPE_OFFSET_BASETYPE (to
)))
7884 /* Const and volatile mean something different for function types,
7885 so the usual checks are not appropriate. */
7886 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7888 if (!at_least_as_qualified_p (to
, from
))
7891 if (!at_least_as_qualified_p (from
, to
))
7895 to_more_cv_qualified
= true;
7899 constp
&= TYPE_READONLY (to
);
7902 if (TREE_CODE (to
) == VECTOR_TYPE
)
7903 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7905 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
7906 return ((constp
>= 0 || to_more_cv_qualified
)
7907 && (is_opaque_pointer
7908 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
7912 /* When comparing, say, char ** to char const **, this function takes
7913 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7914 types to this function. */
7917 comp_ptr_ttypes (tree to
, tree from
)
7919 return comp_ptr_ttypes_real (to
, from
, 1);
7922 /* Returns true iff FNTYPE is a non-class type that involves
7923 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7924 if a parameter type is ill-formed. */
7927 error_type_p (const_tree type
)
7931 switch (TREE_CODE (type
))
7937 case REFERENCE_TYPE
:
7939 return error_type_p (TREE_TYPE (type
));
7943 if (error_type_p (TREE_TYPE (type
)))
7945 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7946 if (error_type_p (TREE_VALUE (t
)))
7951 if (TYPE_PTRMEMFUNC_P (type
))
7952 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
7960 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7961 type or inheritance-related types, regardless of cv-quals. */
7964 ptr_reasonably_similar (const_tree to
, const_tree from
)
7966 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7968 /* Any target type is similar enough to void. */
7969 if (TREE_CODE (to
) == VOID_TYPE
)
7970 return !error_type_p (from
);
7971 if (TREE_CODE (from
) == VOID_TYPE
)
7972 return !error_type_p (to
);
7974 if (TREE_CODE (to
) != TREE_CODE (from
))
7977 if (TREE_CODE (from
) == OFFSET_TYPE
7978 && comptypes (TYPE_OFFSET_BASETYPE (to
),
7979 TYPE_OFFSET_BASETYPE (from
),
7980 COMPARE_BASE
| COMPARE_DERIVED
))
7983 if (TREE_CODE (to
) == VECTOR_TYPE
7984 && vector_types_convertible_p (to
, from
, false))
7987 if (TREE_CODE (to
) == INTEGER_TYPE
7988 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
7991 if (TREE_CODE (to
) == FUNCTION_TYPE
)
7992 return !error_type_p (to
) && !error_type_p (from
);
7994 if (TREE_CODE (to
) != POINTER_TYPE
)
7996 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
7997 COMPARE_BASE
| COMPARE_DERIVED
);
8001 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
8002 pointer-to-member types) are the same, ignoring cv-qualification at
8006 comp_ptr_ttypes_const (tree to
, tree from
)
8008 bool is_opaque_pointer
= false;
8010 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
8012 if (TREE_CODE (to
) != TREE_CODE (from
))
8015 if (TREE_CODE (from
) == OFFSET_TYPE
8016 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
8017 TYPE_OFFSET_BASETYPE (to
)))
8020 if (TREE_CODE (to
) == VECTOR_TYPE
)
8021 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
8023 if (TREE_CODE (to
) != POINTER_TYPE
)
8024 return (is_opaque_pointer
8025 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
8029 /* Returns the type qualifiers for this type, including the qualifiers on the
8030 elements for an array type. */
8033 cp_type_quals (const_tree type
)
8036 /* This CONST_CAST is okay because strip_array_types returns its
8037 argument unmodified and we assign it to a const_tree. */
8038 type
= strip_array_types (CONST_CAST_TREE (type
));
8039 if (type
== error_mark_node
8040 /* Quals on a FUNCTION_TYPE are memfn quals. */
8041 || TREE_CODE (type
) == FUNCTION_TYPE
)
8042 return TYPE_UNQUALIFIED
;
8043 quals
= TYPE_QUALS (type
);
8044 /* METHOD and REFERENCE_TYPEs should never have quals. */
8045 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
8046 && TREE_CODE (type
) != REFERENCE_TYPE
)
8047 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
8048 == TYPE_UNQUALIFIED
));
8052 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
8056 type_memfn_quals (const_tree type
)
8058 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8059 return TYPE_QUALS (type
);
8060 else if (TREE_CODE (type
) == METHOD_TYPE
)
8061 return cp_type_quals (class_of_this_parm (type
));
8066 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
8070 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
)
8072 /* Could handle METHOD_TYPE here if necessary. */
8073 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8074 if (TYPE_QUALS (type
) == memfn_quals
)
8076 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
8078 return build_qualified_type (type
, memfn_quals
);
8081 /* Returns nonzero if TYPE is const or volatile. */
8084 cv_qualified_p (const_tree type
)
8086 int quals
= cp_type_quals (type
);
8087 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
8090 /* Returns nonzero if the TYPE contains a mutable member. */
8093 cp_has_mutable_p (const_tree type
)
8095 /* This CONST_CAST is okay because strip_array_types returns its
8096 argument unmodified and we assign it to a const_tree. */
8097 type
= strip_array_types (CONST_CAST_TREE(type
));
8099 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
8102 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
8103 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
8104 approximation. In particular, consider:
8107 struct S { int i; };
8108 const S s = { f(); }
8110 Here, we will make "s" as TREE_READONLY (because it is declared
8111 "const") -- only to reverse ourselves upon seeing that the
8112 initializer is non-constant. */
8115 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
8117 tree type
= TREE_TYPE (decl
);
8119 if (type
== error_mark_node
)
8122 if (TREE_CODE (decl
) == TYPE_DECL
)
8125 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
8126 && type_quals
!= TYPE_UNQUALIFIED
));
8128 /* Avoid setting TREE_READONLY incorrectly. */
8129 if (/* If the object has a constructor, the constructor may modify
8131 TYPE_NEEDS_CONSTRUCTING (type
)
8132 /* If the type isn't complete, we don't know yet if it will need
8134 || !COMPLETE_TYPE_P (type
)
8135 /* If the type has a mutable component, that component might be
8137 || TYPE_HAS_MUTABLE_P (type
))
8138 type_quals
&= ~TYPE_QUAL_CONST
;
8140 c_apply_type_quals_to_decl (type_quals
, decl
);
8143 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8144 exemplar types such that casting T1 to T2 is casting away constness
8145 if and only if there is no implicit conversion from T1 to T2. */
8148 casts_away_constness_r (tree
*t1
, tree
*t2
)
8153 /* [expr.const.cast]
8155 For multi-level pointer to members and multi-level mixed pointers
8156 and pointers to members (conv.qual), the "member" aspect of a
8157 pointer to member level is ignored when determining if a const
8158 cv-qualifier has been cast away. */
8159 /* [expr.const.cast]
8161 For two pointer types:
8163 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8164 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8167 casting from X1 to X2 casts away constness if, for a non-pointer
8168 type T there does not exist an implicit conversion (clause
8171 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8175 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8176 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
8177 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
8179 *t1
= cp_build_qualified_type (void_type_node
,
8180 cp_type_quals (*t1
));
8181 *t2
= cp_build_qualified_type (void_type_node
,
8182 cp_type_quals (*t2
));
8186 quals1
= cp_type_quals (*t1
);
8187 quals2
= cp_type_quals (*t2
);
8189 if (TYPE_PTRMEM_P (*t1
))
8190 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
8192 *t1
= TREE_TYPE (*t1
);
8193 if (TYPE_PTRMEM_P (*t2
))
8194 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
8196 *t2
= TREE_TYPE (*t2
);
8198 casts_away_constness_r (t1
, t2
);
8199 *t1
= build_pointer_type (*t1
);
8200 *t2
= build_pointer_type (*t2
);
8201 *t1
= cp_build_qualified_type (*t1
, quals1
);
8202 *t2
= cp_build_qualified_type (*t2
, quals2
);
8205 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8208 ??? This function returns non-zero if casting away qualifiers not
8209 just const. We would like to return to the caller exactly which
8210 qualifiers are casted away to give more accurate diagnostics.
8214 casts_away_constness (tree t1
, tree t2
)
8216 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
8218 /* [expr.const.cast]
8220 Casting from an lvalue of type T1 to an lvalue of type T2
8221 using a reference cast casts away constness if a cast from an
8222 rvalue of type "pointer to T1" to the type "pointer to T2"
8223 casts away constness. */
8224 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
8225 return casts_away_constness (build_pointer_type (t1
),
8226 build_pointer_type (TREE_TYPE (t2
)));
8229 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
8230 /* [expr.const.cast]
8232 Casting from an rvalue of type "pointer to data member of X
8233 of type T1" to the type "pointer to data member of Y of type
8234 T2" casts away constness if a cast from an rvalue of type
8235 "pointer to T1" to the type "pointer to T2" casts away
8237 return casts_away_constness
8238 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
8239 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
8241 /* Casting away constness is only something that makes sense for
8242 pointer or reference types. */
8243 if (TREE_CODE (t1
) != POINTER_TYPE
8244 || TREE_CODE (t2
) != POINTER_TYPE
)
8247 /* Top-level qualifiers don't matter. */
8248 t1
= TYPE_MAIN_VARIANT (t1
);
8249 t2
= TYPE_MAIN_VARIANT (t2
);
8250 casts_away_constness_r (&t1
, &t2
);
8251 if (!can_convert (t2
, t1
))
8257 /* If T is a REFERENCE_TYPE return the type to which T refers.
8258 Otherwise, return T itself. */
8261 non_reference (tree t
)
8263 if (TREE_CODE (t
) == REFERENCE_TYPE
)
8269 /* Return nonzero if REF is an lvalue valid for this language;
8270 otherwise, print an error message and return zero. USE says
8271 how the lvalue is being used and so selects the error message. */
8274 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
8276 cp_lvalue_kind kind
= lvalue_kind (ref
);
8278 if (kind
== clk_none
)
8280 if (complain
& tf_error
)
8281 lvalue_error (input_location
, use
);
8284 else if (kind
& (clk_rvalueref
|clk_class
))
8286 if (!(complain
& tf_error
))
8288 if (kind
& clk_class
)
8289 /* Make this a permerror because we used to accept it. */
8290 permerror (input_location
, "using temporary as lvalue");
8292 error ("using xvalue (rvalue reference) as lvalue");