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. */
2685 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2686 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2687 if (type_dependent_expression_p (expr
))
2688 return build_min_nt (INDIRECT_REF
, expr
);
2689 expr
= build_non_dependent_expr (expr
);
2692 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2693 NULL_TREE
, /*overload=*/NULL
, complain
);
2695 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2697 if (processing_template_decl
&& rval
!= error_mark_node
)
2698 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2703 /* Helper function called from c-common. */
2705 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2706 tree ptr
, ref_operator errorstring
)
2708 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2712 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2713 tsubst_flags_t complain
)
2717 if (ptr
== error_mark_node
)
2718 return error_mark_node
;
2720 if (ptr
== current_class_ptr
)
2721 return current_class_ref
;
2723 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2724 ? ptr
: decay_conversion (ptr
));
2725 type
= TREE_TYPE (pointer
);
2727 if (POINTER_TYPE_P (type
))
2731 If the type of the expression is "pointer to T," the type
2732 of the result is "T." */
2733 tree t
= TREE_TYPE (type
);
2735 if (CONVERT_EXPR_P (ptr
)
2736 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2738 /* If a warning is issued, mark it to avoid duplicates from
2739 the backend. This only needs to be done at
2740 warn_strict_aliasing > 2. */
2741 if (warn_strict_aliasing
> 2)
2742 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2743 type
, TREE_OPERAND (ptr
, 0)))
2744 TREE_NO_WARNING (ptr
) = 1;
2747 if (VOID_TYPE_P (t
))
2749 /* A pointer to incomplete type (other than cv void) can be
2750 dereferenced [expr.unary.op]/1 */
2751 if (complain
& tf_error
)
2752 error ("%qT is not a pointer-to-object type", type
);
2753 return error_mark_node
;
2755 else if (TREE_CODE (pointer
) == ADDR_EXPR
2756 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2757 /* The POINTER was something like `&x'. We simplify `*&x' to
2759 return TREE_OPERAND (pointer
, 0);
2762 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2764 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2765 so that we get the proper error message if the result is used
2766 to assign to. Also, &* is supposed to be a no-op. */
2767 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2768 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2769 TREE_SIDE_EFFECTS (ref
)
2770 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2774 else if (!(complain
& tf_error
))
2775 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2777 /* `pointer' won't be an error_mark_node if we were given a
2778 pointer to member, so it's cool to check for this here. */
2779 else if (TYPE_PTR_TO_MEMBER_P (type
))
2780 switch (errorstring
)
2782 case RO_ARRAY_INDEXING
:
2783 error ("invalid use of array indexing on pointer to member");
2786 error ("invalid use of unary %<*%> on pointer to member");
2788 case RO_IMPLICIT_CONVERSION
:
2789 error ("invalid use of implicit conversion on pointer to member");
2794 else if (pointer
!= error_mark_node
)
2795 invalid_indirection_error (input_location
, type
, errorstring
);
2797 return error_mark_node
;
2800 /* This handles expressions of the form "a[i]", which denotes
2803 This is logically equivalent in C to *(a+i), but we may do it differently.
2804 If A is a variable or a member, we generate a primitive ARRAY_REF.
2805 This avoids forcing the array out of registers, and can work on
2806 arrays that are not lvalues (for example, members of structures returned
2809 If INDEX is of some user-defined type, it must be converted to
2810 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2811 will inherit the type of the array, which will be some pointer type.
2813 LOC is the location to use in building the array reference. */
2816 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
2817 tsubst_flags_t complain
)
2823 if (complain
& tf_error
)
2824 error_at (loc
, "subscript missing in array reference");
2825 return error_mark_node
;
2828 if (TREE_TYPE (array
) == error_mark_node
2829 || TREE_TYPE (idx
) == error_mark_node
)
2830 return error_mark_node
;
2832 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2834 switch (TREE_CODE (array
))
2838 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2840 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2841 TREE_OPERAND (array
, 0), value
);
2842 SET_EXPR_LOCATION (ret
, loc
);
2847 ret
= build_conditional_expr
2848 (TREE_OPERAND (array
, 0),
2849 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2851 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
2853 tf_warning_or_error
);
2854 protected_set_expr_location (ret
, loc
);
2861 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2865 warn_array_subscript_with_type_char (idx
);
2867 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2869 if (complain
& tf_error
)
2870 error_at (loc
, "array subscript is not an integer");
2871 return error_mark_node
;
2874 /* Apply integral promotions *after* noticing character types.
2875 (It is unclear why we do these promotions -- the standard
2876 does not say that we should. In fact, the natural thing would
2877 seem to be to convert IDX to ptrdiff_t; we're performing
2878 pointer arithmetic.) */
2879 idx
= perform_integral_promotions (idx
);
2881 /* An array that is indexed by a non-constant
2882 cannot be stored in a register; we must be able to do
2883 address arithmetic on its address.
2884 Likewise an array of elements of variable size. */
2885 if (TREE_CODE (idx
) != INTEGER_CST
2886 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2887 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2890 if (!cxx_mark_addressable (array
))
2891 return error_mark_node
;
2894 /* An array that is indexed by a constant value which is not within
2895 the array bounds cannot be stored in a register either; because we
2896 would get a crash in store_bit_field/extract_bit_field when trying
2897 to access a non-existent part of the register. */
2898 if (TREE_CODE (idx
) == INTEGER_CST
2899 && TYPE_DOMAIN (TREE_TYPE (array
))
2900 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
2902 if (!cxx_mark_addressable (array
))
2903 return error_mark_node
;
2906 if (!lvalue_p (array
) && (complain
& tf_error
))
2907 pedwarn (loc
, OPT_pedantic
,
2908 "ISO C++ forbids subscripting non-lvalue array");
2910 /* Note in C++ it is valid to subscript a `register' array, since
2911 it is valid to take the address of something with that
2912 storage specification. */
2916 while (TREE_CODE (foo
) == COMPONENT_REF
)
2917 foo
= TREE_OPERAND (foo
, 0);
2918 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
)
2919 && (complain
& tf_warning
))
2920 warning_at (loc
, OPT_Wextra
,
2921 "subscripting array declared %<register%>");
2924 type
= TREE_TYPE (TREE_TYPE (array
));
2925 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
2926 /* Array ref is const/volatile if the array elements are
2927 or if the array is.. */
2928 TREE_READONLY (rval
)
2929 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
2930 TREE_SIDE_EFFECTS (rval
)
2931 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
2932 TREE_THIS_VOLATILE (rval
)
2933 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
2934 ret
= require_complete_type_sfinae (fold_if_not_in_template (rval
),
2936 protected_set_expr_location (ret
, loc
);
2941 tree ar
= default_conversion (array
);
2942 tree ind
= default_conversion (idx
);
2944 /* Put the integer in IND to simplify error checking. */
2945 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
2952 if (ar
== error_mark_node
)
2955 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
2957 if (complain
& tf_error
)
2958 error_at (loc
, "subscripted value is neither array nor pointer");
2959 return error_mark_node
;
2961 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
2963 if (complain
& tf_error
)
2964 error_at (loc
, "array subscript is not an integer");
2965 return error_mark_node
;
2968 warn_array_subscript_with_type_char (idx
);
2970 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
2975 protected_set_expr_location (ret
, loc
);
2980 /* Entry point for Obj-C++. */
2983 build_array_ref (location_t loc
, tree array
, tree idx
)
2985 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
2988 /* Resolve a pointer to member function. INSTANCE is the object
2989 instance to use, if the member points to a virtual member.
2991 This used to avoid checking for virtual functions if basetype
2992 has no virtual functions, according to an earlier ANSI draft.
2993 With the final ISO C++ rules, such an optimization is
2994 incorrect: A pointer to a derived member can be static_cast
2995 to pointer-to-base-member, as long as the dynamic object
2996 later has the right member. */
2999 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
3001 if (TREE_CODE (function
) == OFFSET_REF
)
3002 function
= TREE_OPERAND (function
, 1);
3004 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3006 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
3007 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3009 tree instance_ptr
= *instance_ptrptr
;
3010 tree instance_save_expr
= 0;
3011 if (instance_ptr
== error_mark_node
)
3013 if (TREE_CODE (function
) == PTRMEM_CST
)
3015 /* Extracting the function address from a pmf is only
3016 allowed with -Wno-pmf-conversions. It only works for
3018 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
3019 e1
= convert (fntype
, e1
);
3024 error ("object missing in use of %qE", function
);
3025 return error_mark_node
;
3029 if (TREE_SIDE_EFFECTS (instance_ptr
))
3030 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3032 if (TREE_SIDE_EFFECTS (function
))
3033 function
= save_expr (function
);
3035 /* Start by extracting all the information from the PMF itself. */
3036 e3
= pfn_from_ptrmemfunc (function
);
3037 delta
= delta_from_ptrmemfunc (function
);
3038 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3039 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3041 case ptrmemfunc_vbit_in_pfn
:
3042 e1
= cp_build_binary_op (input_location
,
3043 BIT_AND_EXPR
, idx
, integer_one_node
,
3044 tf_warning_or_error
);
3045 idx
= cp_build_binary_op (input_location
,
3046 MINUS_EXPR
, idx
, integer_one_node
,
3047 tf_warning_or_error
);
3050 case ptrmemfunc_vbit_in_delta
:
3051 e1
= cp_build_binary_op (input_location
,
3052 BIT_AND_EXPR
, delta
, integer_one_node
,
3053 tf_warning_or_error
);
3054 delta
= cp_build_binary_op (input_location
,
3055 RSHIFT_EXPR
, delta
, integer_one_node
,
3056 tf_warning_or_error
);
3063 /* Convert down to the right base before using the instance. A
3064 special case is that in a pointer to member of class C, C may
3065 be incomplete. In that case, the function will of course be
3066 a member of C, and no conversion is required. In fact,
3067 lookup_base will fail in that case, because incomplete
3068 classes do not have BINFOs. */
3069 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3070 if (!same_type_ignoring_top_level_qualifiers_p
3071 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3073 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3074 basetype
, ba_check
, NULL
);
3075 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3077 if (instance_ptr
== error_mark_node
)
3078 return error_mark_node
;
3080 /* ...and then the delta in the PMF. */
3081 instance_ptr
= fold_build_pointer_plus (instance_ptr
, delta
);
3083 /* Hand back the adjusted 'this' argument to our caller. */
3084 *instance_ptrptr
= instance_ptr
;
3086 /* Next extract the vtable pointer from the object. */
3087 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3089 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, tf_warning_or_error
);
3090 /* If the object is not dynamic the access invokes undefined
3091 behavior. As it is not executed in this case silence the
3092 spurious warnings it may provoke. */
3093 TREE_NO_WARNING (vtbl
) = 1;
3095 /* Finally, extract the function pointer from the vtable. */
3096 e2
= fold_build_pointer_plus_loc (input_location
, vtbl
, idx
);
3097 e2
= cp_build_indirect_ref (e2
, RO_NULL
, tf_warning_or_error
);
3098 TREE_CONSTANT (e2
) = 1;
3100 /* When using function descriptors, the address of the
3101 vtable entry is treated as a function pointer. */
3102 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3103 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3104 cp_build_addr_expr (e2
, tf_warning_or_error
));
3106 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3107 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
3109 /* Make sure this doesn't get evaluated first inside one of the
3110 branches of the COND_EXPR. */
3111 if (instance_save_expr
)
3112 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3113 instance_save_expr
, e1
);
3120 /* Used by the C-common bits. */
3122 build_function_call (location_t loc ATTRIBUTE_UNUSED
,
3123 tree function
, tree params
)
3125 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3128 /* Used by the C-common bits. */
3130 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED
,
3131 tree function
, VEC(tree
,gc
) *params
,
3132 VEC(tree
,gc
) *origtypes ATTRIBUTE_UNUSED
)
3134 VEC(tree
,gc
) *orig_params
= params
;
3135 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3136 tf_warning_or_error
);
3138 /* cp_build_function_call_vec can reallocate PARAMS by adding
3139 default arguments. That should never happen here. Verify
3141 gcc_assert (params
== orig_params
);
3146 /* Build a function call using a tree list of arguments. */
3149 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3154 vec
= make_tree_vector ();
3155 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3156 VEC_safe_push (tree
, gc
, vec
, TREE_VALUE (params
));
3157 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3158 release_tree_vector (vec
);
3162 /* Build a function call using varargs. */
3165 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3171 vec
= make_tree_vector ();
3172 va_start (args
, complain
);
3173 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3174 VEC_safe_push (tree
, gc
, vec
, t
);
3176 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3177 release_tree_vector (vec
);
3181 /* Build a function call using a vector of arguments. PARAMS may be
3182 NULL if there are no parameters. This changes the contents of
3186 cp_build_function_call_vec (tree function
, VEC(tree
,gc
) **params
,
3187 tsubst_flags_t complain
)
3189 tree fntype
, fndecl
;
3191 tree original
= function
;
3195 VEC(tree
,gc
) *allocated
= NULL
;
3198 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3199 expressions, like those used for ObjC messenger dispatches. */
3200 if (params
!= NULL
&& !VEC_empty (tree
, *params
))
3201 function
= objc_rewrite_function_call (function
,
3202 VEC_index (tree
, *params
, 0));
3204 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3205 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3206 if (TREE_CODE (function
) == NOP_EXPR
3207 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3208 function
= TREE_OPERAND (function
, 0);
3210 if (TREE_CODE (function
) == FUNCTION_DECL
)
3212 mark_used (function
);
3215 /* Convert anything with function type to a pointer-to-function. */
3216 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
3217 pedwarn (input_location
, OPT_pedantic
,
3218 "ISO C++ forbids calling %<::main%> from within program");
3220 function
= build_addr_func (function
);
3226 function
= build_addr_func (function
);
3229 if (function
== error_mark_node
)
3230 return error_mark_node
;
3232 fntype
= TREE_TYPE (function
);
3234 if (TYPE_PTRMEMFUNC_P (fntype
))
3236 if (complain
& tf_error
)
3237 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3238 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3239 original
, original
);
3240 return error_mark_node
;
3243 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
3244 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3246 if (!((TREE_CODE (fntype
) == POINTER_TYPE
3247 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
3249 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3251 if (complain
& tf_error
)
3252 error ("%qE cannot be used as a function", original
);
3253 return error_mark_node
;
3256 /* fntype now gets the type of function pointed to. */
3257 fntype
= TREE_TYPE (fntype
);
3258 parm_types
= TYPE_ARG_TYPES (fntype
);
3262 allocated
= make_tree_vector ();
3263 params
= &allocated
;
3266 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3269 return error_mark_node
;
3271 argarray
= VEC_address (tree
, *params
);
3273 /* Check for errors in format strings and inappropriately
3275 check_function_arguments (fntype
, nargs
, argarray
);
3277 ret
= build_cxx_call (function
, nargs
, argarray
);
3279 if (allocated
!= NULL
)
3280 release_tree_vector (allocated
);
3285 /* Subroutine of convert_arguments.
3286 Warn about wrong number of args are genereted. */
3289 warn_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3293 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3295 if (DECL_NAME (fndecl
) == NULL_TREE
3296 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3299 ? G_("too many arguments to constructor %q#D")
3300 : G_("too few arguments to constructor %q#D"),
3305 ? G_("too many arguments to member function %q#D")
3306 : G_("too few arguments to member function %q#D"),
3312 ? G_("too many arguments to function %q#D")
3313 : G_("too few arguments to function %q#D"),
3315 inform (DECL_SOURCE_LOCATION (fndecl
),
3320 if (c_dialect_objc () && objc_message_selector ())
3323 ? G_("too many arguments to method %q#D")
3324 : G_("too few arguments to method %q#D"),
3325 objc_message_selector ());
3327 error_at (loc
, too_many_p
? G_("too many arguments to function")
3328 : G_("too few arguments to function"));
3332 /* Convert the actual parameter expressions in the list VALUES to the
3333 types in the list TYPELIST. The converted expressions are stored
3334 back in the VALUES vector.
3335 If parmdecls is exhausted, or when an element has NULL as its type,
3336 perform the default conversions.
3338 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3340 This is also where warnings about wrong number of args are generated.
3342 Returns the actual number of arguments processed (which might be less
3343 than the length of the vector), or -1 on error.
3345 In C++, unspecified trailing parameters can be filled in with their
3346 default arguments, if such were specified. Do so here. */
3349 convert_arguments (tree typelist
, VEC(tree
,gc
) **values
, tree fndecl
,
3350 int flags
, tsubst_flags_t complain
)
3355 /* Argument passing is always copy-initialization. */
3356 flags
|= LOOKUP_ONLYCONVERTING
;
3358 for (i
= 0, typetail
= typelist
;
3359 i
< VEC_length (tree
, *values
);
3362 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3363 tree val
= VEC_index (tree
, *values
, i
);
3365 if (val
== error_mark_node
|| type
== error_mark_node
)
3368 if (type
== void_type_node
)
3370 if (complain
& tf_error
)
3372 warn_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3379 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3380 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3381 if (TREE_CODE (val
) == NOP_EXPR
3382 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3383 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3384 val
= TREE_OPERAND (val
, 0);
3386 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3388 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3389 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3390 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3391 val
= decay_conversion (val
);
3394 if (val
== error_mark_node
)
3399 /* Formal parm type is specified by a function prototype. */
3402 if (!COMPLETE_TYPE_P (complete_type (type
)))
3404 if (complain
& tf_error
)
3407 error ("parameter %P of %qD has incomplete type %qT",
3410 error ("parameter %P has incomplete type %qT", i
, type
);
3412 parmval
= error_mark_node
;
3416 parmval
= convert_for_initialization
3417 (NULL_TREE
, type
, val
, flags
,
3418 ICR_ARGPASS
, fndecl
, i
, complain
);
3419 parmval
= convert_for_arg_passing (type
, parmval
);
3422 if (parmval
== error_mark_node
)
3425 VEC_replace (tree
, *values
, i
, parmval
);
3429 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3430 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3431 /* Don't do ellipsis conversion for __built_in_constant_p
3432 as this will result in spurious errors for non-trivial
3434 val
= require_complete_type_sfinae (val
, complain
);
3436 val
= convert_arg_to_ellipsis (val
);
3438 VEC_replace (tree
, *values
, i
, val
);
3442 typetail
= TREE_CHAIN (typetail
);
3445 if (typetail
!= 0 && typetail
!= void_list_node
)
3447 /* See if there are default arguments that can be used. Because
3448 we hold default arguments in the FUNCTION_TYPE (which is so
3449 wrong), we can see default parameters here from deduced
3450 contexts (and via typeof) for indirect function calls.
3451 Fortunately we know whether we have a function decl to
3452 provide default arguments in a language conformant
3454 if (fndecl
&& TREE_PURPOSE (typetail
)
3455 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3457 for (; typetail
!= void_list_node
; ++i
)
3460 = convert_default_arg (TREE_VALUE (typetail
),
3461 TREE_PURPOSE (typetail
),
3464 if (parmval
== error_mark_node
)
3467 VEC_safe_push (tree
, gc
, *values
, parmval
);
3468 typetail
= TREE_CHAIN (typetail
);
3469 /* ends with `...'. */
3470 if (typetail
== NULL_TREE
)
3476 if (complain
& tf_error
)
3477 warn_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3485 /* Build a binary-operation expression, after performing default
3486 conversions on the operands. CODE is the kind of expression to
3487 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3488 are the tree codes which correspond to ARG1 and ARG2 when issuing
3489 warnings about possibly misplaced parentheses. They may differ
3490 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3491 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3492 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3493 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3494 ARG2_CODE as ERROR_MARK. */
3497 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3498 tree arg2
, enum tree_code arg2_code
, tree
*overload
,
3499 tsubst_flags_t complain
)
3508 if (processing_template_decl
)
3510 if (type_dependent_expression_p (arg1
)
3511 || type_dependent_expression_p (arg2
))
3512 return build_min_nt (code
, arg1
, arg2
);
3513 arg1
= build_non_dependent_expr (arg1
);
3514 arg2
= build_non_dependent_expr (arg2
);
3517 if (code
== DOTSTAR_EXPR
)
3518 expr
= build_m_component_ref (arg1
, arg2
);
3520 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3521 overload
, complain
);
3523 /* Check for cases such as x+y<<z which users are likely to
3524 misinterpret. But don't warn about obj << x + y, since that is a
3525 common idiom for I/O. */
3526 if (warn_parentheses
3527 && (complain
& tf_warning
)
3528 && !processing_template_decl
3529 && !error_operand_p (arg1
)
3530 && !error_operand_p (arg2
)
3531 && (code
!= LSHIFT_EXPR
3532 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3533 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3535 if (processing_template_decl
&& expr
!= error_mark_node
)
3536 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3541 /* Build and return an ARRAY_REF expression. */
3544 build_x_array_ref (tree arg1
, tree arg2
, tsubst_flags_t complain
)
3546 tree orig_arg1
= arg1
;
3547 tree orig_arg2
= arg2
;
3550 if (processing_template_decl
)
3552 if (type_dependent_expression_p (arg1
)
3553 || type_dependent_expression_p (arg2
))
3554 return build_min_nt (ARRAY_REF
, arg1
, arg2
,
3555 NULL_TREE
, NULL_TREE
);
3556 arg1
= build_non_dependent_expr (arg1
);
3557 arg2
= build_non_dependent_expr (arg2
);
3560 expr
= build_new_op (ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3561 /*overload=*/NULL
, complain
);
3563 if (processing_template_decl
&& expr
!= error_mark_node
)
3564 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3565 NULL_TREE
, NULL_TREE
);
3569 /* For the c-common bits. */
3571 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3572 int convert_p ATTRIBUTE_UNUSED
)
3574 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3578 /* Build a binary-operation expression without default conversions.
3579 CODE is the kind of expression to build.
3580 LOCATION is the location_t of the operator in the source code.
3581 This function differs from `build' in several ways:
3582 the data type of the result is computed and recorded in it,
3583 warnings are generated if arg data types are invalid,
3584 special handling for addition and subtraction of pointers is known,
3585 and some optimization is done (operations on narrow ints
3586 are done in the narrower type when that gives the same result).
3587 Constant folding is also done before the result is returned.
3589 Note that the operands will never have enumeral types
3590 because either they have just had the default conversions performed
3591 or they have both just been converted to some other type in which
3592 the arithmetic is to be done.
3594 C++: must do special pointer arithmetic when implementing
3595 multiple inheritance, and deal with pointer to member functions. */
3598 cp_build_binary_op (location_t location
,
3599 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3600 tsubst_flags_t complain
)
3603 enum tree_code code0
, code1
;
3605 const char *invalid_op_diag
;
3607 /* Expression code to give to the expression when it is built.
3608 Normally this is CODE, which is what the caller asked for,
3609 but in some special cases we change it. */
3610 enum tree_code resultcode
= code
;
3612 /* Data type in which the computation is to be performed.
3613 In the simplest cases this is the common type of the arguments. */
3614 tree result_type
= NULL
;
3616 /* Nonzero means operands have already been type-converted
3617 in whatever way is necessary.
3618 Zero means they need to be converted to RESULT_TYPE. */
3621 /* Nonzero means create the expression with this type, rather than
3623 tree build_type
= 0;
3625 /* Nonzero means after finally constructing the expression
3626 convert it to this type. */
3627 tree final_type
= 0;
3631 /* Nonzero if this is an operation like MIN or MAX which can
3632 safely be computed in short if both args are promoted shorts.
3633 Also implies COMMON.
3634 -1 indicates a bitwise operation; this makes a difference
3635 in the exact conditions for when it is safe to do the operation
3636 in a narrower mode. */
3639 /* Nonzero if this is a comparison operation;
3640 if both args are promoted shorts, compare the original shorts.
3641 Also implies COMMON. */
3642 int short_compare
= 0;
3644 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3647 /* True if both operands have arithmetic type. */
3648 bool arithmetic_types_p
;
3650 /* Apply default conversions. */
3654 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3655 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3656 || code
== TRUTH_XOR_EXPR
)
3658 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
3659 op0
= decay_conversion (op0
);
3660 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
3661 op1
= decay_conversion (op1
);
3665 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
3666 op0
= default_conversion (op0
);
3667 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
3668 op1
= default_conversion (op1
);
3671 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3672 STRIP_TYPE_NOPS (op0
);
3673 STRIP_TYPE_NOPS (op1
);
3675 /* DTRT if one side is an overloaded function, but complain about it. */
3676 if (type_unknown_p (op0
))
3678 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3679 if (t
!= error_mark_node
)
3681 if (complain
& tf_error
)
3682 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3687 if (type_unknown_p (op1
))
3689 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3690 if (t
!= error_mark_node
)
3692 if (complain
& tf_error
)
3693 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3699 type0
= TREE_TYPE (op0
);
3700 type1
= TREE_TYPE (op1
);
3702 /* The expression codes of the data types of the arguments tell us
3703 whether the arguments are integers, floating, pointers, etc. */
3704 code0
= TREE_CODE (type0
);
3705 code1
= TREE_CODE (type1
);
3707 /* If an error was already reported for one of the arguments,
3708 avoid reporting another error. */
3709 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3710 return error_mark_node
;
3712 if ((invalid_op_diag
3713 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3715 error (invalid_op_diag
);
3716 return error_mark_node
;
3719 /* Issue warnings about peculiar, but valid, uses of NULL. */
3720 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3721 /* It's reasonable to use pointer values as operands of &&
3722 and ||, so NULL is no exception. */
3723 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3724 && ( /* Both are NULL (or 0) and the operation was not a
3725 comparison or a pointer subtraction. */
3726 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3727 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
3728 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3729 || (!null_ptr_cst_p (orig_op0
)
3730 && !TYPE_PTR_P (type0
) && !TYPE_PTR_TO_MEMBER_P (type0
))
3731 || (!null_ptr_cst_p (orig_op1
)
3732 && !TYPE_PTR_P (type1
) && !TYPE_PTR_TO_MEMBER_P (type1
)))
3733 && (complain
& tf_warning
))
3734 /* Some sort of arithmetic operation involving NULL was
3736 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3741 /* Subtraction of two similar pointers.
3742 We must subtract them as integers, then divide by object size. */
3743 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3744 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3746 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3747 /* In all other cases except pointer - int, the usual arithmetic
3749 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3754 /* The pointer - int case is just like pointer + int; fall
3757 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3758 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3762 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3763 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3764 if (processing_template_decl
)
3766 result_type
= TREE_TYPE (ptr_operand
);
3769 return cp_pointer_int_sum (code
,
3780 case TRUNC_DIV_EXPR
:
3782 case FLOOR_DIV_EXPR
:
3783 case ROUND_DIV_EXPR
:
3784 case EXACT_DIV_EXPR
:
3785 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3786 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3787 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3788 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3790 enum tree_code tcode0
= code0
, tcode1
= code1
;
3792 warn_for_div_by_zero (location
, op1
);
3794 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3795 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3796 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3797 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3799 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3800 resultcode
= RDIV_EXPR
;
3802 /* When dividing two signed integers, we have to promote to int.
3803 unless we divide by a constant != -1. Note that default
3804 conversion will have been performed on the operands at this
3805 point, so we have to dig out the original type to find out if
3807 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3808 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3809 || (TREE_CODE (op1
) == INTEGER_CST
3810 && ! integer_all_onesp (op1
)));
3819 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3820 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3821 && !VECTOR_FLOAT_TYPE_P (type0
)
3822 && !VECTOR_FLOAT_TYPE_P (type1
)))
3826 case TRUNC_MOD_EXPR
:
3827 case FLOOR_MOD_EXPR
:
3828 warn_for_div_by_zero (location
, op1
);
3830 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3831 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
3832 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
3834 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3836 /* Although it would be tempting to shorten always here, that loses
3837 on some targets, since the modulo instruction is undefined if the
3838 quotient can't be represented in the computation mode. We shorten
3839 only if unsigned or if dividing by something we know != -1. */
3840 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3841 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3842 || (TREE_CODE (op1
) == INTEGER_CST
3843 && ! integer_all_onesp (op1
)));
3848 case TRUTH_ANDIF_EXPR
:
3849 case TRUTH_ORIF_EXPR
:
3850 case TRUTH_AND_EXPR
:
3852 result_type
= boolean_type_node
;
3855 /* Shift operations: result has same type as first operand;
3856 always convert second operand to int.
3857 Also set SHORT_SHIFT if shifting rightward. */
3860 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3862 result_type
= type0
;
3863 if (TREE_CODE (op1
) == INTEGER_CST
)
3865 if (tree_int_cst_lt (op1
, integer_zero_node
))
3867 if ((complain
& tf_warning
)
3868 && c_inhibit_evaluation_warnings
== 0)
3869 warning (0, "right shift count is negative");
3873 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3874 && (complain
& tf_warning
)
3875 && c_inhibit_evaluation_warnings
== 0)
3876 warning (0, "right shift count >= width of type");
3879 /* Convert the shift-count to an integer, regardless of
3880 size of value being shifted. */
3881 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3882 op1
= cp_convert (integer_type_node
, op1
);
3883 /* Avoid converting op1 to result_type later. */
3889 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3891 result_type
= type0
;
3892 if (TREE_CODE (op1
) == INTEGER_CST
)
3894 if (tree_int_cst_lt (op1
, integer_zero_node
))
3896 if ((complain
& tf_warning
)
3897 && c_inhibit_evaluation_warnings
== 0)
3898 warning (0, "left shift count is negative");
3900 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3902 if ((complain
& tf_warning
)
3903 && c_inhibit_evaluation_warnings
== 0)
3904 warning (0, "left shift count >= width of type");
3907 /* Convert the shift-count to an integer, regardless of
3908 size of value being shifted. */
3909 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3910 op1
= cp_convert (integer_type_node
, op1
);
3911 /* Avoid converting op1 to result_type later. */
3918 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3920 result_type
= type0
;
3921 if (TREE_CODE (op1
) == INTEGER_CST
)
3923 if (tree_int_cst_lt (op1
, integer_zero_node
))
3925 if (complain
& tf_warning
)
3926 warning (0, (code
== LROTATE_EXPR
)
3927 ? G_("left rotate count is negative")
3928 : G_("right rotate count is negative"));
3930 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3932 if (complain
& tf_warning
)
3933 warning (0, (code
== LROTATE_EXPR
)
3934 ? G_("left rotate count >= width of type")
3935 : G_("right rotate count >= width of type"));
3938 /* Convert the shift-count to an integer, regardless of
3939 size of value being shifted. */
3940 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3941 op1
= cp_convert (integer_type_node
, op1
);
3947 if ((complain
& tf_warning
)
3948 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
3949 warning (OPT_Wfloat_equal
,
3950 "comparing floating point with == or != is unsafe");
3951 if ((complain
& tf_warning
)
3952 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
3953 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
3954 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
3956 build_type
= boolean_type_node
;
3957 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3958 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
3959 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3960 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
3962 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3963 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
3964 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3965 CPO_COMPARISON
, complain
);
3966 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
3967 && null_ptr_cst_p (op1
))
3969 if (TREE_CODE (op0
) == ADDR_EXPR
3970 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
3972 if (complain
& tf_warning
)
3973 warning (OPT_Waddress
, "the address of %qD will never be NULL",
3974 TREE_OPERAND (op0
, 0));
3976 result_type
= type0
;
3978 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
3979 && null_ptr_cst_p (op0
))
3981 if (TREE_CODE (op1
) == ADDR_EXPR
3982 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
3984 if (complain
& tf_warning
)
3985 warning (OPT_Waddress
, "the address of %qD will never be NULL",
3986 TREE_OPERAND (op1
, 0));
3988 result_type
= type1
;
3990 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
3991 /* One of the operands must be of nullptr_t type. */
3992 result_type
= TREE_TYPE (nullptr_node
);
3993 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3995 result_type
= type0
;
3996 if (complain
& tf_error
)
3997 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
3999 return error_mark_node
;
4001 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4003 result_type
= type1
;
4004 if (complain
& tf_error
)
4005 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4007 return error_mark_node
;
4009 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
4011 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4012 == ptrmemfunc_vbit_in_delta
)
4014 tree pfn0
= pfn_from_ptrmemfunc (op0
);
4015 tree delta0
= delta_from_ptrmemfunc (op0
);
4016 tree e1
= cp_build_binary_op (location
,
4019 build_zero_cst (TREE_TYPE (pfn0
)),
4021 tree e2
= cp_build_binary_op (location
,
4026 e2
= cp_build_binary_op (location
,
4027 EQ_EXPR
, e2
, integer_zero_node
,
4029 op0
= cp_build_binary_op (location
,
4030 TRUTH_ANDIF_EXPR
, e1
, e2
,
4032 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
4036 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4037 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
4039 result_type
= TREE_TYPE (op0
);
4041 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4042 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4043 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4046 /* E will be the final comparison. */
4048 /* E1 and E2 are for scratch. */
4056 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4057 CPO_COMPARISON
, complain
);
4059 if (!same_type_p (TREE_TYPE (op0
), type
))
4060 op0
= cp_convert_and_check (type
, op0
);
4061 if (!same_type_p (TREE_TYPE (op1
), type
))
4062 op1
= cp_convert_and_check (type
, op1
);
4064 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4065 return error_mark_node
;
4067 if (TREE_SIDE_EFFECTS (op0
))
4068 op0
= save_expr (op0
);
4069 if (TREE_SIDE_EFFECTS (op1
))
4070 op1
= save_expr (op1
);
4072 pfn0
= pfn_from_ptrmemfunc (op0
);
4073 pfn1
= pfn_from_ptrmemfunc (op1
);
4074 delta0
= delta_from_ptrmemfunc (op0
);
4075 delta1
= delta_from_ptrmemfunc (op1
);
4076 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4077 == ptrmemfunc_vbit_in_delta
)
4082 && ((op0.delta == op1.delta)
4083 || (!op0.pfn && op0.delta & 1 == 0
4084 && op1.delta & 1 == 0))
4086 The reason for the `!op0.pfn' bit is that a NULL
4087 pointer-to-member is any member with a zero PFN and
4088 LSB of the DELTA field is 0. */
4090 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4094 e1
= cp_build_binary_op (location
,
4095 EQ_EXPR
, e1
, integer_zero_node
,
4097 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4101 e2
= cp_build_binary_op (location
,
4102 EQ_EXPR
, e2
, integer_zero_node
,
4104 e1
= cp_build_binary_op (location
,
4105 TRUTH_ANDIF_EXPR
, e2
, e1
,
4107 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4109 build_zero_cst (TREE_TYPE (pfn0
)),
4111 e2
= cp_build_binary_op (location
,
4112 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4113 e1
= cp_build_binary_op (location
,
4114 EQ_EXPR
, delta0
, delta1
, complain
);
4115 e1
= cp_build_binary_op (location
,
4116 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4123 && (!op0.pfn || op0.delta == op1.delta))
4125 The reason for the `!op0.pfn' bit is that a NULL
4126 pointer-to-member is any member with a zero PFN; the
4127 DELTA field is unspecified. */
4129 e1
= cp_build_binary_op (location
,
4130 EQ_EXPR
, delta0
, delta1
, complain
);
4131 e2
= cp_build_binary_op (location
,
4134 build_zero_cst (TREE_TYPE (pfn0
)),
4136 e1
= cp_build_binary_op (location
,
4137 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4139 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4140 e
= cp_build_binary_op (location
,
4141 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4142 if (code
== EQ_EXPR
)
4144 return cp_build_binary_op (location
,
4145 EQ_EXPR
, e
, integer_zero_node
, complain
);
4149 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4150 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4152 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4153 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4161 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4162 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4164 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4165 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4166 CPO_COMPARISON
, complain
);
4173 if (TREE_CODE (orig_op0
) == STRING_CST
4174 || TREE_CODE (orig_op1
) == STRING_CST
)
4176 if (complain
& tf_warning
)
4177 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4180 build_type
= boolean_type_node
;
4181 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4182 || code0
== ENUMERAL_TYPE
)
4183 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4184 || code1
== ENUMERAL_TYPE
))
4186 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4187 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4188 CPO_COMPARISON
, complain
);
4189 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4190 result_type
= type0
;
4191 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4192 result_type
= type1
;
4193 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4194 /* One of the operands must be of nullptr_t type. */
4195 result_type
= TREE_TYPE (nullptr_node
);
4196 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4198 result_type
= type0
;
4199 if (complain
& tf_error
)
4200 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4202 return error_mark_node
;
4204 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4206 result_type
= type1
;
4207 if (complain
& tf_error
)
4208 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4210 return error_mark_node
;
4214 case UNORDERED_EXPR
:
4221 build_type
= integer_type_node
;
4222 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4224 if (complain
& tf_error
)
4225 error ("unordered comparison on non-floating point argument");
4226 return error_mark_node
;
4235 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4236 || code0
== ENUMERAL_TYPE
)
4237 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4238 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4239 arithmetic_types_p
= 1;
4242 arithmetic_types_p
= 0;
4243 /* Vector arithmetic is only allowed when both sides are vectors. */
4244 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4246 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4247 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4250 binary_op_error (location
, code
, type0
, type1
);
4251 return error_mark_node
;
4253 arithmetic_types_p
= 1;
4256 /* Determine the RESULT_TYPE, if it is not already known. */
4258 && arithmetic_types_p
4259 && (shorten
|| common
|| short_compare
))
4261 result_type
= cp_common_type (type0
, type1
);
4262 do_warn_double_promotion (result_type
, type0
, type1
,
4263 "implicit conversion from %qT to %qT "
4264 "to match other operand of binary "
4271 if (complain
& tf_error
)
4272 error ("invalid operands of types %qT and %qT to binary %qO",
4273 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4274 return error_mark_node
;
4277 /* If we're in a template, the only thing we need to know is the
4279 if (processing_template_decl
)
4281 /* Since the middle-end checks the type when doing a build2, we
4282 need to build the tree in pieces. This built tree will never
4283 get out of the front-end as we replace it when instantiating
4285 tree tmp
= build2 (resultcode
,
4286 build_type
? build_type
: result_type
,
4288 TREE_OPERAND (tmp
, 0) = op0
;
4292 if (arithmetic_types_p
)
4294 bool first_complex
= (code0
== COMPLEX_TYPE
);
4295 bool second_complex
= (code1
== COMPLEX_TYPE
);
4296 int none_complex
= (!first_complex
&& !second_complex
);
4298 /* Adapted from patch for c/24581. */
4299 if (first_complex
!= second_complex
4300 && (code
== PLUS_EXPR
4301 || code
== MINUS_EXPR
4302 || code
== MULT_EXPR
4303 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4304 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4305 && flag_signed_zeros
)
4307 /* An operation on mixed real/complex operands must be
4308 handled specially, but the language-independent code can
4309 more easily optimize the plain complex arithmetic if
4310 -fno-signed-zeros. */
4311 tree real_type
= TREE_TYPE (result_type
);
4315 if (TREE_TYPE (op0
) != result_type
)
4316 op0
= cp_convert_and_check (result_type
, op0
);
4317 if (TREE_TYPE (op1
) != real_type
)
4318 op1
= cp_convert_and_check (real_type
, op1
);
4322 if (TREE_TYPE (op0
) != real_type
)
4323 op0
= cp_convert_and_check (real_type
, op0
);
4324 if (TREE_TYPE (op1
) != result_type
)
4325 op1
= cp_convert_and_check (result_type
, op1
);
4327 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4328 return error_mark_node
;
4331 op0
= save_expr (op0
);
4332 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4333 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4337 case TRUNC_DIV_EXPR
:
4338 op1
= save_expr (op1
);
4339 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4343 real
= build2 (resultcode
, real_type
, real
, op1
);
4351 op1
= save_expr (op1
);
4352 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4353 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4357 op0
= save_expr (op0
);
4358 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4361 real
= build2 (resultcode
, real_type
, op0
, real
);
4364 real
= build2 (resultcode
, real_type
, op0
, real
);
4365 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4371 real
= fold_if_not_in_template (real
);
4372 imag
= fold_if_not_in_template (imag
);
4373 result
= build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4374 result
= fold_if_not_in_template (result
);
4378 /* For certain operations (which identify themselves by shorten != 0)
4379 if both args were extended from the same smaller type,
4380 do the arithmetic in that type and then extend.
4382 shorten !=0 and !=1 indicates a bitwise operation.
4383 For them, this optimization is safe only if
4384 both args are zero-extended or both are sign-extended.
4385 Otherwise, we might change the result.
4386 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4387 but calculated in (unsigned short) it would be (unsigned short)-1. */
4389 if (shorten
&& none_complex
)
4391 final_type
= result_type
;
4392 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4396 /* Comparison operations are shortened too but differently.
4397 They identify themselves by setting short_compare = 1. */
4401 /* Don't write &op0, etc., because that would prevent op0
4402 from being kept in a register.
4403 Instead, make copies of the our local variables and
4404 pass the copies by reference, then copy them back afterward. */
4405 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4406 enum tree_code xresultcode
= resultcode
;
4408 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4410 return cp_convert (boolean_type_node
, val
);
4411 op0
= xop0
, op1
= xop1
;
4413 resultcode
= xresultcode
;
4416 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4417 && warn_sign_compare
4418 && !TREE_NO_WARNING (orig_op0
)
4419 && !TREE_NO_WARNING (orig_op1
)
4420 /* Do not warn until the template is instantiated; we cannot
4421 bound the ranges of the arguments until that point. */
4422 && !processing_template_decl
4423 && (complain
& tf_warning
)
4424 && c_inhibit_evaluation_warnings
== 0)
4426 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4427 result_type
, resultcode
);
4431 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4432 Then the expression will be built.
4433 It will be given type FINAL_TYPE if that is nonzero;
4434 otherwise, it will be given type RESULT_TYPE. */
4437 if (TREE_TYPE (op0
) != result_type
)
4438 op0
= cp_convert_and_check (result_type
, op0
);
4439 if (TREE_TYPE (op1
) != result_type
)
4440 op1
= cp_convert_and_check (result_type
, op1
);
4442 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4443 return error_mark_node
;
4446 if (build_type
== NULL_TREE
)
4447 build_type
= result_type
;
4449 result
= build2 (resultcode
, build_type
, op0
, op1
);
4450 result
= fold_if_not_in_template (result
);
4451 if (final_type
!= 0)
4452 result
= cp_convert (final_type
, result
);
4454 if (TREE_OVERFLOW_P (result
)
4455 && !TREE_OVERFLOW_P (op0
)
4456 && !TREE_OVERFLOW_P (op1
))
4457 overflow_warning (location
, result
);
4462 /* Return a tree for the sum or difference (RESULTCODE says which)
4463 of pointer PTROP and integer INTOP. */
4466 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4468 tree res_type
= TREE_TYPE (ptrop
);
4470 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4471 in certain circumstance (when it's valid to do so). So we need
4472 to make sure it's complete. We don't need to check here, if we
4473 can actually complete it at all, as those checks will be done in
4474 pointer_int_sum() anyway. */
4475 complete_type (TREE_TYPE (res_type
));
4477 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4478 fold_if_not_in_template (intop
));
4481 /* Return a tree for the difference of pointers OP0 and OP1.
4482 The resulting tree has type int. */
4485 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4488 tree restype
= ptrdiff_type_node
;
4489 tree target_type
= TREE_TYPE (ptrtype
);
4491 if (!complete_type_or_else (target_type
, NULL_TREE
))
4492 return error_mark_node
;
4494 if (TREE_CODE (target_type
) == VOID_TYPE
)
4495 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4496 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4497 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4498 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4499 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4501 /* First do the subtraction as integers;
4502 then drop through to build the divide operator. */
4504 op0
= cp_build_binary_op (input_location
,
4506 cp_convert (restype
, op0
),
4507 cp_convert (restype
, op1
),
4508 tf_warning_or_error
);
4510 /* This generates an error if op1 is a pointer to an incomplete type. */
4511 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4512 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4514 op1
= (TYPE_PTROB_P (ptrtype
)
4515 ? size_in_bytes (target_type
)
4516 : integer_one_node
);
4518 /* Do the division. */
4520 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4521 return fold_if_not_in_template (result
);
4524 /* Construct and perhaps optimize a tree representation
4525 for a unary operation. CODE, a tree_code, specifies the operation
4526 and XARG is the operand. */
4529 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4531 tree orig_expr
= xarg
;
4535 if (processing_template_decl
)
4537 if (type_dependent_expression_p (xarg
))
4538 return build_min_nt (code
, xarg
, NULL_TREE
);
4540 xarg
= build_non_dependent_expr (xarg
);
4545 /* [expr.unary.op] says:
4547 The address of an object of incomplete type can be taken.
4549 (And is just the ordinary address operator, not an overloaded
4550 "operator &".) However, if the type is a template
4551 specialization, we must complete the type at this point so that
4552 an overloaded "operator &" will be available if required. */
4553 if (code
== ADDR_EXPR
4554 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4555 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4556 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4557 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4558 /* Don't look for a function. */;
4560 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4561 /*overload=*/NULL
, complain
);
4562 if (!exp
&& code
== ADDR_EXPR
)
4564 if (is_overloaded_fn (xarg
))
4566 tree fn
= get_first_fn (xarg
);
4567 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4569 error (DECL_CONSTRUCTOR_P (fn
)
4570 ? G_("taking address of constructor %qE")
4571 : G_("taking address of destructor %qE"),
4573 return error_mark_node
;
4577 /* A pointer to member-function can be formed only by saying
4579 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4580 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4582 if (TREE_CODE (xarg
) != OFFSET_REF
4583 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4585 error ("invalid use of %qE to form a pointer-to-member-function",
4587 if (TREE_CODE (xarg
) != OFFSET_REF
)
4588 inform (input_location
, " a qualified-id is required");
4589 return error_mark_node
;
4593 error ("parentheses around %qE cannot be used to form a"
4594 " pointer-to-member-function",
4596 PTRMEM_OK_P (xarg
) = 1;
4600 if (TREE_CODE (xarg
) == OFFSET_REF
)
4602 ptrmem
= PTRMEM_OK_P (xarg
);
4604 if (!ptrmem
&& !flag_ms_extensions
4605 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4607 /* A single non-static member, make sure we don't allow a
4608 pointer-to-member. */
4609 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4610 TREE_OPERAND (xarg
, 0),
4611 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4612 PTRMEM_OK_P (xarg
) = ptrmem
;
4616 exp
= cp_build_addr_expr_strict (xarg
, complain
);
4619 if (processing_template_decl
&& exp
!= error_mark_node
)
4620 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4621 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4622 if (TREE_CODE (exp
) == ADDR_EXPR
)
4623 PTRMEM_OK_P (exp
) = ptrmem
;
4627 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4628 constants, where a null value is represented by an INTEGER_CST of
4632 cp_truthvalue_conversion (tree expr
)
4634 tree type
= TREE_TYPE (expr
);
4635 if (TYPE_PTRMEM_P (type
))
4636 return build_binary_op (EXPR_LOCATION (expr
),
4637 NE_EXPR
, expr
, integer_zero_node
, 1);
4639 return c_common_truthvalue_conversion (input_location
, expr
);
4642 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4645 condition_conversion (tree expr
)
4648 if (processing_template_decl
)
4650 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4651 tf_warning_or_error
, LOOKUP_NORMAL
);
4652 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4656 /* Returns the address of T. This function will fold away
4657 ADDR_EXPR of INDIRECT_REF. */
4660 build_address (tree t
)
4662 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4663 return error_mark_node
;
4664 t
= build_fold_addr_expr (t
);
4665 if (TREE_CODE (t
) != ADDR_EXPR
)
4670 /* Returns the address of T with type TYPE. */
4673 build_typed_address (tree t
, tree type
)
4675 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4676 return error_mark_node
;
4677 t
= build_fold_addr_expr_with_type (t
, type
);
4678 if (TREE_CODE (t
) != ADDR_EXPR
)
4683 /* Return a NOP_EXPR converting EXPR to TYPE. */
4686 build_nop (tree type
, tree expr
)
4688 if (type
== error_mark_node
|| error_operand_p (expr
))
4690 return build1 (NOP_EXPR
, type
, expr
);
4693 /* Take the address of ARG, whatever that means under C++ semantics.
4694 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
4695 and class rvalues as well.
4697 Nothing should call this function directly; instead, callers should use
4698 cp_build_addr_expr or cp_build_addr_expr_strict. */
4701 cp_build_addr_expr_1 (tree arg
, bool strict_lvalue
, tsubst_flags_t complain
)
4706 if (!arg
|| error_operand_p (arg
))
4707 return error_mark_node
;
4709 arg
= mark_lvalue_use (arg
);
4710 argtype
= lvalue_type (arg
);
4712 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
4713 || !IDENTIFIER_OPNAME_P (arg
));
4715 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
4716 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
4718 /* They're trying to take the address of a unique non-static
4719 member function. This is ill-formed (except in MS-land),
4720 but let's try to DTRT.
4721 Note: We only handle unique functions here because we don't
4722 want to complain if there's a static overload; non-unique
4723 cases will be handled by instantiate_type. But we need to
4724 handle this case here to allow casts on the resulting PMF.
4725 We could defer this in non-MS mode, but it's easier to give
4726 a useful error here. */
4728 /* Inside constant member functions, the `this' pointer
4729 contains an extra const qualifier. TYPE_MAIN_VARIANT
4730 is used here to remove this const from the diagnostics
4731 and the created OFFSET_REF. */
4732 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
4733 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
4736 if (! flag_ms_extensions
)
4738 tree name
= DECL_NAME (fn
);
4739 if (!(complain
& tf_error
))
4740 return error_mark_node
;
4741 else if (current_class_type
4742 && TREE_OPERAND (arg
, 0) == current_class_ref
)
4743 /* An expression like &memfn. */
4744 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
4745 " or parenthesized non-static member function to form"
4746 " a pointer to member function. Say %<&%T::%D%>",
4749 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
4750 " function to form a pointer to member function."
4754 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
4757 /* Uninstantiated types are all functions. Taking the
4758 address of a function is a no-op, so just return the
4760 if (type_unknown_p (arg
))
4761 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4763 if (TREE_CODE (arg
) == OFFSET_REF
)
4764 /* We want a pointer to member; bypass all the code for actually taking
4765 the address of something. */
4768 /* Anything not already handled and not a true memory reference
4770 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4771 && TREE_CODE (argtype
) != METHOD_TYPE
)
4773 cp_lvalue_kind kind
= lvalue_kind (arg
);
4774 if (kind
== clk_none
)
4776 if (complain
& tf_error
)
4777 lvalue_error (input_location
, lv_addressof
);
4778 return error_mark_node
;
4780 if (strict_lvalue
&& (kind
& (clk_rvalueref
|clk_class
)))
4782 if (!(complain
& tf_error
))
4783 return error_mark_node
;
4784 if (kind
& clk_class
)
4785 /* Make this a permerror because we used to accept it. */
4786 permerror (input_location
, "taking address of temporary");
4788 error ("taking address of xvalue (rvalue reference)");
4792 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4794 tree type
= build_pointer_type (TREE_TYPE (argtype
));
4795 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4798 else if (pedantic
&& DECL_MAIN_P (arg
))
4801 /* Apparently a lot of autoconf scripts for C++ packages do this,
4802 so only complain if -pedantic. */
4803 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
4804 pedwarn (input_location
, OPT_pedantic
,
4805 "ISO C++ forbids taking address of function %<::main%>");
4806 else if (flag_pedantic_errors
)
4807 return error_mark_node
;
4810 /* Let &* cancel out to simplify resulting code. */
4811 if (TREE_CODE (arg
) == INDIRECT_REF
)
4813 /* We don't need to have `current_class_ptr' wrapped in a
4814 NON_LVALUE_EXPR node. */
4815 if (arg
== current_class_ref
)
4816 return current_class_ptr
;
4818 arg
= TREE_OPERAND (arg
, 0);
4819 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
4821 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
4822 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4825 /* Don't let this be an lvalue. */
4830 /* ??? Cope with user tricks that amount to offsetof. */
4831 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4832 && TREE_CODE (argtype
) != METHOD_TYPE
4833 && argtype
!= unknown_type_node
4834 && (val
= get_base_address (arg
))
4835 && COMPLETE_TYPE_P (TREE_TYPE (val
))
4836 && TREE_CODE (val
) == INDIRECT_REF
4837 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
4839 tree type
= build_pointer_type (argtype
);
4840 tree op0
= fold_convert (type
, TREE_OPERAND (val
, 0));
4841 tree op1
= fold_offsetof (arg
, val
);
4842 return fold_build_pointer_plus (op0
, op1
);
4845 /* Handle complex lvalues (when permitted)
4846 by reduction to simpler cases. */
4847 val
= unary_complex_lvalue (ADDR_EXPR
, arg
);
4851 switch (TREE_CODE (arg
))
4855 case FIX_TRUNC_EXPR
:
4856 /* Even if we're not being pedantic, we cannot allow this
4857 extension when we're instantiating in a SFINAE
4859 if (! lvalue_p (arg
) && complain
== tf_none
)
4861 if (complain
& tf_error
)
4862 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4864 return error_mark_node
;
4869 arg
= BASELINK_FUNCTIONS (arg
);
4873 arg
= OVL_CURRENT (arg
);
4878 /* Turn a reference to a non-static data member into a
4879 pointer-to-member. */
4884 gcc_assert (PTRMEM_OK_P (arg
));
4886 t
= TREE_OPERAND (arg
, 1);
4887 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
4889 if (complain
& tf_error
)
4890 error ("cannot create pointer to reference member %qD", t
);
4891 return error_mark_node
;
4894 type
= build_ptrmem_type (context_for_name_lookup (t
),
4896 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
4904 if (argtype
!= error_mark_node
)
4905 argtype
= build_pointer_type (argtype
);
4907 /* In a template, we are processing a non-dependent expression
4908 so we can just form an ADDR_EXPR with the correct type. */
4909 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
4911 val
= build_address (arg
);
4912 if (TREE_CODE (arg
) == OFFSET_REF
)
4913 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
4915 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
4917 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
4919 /* We can only get here with a single static member
4921 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4922 && DECL_STATIC_FUNCTION_P (fn
));
4924 val
= build_address (fn
);
4925 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
4926 /* Do not lose object's side effects. */
4927 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
4928 TREE_OPERAND (arg
, 0), val
);
4930 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
4932 if (complain
& tf_error
)
4933 error ("attempt to take address of bit-field structure member %qD",
4934 TREE_OPERAND (arg
, 1));
4935 return error_mark_node
;
4939 tree object
= TREE_OPERAND (arg
, 0);
4940 tree field
= TREE_OPERAND (arg
, 1);
4941 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4942 (TREE_TYPE (object
), decl_type_context (field
)));
4943 val
= build_address (arg
);
4946 if (TREE_CODE (argtype
) == POINTER_TYPE
4947 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
4949 build_ptrmemfunc_type (argtype
);
4950 val
= build_ptrmemfunc (argtype
, val
, 0,
4952 tf_warning_or_error
);
4958 /* Take the address of ARG if it has one, even if it's an rvalue. */
4961 cp_build_addr_expr (tree arg
, tsubst_flags_t complain
)
4963 return cp_build_addr_expr_1 (arg
, 0, complain
);
4966 /* Take the address of ARG, but only if it's an lvalue. */
4969 cp_build_addr_expr_strict (tree arg
, tsubst_flags_t complain
)
4971 return cp_build_addr_expr_1 (arg
, 1, complain
);
4974 /* C++: Must handle pointers to members.
4976 Perhaps type instantiation should be extended to handle conversion
4977 from aggregates to types we don't yet know we want? (Or are those
4978 cases typically errors which should be reported?)
4980 NOCONVERT nonzero suppresses the default promotions
4981 (such as from short to int). */
4984 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
4985 tsubst_flags_t complain
)
4987 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4990 const char *errstring
= NULL
;
4992 const char *invalid_op_diag
;
4994 if (!arg
|| error_operand_p (arg
))
4995 return error_mark_node
;
4997 if ((invalid_op_diag
4998 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
5003 error (invalid_op_diag
);
5004 return error_mark_node
;
5009 case UNARY_PLUS_EXPR
:
5012 int flags
= WANT_ARITH
| WANT_ENUM
;
5013 /* Unary plus (but not unary minus) is allowed on pointers. */
5014 if (code
== UNARY_PLUS_EXPR
)
5015 flags
|= WANT_POINTER
;
5016 arg
= build_expr_type_conversion (flags
, arg
, true);
5018 errstring
= (code
== NEGATE_EXPR
5019 ? _("wrong type argument to unary minus")
5020 : _("wrong type argument to unary plus"));
5023 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5024 arg
= perform_integral_promotions (arg
);
5026 /* Make sure the result is not an lvalue: a unary plus or minus
5027 expression is always a rvalue. */
5034 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5038 arg
= default_conversion (arg
);
5040 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
5041 | WANT_VECTOR_OR_COMPLEX
,
5043 errstring
= _("wrong type argument to bit-complement");
5044 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5045 arg
= perform_integral_promotions (arg
);
5049 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5050 errstring
= _("wrong type argument to abs");
5051 else if (!noconvert
)
5052 arg
= default_conversion (arg
);
5056 /* Conjugating a real value is a no-op, but allow it anyway. */
5057 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5058 errstring
= _("wrong type argument to conjugation");
5059 else if (!noconvert
)
5060 arg
= default_conversion (arg
);
5063 case TRUTH_NOT_EXPR
:
5064 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
5066 val
= invert_truthvalue_loc (input_location
, arg
);
5067 if (arg
!= error_mark_node
)
5069 errstring
= _("in argument to unary !");
5077 arg
= build_real_imag_expr (input_location
, code
, arg
);
5078 if (arg
== error_mark_node
)
5081 return fold_if_not_in_template (arg
);
5083 case PREINCREMENT_EXPR
:
5084 case POSTINCREMENT_EXPR
:
5085 case PREDECREMENT_EXPR
:
5086 case POSTDECREMENT_EXPR
:
5087 /* Handle complex lvalues (when permitted)
5088 by reduction to simpler cases. */
5090 val
= unary_complex_lvalue (code
, arg
);
5094 arg
= mark_lvalue_use (arg
);
5096 /* Increment or decrement the real part of the value,
5097 and don't change the imaginary part. */
5098 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5102 arg
= stabilize_reference (arg
);
5103 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
5104 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
5105 real
= cp_build_unary_op (code
, real
, 1, complain
);
5106 if (real
== error_mark_node
|| imag
== error_mark_node
)
5107 return error_mark_node
;
5108 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
5112 /* Report invalid types. */
5114 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
5117 if (code
== PREINCREMENT_EXPR
)
5118 errstring
= _("no pre-increment operator for type");
5119 else if (code
== POSTINCREMENT_EXPR
)
5120 errstring
= _("no post-increment operator for type");
5121 else if (code
== PREDECREMENT_EXPR
)
5122 errstring
= _("no pre-decrement operator for type");
5124 errstring
= _("no post-decrement operator for type");
5127 else if (arg
== error_mark_node
)
5128 return error_mark_node
;
5130 /* Report something read-only. */
5132 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
5133 || TREE_READONLY (arg
))
5135 if (complain
& tf_error
)
5136 cxx_readonly_error (arg
, ((code
== PREINCREMENT_EXPR
5137 || code
== POSTINCREMENT_EXPR
)
5138 ? lv_increment
: lv_decrement
));
5140 return error_mark_node
;
5145 tree declared_type
= unlowered_expr_type (arg
);
5147 argtype
= TREE_TYPE (arg
);
5149 /* ARM $5.2.5 last annotation says this should be forbidden. */
5150 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
5152 if (complain
& tf_error
)
5153 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
5154 ? G_("ISO C++ forbids incrementing an enum")
5155 : G_("ISO C++ forbids decrementing an enum"));
5157 return error_mark_node
;
5160 /* Compute the increment. */
5162 if (TREE_CODE (argtype
) == POINTER_TYPE
)
5164 tree type
= complete_type (TREE_TYPE (argtype
));
5166 if (!COMPLETE_OR_VOID_TYPE_P (type
))
5168 if (complain
& tf_error
)
5169 error (((code
== PREINCREMENT_EXPR
5170 || code
== POSTINCREMENT_EXPR
))
5171 ? G_("cannot increment a pointer to incomplete type %qT")
5172 : G_("cannot decrement a pointer to incomplete type %qT"),
5173 TREE_TYPE (argtype
));
5175 return error_mark_node
;
5177 else if ((pedantic
|| warn_pointer_arith
)
5178 && !TYPE_PTROB_P (argtype
))
5180 if (complain
& tf_error
)
5181 permerror (input_location
, (code
== PREINCREMENT_EXPR
5182 || code
== POSTINCREMENT_EXPR
)
5183 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
5184 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
5187 return error_mark_node
;
5190 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
5193 inc
= integer_one_node
;
5195 inc
= cp_convert (argtype
, inc
);
5197 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
5198 need to ask Objective-C to build the increment or decrement
5199 expression for it. */
5200 if (objc_is_property_ref (arg
))
5201 return objc_build_incr_expr_for_property_ref (input_location
, code
,
5204 /* Complain about anything else that is not a true lvalue. */
5205 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
5206 || code
== POSTINCREMENT_EXPR
)
5207 ? lv_increment
: lv_decrement
),
5209 return error_mark_node
;
5211 /* Forbid using -- on `bool'. */
5212 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
5214 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
5216 if (complain
& tf_error
)
5217 error ("invalid use of Boolean expression as operand "
5218 "to %<operator--%>");
5219 return error_mark_node
;
5221 val
= boolean_increment (code
, arg
);
5223 else if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
5224 /* An rvalue has no cv-qualifiers. */
5225 val
= build2 (code
, cv_unqualified (TREE_TYPE (arg
)), arg
, inc
);
5227 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
5229 TREE_SIDE_EFFECTS (val
) = 1;
5234 /* Note that this operation never does default_conversion
5235 regardless of NOCONVERT. */
5236 return cp_build_addr_expr (arg
, complain
);
5245 argtype
= TREE_TYPE (arg
);
5246 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5249 if (complain
& tf_error
)
5250 error ("%s", errstring
);
5251 return error_mark_node
;
5254 /* Hook for the c-common bits that build a unary op. */
5256 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5257 enum tree_code code
, tree xarg
, int noconvert
)
5259 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5262 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5263 for certain kinds of expressions which are not really lvalues
5264 but which we can accept as lvalues.
5266 If ARG is not a kind of expression we can handle, return
5270 unary_complex_lvalue (enum tree_code code
, tree arg
)
5272 /* Inside a template, making these kinds of adjustments is
5273 pointless; we are only concerned with the type of the
5275 if (processing_template_decl
)
5278 /* Handle (a, b) used as an "lvalue". */
5279 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5281 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5282 tf_warning_or_error
);
5283 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5284 TREE_OPERAND (arg
, 0), real_result
);
5287 /* Handle (a ? b : c) used as an "lvalue". */
5288 if (TREE_CODE (arg
) == COND_EXPR
5289 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5290 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5292 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5293 if (TREE_CODE (arg
) == MODIFY_EXPR
5294 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5295 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5297 tree lvalue
= TREE_OPERAND (arg
, 0);
5298 if (TREE_SIDE_EFFECTS (lvalue
))
5300 lvalue
= stabilize_reference (lvalue
);
5301 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5302 lvalue
, TREE_OPERAND (arg
, 1));
5304 return unary_complex_lvalue
5305 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5308 if (code
!= ADDR_EXPR
)
5311 /* Handle (a = b) used as an "lvalue" for `&'. */
5312 if (TREE_CODE (arg
) == MODIFY_EXPR
5313 || TREE_CODE (arg
) == INIT_EXPR
)
5315 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5316 tf_warning_or_error
);
5317 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5319 TREE_NO_WARNING (arg
) = 1;
5323 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5324 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5325 || TREE_CODE (arg
) == OFFSET_REF
)
5328 /* We permit compiler to make function calls returning
5329 objects of aggregate type look like lvalues. */
5333 if (TREE_CODE (targ
) == SAVE_EXPR
)
5334 targ
= TREE_OPERAND (targ
, 0);
5336 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5338 if (TREE_CODE (arg
) == SAVE_EXPR
)
5341 targ
= build_cplus_new (TREE_TYPE (arg
), arg
, tf_warning_or_error
);
5342 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5345 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5346 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5347 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5350 /* Don't let anything else be handled specially. */
5354 /* Mark EXP saying that we need to be able to take the
5355 address of it; it should not be allocated in a register.
5356 Value is true if successful.
5358 C++: we do not allow `current_class_ptr' to be addressable. */
5361 cxx_mark_addressable (tree exp
)
5366 switch (TREE_CODE (x
))
5373 x
= TREE_OPERAND (x
, 0);
5377 if (x
== current_class_ptr
)
5379 error ("cannot take the address of %<this%>, which is an rvalue expression");
5380 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5386 /* Caller should not be trying to mark initialized
5387 constant fields addressable. */
5388 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5389 || DECL_IN_AGGR_P (x
) == 0
5391 || DECL_EXTERNAL (x
));
5395 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5396 && !DECL_ARTIFICIAL (x
))
5398 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5401 ("address of explicit register variable %qD requested", x
);
5404 else if (extra_warnings
)
5406 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5408 TREE_ADDRESSABLE (x
) = 1;
5413 TREE_ADDRESSABLE (x
) = 1;
5417 TREE_ADDRESSABLE (x
) = 1;
5421 TREE_ADDRESSABLE (x
) = 1;
5422 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5430 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5433 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5434 tsubst_flags_t complain
)
5436 tree orig_ifexp
= ifexp
;
5437 tree orig_op1
= op1
;
5438 tree orig_op2
= op2
;
5441 if (processing_template_decl
)
5443 /* The standard says that the expression is type-dependent if
5444 IFEXP is type-dependent, even though the eventual type of the
5445 expression doesn't dependent on IFEXP. */
5446 if (type_dependent_expression_p (ifexp
)
5447 /* As a GNU extension, the middle operand may be omitted. */
5448 || (op1
&& type_dependent_expression_p (op1
))
5449 || type_dependent_expression_p (op2
))
5450 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5451 ifexp
= build_non_dependent_expr (ifexp
);
5453 op1
= build_non_dependent_expr (op1
);
5454 op2
= build_non_dependent_expr (op2
);
5457 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5458 if (processing_template_decl
&& expr
!= error_mark_node
)
5459 return build_min_non_dep (COND_EXPR
, expr
,
5460 orig_ifexp
, orig_op1
, orig_op2
);
5464 /* Given a list of expressions, return a compound expression
5465 that performs them all and returns the value of the last of them. */
5468 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
,
5469 tsubst_flags_t complain
)
5471 tree expr
= TREE_VALUE (list
);
5473 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
5474 && !CONSTRUCTOR_IS_DIRECT_INIT (expr
))
5476 if (complain
& tf_error
)
5477 pedwarn (EXPR_LOC_OR_HERE (expr
), 0, "list-initializer for "
5478 "non-class type must not be parenthesized");
5480 return error_mark_node
;
5483 if (TREE_CHAIN (list
))
5485 if (complain
& tf_error
)
5489 permerror (input_location
, "expression list treated as compound "
5490 "expression in initializer");
5493 permerror (input_location
, "expression list treated as compound "
5494 "expression in mem-initializer");
5497 permerror (input_location
, "expression list treated as compound "
5498 "expression in functional cast");
5504 return error_mark_node
;
5506 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5507 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5514 /* Like build_x_compound_expr_from_list, but using a VEC. */
5517 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5519 if (VEC_empty (tree
, vec
))
5521 else if (VEC_length (tree
, vec
) == 1)
5522 return VEC_index (tree
, vec
, 0);
5530 permerror (input_location
,
5531 "%s expression list treated as compound expression",
5534 expr
= VEC_index (tree
, vec
, 0);
5535 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5536 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5542 /* Handle overloading of the ',' operator when needed. */
5545 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5548 tree orig_op1
= op1
;
5549 tree orig_op2
= op2
;
5551 if (processing_template_decl
)
5553 if (type_dependent_expression_p (op1
)
5554 || type_dependent_expression_p (op2
))
5555 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5556 op1
= build_non_dependent_expr (op1
);
5557 op2
= build_non_dependent_expr (op2
);
5560 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5561 /*overload=*/NULL
, complain
);
5563 result
= cp_build_compound_expr (op1
, op2
, complain
);
5565 if (processing_template_decl
&& result
!= error_mark_node
)
5566 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5571 /* Like cp_build_compound_expr, but for the c-common bits. */
5574 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5576 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5579 /* Build a compound expression. */
5582 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5584 lhs
= convert_to_void (lhs
, ICV_LEFT_OF_COMMA
, complain
);
5586 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5587 return error_mark_node
;
5589 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5591 /* If the rhs is a TARGET_EXPR, then build the compound
5592 expression inside the target_expr's initializer. This
5593 helps the compiler to eliminate unnecessary temporaries. */
5594 tree init
= TREE_OPERAND (rhs
, 1);
5596 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5597 TREE_OPERAND (rhs
, 1) = init
;
5602 if (type_unknown_p (rhs
))
5604 error ("no context to resolve type of %qE", rhs
);
5605 return error_mark_node
;
5608 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5611 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5612 casts away constness. CAST gives the type of cast. Returns true
5613 if the cast is ill-formed, false if it is well-formed.
5615 ??? This function warns for casting away any qualifier not just
5616 const. We would like to specify exactly what qualifiers are casted
5621 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5622 enum tree_code cast
, tsubst_flags_t complain
)
5624 /* C-style casts are allowed to cast away constness. With
5625 WARN_CAST_QUAL, we still want to issue a warning. */
5626 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5629 if (!casts_away_constness (src_type
, dest_type
))
5635 if (complain
& tf_warning
)
5636 warning (OPT_Wcast_qual
,
5637 "cast from type %qT to type %qT casts away qualifiers",
5638 src_type
, dest_type
);
5641 case STATIC_CAST_EXPR
:
5642 if (complain
& tf_error
)
5643 error ("static_cast from type %qT to type %qT casts away qualifiers",
5644 src_type
, dest_type
);
5647 case REINTERPRET_CAST_EXPR
:
5648 if (complain
& tf_error
)
5649 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5650 src_type
, dest_type
);
5658 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5659 (another pointer-to-member type in the same hierarchy) and return
5660 the converted expression. If ALLOW_INVERSE_P is permitted, a
5661 pointer-to-derived may be converted to pointer-to-base; otherwise,
5662 only the other direction is permitted. If C_CAST_P is true, this
5663 conversion is taking place as part of a C-style cast. */
5666 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5667 bool c_cast_p
, tsubst_flags_t complain
)
5669 if (TYPE_PTRMEM_P (type
))
5673 if (TREE_CODE (expr
) == PTRMEM_CST
)
5674 expr
= cplus_expand_constant (expr
);
5675 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5676 TYPE_PTRMEM_CLASS_TYPE (type
),
5678 c_cast_p
, complain
);
5679 if (delta
== error_mark_node
)
5680 return error_mark_node
;
5682 if (!integer_zerop (delta
))
5684 tree cond
, op1
, op2
;
5686 cond
= cp_build_binary_op (input_location
,
5689 build_int_cst (TREE_TYPE (expr
), -1),
5690 tf_warning_or_error
);
5691 op1
= build_nop (ptrdiff_type_node
, expr
);
5692 op2
= cp_build_binary_op (input_location
,
5693 PLUS_EXPR
, op1
, delta
,
5694 tf_warning_or_error
);
5696 expr
= fold_build3_loc (input_location
,
5697 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5701 return build_nop (type
, expr
);
5704 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5705 allow_inverse_p
, c_cast_p
, complain
);
5708 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5709 this static_cast is being attempted as one of the possible casts
5710 allowed by a C-style cast. (In that case, accessibility of base
5711 classes is not considered, and it is OK to cast away
5712 constness.) Return the result of the cast. *VALID_P is set to
5713 indicate whether or not the cast was valid. */
5716 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5717 bool *valid_p
, tsubst_flags_t complain
)
5722 /* Assume the cast is valid. */
5725 intype
= TREE_TYPE (expr
);
5727 /* Save casted types in the function's used types hash table. */
5728 used_types_insert (type
);
5730 /* [expr.static.cast]
5732 An lvalue of type "cv1 B", where B is a class type, can be cast
5733 to type "reference to cv2 D", where D is a class derived (clause
5734 _class.derived_) from B, if a valid standard conversion from
5735 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5736 same cv-qualification as, or greater cv-qualification than, cv1,
5737 and B is not a virtual base class of D. */
5738 /* We check this case before checking the validity of "TYPE t =
5739 EXPR;" below because for this case:
5742 struct D : public B { D(const B&); };
5744 void f() { static_cast<const D&>(b); }
5746 we want to avoid constructing a new D. The standard is not
5747 completely clear about this issue, but our interpretation is
5748 consistent with other compilers. */
5749 if (TREE_CODE (type
) == REFERENCE_TYPE
5750 && CLASS_TYPE_P (TREE_TYPE (type
))
5751 && CLASS_TYPE_P (intype
)
5752 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5753 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5754 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5755 build_pointer_type (TYPE_MAIN_VARIANT
5756 (TREE_TYPE (type
))))
5758 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5762 /* There is a standard conversion from "D*" to "B*" even if "B"
5763 is ambiguous or inaccessible. If this is really a
5764 static_cast, then we check both for inaccessibility and
5765 ambiguity. However, if this is a static_cast being performed
5766 because the user wrote a C-style cast, then accessibility is
5768 base
= lookup_base (TREE_TYPE (type
), intype
,
5769 c_cast_p
? ba_unique
: ba_check
,
5772 /* Convert from "B*" to "D*". This function will check that "B"
5773 is not a virtual base of "D". */
5774 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5775 base
, /*nonnull=*/false);
5776 /* Convert the pointer to a reference -- but then remember that
5777 there are no expressions with reference type in C++.
5779 We call rvalue so that there's an actual tree code
5780 (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
5781 is a variable with the same type, the conversion would get folded
5782 away, leaving just the variable and causing lvalue_kind to give
5783 the wrong answer. */
5784 return convert_from_reference (rvalue (cp_fold_convert (type
, expr
)));
5787 /* "A glvalue of type cv1 T1 can be cast to type rvalue reference to
5788 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5789 if (TREE_CODE (type
) == REFERENCE_TYPE
5790 && TYPE_REF_IS_RVALUE (type
)
5791 && lvalue_or_rvalue_with_address_p (expr
)
5792 && reference_related_p (TREE_TYPE (type
), intype
)
5793 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5795 expr
= build_typed_address (expr
, type
);
5796 return convert_from_reference (expr
);
5799 /* Resolve overloaded address here rather than once in
5800 implicit_conversion and again in the inverse code below. */
5801 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5803 expr
= instantiate_type (type
, expr
, complain
);
5804 intype
= TREE_TYPE (expr
);
5807 /* [expr.static.cast]
5809 An expression e can be explicitly converted to a type T using a
5810 static_cast of the form static_cast<T>(e) if the declaration T
5811 t(e);" is well-formed, for some invented temporary variable
5813 result
= perform_direct_initialization_if_possible (type
, expr
,
5814 c_cast_p
, complain
);
5817 result
= convert_from_reference (result
);
5819 /* [expr.static.cast]
5821 If T is a reference type, the result is an lvalue; otherwise,
5822 the result is an rvalue. */
5823 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5824 result
= rvalue (result
);
5828 /* [expr.static.cast]
5830 Any expression can be explicitly converted to type cv void. */
5831 if (TREE_CODE (type
) == VOID_TYPE
)
5832 return convert_to_void (expr
, ICV_CAST
, complain
);
5834 /* [expr.static.cast]
5836 The inverse of any standard conversion sequence (clause _conv_),
5837 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5838 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5839 (_conv.bool_) conversions, can be performed explicitly using
5840 static_cast subject to the restriction that the explicit
5841 conversion does not cast away constness (_expr.const.cast_), and
5842 the following additional rules for specific cases: */
5843 /* For reference, the conversions not excluded are: integral
5844 promotions, floating point promotion, integral conversions,
5845 floating point conversions, floating-integral conversions,
5846 pointer conversions, and pointer to member conversions. */
5849 A value of integral _or enumeration_ type can be explicitly
5850 converted to an enumeration type. */
5851 /* The effect of all that is that any conversion between any two
5852 types which are integral, floating, or enumeration types can be
5854 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5855 || SCALAR_FLOAT_TYPE_P (type
))
5856 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5857 || SCALAR_FLOAT_TYPE_P (intype
)))
5858 return ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5860 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5861 && CLASS_TYPE_P (TREE_TYPE (type
))
5862 && CLASS_TYPE_P (TREE_TYPE (intype
))
5863 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5864 (TREE_TYPE (intype
))),
5865 build_pointer_type (TYPE_MAIN_VARIANT
5866 (TREE_TYPE (type
)))))
5871 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
5873 return error_mark_node
;
5874 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
5875 c_cast_p
? ba_unique
: ba_check
,
5877 expr
= build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
5878 return cp_fold_convert(type
, expr
);
5881 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5882 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5889 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
5890 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
5892 if (TYPE_PTRMEM_P (type
))
5894 t1
= (build_ptrmem_type
5896 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
5897 t2
= (build_ptrmem_type
5899 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
5906 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
5909 && check_for_casting_away_constness (intype
, type
,
5912 return error_mark_node
;
5913 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
5914 c_cast_p
, complain
);
5918 /* [expr.static.cast]
5920 An rvalue of type "pointer to cv void" can be explicitly
5921 converted to a pointer to object type. A value of type pointer
5922 to object converted to "pointer to cv void" and back to the
5923 original pointer type will have its original value. */
5924 if (TREE_CODE (intype
) == POINTER_TYPE
5925 && VOID_TYPE_P (TREE_TYPE (intype
))
5926 && TYPE_PTROB_P (type
))
5929 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
5931 return error_mark_node
;
5932 return build_nop (type
, expr
);
5936 return error_mark_node
;
5939 /* Return an expression representing static_cast<TYPE>(EXPR). */
5942 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5947 if (type
== error_mark_node
|| expr
== error_mark_node
)
5948 return error_mark_node
;
5950 if (processing_template_decl
)
5952 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
5953 /* We don't know if it will or will not have side effects. */
5954 TREE_SIDE_EFFECTS (expr
) = 1;
5955 return convert_from_reference (expr
);
5958 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5959 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5960 if (TREE_CODE (type
) != REFERENCE_TYPE
5961 && TREE_CODE (expr
) == NOP_EXPR
5962 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5963 expr
= TREE_OPERAND (expr
, 0);
5965 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
5970 if (complain
& tf_error
)
5971 error ("invalid static_cast from type %qT to type %qT",
5972 TREE_TYPE (expr
), type
);
5973 return error_mark_node
;
5976 /* EXPR is an expression with member function or pointer-to-member
5977 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5978 not permitted by ISO C++, but we accept it in some modes. If we
5979 are not in one of those modes, issue a diagnostic. Return the
5980 converted expression. */
5983 convert_member_func_to_ptr (tree type
, tree expr
)
5988 intype
= TREE_TYPE (expr
);
5989 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
5990 || TREE_CODE (intype
) == METHOD_TYPE
);
5992 if (pedantic
|| warn_pmf2ptr
)
5993 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
5994 "converting from %qT to %qT", intype
, type
);
5996 if (TREE_CODE (intype
) == METHOD_TYPE
)
5997 expr
= build_addr_func (expr
);
5998 else if (TREE_CODE (expr
) == PTRMEM_CST
)
5999 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
6002 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
6003 decl
= build_address (decl
);
6004 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
6007 return build_nop (type
, expr
);
6010 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
6011 If C_CAST_P is true, this reinterpret cast is being done as part of
6012 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
6013 indicate whether or not reinterpret_cast was valid. */
6016 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6017 bool *valid_p
, tsubst_flags_t complain
)
6021 /* Assume the cast is invalid. */
6025 if (type
== error_mark_node
|| error_operand_p (expr
))
6026 return error_mark_node
;
6028 intype
= TREE_TYPE (expr
);
6030 /* Save casted types in the function's used types hash table. */
6031 used_types_insert (type
);
6033 /* [expr.reinterpret.cast]
6034 An lvalue expression of type T1 can be cast to the type
6035 "reference to T2" if an expression of type "pointer to T1" can be
6036 explicitly converted to the type "pointer to T2" using a
6037 reinterpret_cast. */
6038 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6040 if (! real_lvalue_p (expr
))
6042 if (complain
& tf_error
)
6043 error ("invalid cast of an rvalue expression of type "
6046 return error_mark_node
;
6049 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6050 "B" are related class types; the reinterpret_cast does not
6051 adjust the pointer. */
6052 if (TYPE_PTR_P (intype
)
6053 && (complain
& tf_warning
)
6054 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
6055 COMPARE_BASE
| COMPARE_DERIVED
)))
6056 warning (0, "casting %qT to %qT does not dereference pointer",
6059 expr
= cp_build_addr_expr (expr
, complain
);
6061 if (warn_strict_aliasing
> 2)
6062 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
6064 if (expr
!= error_mark_node
)
6065 expr
= build_reinterpret_cast_1
6066 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
6068 if (expr
!= error_mark_node
)
6069 /* cp_build_indirect_ref isn't right for rvalue refs. */
6070 expr
= convert_from_reference (fold_convert (type
, expr
));
6074 /* As a G++ extension, we consider conversions from member
6075 functions, and pointers to member functions to
6076 pointer-to-function and pointer-to-void types. If
6077 -Wno-pmf-conversions has not been specified,
6078 convert_member_func_to_ptr will issue an error message. */
6079 if ((TYPE_PTRMEMFUNC_P (intype
)
6080 || TREE_CODE (intype
) == METHOD_TYPE
)
6081 && TYPE_PTR_P (type
)
6082 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6083 || VOID_TYPE_P (TREE_TYPE (type
))))
6084 return convert_member_func_to_ptr (type
, expr
);
6086 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6087 array-to-pointer, and function-to-pointer conversions are
6089 expr
= decay_conversion (expr
);
6091 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6092 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6093 if (TREE_CODE (expr
) == NOP_EXPR
6094 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6095 expr
= TREE_OPERAND (expr
, 0);
6097 if (error_operand_p (expr
))
6098 return error_mark_node
;
6100 intype
= TREE_TYPE (expr
);
6102 /* [expr.reinterpret.cast]
6103 A pointer can be converted to any integral type large enough to
6104 hold it. ... A value of type std::nullptr_t can be converted to
6105 an integral type; the conversion has the same meaning and
6106 validity as a conversion of (void*)0 to the integral type. */
6107 if (CP_INTEGRAL_TYPE_P (type
)
6108 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
6110 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
6112 if (complain
& tf_error
)
6113 permerror (input_location
, "cast from %qT to %qT loses precision",
6116 return error_mark_node
;
6118 if (NULLPTR_TYPE_P (intype
))
6119 return build_int_cst (type
, 0);
6121 /* [expr.reinterpret.cast]
6122 A value of integral or enumeration type can be explicitly
6123 converted to a pointer. */
6124 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6127 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6128 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6129 return fold_if_not_in_template (build_nop (type
, expr
));
6130 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6131 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6136 && check_for_casting_away_constness (intype
, type
,
6137 REINTERPRET_CAST_EXPR
,
6139 return error_mark_node
;
6140 /* Warn about possible alignment problems. */
6141 if (STRICT_ALIGNMENT
&& warn_cast_align
6142 && (complain
& tf_warning
)
6143 && !VOID_TYPE_P (type
)
6144 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6145 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6146 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6147 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6148 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6149 "increases required alignment of target type", intype
, type
);
6151 /* We need to strip nops here, because the front end likes to
6152 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6154 if (warn_strict_aliasing
<= 2)
6155 strict_aliasing_warning (intype
, type
, sexpr
);
6157 return fold_if_not_in_template (build_nop (type
, expr
));
6159 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6160 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6162 if (pedantic
&& (complain
& tf_warning
))
6163 /* Only issue a warning, as we have always supported this
6164 where possible, and it is necessary in some cases. DR 195
6165 addresses this issue, but as of 2004/10/26 is still in
6167 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6168 return fold_if_not_in_template (build_nop (type
, expr
));
6170 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6171 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6172 else if (TREE_CODE (intype
) == VECTOR_TYPE
6173 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6174 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6179 if (complain
& tf_error
)
6180 error ("invalid cast from type %qT to type %qT", intype
, type
);
6181 return error_mark_node
;
6184 return cp_convert (type
, expr
);
6188 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6190 if (type
== error_mark_node
|| expr
== error_mark_node
)
6191 return error_mark_node
;
6193 if (processing_template_decl
)
6195 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6197 if (!TREE_SIDE_EFFECTS (t
)
6198 && type_dependent_expression_p (expr
))
6199 /* There might turn out to be side effects inside expr. */
6200 TREE_SIDE_EFFECTS (t
) = 1;
6201 return convert_from_reference (t
);
6204 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6205 /*valid_p=*/NULL
, complain
);
6208 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6209 return an appropriate expression. Otherwise, return
6210 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6211 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6212 performing a C-style cast, its value upon return will indicate
6213 whether or not the conversion succeeded. */
6216 build_const_cast_1 (tree dst_type
, tree expr
, tsubst_flags_t complain
,
6220 tree reference_type
;
6222 /* Callers are responsible for handling error_mark_node as a
6223 destination type. */
6224 gcc_assert (dst_type
!= error_mark_node
);
6225 /* In a template, callers should be building syntactic
6226 representations of casts, not using this machinery. */
6227 gcc_assert (!processing_template_decl
);
6229 /* Assume the conversion is invalid. */
6233 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6235 if (complain
& tf_error
)
6236 error ("invalid use of const_cast with type %qT, "
6237 "which is not a pointer, "
6238 "reference, nor a pointer-to-data-member type", dst_type
);
6239 return error_mark_node
;
6242 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6244 if (complain
& tf_error
)
6245 error ("invalid use of const_cast with type %qT, which is a pointer "
6246 "or reference to a function type", dst_type
);
6247 return error_mark_node
;
6250 /* Save casted types in the function's used types hash table. */
6251 used_types_insert (dst_type
);
6253 src_type
= TREE_TYPE (expr
);
6254 /* Expressions do not really have reference types. */
6255 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6256 src_type
= TREE_TYPE (src_type
);
6258 /* [expr.const.cast]
6260 For two object types T1 and T2, if a pointer to T1 can be explicitly
6261 converted to the type "pointer to T2" using a const_cast, then the
6262 following conversions can also be made:
6264 -- an lvalue of type T1 can be explicitly converted to an lvalue of
6265 type T2 using the cast const_cast<T2&>;
6267 -- a glvalue of type T1 can be explicitly converted to an xvalue of
6268 type T2 using the cast const_cast<T2&&>; and
6270 -- if T1 is a class type, a prvalue of type T1 can be explicitly
6271 converted to an xvalue of type T2 using the cast const_cast<T2&&>. */
6273 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6275 reference_type
= dst_type
;
6276 if (!TYPE_REF_IS_RVALUE (dst_type
)
6277 ? real_lvalue_p (expr
)
6278 : (CLASS_TYPE_P (TREE_TYPE (dst_type
))
6280 : lvalue_or_rvalue_with_address_p (expr
)))
6284 if (complain
& tf_error
)
6285 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6286 src_type
, dst_type
);
6287 return error_mark_node
;
6289 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6290 src_type
= build_pointer_type (src_type
);
6294 reference_type
= NULL_TREE
;
6295 /* If the destination type is not a reference type, the
6296 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6297 conversions are performed. */
6298 src_type
= type_decays_to (src_type
);
6299 if (src_type
== error_mark_node
)
6300 return error_mark_node
;
6303 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6304 && comp_ptr_ttypes_const (dst_type
, src_type
))
6309 /* This cast is actually a C-style cast. Issue a warning if
6310 the user is making a potentially unsafe cast. */
6311 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
,
6316 expr
= cp_build_addr_expr (expr
, complain
);
6317 expr
= build_nop (reference_type
, expr
);
6318 return convert_from_reference (expr
);
6322 expr
= decay_conversion (expr
);
6323 /* build_c_cast puts on a NOP_EXPR to make the result not an
6324 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6325 non-lvalue context. */
6326 if (TREE_CODE (expr
) == NOP_EXPR
6327 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6328 expr
= TREE_OPERAND (expr
, 0);
6329 return build_nop (dst_type
, expr
);
6333 if (complain
& tf_error
)
6334 error ("invalid const_cast from type %qT to type %qT",
6335 src_type
, dst_type
);
6336 return error_mark_node
;
6340 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6342 if (type
== error_mark_node
|| error_operand_p (expr
))
6343 return error_mark_node
;
6345 if (processing_template_decl
)
6347 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6349 if (!TREE_SIDE_EFFECTS (t
)
6350 && type_dependent_expression_p (expr
))
6351 /* There might turn out to be side effects inside expr. */
6352 TREE_SIDE_EFFECTS (t
) = 1;
6353 return convert_from_reference (t
);
6356 return build_const_cast_1 (type
, expr
, complain
,
6360 /* Like cp_build_c_cast, but for the c-common bits. */
6363 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6365 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6368 /* Build an expression representing an explicit C-style cast to type
6369 TYPE of expression EXPR. */
6372 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6378 if (type
== error_mark_node
|| error_operand_p (expr
))
6379 return error_mark_node
;
6381 if (processing_template_decl
)
6383 tree t
= build_min (CAST_EXPR
, type
,
6384 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6385 /* We don't know if it will or will not have side effects. */
6386 TREE_SIDE_EFFECTS (t
) = 1;
6387 return convert_from_reference (t
);
6390 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6391 'Class') should always be retained, because this information aids
6392 in method lookup. */
6393 if (objc_is_object_ptr (type
)
6394 && objc_is_object_ptr (TREE_TYPE (expr
)))
6395 return build_nop (type
, expr
);
6397 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6398 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6399 if (TREE_CODE (type
) != REFERENCE_TYPE
6400 && TREE_CODE (value
) == NOP_EXPR
6401 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6402 value
= TREE_OPERAND (value
, 0);
6404 if (TREE_CODE (type
) == ARRAY_TYPE
)
6406 /* Allow casting from T1* to T2[] because Cfront allows it.
6407 NIHCL uses it. It is not valid ISO C++ however. */
6408 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6410 if (complain
& tf_error
)
6411 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6413 return error_mark_node
;
6414 type
= build_pointer_type (TREE_TYPE (type
));
6418 if (complain
& tf_error
)
6419 error ("ISO C++ forbids casting to an array type %qT", type
);
6420 return error_mark_node
;
6424 if (TREE_CODE (type
) == FUNCTION_TYPE
6425 || TREE_CODE (type
) == METHOD_TYPE
)
6427 if (complain
& tf_error
)
6428 error ("invalid cast to function type %qT", type
);
6429 return error_mark_node
;
6432 if (TREE_CODE (type
) == POINTER_TYPE
6433 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
6434 /* Casting to an integer of smaller size is an error detected elsewhere. */
6435 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
6436 /* Don't warn about converting any constant. */
6437 && !TREE_CONSTANT (value
))
6438 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
6439 "cast to pointer from integer of different size");
6441 /* A C-style cast can be a const_cast. */
6442 result
= build_const_cast_1 (type
, value
, complain
& tf_warning
,
6447 /* Or a static cast. */
6448 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6449 &valid_p
, complain
);
6450 /* Or a reinterpret_cast. */
6452 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6453 &valid_p
, complain
);
6454 /* The static_cast or reinterpret_cast may be followed by a
6457 /* A valid cast may result in errors if, for example, a
6458 conversion to am ambiguous base class is required. */
6459 && !error_operand_p (result
))
6463 /* Non-class rvalues always have cv-unqualified type. */
6464 if (!CLASS_TYPE_P (type
))
6465 type
= TYPE_MAIN_VARIANT (type
);
6466 result_type
= TREE_TYPE (result
);
6467 if (!CLASS_TYPE_P (result_type
) && TREE_CODE (type
) != REFERENCE_TYPE
)
6468 result_type
= TYPE_MAIN_VARIANT (result_type
);
6469 /* If the type of RESULT does not match TYPE, perform a
6470 const_cast to make it match. If the static_cast or
6471 reinterpret_cast succeeded, we will differ by at most
6472 cv-qualification, so the follow-on const_cast is guaranteed
6474 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6476 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6477 gcc_assert (valid_p
);
6482 return error_mark_node
;
6485 /* For use from the C common bits. */
6487 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6488 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6489 enum tree_code modifycode
,
6490 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6491 tree rhs_origtype ATTRIBUTE_UNUSED
)
6493 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6496 /* Build an assignment expression of lvalue LHS from value RHS.
6497 MODIFYCODE is the code for a binary operator that we use
6498 to combine the old value of LHS with RHS to get the new value.
6499 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6501 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6504 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6505 tsubst_flags_t complain
)
6509 tree lhstype
= TREE_TYPE (lhs
);
6510 tree olhstype
= lhstype
;
6511 bool plain_assign
= (modifycode
== NOP_EXPR
);
6513 /* Avoid duplicate error messages from operands that had errors. */
6514 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6515 return error_mark_node
;
6517 /* Handle control structure constructs used as "lvalues". */
6518 switch (TREE_CODE (lhs
))
6520 /* Handle --foo = 5; as these are valid constructs in C++. */
6521 case PREDECREMENT_EXPR
:
6522 case PREINCREMENT_EXPR
:
6523 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6524 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6525 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6526 TREE_OPERAND (lhs
, 1));
6527 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6528 modifycode
, rhs
, complain
);
6529 if (newrhs
== error_mark_node
)
6530 return error_mark_node
;
6531 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6533 /* Handle (a, b) used as an "lvalue". */
6535 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6536 modifycode
, rhs
, complain
);
6537 if (newrhs
== error_mark_node
)
6538 return error_mark_node
;
6539 return build2 (COMPOUND_EXPR
, lhstype
,
6540 TREE_OPERAND (lhs
, 0), newrhs
);
6543 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6544 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6545 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6546 TREE_OPERAND (lhs
, 1));
6547 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6549 if (newrhs
== error_mark_node
)
6550 return error_mark_node
;
6551 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6555 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6556 when neither operand has side-effects. */
6557 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6558 return error_mark_node
;
6560 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6561 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6563 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6564 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6566 TREE_OPERAND (lhs
, 0),
6567 TREE_OPERAND (lhs
, 1)),
6568 TREE_OPERAND (lhs
, 0),
6569 TREE_OPERAND (lhs
, 1));
6572 /* Handle (a ? b : c) used as an "lvalue". */
6575 /* Produce (a ? (b = rhs) : (c = rhs))
6576 except that the RHS goes through a save-expr
6577 so the code to compute it is only emitted once. */
6579 tree preeval
= NULL_TREE
;
6581 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6583 if (complain
& tf_error
)
6584 error ("void value not ignored as it ought to be");
6585 return error_mark_node
;
6588 rhs
= stabilize_expr (rhs
, &preeval
);
6590 /* Check this here to avoid odd errors when trying to convert
6591 a throw to the type of the COND_EXPR. */
6592 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6593 return error_mark_node
;
6595 cond
= build_conditional_expr
6596 (TREE_OPERAND (lhs
, 0),
6597 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6598 modifycode
, rhs
, complain
),
6599 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6600 modifycode
, rhs
, complain
),
6603 if (cond
== error_mark_node
)
6605 /* Make sure the code to compute the rhs comes out
6606 before the split. */
6608 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6616 if (modifycode
== INIT_EXPR
)
6618 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6619 /* Do the default thing. */;
6620 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6622 /* Compound literal. */
6623 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6624 /* Call convert to generate an error; see PR 11063. */
6625 rhs
= convert (lhstype
, rhs
);
6626 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6627 TREE_SIDE_EFFECTS (result
) = 1;
6630 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6631 /* Do the default thing. */;
6634 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6635 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6636 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6638 release_tree_vector (rhs_vec
);
6639 if (result
== NULL_TREE
)
6640 return error_mark_node
;
6646 lhs
= require_complete_type_sfinae (lhs
, complain
);
6647 if (lhs
== error_mark_node
)
6648 return error_mark_node
;
6650 if (modifycode
== NOP_EXPR
)
6652 if (c_dialect_objc ())
6654 result
= objc_maybe_build_modify_expr (lhs
, rhs
);
6659 /* `operator=' is not an inheritable operator. */
6660 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6661 /* Do the default thing. */;
6664 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6665 lhs
, rhs
, make_node (NOP_EXPR
),
6668 if (result
== NULL_TREE
)
6669 return error_mark_node
;
6676 tree init
= NULL_TREE
;
6678 /* A binary op has been requested. Combine the old LHS
6679 value with the RHS producing the value we should actually
6680 store into the LHS. */
6681 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6682 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6683 || MAYBE_CLASS_TYPE_P (lhstype
)));
6685 /* Preevaluate the RHS to make sure its evaluation is complete
6686 before the lvalue-to-rvalue conversion of the LHS:
6688 [expr.ass] With respect to an indeterminately-sequenced
6689 function call, the operation of a compound assignment is a
6690 single evaluation. [ Note: Therefore, a function call shall
6691 not intervene between the lvalue-to-rvalue conversion and the
6692 side effect associated with any single compound assignment
6693 operator. -- end note ] */
6694 lhs
= stabilize_reference (lhs
);
6695 if (TREE_SIDE_EFFECTS (rhs
))
6696 rhs
= mark_rvalue_use (rhs
);
6697 rhs
= stabilize_expr (rhs
, &init
);
6698 newrhs
= cp_build_binary_op (input_location
,
6699 modifycode
, lhs
, rhs
,
6701 if (newrhs
== error_mark_node
)
6703 if (complain
& tf_error
)
6704 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6705 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6706 return error_mark_node
;
6710 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), init
, newrhs
);
6712 /* Now it looks like a plain assignment. */
6713 modifycode
= NOP_EXPR
;
6714 if (c_dialect_objc ())
6716 result
= objc_maybe_build_modify_expr (lhs
, newrhs
);
6721 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6722 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6725 /* The left-hand side must be an lvalue. */
6726 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6727 return error_mark_node
;
6729 /* Warn about modifying something that is `const'. Don't warn if
6730 this is initialization. */
6731 if (modifycode
!= INIT_EXPR
6732 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6733 /* Functions are not modifiable, even though they are
6735 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6736 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6737 /* If it's an aggregate and any field is const, then it is
6738 effectively const. */
6739 || (CLASS_TYPE_P (lhstype
)
6740 && C_TYPE_FIELDS_READONLY (lhstype
))))
6742 if (complain
& tf_error
)
6743 cxx_readonly_error (lhs
, lv_assign
);
6745 return error_mark_node
;
6748 /* If storing into a structure or union member, it may have been given a
6749 lowered bitfield type. We need to convert to the declared type first,
6750 so retrieve it now. */
6752 olhstype
= unlowered_expr_type (lhs
);
6754 /* Convert new value to destination type. */
6756 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6760 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6762 if (modifycode
!= INIT_EXPR
)
6764 if (complain
& tf_error
)
6765 error ("assigning to an array from an initializer list");
6766 return error_mark_node
;
6768 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6769 return error_mark_node
;
6770 newrhs
= digest_init (lhstype
, newrhs
, complain
);
6771 if (newrhs
== error_mark_node
)
6772 return error_mark_node
;
6775 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6776 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6778 if (complain
& tf_error
)
6779 error ("incompatible types in assignment of %qT to %qT",
6780 TREE_TYPE (rhs
), lhstype
);
6781 return error_mark_node
;
6784 /* Allow array assignment in compiler-generated code. */
6785 else if (!current_function_decl
6786 || !DECL_DEFAULTED_FN (current_function_decl
))
6788 /* This routine is used for both initialization and assignment.
6789 Make sure the diagnostic message differentiates the context. */
6790 if (complain
& tf_error
)
6792 if (modifycode
== INIT_EXPR
)
6793 error ("array used as initializer");
6795 error ("invalid array assignment");
6797 return error_mark_node
;
6800 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6801 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6802 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6803 /*explicit_value_init_p=*/false,
6804 from_array
, complain
);
6807 if (modifycode
== INIT_EXPR
)
6808 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6809 LOOKUP_ONLYCONVERTING. */
6810 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6811 ICR_INIT
, NULL_TREE
, 0,
6814 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
6815 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6817 if (!same_type_p (lhstype
, olhstype
))
6818 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6820 if (modifycode
!= INIT_EXPR
)
6822 if (TREE_CODE (newrhs
) == CALL_EXPR
6823 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6824 newrhs
= build_cplus_new (lhstype
, newrhs
, complain
);
6826 /* Can't initialize directly from a TARGET_EXPR, since that would
6827 cause the lhs to be constructed twice, and possibly result in
6828 accidental self-initialization. So we force the TARGET_EXPR to be
6829 expanded without a target. */
6830 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6831 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6832 TREE_OPERAND (newrhs
, 0));
6835 if (newrhs
== error_mark_node
)
6836 return error_mark_node
;
6838 if (c_dialect_objc () && flag_objc_gc
)
6840 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6846 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6847 lhstype
, lhs
, newrhs
);
6849 TREE_SIDE_EFFECTS (result
) = 1;
6851 TREE_NO_WARNING (result
) = 1;
6857 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6858 tsubst_flags_t complain
)
6860 if (processing_template_decl
)
6861 return build_min_nt (MODOP_EXPR
, lhs
,
6862 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6864 if (modifycode
!= NOP_EXPR
)
6866 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6867 make_node (modifycode
),
6872 TREE_NO_WARNING (rval
) = 1;
6876 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6879 /* Helper function for get_delta_difference which assumes FROM is a base
6880 class of TO. Returns a delta for the conversion of pointer-to-member
6881 of FROM to pointer-to-member of TO. If the conversion is invalid and
6882 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
6883 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6884 If C_CAST_P is true, this conversion is taking place as part of a
6888 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
,
6889 tsubst_flags_t complain
)
6893 base_access access
= c_cast_p
? ba_unique
: ba_check
;
6895 /* Note: ba_quiet does not distinguish between access control and
6897 if (!(complain
& tf_error
))
6900 binfo
= lookup_base (to
, from
, access
, &kind
);
6902 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6904 if (!(complain
& tf_error
))
6905 return error_mark_node
;
6907 error (" in pointer to member function conversion");
6908 return size_zero_node
;
6912 if (kind
!= bk_via_virtual
)
6913 return BINFO_OFFSET (binfo
);
6915 /* FROM is a virtual base class of TO. Issue an error or warning
6916 depending on whether or not this is a reinterpret cast. */
6918 if (!(complain
& tf_error
))
6919 return error_mark_node
;
6921 error ("pointer to member conversion via virtual base %qT",
6922 BINFO_TYPE (binfo_from_vbase (binfo
)));
6924 return size_zero_node
;
6931 /* Get difference in deltas for different pointer to member function
6932 types. If the conversion is invalid and tf_error is not set in
6933 COMPLAIN, returns error_mark_node, otherwise returns an integer
6934 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
6935 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
6936 conversions as well. If C_CAST_P is true this conversion is taking
6937 place as part of a C-style cast.
6939 Note that the naming of FROM and TO is kind of backwards; the return
6940 value is what we add to a TO in order to get a FROM. They are named
6941 this way because we call this function to find out how to convert from
6942 a pointer to member of FROM to a pointer to member of TO. */
6945 get_delta_difference (tree from
, tree to
,
6946 bool allow_inverse_p
,
6947 bool c_cast_p
, tsubst_flags_t complain
)
6951 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
6952 /* Pointer to member of incomplete class is permitted*/
6953 result
= size_zero_node
;
6955 result
= get_delta_difference_1 (from
, to
, c_cast_p
, complain
);
6957 if (result
== error_mark_node
)
6958 return error_mark_node
;
6962 if (!allow_inverse_p
)
6964 if (!(complain
& tf_error
))
6965 return error_mark_node
;
6967 error_not_base_type (from
, to
);
6968 error (" in pointer to member conversion");
6969 result
= size_zero_node
;
6973 result
= get_delta_difference_1 (to
, from
, c_cast_p
, complain
);
6975 if (result
== error_mark_node
)
6976 return error_mark_node
;
6979 result
= size_diffop_loc (input_location
,
6980 size_zero_node
, result
);
6983 if (!(complain
& tf_error
))
6984 return error_mark_node
;
6986 error_not_base_type (from
, to
);
6987 error (" in pointer to member conversion");
6988 result
= size_zero_node
;
6993 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
6997 /* Return a constructor for the pointer-to-member-function TYPE using
6998 the other components as specified. */
7001 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
7006 VEC(constructor_elt
, gc
) *v
;
7008 /* Pull the FIELD_DECLs out of the type. */
7009 pfn_field
= TYPE_FIELDS (type
);
7010 delta_field
= DECL_CHAIN (pfn_field
);
7012 /* Make sure DELTA has the type we want. */
7013 delta
= convert_and_check (delta_type_node
, delta
);
7015 /* Convert to the correct target type if necessary. */
7016 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
7018 /* Finish creating the initializer. */
7019 v
= VEC_alloc(constructor_elt
, gc
, 2);
7020 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
7021 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
7022 u
= build_constructor (type
, v
);
7023 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
7024 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
7025 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
7027 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
7032 /* Build a constructor for a pointer to member function. It can be
7033 used to initialize global variables, local variable, or used
7034 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
7037 If FORCE is nonzero, then force this conversion, even if
7038 we would rather not do it. Usually set when using an explicit
7039 cast. A C-style cast is being processed iff C_CAST_P is true.
7041 Return error_mark_node, if something goes wrong. */
7044 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
,
7045 tsubst_flags_t complain
)
7051 if (error_operand_p (pfn
))
7052 return error_mark_node
;
7054 pfn_type
= TREE_TYPE (pfn
);
7055 to_type
= build_ptrmemfunc_type (type
);
7057 /* Handle multiple conversions of pointer to member functions. */
7058 if (TYPE_PTRMEMFUNC_P (pfn_type
))
7060 tree delta
= NULL_TREE
;
7061 tree npfn
= NULL_TREE
;
7065 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
7066 error ("invalid conversion to type %qT from type %qT",
7069 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
7070 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
7072 c_cast_p
, complain
);
7073 if (n
== error_mark_node
)
7074 return error_mark_node
;
7076 /* We don't have to do any conversion to convert a
7077 pointer-to-member to its own type. But, we don't want to
7078 just return a PTRMEM_CST if there's an explicit cast; that
7079 cast should make the expression an invalid template argument. */
7080 if (TREE_CODE (pfn
) != PTRMEM_CST
)
7082 if (same_type_p (to_type
, pfn_type
))
7084 else if (integer_zerop (n
))
7085 return build_reinterpret_cast (to_type
, pfn
,
7086 tf_warning_or_error
);
7089 if (TREE_SIDE_EFFECTS (pfn
))
7090 pfn
= save_expr (pfn
);
7092 /* Obtain the function pointer and the current DELTA. */
7093 if (TREE_CODE (pfn
) == PTRMEM_CST
)
7094 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
7097 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
7098 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
7101 /* Just adjust the DELTA field. */
7102 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7103 (TREE_TYPE (delta
), ptrdiff_type_node
));
7104 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
7105 n
= cp_build_binary_op (input_location
,
7106 LSHIFT_EXPR
, n
, integer_one_node
,
7107 tf_warning_or_error
);
7108 delta
= cp_build_binary_op (input_location
,
7109 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
7110 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
7113 /* Handle null pointer to member function conversions. */
7114 if (null_ptr_cst_p (pfn
))
7116 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
7117 return build_ptrmemfunc1 (to_type
,
7122 if (type_unknown_p (pfn
))
7123 return instantiate_type (type
, pfn
, tf_warning_or_error
);
7125 fn
= TREE_OPERAND (pfn
, 0);
7126 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7127 /* In a template, we will have preserved the
7129 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
7130 return make_ptrmem_cst (to_type
, fn
);
7133 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7136 ??? There is no consistency as to the types returned for the above
7137 values. Some code acts as if it were a sizetype and some as if it were
7138 integer_type_node. */
7141 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
7143 tree type
= TREE_TYPE (cst
);
7144 tree fn
= PTRMEM_CST_MEMBER (cst
);
7145 tree ptr_class
, fn_class
;
7147 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7149 /* The class that the function belongs to. */
7150 fn_class
= DECL_CONTEXT (fn
);
7152 /* The class that we're creating a pointer to member of. */
7153 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
7155 /* First, calculate the adjustment to the function's class. */
7156 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
7157 /*c_cast_p=*/0, tf_warning_or_error
);
7159 if (!DECL_VIRTUAL_P (fn
))
7160 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
7163 /* If we're dealing with a virtual function, we have to adjust 'this'
7164 again, to point to the base which provides the vtable entry for
7165 fn; the call will do the opposite adjustment. */
7166 tree orig_class
= DECL_CONTEXT (fn
);
7167 tree binfo
= binfo_or_else (orig_class
, fn_class
);
7168 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7169 *delta
, BINFO_OFFSET (binfo
));
7170 *delta
= fold_if_not_in_template (*delta
);
7172 /* We set PFN to the vtable offset at which the function can be
7173 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7174 case delta is shifted left, and then incremented). */
7175 *pfn
= DECL_VINDEX (fn
);
7176 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
7177 TYPE_SIZE_UNIT (vtable_entry_type
));
7178 *pfn
= fold_if_not_in_template (*pfn
);
7180 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
7182 case ptrmemfunc_vbit_in_pfn
:
7183 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
7185 *pfn
= fold_if_not_in_template (*pfn
);
7188 case ptrmemfunc_vbit_in_delta
:
7189 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
7190 *delta
, integer_one_node
);
7191 *delta
= fold_if_not_in_template (*delta
);
7192 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7193 *delta
, integer_one_node
);
7194 *delta
= fold_if_not_in_template (*delta
);
7201 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
7202 *pfn
= fold_if_not_in_template (*pfn
);
7206 /* Return an expression for PFN from the pointer-to-member function
7210 pfn_from_ptrmemfunc (tree t
)
7212 if (TREE_CODE (t
) == PTRMEM_CST
)
7217 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7222 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
7225 /* Return an expression for DELTA from the pointer-to-member function
7229 delta_from_ptrmemfunc (tree t
)
7231 if (TREE_CODE (t
) == PTRMEM_CST
)
7236 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7241 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7244 /* Convert value RHS to type TYPE as preparation for an assignment to
7245 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
7246 implicit conversion is. If FNDECL is non-NULL, we are doing the
7247 conversion in order to pass the PARMNUMth argument of FNDECL.
7248 If FNDECL is NULL, we are doing the conversion in function pointer
7249 argument passing, conversion in initialization, etc. */
7252 convert_for_assignment (tree type
, tree rhs
,
7253 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7254 tsubst_flags_t complain
, int flags
)
7257 enum tree_code coder
;
7259 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7260 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7261 rhs
= TREE_OPERAND (rhs
, 0);
7263 rhstype
= TREE_TYPE (rhs
);
7264 coder
= TREE_CODE (rhstype
);
7266 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7267 && vector_types_convertible_p (type
, rhstype
, true))
7269 rhs
= mark_rvalue_use (rhs
);
7270 return convert (type
, rhs
);
7273 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7274 return error_mark_node
;
7275 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7276 return error_mark_node
;
7278 /* The RHS of an assignment cannot have void type. */
7279 if (coder
== VOID_TYPE
)
7281 if (complain
& tf_error
)
7282 error ("void value not ignored as it ought to be");
7283 return error_mark_node
;
7286 /* Simplify the RHS if possible. */
7287 if (TREE_CODE (rhs
) == CONST_DECL
)
7288 rhs
= DECL_INITIAL (rhs
);
7290 if (c_dialect_objc ())
7294 tree rname
= fndecl
;
7305 selector
= objc_message_selector ();
7307 if (selector
&& parmno
> 1)
7314 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7316 rhs
= mark_rvalue_use (rhs
);
7317 return convert (type
, rhs
);
7323 The expression is implicitly converted (clause _conv_) to the
7324 cv-unqualified type of the left operand.
7326 We allow bad conversions here because by the time we get to this point
7327 we are committed to doing the conversion. If we end up doing a bad
7328 conversion, convert_like will complain. */
7329 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7331 /* When -Wno-pmf-conversions is use, we just silently allow
7332 conversions from pointers-to-members to plain pointers. If
7333 the conversion doesn't work, cp_convert will complain. */
7335 && TYPE_PTR_P (type
)
7336 && TYPE_PTRMEMFUNC_P (rhstype
))
7337 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7340 if (complain
& tf_error
)
7342 /* If the right-hand side has unknown type, then it is an
7343 overloaded function. Call instantiate_type to get error
7345 if (rhstype
== unknown_type_node
)
7346 instantiate_type (type
, rhs
, tf_warning_or_error
);
7348 error ("cannot convert %qT to %qT for argument %qP to %qD",
7349 rhstype
, type
, parmnum
, fndecl
);
7353 case ICR_DEFAULT_ARGUMENT
:
7354 error ("cannot convert %qT to %qT in default argument",
7358 error ("cannot convert %qT to %qT in argument passing",
7361 case ICR_CONVERTING
:
7362 error ("cannot convert %qT to %qT",
7366 error ("cannot convert %qT to %qT in initialization",
7370 error ("cannot convert %qT to %qT in return",
7374 error ("cannot convert %qT to %qT in assignment",
7381 return error_mark_node
;
7384 if (warn_missing_format_attribute
)
7386 const enum tree_code codel
= TREE_CODE (type
);
7387 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7389 && check_missing_format_attribute (type
, rhstype
)
7390 && (complain
& tf_warning
))
7394 case ICR_DEFAULT_ARGUMENT
:
7396 warning (OPT_Wmissing_format_attribute
,
7397 "parameter %qP of %qD might be a candidate "
7398 "for a format attribute", parmnum
, fndecl
);
7400 warning (OPT_Wmissing_format_attribute
,
7401 "parameter might be a candidate "
7402 "for a format attribute");
7404 case ICR_CONVERTING
:
7405 warning (OPT_Wmissing_format_attribute
,
7406 "target of conversion might be a candidate "
7407 "for a format attribute");
7410 warning (OPT_Wmissing_format_attribute
,
7411 "target of initialization might be a candidate "
7412 "for a format attribute");
7415 warning (OPT_Wmissing_format_attribute
,
7416 "return type might be a candidate "
7417 "for a format attribute");
7420 warning (OPT_Wmissing_format_attribute
,
7421 "left-hand side of assignment might be a candidate "
7422 "for a format attribute");
7429 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7431 if (warn_parentheses
7432 && TREE_CODE (type
) == BOOLEAN_TYPE
7433 && TREE_CODE (rhs
) == MODIFY_EXPR
7434 && !TREE_NO_WARNING (rhs
)
7435 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7436 && (complain
& tf_warning
))
7438 location_t loc
= EXPR_LOC_OR_HERE (rhs
);
7440 warning_at (loc
, OPT_Wparentheses
,
7441 "suggest parentheses around assignment used as truth value");
7442 TREE_NO_WARNING (rhs
) = 1;
7445 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7449 /* Convert RHS to be of type TYPE.
7450 If EXP is nonzero, it is the target of the initialization.
7451 ERRTYPE indicates what kind of error the implicit conversion is.
7453 Two major differences between the behavior of
7454 `convert_for_assignment' and `convert_for_initialization'
7455 are that references are bashed in the former, while
7456 copied in the latter, and aggregates are assigned in
7457 the former (operator=) while initialized in the
7460 If using constructor make sure no conversion operator exists, if one does
7461 exist, an ambiguity exists.
7463 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7466 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7467 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7468 tsubst_flags_t complain
)
7470 enum tree_code codel
= TREE_CODE (type
);
7472 enum tree_code coder
;
7474 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7475 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7476 if (TREE_CODE (rhs
) == NOP_EXPR
7477 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7478 && codel
!= REFERENCE_TYPE
)
7479 rhs
= TREE_OPERAND (rhs
, 0);
7481 if (type
== error_mark_node
7482 || rhs
== error_mark_node
7483 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7484 return error_mark_node
;
7486 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7487 && TREE_CODE (type
) != ARRAY_TYPE
7488 && (TREE_CODE (type
) != REFERENCE_TYPE
7489 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7490 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7491 && (TREE_CODE (type
) != REFERENCE_TYPE
7492 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7493 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7494 rhs
= decay_conversion (rhs
);
7496 rhstype
= TREE_TYPE (rhs
);
7497 coder
= TREE_CODE (rhstype
);
7499 if (coder
== ERROR_MARK
)
7500 return error_mark_node
;
7502 /* We accept references to incomplete types, so we can
7503 return here before checking if RHS is of complete type. */
7505 if (codel
== REFERENCE_TYPE
)
7507 /* This should eventually happen in convert_arguments. */
7508 int savew
= 0, savee
= 0;
7511 savew
= warningcount
, savee
= errorcount
;
7512 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7513 /*cleanup=*/NULL
, complain
);
7516 if (warningcount
> savew
)
7517 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7518 else if (errorcount
> savee
)
7519 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7525 exp
= require_complete_type_sfinae (exp
, complain
);
7526 if (exp
== error_mark_node
)
7527 return error_mark_node
;
7529 rhstype
= non_reference (rhstype
);
7531 type
= complete_type (type
);
7533 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7534 /* Don't try to do copy-initialization if we already have
7535 direct-initialization. */
7538 if (MAYBE_CLASS_TYPE_P (type
))
7539 return perform_implicit_conversion_flags (type
, rhs
, complain
, flags
);
7541 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7545 /* If RETVAL is the address of, or a reference to, a local variable or
7546 temporary give an appropriate warning. */
7549 maybe_warn_about_returning_address_of_local (tree retval
)
7551 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7552 tree whats_returned
= retval
;
7556 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7557 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7558 else if (CONVERT_EXPR_P (whats_returned
)
7559 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7560 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7565 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7567 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7569 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7571 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7572 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7574 warning (0, "returning reference to temporary");
7577 if (TREE_CODE (whats_returned
) == VAR_DECL
7578 && DECL_NAME (whats_returned
)
7579 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7581 warning (0, "reference to non-lvalue returned");
7586 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7587 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7588 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7590 if (DECL_P (whats_returned
)
7591 && DECL_NAME (whats_returned
)
7592 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7593 && !(TREE_STATIC (whats_returned
)
7594 || TREE_PUBLIC (whats_returned
)))
7596 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7597 warning (0, "reference to local variable %q+D returned",
7600 warning (0, "address of local variable %q+D returned",
7606 /* Check that returning RETVAL from the current function is valid.
7607 Return an expression explicitly showing all conversions required to
7608 change RETVAL into the function return type, and to assign it to
7609 the DECL_RESULT for the function. Set *NO_WARNING to true if
7610 code reaches end of non-void function warning shouldn't be issued
7611 on this RETURN_EXPR. */
7614 check_return_expr (tree retval
, bool *no_warning
)
7617 /* The type actually returned by the function, after any
7620 int fn_returns_value_p
;
7621 bool named_return_value_okay_p
;
7623 *no_warning
= false;
7625 /* A `volatile' function is one that isn't supposed to return, ever.
7626 (This is a G++ extension, used to get better code for functions
7627 that call the `volatile' function.) */
7628 if (TREE_THIS_VOLATILE (current_function_decl
))
7629 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7631 /* Check for various simple errors. */
7632 if (DECL_DESTRUCTOR_P (current_function_decl
))
7635 error ("returning a value from a destructor");
7638 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7640 if (in_function_try_handler
)
7641 /* If a return statement appears in a handler of the
7642 function-try-block of a constructor, the program is ill-formed. */
7643 error ("cannot return from a handler of a function-try-block of a constructor");
7645 /* You can't return a value from a constructor. */
7646 error ("returning a value from a constructor");
7650 /* As an extension, deduce lambda return type from a return statement
7651 anywhere in the body. */
7652 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7654 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7655 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7657 tree type
= lambda_return_type (retval
);
7658 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7660 if (VOID_TYPE_P (type
))
7662 else if (oldtype
== NULL_TREE
)
7664 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7665 "can only be deduced when the return statement is "
7666 "the only statement in the function body");
7667 apply_lambda_return_type (lambda
, type
);
7669 else if (!same_type_p (type
, oldtype
))
7670 error ("inconsistent types %qT and %qT deduced for "
7671 "lambda return type", type
, oldtype
);
7675 if (processing_template_decl
)
7677 current_function_returns_value
= 1;
7678 if (check_for_bare_parameter_packs (retval
))
7679 retval
= error_mark_node
;
7683 /* When no explicit return-value is given in a function with a named
7684 return value, the named return value is used. */
7685 result
= DECL_RESULT (current_function_decl
);
7686 valtype
= TREE_TYPE (result
);
7687 gcc_assert (valtype
!= NULL_TREE
);
7688 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7689 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7692 /* Check for a return statement with no return value in a function
7693 that's supposed to return a value. */
7694 if (!retval
&& fn_returns_value_p
)
7696 permerror (input_location
, "return-statement with no value, in function returning %qT",
7698 /* Clear this, so finish_function won't say that we reach the
7699 end of a non-void function (which we don't, we gave a
7701 current_function_returns_null
= 0;
7702 /* And signal caller that TREE_NO_WARNING should be set on the
7703 RETURN_EXPR to avoid control reaches end of non-void function
7704 warnings in tree-cfg.c. */
7707 /* Check for a return statement with a value in a function that
7708 isn't supposed to return a value. */
7709 else if (retval
&& !fn_returns_value_p
)
7711 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7712 /* You can return a `void' value from a function of `void'
7713 type. In that case, we have to evaluate the expression for
7714 its side-effects. */
7715 finish_expr_stmt (retval
);
7717 permerror (input_location
, "return-statement with a value, in function "
7718 "returning 'void'");
7719 current_function_returns_null
= 1;
7721 /* There's really no value to return, after all. */
7725 /* Remember that this function can sometimes return without a
7727 current_function_returns_null
= 1;
7729 /* Remember that this function did return a value. */
7730 current_function_returns_value
= 1;
7732 /* Check for erroneous operands -- but after giving ourselves a
7733 chance to provide an error about returning a value from a void
7735 if (error_operand_p (retval
))
7737 current_function_return_value
= error_mark_node
;
7738 return error_mark_node
;
7741 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7742 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7743 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7744 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7746 && retval
&& null_ptr_cst_p (retval
))
7747 warning (0, "%<operator new%> must not return NULL unless it is "
7748 "declared %<throw()%> (or -fcheck-new is in effect)");
7750 /* Effective C++ rule 15. See also start_function. */
7752 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7756 /* The function return type must be a reference to the current
7758 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7759 && same_type_ignoring_top_level_qualifiers_p
7760 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7762 /* Returning '*this' is obviously OK. */
7763 if (retval
== current_class_ref
)
7765 /* If we are calling a function whose return type is the same of
7766 the current class reference, it is ok. */
7767 else if (TREE_CODE (retval
) == INDIRECT_REF
7768 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7773 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7776 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7778 [...] For a function with a class return type, if the expression
7779 in the return statement is the name of a local object, and the cv-
7780 unqualified type of the local object is the same as the function
7781 return type, an implementation is permitted to omit creating the tem-
7782 porary object to hold the function return value [...]
7784 So, if this is a value-returning function that always returns the same
7785 local variable, remember it.
7787 It might be nice to be more flexible, and choose the first suitable
7788 variable even if the function sometimes returns something else, but
7789 then we run the risk of clobbering the variable we chose if the other
7790 returned expression uses the chosen variable somehow. And people expect
7791 this restriction, anyway. (jason 2000-11-19)
7793 See finish_function and finalize_nrv for the rest of this optimization. */
7795 named_return_value_okay_p
=
7796 (retval
!= NULL_TREE
7797 /* Must be a local, automatic variable. */
7798 && TREE_CODE (retval
) == VAR_DECL
7799 && DECL_CONTEXT (retval
) == current_function_decl
7800 && ! TREE_STATIC (retval
)
7801 && ! DECL_ANON_UNION_VAR_P (retval
)
7802 && (DECL_ALIGN (retval
)
7803 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7804 /* The cv-unqualified type of the returned value must be the
7805 same as the cv-unqualified return type of the
7807 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7809 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7810 /* And the returned value must be non-volatile. */
7811 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7813 if (fn_returns_value_p
&& flag_elide_constructors
)
7815 if (named_return_value_okay_p
7816 && (current_function_return_value
== NULL_TREE
7817 || current_function_return_value
== retval
))
7818 current_function_return_value
= retval
;
7820 current_function_return_value
= error_mark_node
;
7823 /* We don't need to do any conversions when there's nothing being
7828 /* Do any required conversions. */
7829 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7830 /* No conversions are required. */
7834 /* The type the function is declared to return. */
7835 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7836 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7838 /* The functype's return type will have been set to void, if it
7839 was an incomplete type. Just treat this as 'return;' */
7840 if (VOID_TYPE_P (functype
))
7841 return error_mark_node
;
7843 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7844 treated as an rvalue for the purposes of overload resolution to
7845 favor move constructors over copy constructors.
7847 Note that these conditions are similar to, but not as strict as,
7848 the conditions for the named return value optimization. */
7849 if ((cxx_dialect
!= cxx98
)
7850 && (TREE_CODE (retval
) == VAR_DECL
7851 || TREE_CODE (retval
) == PARM_DECL
)
7852 && DECL_CONTEXT (retval
) == current_function_decl
7853 && !TREE_STATIC (retval
)
7854 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7856 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7857 /* This is only interesting for class type. */
7858 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7859 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7861 /* First convert the value to the function's return type, then
7862 to the type of return value's location to handle the
7863 case that functype is smaller than the valtype. */
7864 retval
= convert_for_initialization
7865 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
7866 tf_warning_or_error
);
7867 retval
= convert (valtype
, retval
);
7869 /* If the conversion failed, treat this just like `return;'. */
7870 if (retval
== error_mark_node
)
7872 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7873 else if (! cfun
->returns_struct
7874 && TREE_CODE (retval
) == TARGET_EXPR
7875 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7876 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7877 TREE_OPERAND (retval
, 0));
7879 maybe_warn_about_returning_address_of_local (retval
);
7882 /* Actually copy the value returned into the appropriate location. */
7883 if (retval
&& retval
!= result
)
7884 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7890 /* Returns nonzero if the pointer-type FROM can be converted to the
7891 pointer-type TO via a qualification conversion. If CONSTP is -1,
7892 then we return nonzero if the pointers are similar, and the
7893 cv-qualification signature of FROM is a proper subset of that of TO.
7895 If CONSTP is positive, then all outer pointers have been
7899 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7901 bool to_more_cv_qualified
= false;
7902 bool is_opaque_pointer
= false;
7904 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7906 if (TREE_CODE (to
) != TREE_CODE (from
))
7909 if (TREE_CODE (from
) == OFFSET_TYPE
7910 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7911 TYPE_OFFSET_BASETYPE (to
)))
7914 /* Const and volatile mean something different for function types,
7915 so the usual checks are not appropriate. */
7916 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7918 if (!at_least_as_qualified_p (to
, from
))
7921 if (!at_least_as_qualified_p (from
, to
))
7925 to_more_cv_qualified
= true;
7929 constp
&= TYPE_READONLY (to
);
7932 if (TREE_CODE (to
) == VECTOR_TYPE
)
7933 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7935 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
7936 return ((constp
>= 0 || to_more_cv_qualified
)
7937 && (is_opaque_pointer
7938 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
7942 /* When comparing, say, char ** to char const **, this function takes
7943 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7944 types to this function. */
7947 comp_ptr_ttypes (tree to
, tree from
)
7949 return comp_ptr_ttypes_real (to
, from
, 1);
7952 /* Returns true iff FNTYPE is a non-class type that involves
7953 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7954 if a parameter type is ill-formed. */
7957 error_type_p (const_tree type
)
7961 switch (TREE_CODE (type
))
7967 case REFERENCE_TYPE
:
7969 return error_type_p (TREE_TYPE (type
));
7973 if (error_type_p (TREE_TYPE (type
)))
7975 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7976 if (error_type_p (TREE_VALUE (t
)))
7981 if (TYPE_PTRMEMFUNC_P (type
))
7982 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
7990 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7991 type or inheritance-related types, regardless of cv-quals. */
7994 ptr_reasonably_similar (const_tree to
, const_tree from
)
7996 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7998 /* Any target type is similar enough to void. */
7999 if (TREE_CODE (to
) == VOID_TYPE
)
8000 return !error_type_p (from
);
8001 if (TREE_CODE (from
) == VOID_TYPE
)
8002 return !error_type_p (to
);
8004 if (TREE_CODE (to
) != TREE_CODE (from
))
8007 if (TREE_CODE (from
) == OFFSET_TYPE
8008 && comptypes (TYPE_OFFSET_BASETYPE (to
),
8009 TYPE_OFFSET_BASETYPE (from
),
8010 COMPARE_BASE
| COMPARE_DERIVED
))
8013 if (TREE_CODE (to
) == VECTOR_TYPE
8014 && vector_types_convertible_p (to
, from
, false))
8017 if (TREE_CODE (to
) == INTEGER_TYPE
8018 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
8021 if (TREE_CODE (to
) == FUNCTION_TYPE
)
8022 return !error_type_p (to
) && !error_type_p (from
);
8024 if (TREE_CODE (to
) != POINTER_TYPE
)
8026 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
8027 COMPARE_BASE
| COMPARE_DERIVED
);
8031 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
8032 pointer-to-member types) are the same, ignoring cv-qualification at
8036 comp_ptr_ttypes_const (tree to
, tree from
)
8038 bool is_opaque_pointer
= false;
8040 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
8042 if (TREE_CODE (to
) != TREE_CODE (from
))
8045 if (TREE_CODE (from
) == OFFSET_TYPE
8046 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
8047 TYPE_OFFSET_BASETYPE (to
)))
8050 if (TREE_CODE (to
) == VECTOR_TYPE
)
8051 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
8053 if (TREE_CODE (to
) != POINTER_TYPE
)
8054 return (is_opaque_pointer
8055 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
8059 /* Returns the type qualifiers for this type, including the qualifiers on the
8060 elements for an array type. */
8063 cp_type_quals (const_tree type
)
8066 /* This CONST_CAST is okay because strip_array_types returns its
8067 argument unmodified and we assign it to a const_tree. */
8068 type
= strip_array_types (CONST_CAST_TREE (type
));
8069 if (type
== error_mark_node
8070 /* Quals on a FUNCTION_TYPE are memfn quals. */
8071 || TREE_CODE (type
) == FUNCTION_TYPE
)
8072 return TYPE_UNQUALIFIED
;
8073 quals
= TYPE_QUALS (type
);
8074 /* METHOD and REFERENCE_TYPEs should never have quals. */
8075 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
8076 && TREE_CODE (type
) != REFERENCE_TYPE
)
8077 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
8078 == TYPE_UNQUALIFIED
));
8082 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
8086 type_memfn_quals (const_tree type
)
8088 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8089 return TYPE_QUALS (type
);
8090 else if (TREE_CODE (type
) == METHOD_TYPE
)
8091 return cp_type_quals (class_of_this_parm (type
));
8096 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
8100 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
)
8102 /* Could handle METHOD_TYPE here if necessary. */
8103 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8104 if (TYPE_QUALS (type
) == memfn_quals
)
8106 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
8108 return build_qualified_type (type
, memfn_quals
);
8111 /* Returns nonzero if TYPE is const or volatile. */
8114 cv_qualified_p (const_tree type
)
8116 int quals
= cp_type_quals (type
);
8117 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
8120 /* Returns nonzero if the TYPE contains a mutable member. */
8123 cp_has_mutable_p (const_tree type
)
8125 /* This CONST_CAST is okay because strip_array_types returns its
8126 argument unmodified and we assign it to a const_tree. */
8127 type
= strip_array_types (CONST_CAST_TREE(type
));
8129 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
8132 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
8133 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
8134 approximation. In particular, consider:
8137 struct S { int i; };
8138 const S s = { f(); }
8140 Here, we will make "s" as TREE_READONLY (because it is declared
8141 "const") -- only to reverse ourselves upon seeing that the
8142 initializer is non-constant. */
8145 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
8147 tree type
= TREE_TYPE (decl
);
8149 if (type
== error_mark_node
)
8152 if (TREE_CODE (decl
) == TYPE_DECL
)
8155 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
8156 && type_quals
!= TYPE_UNQUALIFIED
));
8158 /* Avoid setting TREE_READONLY incorrectly. */
8159 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
8160 constructor can produce constant init, so rely on cp_finish_decl to
8161 clear TREE_READONLY if the variable has non-constant init. */
8163 /* If the type has a mutable component, that component might be
8165 if (TYPE_HAS_MUTABLE_P (type
))
8166 type_quals
&= ~TYPE_QUAL_CONST
;
8168 c_apply_type_quals_to_decl (type_quals
, decl
);
8171 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8172 exemplar types such that casting T1 to T2 is casting away constness
8173 if and only if there is no implicit conversion from T1 to T2. */
8176 casts_away_constness_r (tree
*t1
, tree
*t2
)
8181 /* [expr.const.cast]
8183 For multi-level pointer to members and multi-level mixed pointers
8184 and pointers to members (conv.qual), the "member" aspect of a
8185 pointer to member level is ignored when determining if a const
8186 cv-qualifier has been cast away. */
8187 /* [expr.const.cast]
8189 For two pointer types:
8191 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8192 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8195 casting from X1 to X2 casts away constness if, for a non-pointer
8196 type T there does not exist an implicit conversion (clause
8199 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8203 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8204 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
8205 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
8207 *t1
= cp_build_qualified_type (void_type_node
,
8208 cp_type_quals (*t1
));
8209 *t2
= cp_build_qualified_type (void_type_node
,
8210 cp_type_quals (*t2
));
8214 quals1
= cp_type_quals (*t1
);
8215 quals2
= cp_type_quals (*t2
);
8217 if (TYPE_PTRMEM_P (*t1
))
8218 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
8220 *t1
= TREE_TYPE (*t1
);
8221 if (TYPE_PTRMEM_P (*t2
))
8222 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
8224 *t2
= TREE_TYPE (*t2
);
8226 casts_away_constness_r (t1
, t2
);
8227 *t1
= build_pointer_type (*t1
);
8228 *t2
= build_pointer_type (*t2
);
8229 *t1
= cp_build_qualified_type (*t1
, quals1
);
8230 *t2
= cp_build_qualified_type (*t2
, quals2
);
8233 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8236 ??? This function returns non-zero if casting away qualifiers not
8237 just const. We would like to return to the caller exactly which
8238 qualifiers are casted away to give more accurate diagnostics.
8242 casts_away_constness (tree t1
, tree t2
)
8244 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
8246 /* [expr.const.cast]
8248 Casting from an lvalue of type T1 to an lvalue of type T2
8249 using a reference cast casts away constness if a cast from an
8250 rvalue of type "pointer to T1" to the type "pointer to T2"
8251 casts away constness. */
8252 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
8253 return casts_away_constness (build_pointer_type (t1
),
8254 build_pointer_type (TREE_TYPE (t2
)));
8257 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
8258 /* [expr.const.cast]
8260 Casting from an rvalue of type "pointer to data member of X
8261 of type T1" to the type "pointer to data member of Y of type
8262 T2" casts away constness if a cast from an rvalue of type
8263 "pointer to T1" to the type "pointer to T2" casts away
8265 return casts_away_constness
8266 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
8267 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
8269 /* Casting away constness is only something that makes sense for
8270 pointer or reference types. */
8271 if (TREE_CODE (t1
) != POINTER_TYPE
8272 || TREE_CODE (t2
) != POINTER_TYPE
)
8275 /* Top-level qualifiers don't matter. */
8276 t1
= TYPE_MAIN_VARIANT (t1
);
8277 t2
= TYPE_MAIN_VARIANT (t2
);
8278 casts_away_constness_r (&t1
, &t2
);
8279 if (!can_convert (t2
, t1
))
8285 /* If T is a REFERENCE_TYPE return the type to which T refers.
8286 Otherwise, return T itself. */
8289 non_reference (tree t
)
8291 if (TREE_CODE (t
) == REFERENCE_TYPE
)
8297 /* Return nonzero if REF is an lvalue valid for this language;
8298 otherwise, print an error message and return zero. USE says
8299 how the lvalue is being used and so selects the error message. */
8302 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
8304 cp_lvalue_kind kind
= lvalue_kind (ref
);
8306 if (kind
== clk_none
)
8308 if (complain
& tf_error
)
8309 lvalue_error (input_location
, use
);
8312 else if (kind
& (clk_rvalueref
|clk_class
))
8314 if (!(complain
& tf_error
))
8316 if (kind
& clk_class
)
8317 /* Make this a permerror because we used to accept it. */
8318 permerror (input_location
, "using temporary as lvalue");
8320 error ("using xvalue (rvalue reference) as lvalue");