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
));
834 t1
= build_exception_variant (rval
, raises
);
840 /* Get this value the long way, since TYPE_METHOD_BASETYPE
841 is just the main variant of this. */
842 tree basetype
= class_of_this_parm (t2
);
843 tree raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
844 TYPE_RAISES_EXCEPTIONS (t2
));
847 /* If this was a member function type, get back to the
848 original type of type member function (i.e., without
849 the class instance variable up front. */
850 t1
= build_function_type (TREE_TYPE (t1
),
851 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
852 t2
= build_function_type (TREE_TYPE (t2
),
853 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
854 t3
= merge_types (t1
, t2
);
855 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
856 TYPE_ARG_TYPES (t3
));
857 t1
= build_exception_variant (t3
, raises
);
862 /* There is no need to merge attributes into a TYPENAME_TYPE.
863 When the type is instantiated it will have whatever
864 attributes result from the instantiation. */
870 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
872 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
875 return cp_build_type_attribute_variant (t1
, attributes
);
878 /* Return the ARRAY_TYPE type without its domain. */
881 strip_array_domain (tree type
)
884 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
885 if (TYPE_DOMAIN (type
) == NULL_TREE
)
887 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
888 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
891 /* Wrapper around cp_common_type that is used by c-common.c and other
892 front end optimizations that remove promotions.
894 Return the common type for two arithmetic types T1 and T2 under the
895 usual arithmetic conversions. The default conversions have already
896 been applied, and enumerated types converted to their compatible
900 common_type (tree t1
, tree t2
)
902 /* If one type is nonsense, use the other */
903 if (t1
== error_mark_node
)
905 if (t2
== error_mark_node
)
908 return cp_common_type (t1
, t2
);
911 /* Return the common type of two pointer types T1 and T2. This is the
912 type for the result of most arithmetic operations if the operands
913 have the given two types.
915 We assume that comp_target_types has already been done and returned
916 nonzero; if that isn't so, this may crash. */
919 common_pointer_type (tree t1
, tree t2
)
921 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
922 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
923 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
925 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
926 CPO_CONVERSION
, tf_warning_or_error
);
929 /* Compare two exception specifier types for exactness or subsetness, if
930 allowed. Returns false for mismatch, true for match (same, or
933 [except.spec] "If a class X ... objects of class X or any class publicly
934 and unambiguously derived from X. Similarly, if a pointer type Y * ...
935 exceptions of type Y * or that are pointers to any type publicly and
936 unambiguously derived from Y. Otherwise a function only allows exceptions
937 that have the same type ..."
938 This does not mention cv qualifiers and is different to what throw
939 [except.throw] and catch [except.catch] will do. They will ignore the
940 top level cv qualifiers, and allow qualifiers in the pointer to class
943 We implement the letter of the standard. */
946 comp_except_types (tree a
, tree b
, bool exact
)
948 if (same_type_p (a
, b
))
952 if (cp_type_quals (a
) || cp_type_quals (b
))
955 if (TREE_CODE (a
) == POINTER_TYPE
956 && TREE_CODE (b
) == POINTER_TYPE
)
960 if (cp_type_quals (a
) || cp_type_quals (b
))
964 if (TREE_CODE (a
) != RECORD_TYPE
965 || TREE_CODE (b
) != RECORD_TYPE
)
968 if (PUBLICLY_UNIQUELY_DERIVED_P (a
, b
))
974 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
975 If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
976 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
977 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
978 are unordered, but we've already filtered out duplicates. Most lists will
979 be in order, we should try to make use of that. */
982 comp_except_specs (const_tree t1
, const_tree t2
, int exact
)
991 /* First handle noexcept. */
992 if (exact
< ce_exact
)
994 /* noexcept(false) is compatible with no exception-specification,
995 and stricter than any spec. */
996 if (t1
== noexcept_false_spec
)
997 return t2
== NULL_TREE
|| exact
== ce_derived
;
998 /* Even a derived noexcept(false) is compatible with no
999 exception-specification. */
1000 if (t2
== noexcept_false_spec
)
1001 return t1
== NULL_TREE
;
1003 /* Otherwise, if we aren't looking for an exact match, noexcept is
1004 equivalent to throw(). */
1005 if (t1
== noexcept_true_spec
)
1006 t1
= empty_except_spec
;
1007 if (t2
== noexcept_true_spec
)
1008 t2
= empty_except_spec
;
1011 /* If any noexcept is left, it is only comparable to itself;
1012 either we're looking for an exact match or we're redeclaring a
1013 template with dependent noexcept. */
1014 if ((t1
&& TREE_PURPOSE (t1
))
1015 || (t2
&& TREE_PURPOSE (t2
)))
1017 && cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)));
1019 if (t1
== NULL_TREE
) /* T1 is ... */
1020 return t2
== NULL_TREE
|| exact
== ce_derived
;
1021 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1022 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1023 if (t2
== NULL_TREE
) /* T2 is ... */
1025 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1026 return exact
== ce_derived
;
1028 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1029 Count how many we find, to determine exactness. For exact matching and
1030 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1032 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1034 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1036 tree a
= TREE_VALUE (probe
);
1037 tree b
= TREE_VALUE (t2
);
1039 if (comp_except_types (a
, b
, exact
))
1041 if (probe
== base
&& exact
> ce_derived
)
1042 base
= TREE_CHAIN (probe
);
1047 if (probe
== NULL_TREE
)
1050 return exact
== ce_derived
|| base
== NULL_TREE
|| length
== list_length (t1
);
1053 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1054 [] can match [size]. */
1057 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1066 /* The type of the array elements must be the same. */
1067 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1070 d1
= TYPE_DOMAIN (t1
);
1071 d2
= TYPE_DOMAIN (t2
);
1076 /* If one of the arrays is dimensionless, and the other has a
1077 dimension, they are of different types. However, it is valid to
1085 declarations for an array object can specify
1086 array types that differ by the presence or absence of a major
1087 array bound (_dcl.array_). */
1089 return allow_redeclaration
;
1091 /* Check that the dimensions are the same. */
1093 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1095 max1
= TYPE_MAX_VALUE (d1
);
1096 max2
= TYPE_MAX_VALUE (d2
);
1097 if (processing_template_decl
&& !abi_version_at_least (2)
1098 && !value_dependent_expression_p (max1
)
1099 && !value_dependent_expression_p (max2
))
1101 /* With abi-1 we do not fold non-dependent array bounds, (and
1102 consequently mangle them incorrectly). We must therefore
1103 fold them here, to verify the domains have the same
1109 if (!cp_tree_equal (max1
, max2
))
1115 /* Compare the relative position of T1 and T2 into their respective
1116 template parameter list.
1117 T1 and T2 must be template parameter types.
1118 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1121 comp_template_parms_position (tree t1
, tree t2
)
1123 tree index1
, index2
;
1124 gcc_assert (t1
&& t2
1125 && TREE_CODE (t1
) == TREE_CODE (t2
)
1126 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1127 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1128 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1130 index1
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t1
));
1131 index2
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t2
));
1133 /* If T1 and T2 belong to template parm lists of different size,
1134 let's assume they are different. */
1135 if (TEMPLATE_PARM_NUM_SIBLINGS (index1
)
1136 != TEMPLATE_PARM_NUM_SIBLINGS (index2
))
1139 /* Then compare their relative position. */
1140 if (TEMPLATE_PARM_IDX (index1
) != TEMPLATE_PARM_IDX (index2
)
1141 || TEMPLATE_PARM_LEVEL (index1
) != TEMPLATE_PARM_LEVEL (index2
)
1142 || (TEMPLATE_PARM_PARAMETER_PACK (index1
)
1143 != TEMPLATE_PARM_PARAMETER_PACK (index2
)))
1149 /* Subroutine in comptypes. */
1152 structural_comptypes (tree t1
, tree t2
, int strict
)
1157 /* Suppress errors caused by previously reported errors. */
1158 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1161 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1163 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1164 current instantiation. */
1165 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1166 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1168 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1169 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1171 if (TYPE_PTRMEMFUNC_P (t1
))
1172 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1173 if (TYPE_PTRMEMFUNC_P (t2
))
1174 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1176 /* Different classes of types can't be compatible. */
1177 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1180 /* Qualifiers must match. For array types, we will check when we
1181 recur on the array element types. */
1182 if (TREE_CODE (t1
) != ARRAY_TYPE
1183 && cp_type_quals (t1
) != cp_type_quals (t2
))
1185 if (TREE_CODE (t1
) == FUNCTION_TYPE
1186 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1188 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1191 /* Allow for two different type nodes which have essentially the same
1192 definition. Note that we already checked for equality of the type
1193 qualifiers (just above). */
1195 if (TREE_CODE (t1
) != ARRAY_TYPE
1196 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1200 /* Compare the types. Break out if they could be the same. */
1201 switch (TREE_CODE (t1
))
1205 /* All void and bool types are the same. */
1209 case FIXED_POINT_TYPE
:
1211 /* With these nodes, we can't determine type equivalence by
1212 looking at what is stored in the nodes themselves, because
1213 two nodes might have different TYPE_MAIN_VARIANTs but still
1214 represent the same type. For example, wchar_t and int could
1215 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1216 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1217 and are distinct types. On the other hand, int and the
1220 typedef int INT __attribute((may_alias));
1222 have identical properties, different TYPE_MAIN_VARIANTs, but
1223 represent the same type. The canonical type system keeps
1224 track of equivalence in this case, so we fall back on it. */
1225 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1227 case TEMPLATE_TEMPLATE_PARM
:
1228 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1229 if (!comp_template_parms_position (t1
, t2
))
1231 if (!comp_template_parms
1232 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1233 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1235 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1237 /* Don't check inheritance. */
1238 strict
= COMPARE_STRICT
;
1243 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1244 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1245 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1246 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1249 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1251 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1257 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1258 strict
& ~COMPARE_REDECLARATION
))
1260 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1264 case REFERENCE_TYPE
:
1265 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1267 /* fall through to checks for pointer types */
1270 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1271 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
)
1272 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1278 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1280 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1285 /* Target types must match incl. qualifiers. */
1286 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1290 case TEMPLATE_TYPE_PARM
:
1291 /* If T1 and T2 don't have the same relative position in their
1292 template parameters set, they can't be equal. */
1293 if (!comp_template_parms_position (t1
, t2
))
1298 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1299 TYPENAME_TYPE_FULLNAME (t2
)))
1301 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1305 case UNBOUND_CLASS_TEMPLATE
:
1306 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1308 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1313 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1318 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1319 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1323 case TYPE_PACK_EXPANSION
:
1324 return same_type_p (PACK_EXPANSION_PATTERN (t1
),
1325 PACK_EXPANSION_PATTERN (t2
));
1328 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1329 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1330 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1331 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1332 || (DECLTYPE_FOR_LAMBDA_RETURN (t1
)
1333 != DECLTYPE_FOR_LAMBDA_RETURN (t2
))
1334 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1335 DECLTYPE_TYPE_EXPR (t2
)))
1339 case UNDERLYING_TYPE
:
1340 return same_type_p (UNDERLYING_TYPE_TYPE (t1
),
1341 UNDERLYING_TYPE_TYPE (t2
));
1347 /* If we get here, we know that from a target independent POV the
1348 types are the same. Make sure the target attributes are also
1350 return comp_type_attributes (t1
, t2
);
1353 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1354 is a bitwise-or of the COMPARE_* flags. */
1357 comptypes (tree t1
, tree t2
, int strict
)
1359 if (strict
== COMPARE_STRICT
)
1364 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1367 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1368 /* At least one of the types requires structural equality, so
1369 perform a deep check. */
1370 return structural_comptypes (t1
, t2
, strict
);
1372 #ifdef ENABLE_CHECKING
1373 if (USE_CANONICAL_TYPES
)
1375 bool result
= structural_comptypes (t1
, t2
, strict
);
1377 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1378 /* The two types are structurally equivalent, but their
1379 canonical types were different. This is a failure of the
1380 canonical type propagation code.*/
1382 ("canonical types differ for identical types %T and %T",
1384 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1385 /* Two types are structurally different, but the canonical
1386 types are the same. This means we were over-eager in
1387 assigning canonical types. */
1389 ("same canonical type node for different types %T and %T",
1395 if (USE_CANONICAL_TYPES
)
1396 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1399 return structural_comptypes (t1
, t2
, strict
);
1401 else if (strict
== COMPARE_STRUCTURAL
)
1402 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1404 return structural_comptypes (t1
, t2
, strict
);
1407 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1408 top-level qualifiers. */
1411 same_type_ignoring_top_level_qualifiers_p (tree type1
, tree type2
)
1413 if (type1
== error_mark_node
|| type2
== error_mark_node
)
1416 return same_type_p (TYPE_MAIN_VARIANT (type1
), TYPE_MAIN_VARIANT (type2
));
1419 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1422 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1424 int q1
= cp_type_quals (type1
);
1425 int q2
= cp_type_quals (type2
);
1427 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1428 return (q1
& q2
) == q2
;
1431 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1432 more cv-qualified that TYPE1, and 0 otherwise. */
1435 comp_cv_qualification (const_tree type1
, const_tree type2
)
1437 int q1
= cp_type_quals (type1
);
1438 int q2
= cp_type_quals (type2
);
1443 if ((q1
& q2
) == q2
)
1445 else if ((q1
& q2
) == q1
)
1451 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1452 subset of the cv-qualification signature of TYPE2, and the types
1453 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1456 comp_cv_qual_signature (tree type1
, tree type2
)
1458 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1460 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1466 /* Subroutines of `comptypes'. */
1468 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1469 equivalent in the sense that functions with those parameter types
1470 can have equivalent types. The two lists must be equivalent,
1471 element by element. */
1474 compparms (const_tree parms1
, const_tree parms2
)
1478 /* An unspecified parmlist matches any specified parmlist
1479 whose argument types don't need default promotions. */
1481 for (t1
= parms1
, t2
= parms2
;
1483 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1485 /* If one parmlist is shorter than the other,
1486 they fail to match. */
1489 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1496 /* Process a sizeof or alignof expression where the operand is a
1500 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1505 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1506 if (type
== error_mark_node
)
1507 return error_mark_node
;
1509 type
= non_reference (type
);
1510 if (TREE_CODE (type
) == METHOD_TYPE
)
1513 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
1514 "invalid application of %qs to a member function",
1515 operator_name_info
[(int) op
].name
);
1516 value
= size_one_node
;
1519 dependent_p
= dependent_type_p (type
);
1521 complete_type (type
);
1523 /* VLA types will have a non-constant size. In the body of an
1524 uninstantiated template, we don't need to try to compute the
1525 value, because the sizeof expression is not an integral
1526 constant expression in that case. And, if we do try to
1527 compute the value, we'll likely end up with SAVE_EXPRs, which
1528 the template substitution machinery does not expect to see. */
1529 || (processing_template_decl
1530 && COMPLETE_TYPE_P (type
)
1531 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1533 value
= build_min (op
, size_type_node
, type
);
1534 TREE_READONLY (value
) = 1;
1538 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1543 /* Return the size of the type, without producing any warnings for
1544 types whose size cannot be taken. This routine should be used only
1545 in some other routine that has already produced a diagnostic about
1546 using the size of such a type. */
1548 cxx_sizeof_nowarn (tree type
)
1550 if (TREE_CODE (type
) == FUNCTION_TYPE
1551 || TREE_CODE (type
) == VOID_TYPE
1552 || TREE_CODE (type
) == ERROR_MARK
)
1553 return size_one_node
;
1554 else if (!COMPLETE_TYPE_P (type
))
1555 return size_zero_node
;
1557 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1560 /* Process a sizeof expression where the operand is an expression. */
1563 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1565 if (e
== error_mark_node
)
1566 return error_mark_node
;
1568 if (processing_template_decl
)
1570 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1571 TREE_SIDE_EFFECTS (e
) = 0;
1572 TREE_READONLY (e
) = 1;
1577 /* To get the size of a static data member declared as an array of
1578 unknown bound, we need to instantiate it. */
1579 if (TREE_CODE (e
) == VAR_DECL
1580 && VAR_HAD_UNKNOWN_BOUND (e
)
1581 && DECL_TEMPLATE_INSTANTIATION (e
))
1582 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1584 e
= mark_type_use (e
);
1586 if (TREE_CODE (e
) == COMPONENT_REF
1587 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1588 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1590 if (complain
& tf_error
)
1591 error ("invalid application of %<sizeof%> to a bit-field");
1593 return error_mark_node
;
1596 else if (is_overloaded_fn (e
))
1598 if (complain
& tf_error
)
1599 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1602 return error_mark_node
;
1605 else if (type_unknown_p (e
))
1607 if (complain
& tf_error
)
1608 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1610 return error_mark_node
;
1616 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1619 /* Implement the __alignof keyword: Return the minimum required
1620 alignment of E, measured in bytes. For VAR_DECL's and
1621 FIELD_DECL's return DECL_ALIGN (which can be set from an
1622 "aligned" __attribute__ specification). */
1625 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1629 if (e
== error_mark_node
)
1630 return error_mark_node
;
1632 if (processing_template_decl
)
1634 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1635 TREE_SIDE_EFFECTS (e
) = 0;
1636 TREE_READONLY (e
) = 1;
1641 e
= mark_type_use (e
);
1643 if (TREE_CODE (e
) == VAR_DECL
)
1644 t
= size_int (DECL_ALIGN_UNIT (e
));
1645 else if (TREE_CODE (e
) == COMPONENT_REF
1646 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1647 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1649 if (complain
& tf_error
)
1650 error ("invalid application of %<__alignof%> to a bit-field");
1652 return error_mark_node
;
1655 else if (TREE_CODE (e
) == COMPONENT_REF
1656 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1657 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1658 else if (is_overloaded_fn (e
))
1660 if (complain
& tf_error
)
1661 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1664 return error_mark_node
;
1665 if (TREE_CODE (e
) == FUNCTION_DECL
)
1666 t
= size_int (DECL_ALIGN_UNIT (e
));
1670 else if (type_unknown_p (e
))
1672 if (complain
& tf_error
)
1673 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1675 return error_mark_node
;
1679 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1680 complain
& tf_error
);
1682 return fold_convert (size_type_node
, t
);
1685 /* Process a sizeof or alignof expression E with code OP where the operand
1686 is an expression. */
1689 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1691 if (op
== SIZEOF_EXPR
)
1692 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1694 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1697 /* EXPR is being used in a context that is not a function call.
1702 The expression can be used only as the left-hand operand of a
1703 member function call.
1705 [expr.mptr.operator]
1707 If the result of .* or ->* is a function, then that result can be
1708 used only as the operand for the function call operator ().
1710 by issuing an error message if appropriate. Returns true iff EXPR
1711 violates these rules. */
1714 invalid_nonstatic_memfn_p (const_tree expr
, tsubst_flags_t complain
)
1716 if (expr
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1718 if (complain
& tf_error
)
1719 error ("invalid use of non-static member function");
1725 /* If EXP is a reference to a bitfield, and the type of EXP does not
1726 match the declared type of the bitfield, return the declared type
1727 of the bitfield. Otherwise, return NULL_TREE. */
1730 is_bitfield_expr_with_lowered_type (const_tree exp
)
1732 switch (TREE_CODE (exp
))
1735 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1736 ? TREE_OPERAND (exp
, 1)
1737 : TREE_OPERAND (exp
, 0)))
1739 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1742 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1746 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1752 field
= TREE_OPERAND (exp
, 1);
1753 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1755 if (same_type_ignoring_top_level_qualifiers_p
1756 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1758 return DECL_BIT_FIELD_TYPE (field
);
1762 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1763 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1764 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1772 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1773 bitfield with a lowered type, the type of EXP is returned, rather
1777 unlowered_expr_type (const_tree exp
)
1780 tree etype
= TREE_TYPE (exp
);
1782 type
= is_bitfield_expr_with_lowered_type (exp
);
1784 type
= cp_build_qualified_type (type
, cp_type_quals (etype
));
1791 /* Perform the conversions in [expr] that apply when an lvalue appears
1792 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1793 function-to-pointer conversions. In addition, manifest constants
1794 are replaced by their values, and bitfield references are converted
1795 to their declared types. Note that this function does not perform the
1796 lvalue-to-rvalue conversion for class types. If you need that conversion
1797 to for class types, then you probably need to use force_rvalue.
1799 Although the returned value is being used as an rvalue, this
1800 function does not wrap the returned expression in a
1801 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1802 that the return value is no longer an lvalue. */
1805 decay_conversion (tree exp
)
1808 enum tree_code code
;
1810 type
= TREE_TYPE (exp
);
1811 if (type
== error_mark_node
)
1812 return error_mark_node
;
1814 exp
= mark_rvalue_use (exp
);
1816 exp
= resolve_nondeduced_context (exp
);
1817 if (type_unknown_p (exp
))
1819 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1820 return error_mark_node
;
1823 /* FIXME remove? at least need to remember that this isn't really a
1824 constant expression if EXP isn't decl_constant_var_p, like with
1825 C_MAYBE_CONST_EXPR. */
1826 exp
= decl_constant_value (exp
);
1827 if (error_operand_p (exp
))
1828 return error_mark_node
;
1830 if (NULLPTR_TYPE_P (type
))
1831 return nullptr_node
;
1833 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1834 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1835 code
= TREE_CODE (type
);
1836 if (code
== VOID_TYPE
)
1838 error ("void value not ignored as it ought to be");
1839 return error_mark_node
;
1841 if (invalid_nonstatic_memfn_p (exp
, tf_warning_or_error
))
1842 return error_mark_node
;
1843 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1844 return cp_build_addr_expr (exp
, tf_warning_or_error
);
1845 if (code
== ARRAY_TYPE
)
1850 if (TREE_CODE (exp
) == INDIRECT_REF
)
1851 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1852 TREE_OPERAND (exp
, 0));
1854 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1856 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1857 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1858 TREE_OPERAND (exp
, 0), op1
);
1862 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1864 error ("invalid use of non-lvalue array");
1865 return error_mark_node
;
1868 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1870 if (TREE_CODE (exp
) == VAR_DECL
)
1872 if (!cxx_mark_addressable (exp
))
1873 return error_mark_node
;
1874 adr
= build_nop (ptrtype
, build_address (exp
));
1877 /* This way is better for a COMPONENT_REF since it can
1878 simplify the offset for a component. */
1879 adr
= cp_build_addr_expr (exp
, tf_warning_or_error
);
1880 return cp_convert (ptrtype
, adr
);
1883 /* If a bitfield is used in a context where integral promotion
1884 applies, then the caller is expected to have used
1885 default_conversion. That function promotes bitfields correctly
1886 before calling this function. At this point, if we have a
1887 bitfield referenced, we may assume that is not subject to
1888 promotion, and that, therefore, the type of the resulting rvalue
1889 is the declared type of the bitfield. */
1890 exp
= convert_bitfield_to_declared_type (exp
);
1892 /* We do not call rvalue() here because we do not want to wrap EXP
1893 in a NON_LVALUE_EXPR. */
1897 Non-class rvalues always have cv-unqualified types. */
1898 type
= TREE_TYPE (exp
);
1899 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
1900 exp
= build_nop (cv_unqualified (type
), exp
);
1905 /* Perform preparatory conversions, as part of the "usual arithmetic
1906 conversions". In particular, as per [expr]:
1908 Whenever an lvalue expression appears as an operand of an
1909 operator that expects the rvalue for that operand, the
1910 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1911 standard conversions are applied to convert the expression to an
1914 In addition, we perform integral promotions here, as those are
1915 applied to both operands to a binary operator before determining
1916 what additional conversions should apply. */
1919 default_conversion (tree exp
)
1921 /* Check for target-specific promotions. */
1922 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
1924 exp
= cp_convert (promoted_type
, exp
);
1925 /* Perform the integral promotions first so that bitfield
1926 expressions (which may promote to "int", even if the bitfield is
1927 declared "unsigned") are promoted correctly. */
1928 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
1929 exp
= perform_integral_promotions (exp
);
1930 /* Perform the other conversions. */
1931 exp
= decay_conversion (exp
);
1936 /* EXPR is an expression with an integral or enumeration type.
1937 Perform the integral promotions in [conv.prom], and return the
1941 perform_integral_promotions (tree expr
)
1946 expr
= mark_rvalue_use (expr
);
1950 If the bitfield has an enumerated type, it is treated as any
1951 other value of that type for promotion purposes. */
1952 type
= is_bitfield_expr_with_lowered_type (expr
);
1953 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
1954 type
= TREE_TYPE (expr
);
1955 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
1956 promoted_type
= type_promotes_to (type
);
1957 if (type
!= promoted_type
)
1958 expr
= cp_convert (promoted_type
, expr
);
1962 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1963 decay_conversion to one. */
1966 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
1970 if (TREE_CODE (totype
) != POINTER_TYPE
)
1973 t
= TREE_TYPE (totype
);
1974 if (!same_type_p (t
, char_type_node
)
1975 && !same_type_p (t
, char16_type_node
)
1976 && !same_type_p (t
, char32_type_node
)
1977 && !same_type_p (t
, wchar_type_node
))
1980 if (TREE_CODE (exp
) == STRING_CST
)
1982 /* Make sure that we don't try to convert between char and wide chars. */
1983 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
1988 /* Is this a string constant which has decayed to 'const char *'? */
1989 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
1990 if (!same_type_p (TREE_TYPE (exp
), t
))
1993 if (TREE_CODE (exp
) != ADDR_EXPR
1994 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
1998 /* This warning is not very useful, as it complains about printf. */
2000 warning (OPT_Wwrite_strings
,
2001 "deprecated conversion from string constant to %qT",
2007 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2008 can, for example, use as an lvalue. This code used to be in
2009 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2010 expressions, where we're dealing with aggregates. But now it's again only
2011 called from unary_complex_lvalue. The case (in particular) that led to
2012 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2016 rationalize_conditional_expr (enum tree_code code
, tree t
,
2017 tsubst_flags_t complain
)
2019 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2020 the first operand is always the one to be used if both operands
2021 are equal, so we know what conditional expression this used to be. */
2022 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2024 tree op0
= TREE_OPERAND (t
, 0);
2025 tree op1
= TREE_OPERAND (t
, 1);
2027 /* The following code is incorrect if either operand side-effects. */
2028 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2029 && !TREE_SIDE_EFFECTS (op1
));
2031 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
2032 ? LE_EXPR
: GE_EXPR
),
2033 op0
, TREE_CODE (op0
),
2034 op1
, TREE_CODE (op1
),
2035 /*overloaded_p=*/NULL
,
2037 cp_build_unary_op (code
, op0
, 0, complain
),
2038 cp_build_unary_op (code
, op1
, 0, complain
),
2043 build_conditional_expr (TREE_OPERAND (t
, 0),
2044 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2046 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2051 /* Given the TYPE of an anonymous union field inside T, return the
2052 FIELD_DECL for the field. If not found return NULL_TREE. Because
2053 anonymous unions can nest, we must also search all anonymous unions
2054 that are directly reachable. */
2057 lookup_anon_field (tree t
, tree type
)
2061 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2063 if (TREE_STATIC (field
))
2065 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2068 /* If we find it directly, return the field. */
2069 if (DECL_NAME (field
) == NULL_TREE
2070 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2075 /* Otherwise, it could be nested, search harder. */
2076 if (DECL_NAME (field
) == NULL_TREE
2077 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2079 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2087 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2088 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2089 non-NULL, it indicates the path to the base used to name MEMBER.
2090 If PRESERVE_REFERENCE is true, the expression returned will have
2091 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2092 returned will have the type referred to by the reference.
2094 This function does not perform access control; that is either done
2095 earlier by the parser when the name of MEMBER is resolved to MEMBER
2096 itself, or later when overload resolution selects one of the
2097 functions indicated by MEMBER. */
2100 build_class_member_access_expr (tree object
, tree member
,
2101 tree access_path
, bool preserve_reference
,
2102 tsubst_flags_t complain
)
2106 tree result
= NULL_TREE
;
2108 if (error_operand_p (object
) || error_operand_p (member
))
2109 return error_mark_node
;
2111 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2115 The type of the first expression shall be "class object" (of a
2117 object_type
= TREE_TYPE (object
);
2118 if (!currently_open_class (object_type
)
2119 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2120 return error_mark_node
;
2121 if (!CLASS_TYPE_P (object_type
))
2123 if (complain
& tf_error
)
2124 error ("request for member %qD in %qE, which is of non-class type %qT",
2125 member
, object
, object_type
);
2126 return error_mark_node
;
2129 /* The standard does not seem to actually say that MEMBER must be a
2130 member of OBJECT_TYPE. However, that is clearly what is
2132 if (DECL_P (member
))
2134 member_scope
= DECL_CLASS_CONTEXT (member
);
2136 if (TREE_DEPRECATED (member
))
2137 warn_deprecated_use (member
, NULL_TREE
);
2140 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2141 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2142 presently be the anonymous union. Go outwards until we find a
2143 type related to OBJECT_TYPE. */
2144 while (ANON_AGGR_TYPE_P (member_scope
)
2145 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2147 member_scope
= TYPE_CONTEXT (member_scope
);
2148 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2150 if (complain
& tf_error
)
2152 if (TREE_CODE (member
) == FIELD_DECL
)
2153 error ("invalid use of nonstatic data member %qE", member
);
2155 error ("%qD is not a member of %qT", member
, object_type
);
2157 return error_mark_node
;
2160 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2161 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2162 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2164 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2166 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2169 /* In [expr.ref], there is an explicit list of the valid choices for
2170 MEMBER. We check for each of those cases here. */
2171 if (TREE_CODE (member
) == VAR_DECL
)
2173 /* A static data member. */
2175 mark_exp_read (object
);
2176 /* If OBJECT has side-effects, they are supposed to occur. */
2177 if (TREE_SIDE_EFFECTS (object
))
2178 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2180 else if (TREE_CODE (member
) == FIELD_DECL
)
2182 /* A non-static data member. */
2187 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
2188 && integer_zerop (TREE_OPERAND (object
, 0)));
2190 /* Convert OBJECT to the type of MEMBER. */
2191 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2192 TYPE_MAIN_VARIANT (member_scope
)))
2197 binfo
= lookup_base (access_path
? access_path
: object_type
,
2198 member_scope
, ba_unique
, &kind
);
2199 if (binfo
== error_mark_node
)
2200 return error_mark_node
;
2202 /* It is invalid to try to get to a virtual base of a
2203 NULL object. The most common cause is invalid use of
2205 if (null_object_p
&& kind
== bk_via_virtual
)
2207 if (complain
& tf_error
)
2209 error ("invalid access to non-static data member %qD of "
2212 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2214 return error_mark_node
;
2217 /* Convert to the base. */
2218 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2220 /* If we found the base successfully then we should be able
2221 to convert to it successfully. */
2222 gcc_assert (object
!= error_mark_node
);
2225 /* Complain about other invalid uses of offsetof, even though they will
2226 give the right answer. Note that we complain whether or not they
2227 actually used the offsetof macro, since there's no way to know at this
2228 point. So we just give a warning, instead of a pedwarn. */
2229 /* Do not produce this warning for base class field references, because
2230 we know for a fact that didn't come from offsetof. This does occur
2231 in various testsuite cases where a null object is passed where a
2232 vtable access is required. */
2233 if (null_object_p
&& warn_invalid_offsetof
2234 && CLASSTYPE_NON_STD_LAYOUT (object_type
)
2235 && !DECL_FIELD_IS_BASE (member
)
2236 && cp_unevaluated_operand
== 0
2237 && (complain
& tf_warning
))
2239 warning (OPT_Winvalid_offsetof
,
2240 "invalid access to non-static data member %qD "
2241 " of NULL object", member
);
2242 warning (OPT_Winvalid_offsetof
,
2243 "(perhaps the %<offsetof%> macro was used incorrectly)");
2246 /* If MEMBER is from an anonymous aggregate, we have converted
2247 OBJECT so that it refers to the class containing the
2248 anonymous union. Generate a reference to the anonymous union
2249 itself, and recur to find MEMBER. */
2250 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2251 /* When this code is called from build_field_call, the
2252 object already has the type of the anonymous union.
2253 That is because the COMPONENT_REF was already
2254 constructed, and was then disassembled before calling
2255 build_field_call. After the function-call code is
2256 cleaned up, this waste can be eliminated. */
2257 && (!same_type_ignoring_top_level_qualifiers_p
2258 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2260 tree anonymous_union
;
2262 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2263 DECL_CONTEXT (member
));
2264 object
= build_class_member_access_expr (object
,
2266 /*access_path=*/NULL_TREE
,
2271 /* Compute the type of the field, as described in [expr.ref]. */
2272 type_quals
= TYPE_UNQUALIFIED
;
2273 member_type
= TREE_TYPE (member
);
2274 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2276 type_quals
= (cp_type_quals (member_type
)
2277 | cp_type_quals (object_type
));
2279 /* A field is const (volatile) if the enclosing object, or the
2280 field itself, is const (volatile). But, a mutable field is
2281 not const, even within a const object. */
2282 if (DECL_MUTABLE_P (member
))
2283 type_quals
&= ~TYPE_QUAL_CONST
;
2284 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2287 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
2289 result
= fold_if_not_in_template (result
);
2291 /* Mark the expression const or volatile, as appropriate. Even
2292 though we've dealt with the type above, we still have to mark the
2293 expression itself. */
2294 if (type_quals
& TYPE_QUAL_CONST
)
2295 TREE_READONLY (result
) = 1;
2296 if (type_quals
& TYPE_QUAL_VOLATILE
)
2297 TREE_THIS_VOLATILE (result
) = 1;
2299 else if (BASELINK_P (member
))
2301 /* The member is a (possibly overloaded) member function. */
2305 /* If the MEMBER is exactly one static member function, then we
2306 know the type of the expression. Otherwise, we must wait
2307 until overload resolution has been performed. */
2308 functions
= BASELINK_FUNCTIONS (member
);
2309 if (TREE_CODE (functions
) == FUNCTION_DECL
2310 && DECL_STATIC_FUNCTION_P (functions
))
2311 type
= TREE_TYPE (functions
);
2313 type
= unknown_type_node
;
2314 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2315 base. That will happen when the function is called. */
2316 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2318 else if (TREE_CODE (member
) == CONST_DECL
)
2320 /* The member is an enumerator. */
2322 /* If OBJECT has side-effects, they are supposed to occur. */
2323 if (TREE_SIDE_EFFECTS (object
))
2324 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2329 if (complain
& tf_error
)
2330 error ("invalid use of %qD", member
);
2331 return error_mark_node
;
2334 if (!preserve_reference
)
2337 If E2 is declared to have type "reference to T", then ... the
2338 type of E1.E2 is T. */
2339 result
= convert_from_reference (result
);
2344 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2345 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2348 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2350 tree object_type
= TREE_TYPE (object
);
2351 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2354 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2356 error ("qualified type %qT does not match destructor name ~%qT",
2358 return error_mark_node
;
2360 if (TREE_CODE (dtor_type
) == IDENTIFIER_NODE
)
2362 /* In a template, names we can't find a match for are still accepted
2363 destructor names, and we check them here. */
2364 if (check_dtor_name (object_type
, dtor_type
))
2365 dtor_type
= object_type
;
2368 error ("object type %qT does not match destructor name ~%qT",
2369 object_type
, dtor_type
);
2370 return error_mark_node
;
2374 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2376 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2377 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2378 return error_mark_node
;
2380 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2381 /*protect=*/1, /*want_type=*/false);
2382 expr
= (adjust_result_of_qualified_name_lookup
2383 (expr
, dtor_type
, object_type
));
2387 /* An expression of the form "A::template B" has been resolved to
2388 DECL. Issue a diagnostic if B is not a template or template
2392 check_template_keyword (tree decl
)
2394 /* The standard says:
2398 If a name prefixed by the keyword template is not a member
2399 template, the program is ill-formed.
2401 DR 228 removed the restriction that the template be a member
2404 DR 96, if accepted would add the further restriction that explicit
2405 template arguments must be provided if the template keyword is
2406 used, but, as of 2005-10-16, that DR is still in "drafting". If
2407 this DR is accepted, then the semantic checks here can be
2408 simplified, as the entity named must in fact be a template
2409 specialization, rather than, as at present, a set of overloaded
2410 functions containing at least one template function. */
2411 if (TREE_CODE (decl
) != TEMPLATE_DECL
2412 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2414 if (!is_overloaded_fn (decl
))
2415 permerror (input_location
, "%qD is not a template", decl
);
2420 if (BASELINK_P (fns
))
2421 fns
= BASELINK_FUNCTIONS (fns
);
2424 tree fn
= OVL_CURRENT (fns
);
2425 if (TREE_CODE (fn
) == TEMPLATE_DECL
2426 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2428 if (TREE_CODE (fn
) == FUNCTION_DECL
2429 && DECL_USE_TEMPLATE (fn
)
2430 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2432 fns
= OVL_NEXT (fns
);
2435 permerror (input_location
, "%qD is not a template", decl
);
2440 /* This function is called by the parser to process a class member
2441 access expression of the form OBJECT.NAME. NAME is a node used by
2442 the parser to represent a name; it is not yet a DECL. It may,
2443 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2444 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2445 there is no reason to do the lookup twice, so the parser keeps the
2446 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2447 be a template via the use of the "A::template B" syntax. */
2450 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2451 tsubst_flags_t complain
)
2456 tree access_path
= NULL_TREE
;
2457 tree orig_object
= object
;
2458 tree orig_name
= name
;
2460 if (object
== error_mark_node
|| name
== error_mark_node
)
2461 return error_mark_node
;
2463 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2464 if (!objc_is_public (object
, name
))
2465 return error_mark_node
;
2467 object_type
= TREE_TYPE (object
);
2469 if (processing_template_decl
)
2471 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2472 dependent_type_p (object_type
)
2473 /* If NAME is just an IDENTIFIER_NODE, then the expression
2475 || TREE_CODE (object
) == IDENTIFIER_NODE
2476 /* If NAME is "f<args>", where either 'f' or 'args' is
2477 dependent, then the expression is dependent. */
2478 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2479 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2480 TREE_OPERAND (name
, 1)))
2481 /* If NAME is "T::X" where "T" is dependent, then the
2482 expression is dependent. */
2483 || (TREE_CODE (name
) == SCOPE_REF
2484 && TYPE_P (TREE_OPERAND (name
, 0))
2485 && dependent_type_p (TREE_OPERAND (name
, 0))))
2486 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2487 object
= build_non_dependent_expr (object
);
2489 else if (c_dialect_objc ()
2490 && TREE_CODE (name
) == IDENTIFIER_NODE
2491 && (expr
= objc_maybe_build_component_ref (object
, name
)))
2496 The type of the first expression shall be "class object" (of a
2498 if (!currently_open_class (object_type
)
2499 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2500 return error_mark_node
;
2501 if (!CLASS_TYPE_P (object_type
))
2503 if (complain
& tf_error
)
2504 error ("request for member %qD in %qE, which is of non-class type %qT",
2505 name
, object
, object_type
);
2506 return error_mark_node
;
2509 if (BASELINK_P (name
))
2510 /* A member function that has already been looked up. */
2514 bool is_template_id
= false;
2515 tree template_args
= NULL_TREE
;
2518 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2520 is_template_id
= true;
2521 template_args
= TREE_OPERAND (name
, 1);
2522 name
= TREE_OPERAND (name
, 0);
2524 if (TREE_CODE (name
) == OVERLOAD
)
2525 name
= DECL_NAME (get_first_fn (name
));
2526 else if (DECL_P (name
))
2527 name
= DECL_NAME (name
);
2530 if (TREE_CODE (name
) == SCOPE_REF
)
2532 /* A qualified name. The qualifying class or namespace `S'
2533 has already been looked up; it is either a TYPE or a
2535 scope
= TREE_OPERAND (name
, 0);
2536 name
= TREE_OPERAND (name
, 1);
2538 /* If SCOPE is a namespace, then the qualified name does not
2539 name a member of OBJECT_TYPE. */
2540 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2542 if (complain
& tf_error
)
2543 error ("%<%D::%D%> is not a member of %qT",
2544 scope
, name
, object_type
);
2545 return error_mark_node
;
2548 gcc_assert (CLASS_TYPE_P (scope
));
2549 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2550 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2552 if (constructor_name_p (name
, scope
))
2554 if (complain
& tf_error
)
2555 error ("cannot call constructor %<%T::%D%> directly",
2557 return error_mark_node
;
2560 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2561 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2562 if (access_path
== error_mark_node
)
2563 return error_mark_node
;
2566 if (complain
& tf_error
)
2567 error ("%qT is not a base of %qT", scope
, object_type
);
2568 return error_mark_node
;
2574 access_path
= object_type
;
2577 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2578 member
= lookup_destructor (object
, scope
, name
);
2581 /* Look up the member. */
2582 member
= lookup_member (access_path
, name
, /*protect=*/1,
2583 /*want_type=*/false);
2584 if (member
== NULL_TREE
)
2586 if (complain
& tf_error
)
2587 error ("%qD has no member named %qE", object_type
, name
);
2588 return error_mark_node
;
2590 if (member
== error_mark_node
)
2591 return error_mark_node
;
2596 tree templ
= member
;
2598 if (BASELINK_P (templ
))
2599 templ
= lookup_template_function (templ
, template_args
);
2602 if (complain
& tf_error
)
2603 error ("%qD is not a member template function", name
);
2604 return error_mark_node
;
2609 if (TREE_DEPRECATED (member
))
2610 warn_deprecated_use (member
, NULL_TREE
);
2613 check_template_keyword (member
);
2615 expr
= build_class_member_access_expr (object
, member
, access_path
,
2616 /*preserve_reference=*/false,
2618 if (processing_template_decl
&& expr
!= error_mark_node
)
2620 if (BASELINK_P (member
))
2622 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2623 BASELINK_QUALIFIED_P (member
) = 1;
2626 return build_min_non_dep (COMPONENT_REF
, expr
,
2627 orig_object
, orig_name
,
2634 /* Return an expression for the MEMBER_NAME field in the internal
2635 representation of PTRMEM, a pointer-to-member function. (Each
2636 pointer-to-member function type gets its own RECORD_TYPE so it is
2637 more convenient to access the fields by name than by FIELD_DECL.)
2638 This routine converts the NAME to a FIELD_DECL and then creates the
2639 node for the complete expression. */
2642 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2648 /* This code is a stripped down version of
2649 build_class_member_access_expr. It does not work to use that
2650 routine directly because it expects the object to be of class
2652 ptrmem_type
= TREE_TYPE (ptrmem
);
2653 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2654 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2655 /*want_type=*/false);
2656 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2657 cp_type_quals (ptrmem_type
));
2658 return fold_build3_loc (input_location
,
2659 COMPONENT_REF
, member_type
,
2660 ptrmem
, member
, NULL_TREE
);
2663 /* Given an expression PTR for a pointer, return an expression
2664 for the value pointed to.
2665 ERRORSTRING is the name of the operator to appear in error messages.
2667 This function may need to overload OPERATOR_FNNAME.
2668 Must also handle REFERENCE_TYPEs for C++. */
2671 build_x_indirect_ref (tree expr
, ref_operator errorstring
,
2672 tsubst_flags_t complain
)
2674 tree orig_expr
= expr
;
2677 if (processing_template_decl
)
2679 /* Retain the type if we know the operand is a pointer so that
2680 describable_type doesn't make auto deduction break. */
2681 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2682 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2683 if (type_dependent_expression_p (expr
))
2684 return build_min_nt (INDIRECT_REF
, expr
);
2685 expr
= build_non_dependent_expr (expr
);
2688 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2689 NULL_TREE
, /*overloaded_p=*/NULL
, complain
);
2691 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2693 if (processing_template_decl
&& rval
!= error_mark_node
)
2694 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2699 /* Helper function called from c-common. */
2701 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2702 tree ptr
, ref_operator errorstring
)
2704 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2708 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2709 tsubst_flags_t complain
)
2713 if (ptr
== error_mark_node
)
2714 return error_mark_node
;
2716 if (ptr
== current_class_ptr
)
2717 return current_class_ref
;
2719 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2720 ? ptr
: decay_conversion (ptr
));
2721 type
= TREE_TYPE (pointer
);
2723 if (POINTER_TYPE_P (type
))
2727 If the type of the expression is "pointer to T," the type
2728 of the result is "T." */
2729 tree t
= TREE_TYPE (type
);
2731 if (CONVERT_EXPR_P (ptr
)
2732 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2734 /* If a warning is issued, mark it to avoid duplicates from
2735 the backend. This only needs to be done at
2736 warn_strict_aliasing > 2. */
2737 if (warn_strict_aliasing
> 2)
2738 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2739 type
, TREE_OPERAND (ptr
, 0)))
2740 TREE_NO_WARNING (ptr
) = 1;
2743 if (VOID_TYPE_P (t
))
2745 /* A pointer to incomplete type (other than cv void) can be
2746 dereferenced [expr.unary.op]/1 */
2747 if (complain
& tf_error
)
2748 error ("%qT is not a pointer-to-object type", type
);
2749 return error_mark_node
;
2751 else if (TREE_CODE (pointer
) == ADDR_EXPR
2752 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2753 /* The POINTER was something like `&x'. We simplify `*&x' to
2755 return TREE_OPERAND (pointer
, 0);
2758 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2760 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2761 so that we get the proper error message if the result is used
2762 to assign to. Also, &* is supposed to be a no-op. */
2763 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2764 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2765 TREE_SIDE_EFFECTS (ref
)
2766 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2770 else if (!(complain
& tf_error
))
2771 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2773 /* `pointer' won't be an error_mark_node if we were given a
2774 pointer to member, so it's cool to check for this here. */
2775 else if (TYPE_PTR_TO_MEMBER_P (type
))
2776 switch (errorstring
)
2778 case RO_ARRAY_INDEXING
:
2779 error ("invalid use of array indexing on pointer to member");
2782 error ("invalid use of unary %<*%> on pointer to member");
2784 case RO_IMPLICIT_CONVERSION
:
2785 error ("invalid use of implicit conversion on pointer to member");
2790 else if (pointer
!= error_mark_node
)
2791 invalid_indirection_error (input_location
, type
, errorstring
);
2793 return error_mark_node
;
2796 /* This handles expressions of the form "a[i]", which denotes
2799 This is logically equivalent in C to *(a+i), but we may do it differently.
2800 If A is a variable or a member, we generate a primitive ARRAY_REF.
2801 This avoids forcing the array out of registers, and can work on
2802 arrays that are not lvalues (for example, members of structures returned
2805 If INDEX is of some user-defined type, it must be converted to
2806 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2807 will inherit the type of the array, which will be some pointer type.
2809 LOC is the location to use in building the array reference. */
2812 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
2813 tsubst_flags_t complain
)
2819 if (complain
& tf_error
)
2820 error_at (loc
, "subscript missing in array reference");
2821 return error_mark_node
;
2824 if (TREE_TYPE (array
) == error_mark_node
2825 || TREE_TYPE (idx
) == error_mark_node
)
2826 return error_mark_node
;
2828 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2830 switch (TREE_CODE (array
))
2834 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2836 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2837 TREE_OPERAND (array
, 0), value
);
2838 SET_EXPR_LOCATION (ret
, loc
);
2843 ret
= build_conditional_expr
2844 (TREE_OPERAND (array
, 0),
2845 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2847 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
2849 tf_warning_or_error
);
2850 protected_set_expr_location (ret
, loc
);
2857 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2861 warn_array_subscript_with_type_char (idx
);
2863 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2865 if (complain
& tf_error
)
2866 error_at (loc
, "array subscript is not an integer");
2867 return error_mark_node
;
2870 /* Apply integral promotions *after* noticing character types.
2871 (It is unclear why we do these promotions -- the standard
2872 does not say that we should. In fact, the natural thing would
2873 seem to be to convert IDX to ptrdiff_t; we're performing
2874 pointer arithmetic.) */
2875 idx
= perform_integral_promotions (idx
);
2877 /* An array that is indexed by a non-constant
2878 cannot be stored in a register; we must be able to do
2879 address arithmetic on its address.
2880 Likewise an array of elements of variable size. */
2881 if (TREE_CODE (idx
) != INTEGER_CST
2882 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2883 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2886 if (!cxx_mark_addressable (array
))
2887 return error_mark_node
;
2890 /* An array that is indexed by a constant value which is not within
2891 the array bounds cannot be stored in a register either; because we
2892 would get a crash in store_bit_field/extract_bit_field when trying
2893 to access a non-existent part of the register. */
2894 if (TREE_CODE (idx
) == INTEGER_CST
2895 && TYPE_DOMAIN (TREE_TYPE (array
))
2896 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
2898 if (!cxx_mark_addressable (array
))
2899 return error_mark_node
;
2902 if (!lvalue_p (array
) && (complain
& tf_error
))
2903 pedwarn (loc
, OPT_pedantic
,
2904 "ISO C++ forbids subscripting non-lvalue array");
2906 /* Note in C++ it is valid to subscript a `register' array, since
2907 it is valid to take the address of something with that
2908 storage specification. */
2912 while (TREE_CODE (foo
) == COMPONENT_REF
)
2913 foo
= TREE_OPERAND (foo
, 0);
2914 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
)
2915 && (complain
& tf_warning
))
2916 warning_at (loc
, OPT_Wextra
,
2917 "subscripting array declared %<register%>");
2920 type
= TREE_TYPE (TREE_TYPE (array
));
2921 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
2922 /* Array ref is const/volatile if the array elements are
2923 or if the array is.. */
2924 TREE_READONLY (rval
)
2925 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
2926 TREE_SIDE_EFFECTS (rval
)
2927 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
2928 TREE_THIS_VOLATILE (rval
)
2929 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
2930 ret
= require_complete_type_sfinae (fold_if_not_in_template (rval
),
2932 protected_set_expr_location (ret
, loc
);
2937 tree ar
= default_conversion (array
);
2938 tree ind
= default_conversion (idx
);
2940 /* Put the integer in IND to simplify error checking. */
2941 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
2948 if (ar
== error_mark_node
)
2951 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
2953 if (complain
& tf_error
)
2954 error_at (loc
, "subscripted value is neither array nor pointer");
2955 return error_mark_node
;
2957 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
2959 if (complain
& tf_error
)
2960 error_at (loc
, "array subscript is not an integer");
2961 return error_mark_node
;
2964 warn_array_subscript_with_type_char (idx
);
2966 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
2971 protected_set_expr_location (ret
, loc
);
2976 /* Entry point for Obj-C++. */
2979 build_array_ref (location_t loc
, tree array
, tree idx
)
2981 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
2984 /* Resolve a pointer to member function. INSTANCE is the object
2985 instance to use, if the member points to a virtual member.
2987 This used to avoid checking for virtual functions if basetype
2988 has no virtual functions, according to an earlier ANSI draft.
2989 With the final ISO C++ rules, such an optimization is
2990 incorrect: A pointer to a derived member can be static_cast
2991 to pointer-to-base-member, as long as the dynamic object
2992 later has the right member. */
2995 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
2997 if (TREE_CODE (function
) == OFFSET_REF
)
2998 function
= TREE_OPERAND (function
, 1);
3000 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3002 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
3003 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3005 tree instance_ptr
= *instance_ptrptr
;
3006 tree instance_save_expr
= 0;
3007 if (instance_ptr
== error_mark_node
)
3009 if (TREE_CODE (function
) == PTRMEM_CST
)
3011 /* Extracting the function address from a pmf is only
3012 allowed with -Wno-pmf-conversions. It only works for
3014 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
3015 e1
= convert (fntype
, e1
);
3020 error ("object missing in use of %qE", function
);
3021 return error_mark_node
;
3025 if (TREE_SIDE_EFFECTS (instance_ptr
))
3026 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3028 if (TREE_SIDE_EFFECTS (function
))
3029 function
= save_expr (function
);
3031 /* Start by extracting all the information from the PMF itself. */
3032 e3
= pfn_from_ptrmemfunc (function
);
3033 delta
= delta_from_ptrmemfunc (function
);
3034 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3035 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3037 case ptrmemfunc_vbit_in_pfn
:
3038 e1
= cp_build_binary_op (input_location
,
3039 BIT_AND_EXPR
, idx
, integer_one_node
,
3040 tf_warning_or_error
);
3041 idx
= cp_build_binary_op (input_location
,
3042 MINUS_EXPR
, idx
, integer_one_node
,
3043 tf_warning_or_error
);
3046 case ptrmemfunc_vbit_in_delta
:
3047 e1
= cp_build_binary_op (input_location
,
3048 BIT_AND_EXPR
, delta
, integer_one_node
,
3049 tf_warning_or_error
);
3050 delta
= cp_build_binary_op (input_location
,
3051 RSHIFT_EXPR
, delta
, integer_one_node
,
3052 tf_warning_or_error
);
3059 /* Convert down to the right base before using the instance. A
3060 special case is that in a pointer to member of class C, C may
3061 be incomplete. In that case, the function will of course be
3062 a member of C, and no conversion is required. In fact,
3063 lookup_base will fail in that case, because incomplete
3064 classes do not have BINFOs. */
3065 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3066 if (!same_type_ignoring_top_level_qualifiers_p
3067 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3069 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3070 basetype
, ba_check
, NULL
);
3071 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3073 if (instance_ptr
== error_mark_node
)
3074 return error_mark_node
;
3076 /* ...and then the delta in the PMF. */
3077 instance_ptr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (instance_ptr
),
3078 instance_ptr
, fold_convert (sizetype
, delta
));
3080 /* Hand back the adjusted 'this' argument to our caller. */
3081 *instance_ptrptr
= instance_ptr
;
3083 /* Next extract the vtable pointer from the object. */
3084 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3086 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, tf_warning_or_error
);
3087 /* If the object is not dynamic the access invokes undefined
3088 behavior. As it is not executed in this case silence the
3089 spurious warnings it may provoke. */
3090 TREE_NO_WARNING (vtbl
) = 1;
3092 /* Finally, extract the function pointer from the vtable. */
3093 e2
= fold_build2_loc (input_location
,
3094 POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
,
3095 fold_convert (sizetype
, idx
));
3096 e2
= cp_build_indirect_ref (e2
, RO_NULL
, tf_warning_or_error
);
3097 TREE_CONSTANT (e2
) = 1;
3099 /* When using function descriptors, the address of the
3100 vtable entry is treated as a function pointer. */
3101 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3102 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3103 cp_build_addr_expr (e2
, tf_warning_or_error
));
3105 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3106 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
3108 /* Make sure this doesn't get evaluated first inside one of the
3109 branches of the COND_EXPR. */
3110 if (instance_save_expr
)
3111 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3112 instance_save_expr
, e1
);
3119 /* Used by the C-common bits. */
3121 build_function_call (location_t loc ATTRIBUTE_UNUSED
,
3122 tree function
, tree params
)
3124 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3127 /* Used by the C-common bits. */
3129 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED
,
3130 tree function
, VEC(tree
,gc
) *params
,
3131 VEC(tree
,gc
) *origtypes ATTRIBUTE_UNUSED
)
3133 VEC(tree
,gc
) *orig_params
= params
;
3134 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3135 tf_warning_or_error
);
3137 /* cp_build_function_call_vec can reallocate PARAMS by adding
3138 default arguments. That should never happen here. Verify
3140 gcc_assert (params
== orig_params
);
3145 /* Build a function call using a tree list of arguments. */
3148 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3153 vec
= make_tree_vector ();
3154 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3155 VEC_safe_push (tree
, gc
, vec
, TREE_VALUE (params
));
3156 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3157 release_tree_vector (vec
);
3161 /* Build a function call using varargs. */
3164 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3170 vec
= make_tree_vector ();
3171 va_start (args
, complain
);
3172 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3173 VEC_safe_push (tree
, gc
, vec
, t
);
3175 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3176 release_tree_vector (vec
);
3180 /* Build a function call using a vector of arguments. PARAMS may be
3181 NULL if there are no parameters. This changes the contents of
3185 cp_build_function_call_vec (tree function
, VEC(tree
,gc
) **params
,
3186 tsubst_flags_t complain
)
3188 tree fntype
, fndecl
;
3190 tree original
= function
;
3194 VEC(tree
,gc
) *allocated
= NULL
;
3197 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3198 expressions, like those used for ObjC messenger dispatches. */
3199 if (params
!= NULL
&& !VEC_empty (tree
, *params
))
3200 function
= objc_rewrite_function_call (function
,
3201 VEC_index (tree
, *params
, 0));
3203 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3204 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3205 if (TREE_CODE (function
) == NOP_EXPR
3206 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3207 function
= TREE_OPERAND (function
, 0);
3209 if (TREE_CODE (function
) == FUNCTION_DECL
)
3211 mark_used (function
);
3214 /* Convert anything with function type to a pointer-to-function. */
3215 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
3216 pedwarn (input_location
, OPT_pedantic
,
3217 "ISO C++ forbids calling %<::main%> from within program");
3219 function
= build_addr_func (function
);
3225 function
= build_addr_func (function
);
3228 if (function
== error_mark_node
)
3229 return error_mark_node
;
3231 fntype
= TREE_TYPE (function
);
3233 if (TYPE_PTRMEMFUNC_P (fntype
))
3235 if (complain
& tf_error
)
3236 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3237 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3238 original
, original
);
3239 return error_mark_node
;
3242 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
3243 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3245 if (!((TREE_CODE (fntype
) == POINTER_TYPE
3246 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
3248 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3250 if (complain
& tf_error
)
3251 error ("%qE cannot be used as a function", original
);
3252 return error_mark_node
;
3255 /* fntype now gets the type of function pointed to. */
3256 fntype
= TREE_TYPE (fntype
);
3257 parm_types
= TYPE_ARG_TYPES (fntype
);
3261 allocated
= make_tree_vector ();
3262 params
= &allocated
;
3265 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3268 return error_mark_node
;
3270 argarray
= VEC_address (tree
, *params
);
3272 /* Check for errors in format strings and inappropriately
3274 check_function_arguments (fntype
, nargs
, argarray
);
3276 ret
= build_cxx_call (function
, nargs
, argarray
);
3278 if (allocated
!= NULL
)
3279 release_tree_vector (allocated
);
3284 /* Subroutine of convert_arguments.
3285 Warn about wrong number of args are genereted. */
3288 warn_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3292 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3294 if (DECL_NAME (fndecl
) == NULL_TREE
3295 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3298 ? G_("too many arguments to constructor %q#D")
3299 : G_("too few arguments to constructor %q#D"),
3304 ? G_("too many arguments to member function %q#D")
3305 : G_("too few arguments to member function %q#D"),
3311 ? G_("too many arguments to function %q#D")
3312 : G_("too few arguments to function %q#D"),
3314 inform (DECL_SOURCE_LOCATION (fndecl
),
3319 if (c_dialect_objc () && objc_message_selector ())
3322 ? G_("too many arguments to method %q#D")
3323 : G_("too few arguments to method %q#D"),
3324 objc_message_selector ());
3326 error_at (loc
, too_many_p
? G_("too many arguments to function")
3327 : G_("too few arguments to function"));
3331 /* Convert the actual parameter expressions in the list VALUES to the
3332 types in the list TYPELIST. The converted expressions are stored
3333 back in the VALUES vector.
3334 If parmdecls is exhausted, or when an element has NULL as its type,
3335 perform the default conversions.
3337 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3339 This is also where warnings about wrong number of args are generated.
3341 Returns the actual number of arguments processed (which might be less
3342 than the length of the vector), or -1 on error.
3344 In C++, unspecified trailing parameters can be filled in with their
3345 default arguments, if such were specified. Do so here. */
3348 convert_arguments (tree typelist
, VEC(tree
,gc
) **values
, tree fndecl
,
3349 int flags
, tsubst_flags_t complain
)
3354 /* Argument passing is always copy-initialization. */
3355 flags
|= LOOKUP_ONLYCONVERTING
;
3357 for (i
= 0, typetail
= typelist
;
3358 i
< VEC_length (tree
, *values
);
3361 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3362 tree val
= VEC_index (tree
, *values
, i
);
3364 if (val
== error_mark_node
|| type
== error_mark_node
)
3367 if (type
== void_type_node
)
3369 if (complain
& tf_error
)
3371 warn_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3378 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3379 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3380 if (TREE_CODE (val
) == NOP_EXPR
3381 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3382 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3383 val
= TREE_OPERAND (val
, 0);
3385 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3387 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3388 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3389 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3390 val
= decay_conversion (val
);
3393 if (val
== error_mark_node
)
3398 /* Formal parm type is specified by a function prototype. */
3401 if (!COMPLETE_TYPE_P (complete_type (type
)))
3403 if (complain
& tf_error
)
3406 error ("parameter %P of %qD has incomplete type %qT",
3409 error ("parameter %P has incomplete type %qT", i
, type
);
3411 parmval
= error_mark_node
;
3415 parmval
= convert_for_initialization
3416 (NULL_TREE
, type
, val
, flags
,
3417 ICR_ARGPASS
, fndecl
, i
, complain
);
3418 parmval
= convert_for_arg_passing (type
, parmval
);
3421 if (parmval
== error_mark_node
)
3424 VEC_replace (tree
, *values
, i
, parmval
);
3428 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3429 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3430 /* Don't do ellipsis conversion for __built_in_constant_p
3431 as this will result in spurious errors for non-trivial
3433 val
= require_complete_type_sfinae (val
, complain
);
3435 val
= convert_arg_to_ellipsis (val
);
3437 VEC_replace (tree
, *values
, i
, val
);
3441 typetail
= TREE_CHAIN (typetail
);
3444 if (typetail
!= 0 && typetail
!= void_list_node
)
3446 /* See if there are default arguments that can be used. Because
3447 we hold default arguments in the FUNCTION_TYPE (which is so
3448 wrong), we can see default parameters here from deduced
3449 contexts (and via typeof) for indirect function calls.
3450 Fortunately we know whether we have a function decl to
3451 provide default arguments in a language conformant
3453 if (fndecl
&& TREE_PURPOSE (typetail
)
3454 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3456 for (; typetail
!= void_list_node
; ++i
)
3459 = convert_default_arg (TREE_VALUE (typetail
),
3460 TREE_PURPOSE (typetail
),
3463 if (parmval
== error_mark_node
)
3466 VEC_safe_push (tree
, gc
, *values
, parmval
);
3467 typetail
= TREE_CHAIN (typetail
);
3468 /* ends with `...'. */
3469 if (typetail
== NULL_TREE
)
3475 if (complain
& tf_error
)
3476 warn_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3484 /* Build a binary-operation expression, after performing default
3485 conversions on the operands. CODE is the kind of expression to
3486 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3487 are the tree codes which correspond to ARG1 and ARG2 when issuing
3488 warnings about possibly misplaced parentheses. They may differ
3489 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3490 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3491 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3492 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3493 ARG2_CODE as ERROR_MARK. */
3496 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3497 tree arg2
, enum tree_code arg2_code
, bool *overloaded_p
,
3498 tsubst_flags_t complain
)
3507 if (processing_template_decl
)
3509 if (type_dependent_expression_p (arg1
)
3510 || type_dependent_expression_p (arg2
))
3511 return build_min_nt (code
, arg1
, arg2
);
3512 arg1
= build_non_dependent_expr (arg1
);
3513 arg2
= build_non_dependent_expr (arg2
);
3516 if (code
== DOTSTAR_EXPR
)
3517 expr
= build_m_component_ref (arg1
, arg2
);
3519 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3520 overloaded_p
, complain
);
3522 /* Check for cases such as x+y<<z which users are likely to
3523 misinterpret. But don't warn about obj << x + y, since that is a
3524 common idiom for I/O. */
3525 if (warn_parentheses
3526 && (complain
& tf_warning
)
3527 && !processing_template_decl
3528 && !error_operand_p (arg1
)
3529 && !error_operand_p (arg2
)
3530 && (code
!= LSHIFT_EXPR
3531 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3532 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3534 if (processing_template_decl
&& expr
!= error_mark_node
)
3535 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3540 /* Build and return an ARRAY_REF expression. */
3543 build_x_array_ref (tree arg1
, tree arg2
, tsubst_flags_t complain
)
3545 tree orig_arg1
= arg1
;
3546 tree orig_arg2
= arg2
;
3549 if (processing_template_decl
)
3551 if (type_dependent_expression_p (arg1
)
3552 || type_dependent_expression_p (arg2
))
3553 return build_min_nt (ARRAY_REF
, arg1
, arg2
,
3554 NULL_TREE
, NULL_TREE
);
3555 arg1
= build_non_dependent_expr (arg1
);
3556 arg2
= build_non_dependent_expr (arg2
);
3559 expr
= build_new_op (ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3560 /*overloaded_p=*/NULL
, complain
);
3562 if (processing_template_decl
&& expr
!= error_mark_node
)
3563 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3564 NULL_TREE
, NULL_TREE
);
3568 /* For the c-common bits. */
3570 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3571 int convert_p ATTRIBUTE_UNUSED
)
3573 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3577 /* Build a binary-operation expression without default conversions.
3578 CODE is the kind of expression to build.
3579 LOCATION is the location_t of the operator in the source code.
3580 This function differs from `build' in several ways:
3581 the data type of the result is computed and recorded in it,
3582 warnings are generated if arg data types are invalid,
3583 special handling for addition and subtraction of pointers is known,
3584 and some optimization is done (operations on narrow ints
3585 are done in the narrower type when that gives the same result).
3586 Constant folding is also done before the result is returned.
3588 Note that the operands will never have enumeral types
3589 because either they have just had the default conversions performed
3590 or they have both just been converted to some other type in which
3591 the arithmetic is to be done.
3593 C++: must do special pointer arithmetic when implementing
3594 multiple inheritance, and deal with pointer to member functions. */
3597 cp_build_binary_op (location_t location
,
3598 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3599 tsubst_flags_t complain
)
3602 enum tree_code code0
, code1
;
3604 const char *invalid_op_diag
;
3606 /* Expression code to give to the expression when it is built.
3607 Normally this is CODE, which is what the caller asked for,
3608 but in some special cases we change it. */
3609 enum tree_code resultcode
= code
;
3611 /* Data type in which the computation is to be performed.
3612 In the simplest cases this is the common type of the arguments. */
3613 tree result_type
= NULL
;
3615 /* Nonzero means operands have already been type-converted
3616 in whatever way is necessary.
3617 Zero means they need to be converted to RESULT_TYPE. */
3620 /* Nonzero means create the expression with this type, rather than
3622 tree build_type
= 0;
3624 /* Nonzero means after finally constructing the expression
3625 convert it to this type. */
3626 tree final_type
= 0;
3630 /* Nonzero if this is an operation like MIN or MAX which can
3631 safely be computed in short if both args are promoted shorts.
3632 Also implies COMMON.
3633 -1 indicates a bitwise operation; this makes a difference
3634 in the exact conditions for when it is safe to do the operation
3635 in a narrower mode. */
3638 /* Nonzero if this is a comparison operation;
3639 if both args are promoted shorts, compare the original shorts.
3640 Also implies COMMON. */
3641 int short_compare
= 0;
3643 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3646 /* True if both operands have arithmetic type. */
3647 bool arithmetic_types_p
;
3649 /* Apply default conversions. */
3653 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3654 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3655 || code
== TRUTH_XOR_EXPR
)
3657 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
3658 op0
= decay_conversion (op0
);
3659 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
3660 op1
= decay_conversion (op1
);
3664 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
3665 op0
= default_conversion (op0
);
3666 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
3667 op1
= default_conversion (op1
);
3670 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3671 STRIP_TYPE_NOPS (op0
);
3672 STRIP_TYPE_NOPS (op1
);
3674 /* DTRT if one side is an overloaded function, but complain about it. */
3675 if (type_unknown_p (op0
))
3677 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3678 if (t
!= error_mark_node
)
3680 if (complain
& tf_error
)
3681 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3686 if (type_unknown_p (op1
))
3688 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3689 if (t
!= error_mark_node
)
3691 if (complain
& tf_error
)
3692 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3698 type0
= TREE_TYPE (op0
);
3699 type1
= TREE_TYPE (op1
);
3701 /* The expression codes of the data types of the arguments tell us
3702 whether the arguments are integers, floating, pointers, etc. */
3703 code0
= TREE_CODE (type0
);
3704 code1
= TREE_CODE (type1
);
3706 /* If an error was already reported for one of the arguments,
3707 avoid reporting another error. */
3708 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3709 return error_mark_node
;
3711 if ((invalid_op_diag
3712 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3714 error (invalid_op_diag
);
3715 return error_mark_node
;
3718 /* Issue warnings about peculiar, but valid, uses of NULL. */
3719 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3720 /* It's reasonable to use pointer values as operands of &&
3721 and ||, so NULL is no exception. */
3722 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3723 && ( /* Both are NULL (or 0) and the operation was not a
3724 comparison or a pointer subtraction. */
3725 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3726 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
3727 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3728 || (!null_ptr_cst_p (orig_op0
)
3729 && !TYPE_PTR_P (type0
) && !TYPE_PTR_TO_MEMBER_P (type0
))
3730 || (!null_ptr_cst_p (orig_op1
)
3731 && !TYPE_PTR_P (type1
) && !TYPE_PTR_TO_MEMBER_P (type1
)))
3732 && (complain
& tf_warning
))
3733 /* Some sort of arithmetic operation involving NULL was
3735 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3740 /* Subtraction of two similar pointers.
3741 We must subtract them as integers, then divide by object size. */
3742 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3743 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3745 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3746 /* In all other cases except pointer - int, the usual arithmetic
3748 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3753 /* The pointer - int case is just like pointer + int; fall
3756 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3757 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3761 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3762 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3763 if (processing_template_decl
)
3765 result_type
= TREE_TYPE (ptr_operand
);
3768 return cp_pointer_int_sum (code
,
3779 case TRUNC_DIV_EXPR
:
3781 case FLOOR_DIV_EXPR
:
3782 case ROUND_DIV_EXPR
:
3783 case EXACT_DIV_EXPR
:
3784 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3785 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3786 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3787 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3789 enum tree_code tcode0
= code0
, tcode1
= code1
;
3791 warn_for_div_by_zero (location
, op1
);
3793 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3794 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3795 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3796 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3798 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3799 resultcode
= RDIV_EXPR
;
3801 /* When dividing two signed integers, we have to promote to int.
3802 unless we divide by a constant != -1. Note that default
3803 conversion will have been performed on the operands at this
3804 point, so we have to dig out the original type to find out if
3806 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3807 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3808 || (TREE_CODE (op1
) == INTEGER_CST
3809 && ! integer_all_onesp (op1
)));
3818 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3819 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3820 && !VECTOR_FLOAT_TYPE_P (type0
)
3821 && !VECTOR_FLOAT_TYPE_P (type1
)))
3825 case TRUNC_MOD_EXPR
:
3826 case FLOOR_MOD_EXPR
:
3827 warn_for_div_by_zero (location
, op1
);
3829 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3830 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
3831 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
3833 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3835 /* Although it would be tempting to shorten always here, that loses
3836 on some targets, since the modulo instruction is undefined if the
3837 quotient can't be represented in the computation mode. We shorten
3838 only if unsigned or if dividing by something we know != -1. */
3839 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3840 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3841 || (TREE_CODE (op1
) == INTEGER_CST
3842 && ! integer_all_onesp (op1
)));
3847 case TRUTH_ANDIF_EXPR
:
3848 case TRUTH_ORIF_EXPR
:
3849 case TRUTH_AND_EXPR
:
3851 result_type
= boolean_type_node
;
3854 /* Shift operations: result has same type as first operand;
3855 always convert second operand to int.
3856 Also set SHORT_SHIFT if shifting rightward. */
3859 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3861 result_type
= type0
;
3862 if (TREE_CODE (op1
) == INTEGER_CST
)
3864 if (tree_int_cst_lt (op1
, integer_zero_node
))
3866 if ((complain
& tf_warning
)
3867 && c_inhibit_evaluation_warnings
== 0)
3868 warning (0, "right shift count is negative");
3872 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3873 && (complain
& tf_warning
)
3874 && c_inhibit_evaluation_warnings
== 0)
3875 warning (0, "right shift count >= width of type");
3878 /* Convert the shift-count to an integer, regardless of
3879 size of value being shifted. */
3880 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3881 op1
= cp_convert (integer_type_node
, op1
);
3882 /* Avoid converting op1 to result_type later. */
3888 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3890 result_type
= type0
;
3891 if (TREE_CODE (op1
) == INTEGER_CST
)
3893 if (tree_int_cst_lt (op1
, integer_zero_node
))
3895 if ((complain
& tf_warning
)
3896 && c_inhibit_evaluation_warnings
== 0)
3897 warning (0, "left shift count is negative");
3899 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3901 if ((complain
& tf_warning
)
3902 && c_inhibit_evaluation_warnings
== 0)
3903 warning (0, "left shift count >= width of type");
3906 /* Convert the shift-count to an integer, regardless of
3907 size of value being shifted. */
3908 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3909 op1
= cp_convert (integer_type_node
, op1
);
3910 /* Avoid converting op1 to result_type later. */
3917 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3919 result_type
= type0
;
3920 if (TREE_CODE (op1
) == INTEGER_CST
)
3922 if (tree_int_cst_lt (op1
, integer_zero_node
))
3924 if (complain
& tf_warning
)
3925 warning (0, (code
== LROTATE_EXPR
)
3926 ? G_("left rotate count is negative")
3927 : G_("right rotate count is negative"));
3929 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3931 if (complain
& tf_warning
)
3932 warning (0, (code
== LROTATE_EXPR
)
3933 ? G_("left rotate count >= width of type")
3934 : G_("right rotate count >= width of type"));
3937 /* Convert the shift-count to an integer, regardless of
3938 size of value being shifted. */
3939 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3940 op1
= cp_convert (integer_type_node
, op1
);
3946 if ((complain
& tf_warning
)
3947 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
3948 warning (OPT_Wfloat_equal
,
3949 "comparing floating point with == or != is unsafe");
3950 if ((complain
& tf_warning
)
3951 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
3952 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
3953 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
3955 build_type
= boolean_type_node
;
3956 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3957 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
3958 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3959 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
3961 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3962 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
3963 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3964 CPO_COMPARISON
, complain
);
3965 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
3966 && null_ptr_cst_p (op1
))
3968 if (TREE_CODE (op0
) == ADDR_EXPR
3969 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
3971 if (complain
& tf_warning
)
3972 warning (OPT_Waddress
, "the address of %qD will never be NULL",
3973 TREE_OPERAND (op0
, 0));
3975 result_type
= type0
;
3977 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
3978 && null_ptr_cst_p (op0
))
3980 if (TREE_CODE (op1
) == ADDR_EXPR
3981 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
3983 if (complain
& tf_warning
)
3984 warning (OPT_Waddress
, "the address of %qD will never be NULL",
3985 TREE_OPERAND (op1
, 0));
3987 result_type
= type1
;
3989 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
3990 /* One of the operands must be of nullptr_t type. */
3991 result_type
= TREE_TYPE (nullptr_node
);
3992 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3994 result_type
= type0
;
3995 if (complain
& tf_error
)
3996 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
3998 return error_mark_node
;
4000 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4002 result_type
= type1
;
4003 if (complain
& tf_error
)
4004 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4006 return error_mark_node
;
4008 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
4010 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4011 == ptrmemfunc_vbit_in_delta
)
4013 tree pfn0
= pfn_from_ptrmemfunc (op0
);
4014 tree delta0
= delta_from_ptrmemfunc (op0
);
4015 tree e1
= cp_build_binary_op (location
,
4018 build_zero_cst (TREE_TYPE (pfn0
)),
4020 tree e2
= cp_build_binary_op (location
,
4025 e2
= cp_build_binary_op (location
,
4026 EQ_EXPR
, e2
, integer_zero_node
,
4028 op0
= cp_build_binary_op (location
,
4029 TRUTH_ANDIF_EXPR
, e1
, e2
,
4031 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
4035 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4036 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
4038 result_type
= TREE_TYPE (op0
);
4040 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4041 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4042 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4045 /* E will be the final comparison. */
4047 /* E1 and E2 are for scratch. */
4055 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4056 CPO_COMPARISON
, complain
);
4058 if (!same_type_p (TREE_TYPE (op0
), type
))
4059 op0
= cp_convert_and_check (type
, op0
);
4060 if (!same_type_p (TREE_TYPE (op1
), type
))
4061 op1
= cp_convert_and_check (type
, op1
);
4063 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4064 return error_mark_node
;
4066 if (TREE_SIDE_EFFECTS (op0
))
4067 op0
= save_expr (op0
);
4068 if (TREE_SIDE_EFFECTS (op1
))
4069 op1
= save_expr (op1
);
4071 pfn0
= pfn_from_ptrmemfunc (op0
);
4072 pfn1
= pfn_from_ptrmemfunc (op1
);
4073 delta0
= delta_from_ptrmemfunc (op0
);
4074 delta1
= delta_from_ptrmemfunc (op1
);
4075 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4076 == ptrmemfunc_vbit_in_delta
)
4081 && ((op0.delta == op1.delta)
4082 || (!op0.pfn && op0.delta & 1 == 0
4083 && op1.delta & 1 == 0))
4085 The reason for the `!op0.pfn' bit is that a NULL
4086 pointer-to-member is any member with a zero PFN and
4087 LSB of the DELTA field is 0. */
4089 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4093 e1
= cp_build_binary_op (location
,
4094 EQ_EXPR
, e1
, integer_zero_node
,
4096 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4100 e2
= cp_build_binary_op (location
,
4101 EQ_EXPR
, e2
, integer_zero_node
,
4103 e1
= cp_build_binary_op (location
,
4104 TRUTH_ANDIF_EXPR
, e2
, e1
,
4106 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4108 build_zero_cst (TREE_TYPE (pfn0
)),
4110 e2
= cp_build_binary_op (location
,
4111 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4112 e1
= cp_build_binary_op (location
,
4113 EQ_EXPR
, delta0
, delta1
, complain
);
4114 e1
= cp_build_binary_op (location
,
4115 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4122 && (!op0.pfn || op0.delta == op1.delta))
4124 The reason for the `!op0.pfn' bit is that a NULL
4125 pointer-to-member is any member with a zero PFN; the
4126 DELTA field is unspecified. */
4128 e1
= cp_build_binary_op (location
,
4129 EQ_EXPR
, delta0
, delta1
, complain
);
4130 e2
= cp_build_binary_op (location
,
4133 build_zero_cst (TREE_TYPE (pfn0
)),
4135 e1
= cp_build_binary_op (location
,
4136 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4138 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4139 e
= cp_build_binary_op (location
,
4140 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4141 if (code
== EQ_EXPR
)
4143 return cp_build_binary_op (location
,
4144 EQ_EXPR
, e
, integer_zero_node
, complain
);
4148 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4149 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4151 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4152 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4160 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4161 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4163 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4164 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4165 CPO_COMPARISON
, complain
);
4172 if (TREE_CODE (orig_op0
) == STRING_CST
4173 || TREE_CODE (orig_op1
) == STRING_CST
)
4175 if (complain
& tf_warning
)
4176 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4179 build_type
= boolean_type_node
;
4180 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4181 || code0
== ENUMERAL_TYPE
)
4182 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4183 || code1
== ENUMERAL_TYPE
))
4185 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4186 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4187 CPO_COMPARISON
, complain
);
4188 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4189 result_type
= type0
;
4190 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4191 result_type
= type1
;
4192 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4193 /* One of the operands must be of nullptr_t type. */
4194 result_type
= TREE_TYPE (nullptr_node
);
4195 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4197 result_type
= type0
;
4198 if (complain
& tf_error
)
4199 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4201 return error_mark_node
;
4203 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4205 result_type
= type1
;
4206 if (complain
& tf_error
)
4207 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4209 return error_mark_node
;
4213 case UNORDERED_EXPR
:
4220 build_type
= integer_type_node
;
4221 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4223 if (complain
& tf_error
)
4224 error ("unordered comparison on non-floating point argument");
4225 return error_mark_node
;
4234 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4235 || code0
== ENUMERAL_TYPE
)
4236 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4237 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4238 arithmetic_types_p
= 1;
4241 arithmetic_types_p
= 0;
4242 /* Vector arithmetic is only allowed when both sides are vectors. */
4243 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4245 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4246 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4249 binary_op_error (location
, code
, type0
, type1
);
4250 return error_mark_node
;
4252 arithmetic_types_p
= 1;
4255 /* Determine the RESULT_TYPE, if it is not already known. */
4257 && arithmetic_types_p
4258 && (shorten
|| common
|| short_compare
))
4260 result_type
= cp_common_type (type0
, type1
);
4261 do_warn_double_promotion (result_type
, type0
, type1
,
4262 "implicit conversion from %qT to %qT "
4263 "to match other operand of binary "
4270 if (complain
& tf_error
)
4271 error ("invalid operands of types %qT and %qT to binary %qO",
4272 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4273 return error_mark_node
;
4276 /* If we're in a template, the only thing we need to know is the
4278 if (processing_template_decl
)
4280 /* Since the middle-end checks the type when doing a build2, we
4281 need to build the tree in pieces. This built tree will never
4282 get out of the front-end as we replace it when instantiating
4284 tree tmp
= build2 (resultcode
,
4285 build_type
? build_type
: result_type
,
4287 TREE_OPERAND (tmp
, 0) = op0
;
4291 if (arithmetic_types_p
)
4293 bool first_complex
= (code0
== COMPLEX_TYPE
);
4294 bool second_complex
= (code1
== COMPLEX_TYPE
);
4295 int none_complex
= (!first_complex
&& !second_complex
);
4297 /* Adapted from patch for c/24581. */
4298 if (first_complex
!= second_complex
4299 && (code
== PLUS_EXPR
4300 || code
== MINUS_EXPR
4301 || code
== MULT_EXPR
4302 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4303 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4304 && flag_signed_zeros
)
4306 /* An operation on mixed real/complex operands must be
4307 handled specially, but the language-independent code can
4308 more easily optimize the plain complex arithmetic if
4309 -fno-signed-zeros. */
4310 tree real_type
= TREE_TYPE (result_type
);
4314 if (TREE_TYPE (op0
) != result_type
)
4315 op0
= cp_convert_and_check (result_type
, op0
);
4316 if (TREE_TYPE (op1
) != real_type
)
4317 op1
= cp_convert_and_check (real_type
, op1
);
4321 if (TREE_TYPE (op0
) != real_type
)
4322 op0
= cp_convert_and_check (real_type
, op0
);
4323 if (TREE_TYPE (op1
) != result_type
)
4324 op1
= cp_convert_and_check (result_type
, op1
);
4326 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4327 return error_mark_node
;
4330 op0
= save_expr (op0
);
4331 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4332 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4336 case TRUNC_DIV_EXPR
:
4337 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4341 real
= build2 (resultcode
, real_type
, real
, op1
);
4349 op1
= save_expr (op1
);
4350 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4351 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4355 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4358 real
= build2 (resultcode
, real_type
, op0
, real
);
4361 real
= build2 (resultcode
, real_type
, op0
, real
);
4362 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4368 real
= fold_if_not_in_template (real
);
4369 imag
= fold_if_not_in_template (imag
);
4370 result
= build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4371 result
= fold_if_not_in_template (result
);
4375 /* For certain operations (which identify themselves by shorten != 0)
4376 if both args were extended from the same smaller type,
4377 do the arithmetic in that type and then extend.
4379 shorten !=0 and !=1 indicates a bitwise operation.
4380 For them, this optimization is safe only if
4381 both args are zero-extended or both are sign-extended.
4382 Otherwise, we might change the result.
4383 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4384 but calculated in (unsigned short) it would be (unsigned short)-1. */
4386 if (shorten
&& none_complex
)
4388 final_type
= result_type
;
4389 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4393 /* Comparison operations are shortened too but differently.
4394 They identify themselves by setting short_compare = 1. */
4398 /* Don't write &op0, etc., because that would prevent op0
4399 from being kept in a register.
4400 Instead, make copies of the our local variables and
4401 pass the copies by reference, then copy them back afterward. */
4402 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4403 enum tree_code xresultcode
= resultcode
;
4405 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4407 return cp_convert (boolean_type_node
, val
);
4408 op0
= xop0
, op1
= xop1
;
4410 resultcode
= xresultcode
;
4413 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4414 && warn_sign_compare
4415 && !TREE_NO_WARNING (orig_op0
)
4416 && !TREE_NO_WARNING (orig_op1
)
4417 /* Do not warn until the template is instantiated; we cannot
4418 bound the ranges of the arguments until that point. */
4419 && !processing_template_decl
4420 && (complain
& tf_warning
)
4421 && c_inhibit_evaluation_warnings
== 0)
4423 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4424 result_type
, resultcode
);
4428 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4429 Then the expression will be built.
4430 It will be given type FINAL_TYPE if that is nonzero;
4431 otherwise, it will be given type RESULT_TYPE. */
4434 if (TREE_TYPE (op0
) != result_type
)
4435 op0
= cp_convert_and_check (result_type
, op0
);
4436 if (TREE_TYPE (op1
) != result_type
)
4437 op1
= cp_convert_and_check (result_type
, op1
);
4439 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4440 return error_mark_node
;
4443 if (build_type
== NULL_TREE
)
4444 build_type
= result_type
;
4446 result
= build2 (resultcode
, build_type
, op0
, op1
);
4447 result
= fold_if_not_in_template (result
);
4448 if (final_type
!= 0)
4449 result
= cp_convert (final_type
, result
);
4451 if (TREE_OVERFLOW_P (result
)
4452 && !TREE_OVERFLOW_P (op0
)
4453 && !TREE_OVERFLOW_P (op1
))
4454 overflow_warning (location
, result
);
4459 /* Return a tree for the sum or difference (RESULTCODE says which)
4460 of pointer PTROP and integer INTOP. */
4463 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4465 tree res_type
= TREE_TYPE (ptrop
);
4467 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4468 in certain circumstance (when it's valid to do so). So we need
4469 to make sure it's complete. We don't need to check here, if we
4470 can actually complete it at all, as those checks will be done in
4471 pointer_int_sum() anyway. */
4472 complete_type (TREE_TYPE (res_type
));
4474 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4475 fold_if_not_in_template (intop
));
4478 /* Return a tree for the difference of pointers OP0 and OP1.
4479 The resulting tree has type int. */
4482 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4485 tree restype
= ptrdiff_type_node
;
4486 tree target_type
= TREE_TYPE (ptrtype
);
4488 if (!complete_type_or_else (target_type
, NULL_TREE
))
4489 return error_mark_node
;
4491 if (TREE_CODE (target_type
) == VOID_TYPE
)
4492 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4493 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4494 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4495 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4496 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4498 /* First do the subtraction as integers;
4499 then drop through to build the divide operator. */
4501 op0
= cp_build_binary_op (input_location
,
4503 cp_convert (restype
, op0
),
4504 cp_convert (restype
, op1
),
4505 tf_warning_or_error
);
4507 /* This generates an error if op1 is a pointer to an incomplete type. */
4508 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4509 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4511 op1
= (TYPE_PTROB_P (ptrtype
)
4512 ? size_in_bytes (target_type
)
4513 : integer_one_node
);
4515 /* Do the division. */
4517 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4518 return fold_if_not_in_template (result
);
4521 /* Construct and perhaps optimize a tree representation
4522 for a unary operation. CODE, a tree_code, specifies the operation
4523 and XARG is the operand. */
4526 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4528 tree orig_expr
= xarg
;
4532 if (processing_template_decl
)
4534 if (type_dependent_expression_p (xarg
))
4535 return build_min_nt (code
, xarg
, NULL_TREE
);
4537 xarg
= build_non_dependent_expr (xarg
);
4542 /* [expr.unary.op] says:
4544 The address of an object of incomplete type can be taken.
4546 (And is just the ordinary address operator, not an overloaded
4547 "operator &".) However, if the type is a template
4548 specialization, we must complete the type at this point so that
4549 an overloaded "operator &" will be available if required. */
4550 if (code
== ADDR_EXPR
4551 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4552 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4553 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4554 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4555 /* Don't look for a function. */;
4557 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4558 /*overloaded_p=*/NULL
, complain
);
4559 if (!exp
&& code
== ADDR_EXPR
)
4561 if (is_overloaded_fn (xarg
))
4563 tree fn
= get_first_fn (xarg
);
4564 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4566 error (DECL_CONSTRUCTOR_P (fn
)
4567 ? G_("taking address of constructor %qE")
4568 : G_("taking address of destructor %qE"),
4570 return error_mark_node
;
4574 /* A pointer to member-function can be formed only by saying
4576 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4577 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4579 if (TREE_CODE (xarg
) != OFFSET_REF
4580 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4582 error ("invalid use of %qE to form a pointer-to-member-function",
4584 if (TREE_CODE (xarg
) != OFFSET_REF
)
4585 inform (input_location
, " a qualified-id is required");
4586 return error_mark_node
;
4590 error ("parentheses around %qE cannot be used to form a"
4591 " pointer-to-member-function",
4593 PTRMEM_OK_P (xarg
) = 1;
4597 if (TREE_CODE (xarg
) == OFFSET_REF
)
4599 ptrmem
= PTRMEM_OK_P (xarg
);
4601 if (!ptrmem
&& !flag_ms_extensions
4602 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4604 /* A single non-static member, make sure we don't allow a
4605 pointer-to-member. */
4606 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4607 TREE_OPERAND (xarg
, 0),
4608 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4609 PTRMEM_OK_P (xarg
) = ptrmem
;
4613 exp
= cp_build_addr_expr_strict (xarg
, complain
);
4616 if (processing_template_decl
&& exp
!= error_mark_node
)
4617 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4618 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4619 if (TREE_CODE (exp
) == ADDR_EXPR
)
4620 PTRMEM_OK_P (exp
) = ptrmem
;
4624 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4625 constants, where a null value is represented by an INTEGER_CST of
4629 cp_truthvalue_conversion (tree expr
)
4631 tree type
= TREE_TYPE (expr
);
4632 if (TYPE_PTRMEM_P (type
))
4633 return build_binary_op (EXPR_LOCATION (expr
),
4634 NE_EXPR
, expr
, integer_zero_node
, 1);
4636 return c_common_truthvalue_conversion (input_location
, expr
);
4639 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4642 condition_conversion (tree expr
)
4645 if (processing_template_decl
)
4647 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4648 tf_warning_or_error
, LOOKUP_NORMAL
);
4649 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4653 /* Returns the address of T. This function will fold away
4654 ADDR_EXPR of INDIRECT_REF. */
4657 build_address (tree t
)
4659 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4660 return error_mark_node
;
4661 t
= build_fold_addr_expr (t
);
4662 if (TREE_CODE (t
) != ADDR_EXPR
)
4667 /* Returns the address of T with type TYPE. */
4670 build_typed_address (tree t
, tree type
)
4672 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4673 return error_mark_node
;
4674 t
= build_fold_addr_expr_with_type (t
, type
);
4675 if (TREE_CODE (t
) != ADDR_EXPR
)
4680 /* Return a NOP_EXPR converting EXPR to TYPE. */
4683 build_nop (tree type
, tree expr
)
4685 if (type
== error_mark_node
|| error_operand_p (expr
))
4687 return build1 (NOP_EXPR
, type
, expr
);
4690 /* Take the address of ARG, whatever that means under C++ semantics.
4691 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
4692 and class rvalues as well.
4694 Nothing should call this function directly; instead, callers should use
4695 cp_build_addr_expr or cp_build_addr_expr_strict. */
4698 cp_build_addr_expr_1 (tree arg
, bool strict_lvalue
, tsubst_flags_t complain
)
4703 if (!arg
|| error_operand_p (arg
))
4704 return error_mark_node
;
4706 arg
= mark_lvalue_use (arg
);
4707 argtype
= lvalue_type (arg
);
4709 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
4710 || !IDENTIFIER_OPNAME_P (arg
));
4712 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
4713 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
4715 /* They're trying to take the address of a unique non-static
4716 member function. This is ill-formed (except in MS-land),
4717 but let's try to DTRT.
4718 Note: We only handle unique functions here because we don't
4719 want to complain if there's a static overload; non-unique
4720 cases will be handled by instantiate_type. But we need to
4721 handle this case here to allow casts on the resulting PMF.
4722 We could defer this in non-MS mode, but it's easier to give
4723 a useful error here. */
4725 /* Inside constant member functions, the `this' pointer
4726 contains an extra const qualifier. TYPE_MAIN_VARIANT
4727 is used here to remove this const from the diagnostics
4728 and the created OFFSET_REF. */
4729 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
4730 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
4733 if (! flag_ms_extensions
)
4735 tree name
= DECL_NAME (fn
);
4736 if (!(complain
& tf_error
))
4737 return error_mark_node
;
4738 else if (current_class_type
4739 && TREE_OPERAND (arg
, 0) == current_class_ref
)
4740 /* An expression like &memfn. */
4741 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
4742 " or parenthesized non-static member function to form"
4743 " a pointer to member function. Say %<&%T::%D%>",
4746 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
4747 " function to form a pointer to member function."
4751 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
4754 /* Uninstantiated types are all functions. Taking the
4755 address of a function is a no-op, so just return the
4757 if (type_unknown_p (arg
))
4758 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4760 if (TREE_CODE (arg
) == OFFSET_REF
)
4761 /* We want a pointer to member; bypass all the code for actually taking
4762 the address of something. */
4765 /* Anything not already handled and not a true memory reference
4767 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4768 && TREE_CODE (argtype
) != METHOD_TYPE
)
4770 cp_lvalue_kind kind
= lvalue_kind (arg
);
4771 if (kind
== clk_none
)
4773 if (complain
& tf_error
)
4774 lvalue_error (input_location
, lv_addressof
);
4775 return error_mark_node
;
4777 if (strict_lvalue
&& (kind
& (clk_rvalueref
|clk_class
)))
4779 if (!(complain
& tf_error
))
4780 return error_mark_node
;
4781 if (kind
& clk_class
)
4782 /* Make this a permerror because we used to accept it. */
4783 permerror (input_location
, "taking address of temporary");
4785 error ("taking address of xvalue (rvalue reference)");
4789 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4791 tree type
= build_pointer_type (TREE_TYPE (argtype
));
4792 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4795 else if (pedantic
&& DECL_MAIN_P (arg
))
4798 /* Apparently a lot of autoconf scripts for C++ packages do this,
4799 so only complain if -pedantic. */
4800 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
4801 pedwarn (input_location
, OPT_pedantic
,
4802 "ISO C++ forbids taking address of function %<::main%>");
4803 else if (flag_pedantic_errors
)
4804 return error_mark_node
;
4807 /* Let &* cancel out to simplify resulting code. */
4808 if (TREE_CODE (arg
) == INDIRECT_REF
)
4810 /* We don't need to have `current_class_ptr' wrapped in a
4811 NON_LVALUE_EXPR node. */
4812 if (arg
== current_class_ref
)
4813 return current_class_ptr
;
4815 arg
= TREE_OPERAND (arg
, 0);
4816 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
4818 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
4819 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4822 /* Don't let this be an lvalue. */
4827 /* ??? Cope with user tricks that amount to offsetof. */
4828 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4829 && TREE_CODE (argtype
) != METHOD_TYPE
4830 && argtype
!= unknown_type_node
4831 && (val
= get_base_address (arg
))
4832 && COMPLETE_TYPE_P (TREE_TYPE (val
))
4833 && TREE_CODE (val
) == INDIRECT_REF
4834 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
4836 tree type
= build_pointer_type (argtype
);
4837 tree op0
= fold_convert (type
, TREE_OPERAND (val
, 0));
4838 tree op1
= fold_convert (sizetype
, fold_offsetof (arg
, val
));
4839 return fold_build2 (POINTER_PLUS_EXPR
, type
, op0
, op1
);
4842 /* Handle complex lvalues (when permitted)
4843 by reduction to simpler cases. */
4844 val
= unary_complex_lvalue (ADDR_EXPR
, arg
);
4848 switch (TREE_CODE (arg
))
4852 case FIX_TRUNC_EXPR
:
4853 /* Even if we're not being pedantic, we cannot allow this
4854 extension when we're instantiating in a SFINAE
4856 if (! lvalue_p (arg
) && complain
== tf_none
)
4858 if (complain
& tf_error
)
4859 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4861 return error_mark_node
;
4866 arg
= BASELINK_FUNCTIONS (arg
);
4870 arg
= OVL_CURRENT (arg
);
4875 /* Turn a reference to a non-static data member into a
4876 pointer-to-member. */
4881 gcc_assert (PTRMEM_OK_P (arg
));
4883 t
= TREE_OPERAND (arg
, 1);
4884 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
4886 if (complain
& tf_error
)
4887 error ("cannot create pointer to reference member %qD", t
);
4888 return error_mark_node
;
4891 type
= build_ptrmem_type (context_for_name_lookup (t
),
4893 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
4901 if (argtype
!= error_mark_node
)
4902 argtype
= build_pointer_type (argtype
);
4904 /* In a template, we are processing a non-dependent expression
4905 so we can just form an ADDR_EXPR with the correct type. */
4906 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
4908 val
= build_address (arg
);
4909 if (TREE_CODE (arg
) == OFFSET_REF
)
4910 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
4912 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
4914 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
4916 /* We can only get here with a single static member
4918 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4919 && DECL_STATIC_FUNCTION_P (fn
));
4921 val
= build_address (fn
);
4922 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
4923 /* Do not lose object's side effects. */
4924 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
4925 TREE_OPERAND (arg
, 0), val
);
4927 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
4929 if (complain
& tf_error
)
4930 error ("attempt to take address of bit-field structure member %qD",
4931 TREE_OPERAND (arg
, 1));
4932 return error_mark_node
;
4936 tree object
= TREE_OPERAND (arg
, 0);
4937 tree field
= TREE_OPERAND (arg
, 1);
4938 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4939 (TREE_TYPE (object
), decl_type_context (field
)));
4940 val
= build_address (arg
);
4943 if (TREE_CODE (argtype
) == POINTER_TYPE
4944 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
4946 build_ptrmemfunc_type (argtype
);
4947 val
= build_ptrmemfunc (argtype
, val
, 0,
4949 tf_warning_or_error
);
4955 /* Take the address of ARG if it has one, even if it's an rvalue. */
4958 cp_build_addr_expr (tree arg
, tsubst_flags_t complain
)
4960 return cp_build_addr_expr_1 (arg
, 0, complain
);
4963 /* Take the address of ARG, but only if it's an lvalue. */
4966 cp_build_addr_expr_strict (tree arg
, tsubst_flags_t complain
)
4968 return cp_build_addr_expr_1 (arg
, 1, complain
);
4971 /* C++: Must handle pointers to members.
4973 Perhaps type instantiation should be extended to handle conversion
4974 from aggregates to types we don't yet know we want? (Or are those
4975 cases typically errors which should be reported?)
4977 NOCONVERT nonzero suppresses the default promotions
4978 (such as from short to int). */
4981 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
4982 tsubst_flags_t complain
)
4984 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4987 const char *errstring
= NULL
;
4989 const char *invalid_op_diag
;
4991 if (!arg
|| error_operand_p (arg
))
4992 return error_mark_node
;
4994 if ((invalid_op_diag
4995 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
5000 error (invalid_op_diag
);
5001 return error_mark_node
;
5006 case UNARY_PLUS_EXPR
:
5009 int flags
= WANT_ARITH
| WANT_ENUM
;
5010 /* Unary plus (but not unary minus) is allowed on pointers. */
5011 if (code
== UNARY_PLUS_EXPR
)
5012 flags
|= WANT_POINTER
;
5013 arg
= build_expr_type_conversion (flags
, arg
, true);
5015 errstring
= (code
== NEGATE_EXPR
5016 ? _("wrong type argument to unary minus")
5017 : _("wrong type argument to unary plus"));
5020 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5021 arg
= perform_integral_promotions (arg
);
5023 /* Make sure the result is not an lvalue: a unary plus or minus
5024 expression is always a rvalue. */
5031 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5035 arg
= default_conversion (arg
);
5037 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
5038 | WANT_VECTOR_OR_COMPLEX
,
5040 errstring
= _("wrong type argument to bit-complement");
5041 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5042 arg
= perform_integral_promotions (arg
);
5046 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5047 errstring
= _("wrong type argument to abs");
5048 else if (!noconvert
)
5049 arg
= default_conversion (arg
);
5053 /* Conjugating a real value is a no-op, but allow it anyway. */
5054 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5055 errstring
= _("wrong type argument to conjugation");
5056 else if (!noconvert
)
5057 arg
= default_conversion (arg
);
5060 case TRUTH_NOT_EXPR
:
5061 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
5063 val
= invert_truthvalue_loc (input_location
, arg
);
5064 if (arg
!= error_mark_node
)
5066 errstring
= _("in argument to unary !");
5074 arg
= build_real_imag_expr (input_location
, code
, arg
);
5075 if (arg
== error_mark_node
)
5078 return fold_if_not_in_template (arg
);
5080 case PREINCREMENT_EXPR
:
5081 case POSTINCREMENT_EXPR
:
5082 case PREDECREMENT_EXPR
:
5083 case POSTDECREMENT_EXPR
:
5084 /* Handle complex lvalues (when permitted)
5085 by reduction to simpler cases. */
5087 val
= unary_complex_lvalue (code
, arg
);
5091 arg
= mark_lvalue_use (arg
);
5093 /* Increment or decrement the real part of the value,
5094 and don't change the imaginary part. */
5095 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5099 arg
= stabilize_reference (arg
);
5100 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
5101 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
5102 real
= cp_build_unary_op (code
, real
, 1, complain
);
5103 if (real
== error_mark_node
|| imag
== error_mark_node
)
5104 return error_mark_node
;
5105 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
5109 /* Report invalid types. */
5111 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
5114 if (code
== PREINCREMENT_EXPR
)
5115 errstring
= _("no pre-increment operator for type");
5116 else if (code
== POSTINCREMENT_EXPR
)
5117 errstring
= _("no post-increment operator for type");
5118 else if (code
== PREDECREMENT_EXPR
)
5119 errstring
= _("no pre-decrement operator for type");
5121 errstring
= _("no post-decrement operator for type");
5124 else if (arg
== error_mark_node
)
5125 return error_mark_node
;
5127 /* Report something read-only. */
5129 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
5130 || TREE_READONLY (arg
))
5132 if (complain
& tf_error
)
5133 cxx_readonly_error (arg
, ((code
== PREINCREMENT_EXPR
5134 || code
== POSTINCREMENT_EXPR
)
5135 ? lv_increment
: lv_decrement
));
5137 return error_mark_node
;
5142 tree declared_type
= unlowered_expr_type (arg
);
5144 argtype
= TREE_TYPE (arg
);
5146 /* ARM $5.2.5 last annotation says this should be forbidden. */
5147 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
5149 if (complain
& tf_error
)
5150 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
5151 ? G_("ISO C++ forbids incrementing an enum")
5152 : G_("ISO C++ forbids decrementing an enum"));
5154 return error_mark_node
;
5157 /* Compute the increment. */
5159 if (TREE_CODE (argtype
) == POINTER_TYPE
)
5161 tree type
= complete_type (TREE_TYPE (argtype
));
5163 if (!COMPLETE_OR_VOID_TYPE_P (type
))
5165 if (complain
& tf_error
)
5166 error (((code
== PREINCREMENT_EXPR
5167 || code
== POSTINCREMENT_EXPR
))
5168 ? G_("cannot increment a pointer to incomplete type %qT")
5169 : G_("cannot decrement a pointer to incomplete type %qT"),
5170 TREE_TYPE (argtype
));
5172 return error_mark_node
;
5174 else if ((pedantic
|| warn_pointer_arith
)
5175 && !TYPE_PTROB_P (argtype
))
5177 if (complain
& tf_error
)
5178 permerror (input_location
, (code
== PREINCREMENT_EXPR
5179 || code
== POSTINCREMENT_EXPR
)
5180 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
5181 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
5184 return error_mark_node
;
5187 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
5190 inc
= integer_one_node
;
5192 inc
= cp_convert (argtype
, inc
);
5194 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
5195 need to ask Objective-C to build the increment or decrement
5196 expression for it. */
5197 if (objc_is_property_ref (arg
))
5198 return objc_build_incr_expr_for_property_ref (input_location
, code
,
5201 /* Complain about anything else that is not a true lvalue. */
5202 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
5203 || code
== POSTINCREMENT_EXPR
)
5204 ? lv_increment
: lv_decrement
),
5206 return error_mark_node
;
5208 /* Forbid using -- on `bool'. */
5209 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
5211 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
5213 if (complain
& tf_error
)
5214 error ("invalid use of Boolean expression as operand "
5215 "to %<operator--%>");
5216 return error_mark_node
;
5218 val
= boolean_increment (code
, arg
);
5221 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
5223 TREE_SIDE_EFFECTS (val
) = 1;
5228 /* Note that this operation never does default_conversion
5229 regardless of NOCONVERT. */
5230 return cp_build_addr_expr (arg
, complain
);
5239 argtype
= TREE_TYPE (arg
);
5240 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5243 if (complain
& tf_error
)
5244 error ("%s", errstring
);
5245 return error_mark_node
;
5248 /* Hook for the c-common bits that build a unary op. */
5250 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5251 enum tree_code code
, tree xarg
, int noconvert
)
5253 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5256 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5257 for certain kinds of expressions which are not really lvalues
5258 but which we can accept as lvalues.
5260 If ARG is not a kind of expression we can handle, return
5264 unary_complex_lvalue (enum tree_code code
, tree arg
)
5266 /* Inside a template, making these kinds of adjustments is
5267 pointless; we are only concerned with the type of the
5269 if (processing_template_decl
)
5272 /* Handle (a, b) used as an "lvalue". */
5273 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5275 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5276 tf_warning_or_error
);
5277 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5278 TREE_OPERAND (arg
, 0), real_result
);
5281 /* Handle (a ? b : c) used as an "lvalue". */
5282 if (TREE_CODE (arg
) == COND_EXPR
5283 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5284 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5286 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5287 if (TREE_CODE (arg
) == MODIFY_EXPR
5288 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5289 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5291 tree lvalue
= TREE_OPERAND (arg
, 0);
5292 if (TREE_SIDE_EFFECTS (lvalue
))
5294 lvalue
= stabilize_reference (lvalue
);
5295 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5296 lvalue
, TREE_OPERAND (arg
, 1));
5298 return unary_complex_lvalue
5299 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5302 if (code
!= ADDR_EXPR
)
5305 /* Handle (a = b) used as an "lvalue" for `&'. */
5306 if (TREE_CODE (arg
) == MODIFY_EXPR
5307 || TREE_CODE (arg
) == INIT_EXPR
)
5309 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5310 tf_warning_or_error
);
5311 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5313 TREE_NO_WARNING (arg
) = 1;
5317 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5318 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5319 || TREE_CODE (arg
) == OFFSET_REF
)
5322 /* We permit compiler to make function calls returning
5323 objects of aggregate type look like lvalues. */
5327 if (TREE_CODE (targ
) == SAVE_EXPR
)
5328 targ
= TREE_OPERAND (targ
, 0);
5330 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5332 if (TREE_CODE (arg
) == SAVE_EXPR
)
5335 targ
= build_cplus_new (TREE_TYPE (arg
), arg
, tf_warning_or_error
);
5336 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5339 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5340 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5341 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5344 /* Don't let anything else be handled specially. */
5348 /* Mark EXP saying that we need to be able to take the
5349 address of it; it should not be allocated in a register.
5350 Value is true if successful.
5352 C++: we do not allow `current_class_ptr' to be addressable. */
5355 cxx_mark_addressable (tree exp
)
5360 switch (TREE_CODE (x
))
5367 x
= TREE_OPERAND (x
, 0);
5371 if (x
== current_class_ptr
)
5373 error ("cannot take the address of %<this%>, which is an rvalue expression");
5374 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5380 /* Caller should not be trying to mark initialized
5381 constant fields addressable. */
5382 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5383 || DECL_IN_AGGR_P (x
) == 0
5385 || DECL_EXTERNAL (x
));
5389 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5390 && !DECL_ARTIFICIAL (x
))
5392 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5395 ("address of explicit register variable %qD requested", x
);
5398 else if (extra_warnings
)
5400 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5402 TREE_ADDRESSABLE (x
) = 1;
5407 TREE_ADDRESSABLE (x
) = 1;
5411 TREE_ADDRESSABLE (x
) = 1;
5415 TREE_ADDRESSABLE (x
) = 1;
5416 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5424 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5427 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5428 tsubst_flags_t complain
)
5430 tree orig_ifexp
= ifexp
;
5431 tree orig_op1
= op1
;
5432 tree orig_op2
= op2
;
5435 if (processing_template_decl
)
5437 /* The standard says that the expression is type-dependent if
5438 IFEXP is type-dependent, even though the eventual type of the
5439 expression doesn't dependent on IFEXP. */
5440 if (type_dependent_expression_p (ifexp
)
5441 /* As a GNU extension, the middle operand may be omitted. */
5442 || (op1
&& type_dependent_expression_p (op1
))
5443 || type_dependent_expression_p (op2
))
5444 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5445 ifexp
= build_non_dependent_expr (ifexp
);
5447 op1
= build_non_dependent_expr (op1
);
5448 op2
= build_non_dependent_expr (op2
);
5451 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5452 if (processing_template_decl
&& expr
!= error_mark_node
)
5453 return build_min_non_dep (COND_EXPR
, expr
,
5454 orig_ifexp
, orig_op1
, orig_op2
);
5458 /* Given a list of expressions, return a compound expression
5459 that performs them all and returns the value of the last of them. */
5462 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
,
5463 tsubst_flags_t complain
)
5465 tree expr
= TREE_VALUE (list
);
5467 if (TREE_CHAIN (list
))
5469 if (complain
& tf_error
)
5473 permerror (input_location
, "expression list treated as compound "
5474 "expression in initializer");
5477 permerror (input_location
, "expression list treated as compound "
5478 "expression in mem-initializer");
5481 permerror (input_location
, "expression list treated as compound "
5482 "expression in functional cast");
5488 return error_mark_node
;
5490 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5491 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5498 /* Like build_x_compound_expr_from_list, but using a VEC. */
5501 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5503 if (VEC_empty (tree
, vec
))
5505 else if (VEC_length (tree
, vec
) == 1)
5506 return VEC_index (tree
, vec
, 0);
5514 permerror (input_location
,
5515 "%s expression list treated as compound expression",
5518 expr
= VEC_index (tree
, vec
, 0);
5519 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5520 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5526 /* Handle overloading of the ',' operator when needed. */
5529 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5532 tree orig_op1
= op1
;
5533 tree orig_op2
= op2
;
5535 if (processing_template_decl
)
5537 if (type_dependent_expression_p (op1
)
5538 || type_dependent_expression_p (op2
))
5539 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5540 op1
= build_non_dependent_expr (op1
);
5541 op2
= build_non_dependent_expr (op2
);
5544 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5545 /*overloaded_p=*/NULL
, complain
);
5547 result
= cp_build_compound_expr (op1
, op2
, complain
);
5549 if (processing_template_decl
&& result
!= error_mark_node
)
5550 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5555 /* Like cp_build_compound_expr, but for the c-common bits. */
5558 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5560 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5563 /* Build a compound expression. */
5566 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5568 lhs
= convert_to_void (lhs
, ICV_LEFT_OF_COMMA
, complain
);
5570 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5571 return error_mark_node
;
5573 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5575 /* If the rhs is a TARGET_EXPR, then build the compound
5576 expression inside the target_expr's initializer. This
5577 helps the compiler to eliminate unnecessary temporaries. */
5578 tree init
= TREE_OPERAND (rhs
, 1);
5580 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5581 TREE_OPERAND (rhs
, 1) = init
;
5586 if (type_unknown_p (rhs
))
5588 error ("no context to resolve type of %qE", rhs
);
5589 return error_mark_node
;
5592 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5595 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5596 casts away constness. CAST gives the type of cast. Returns true
5597 if the cast is ill-formed, false if it is well-formed.
5599 ??? This function warns for casting away any qualifier not just
5600 const. We would like to specify exactly what qualifiers are casted
5605 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5606 enum tree_code cast
, tsubst_flags_t complain
)
5608 /* C-style casts are allowed to cast away constness. With
5609 WARN_CAST_QUAL, we still want to issue a warning. */
5610 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5613 if (!casts_away_constness (src_type
, dest_type
))
5619 if (complain
& tf_warning
)
5620 warning (OPT_Wcast_qual
,
5621 "cast from type %qT to type %qT casts away qualifiers",
5622 src_type
, dest_type
);
5625 case STATIC_CAST_EXPR
:
5626 if (complain
& tf_error
)
5627 error ("static_cast from type %qT to type %qT casts away qualifiers",
5628 src_type
, dest_type
);
5631 case REINTERPRET_CAST_EXPR
:
5632 if (complain
& tf_error
)
5633 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5634 src_type
, dest_type
);
5642 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5643 (another pointer-to-member type in the same hierarchy) and return
5644 the converted expression. If ALLOW_INVERSE_P is permitted, a
5645 pointer-to-derived may be converted to pointer-to-base; otherwise,
5646 only the other direction is permitted. If C_CAST_P is true, this
5647 conversion is taking place as part of a C-style cast. */
5650 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5651 bool c_cast_p
, tsubst_flags_t complain
)
5653 if (TYPE_PTRMEM_P (type
))
5657 if (TREE_CODE (expr
) == PTRMEM_CST
)
5658 expr
= cplus_expand_constant (expr
);
5659 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5660 TYPE_PTRMEM_CLASS_TYPE (type
),
5662 c_cast_p
, complain
);
5663 if (delta
== error_mark_node
)
5664 return error_mark_node
;
5666 if (!integer_zerop (delta
))
5668 tree cond
, op1
, op2
;
5670 cond
= cp_build_binary_op (input_location
,
5673 build_int_cst (TREE_TYPE (expr
), -1),
5674 tf_warning_or_error
);
5675 op1
= build_nop (ptrdiff_type_node
, expr
);
5676 op2
= cp_build_binary_op (input_location
,
5677 PLUS_EXPR
, op1
, delta
,
5678 tf_warning_or_error
);
5680 expr
= fold_build3_loc (input_location
,
5681 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5685 return build_nop (type
, expr
);
5688 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5689 allow_inverse_p
, c_cast_p
, complain
);
5692 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5693 this static_cast is being attempted as one of the possible casts
5694 allowed by a C-style cast. (In that case, accessibility of base
5695 classes is not considered, and it is OK to cast away
5696 constness.) Return the result of the cast. *VALID_P is set to
5697 indicate whether or not the cast was valid. */
5700 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5701 bool *valid_p
, tsubst_flags_t complain
)
5706 /* Assume the cast is valid. */
5709 intype
= TREE_TYPE (expr
);
5711 /* Save casted types in the function's used types hash table. */
5712 used_types_insert (type
);
5714 /* [expr.static.cast]
5716 An lvalue of type "cv1 B", where B is a class type, can be cast
5717 to type "reference to cv2 D", where D is a class derived (clause
5718 _class.derived_) from B, if a valid standard conversion from
5719 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5720 same cv-qualification as, or greater cv-qualification than, cv1,
5721 and B is not a virtual base class of D. */
5722 /* We check this case before checking the validity of "TYPE t =
5723 EXPR;" below because for this case:
5726 struct D : public B { D(const B&); };
5728 void f() { static_cast<const D&>(b); }
5730 we want to avoid constructing a new D. The standard is not
5731 completely clear about this issue, but our interpretation is
5732 consistent with other compilers. */
5733 if (TREE_CODE (type
) == REFERENCE_TYPE
5734 && CLASS_TYPE_P (TREE_TYPE (type
))
5735 && CLASS_TYPE_P (intype
)
5736 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5737 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5738 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5739 build_pointer_type (TYPE_MAIN_VARIANT
5740 (TREE_TYPE (type
))))
5742 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5746 /* There is a standard conversion from "D*" to "B*" even if "B"
5747 is ambiguous or inaccessible. If this is really a
5748 static_cast, then we check both for inaccessibility and
5749 ambiguity. However, if this is a static_cast being performed
5750 because the user wrote a C-style cast, then accessibility is
5752 base
= lookup_base (TREE_TYPE (type
), intype
,
5753 c_cast_p
? ba_unique
: ba_check
,
5756 /* Convert from "B*" to "D*". This function will check that "B"
5757 is not a virtual base of "D". */
5758 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5759 base
, /*nonnull=*/false);
5760 /* Convert the pointer to a reference -- but then remember that
5761 there are no expressions with reference type in C++.
5763 We call rvalue so that there's an actual tree code
5764 (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
5765 is a variable with the same type, the conversion would get folded
5766 away, leaving just the variable and causing lvalue_kind to give
5767 the wrong answer. */
5768 return convert_from_reference (rvalue (cp_fold_convert (type
, expr
)));
5771 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5772 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5773 if (TREE_CODE (type
) == REFERENCE_TYPE
5774 && TYPE_REF_IS_RVALUE (type
)
5775 && real_lvalue_p (expr
)
5776 && reference_related_p (TREE_TYPE (type
), intype
)
5777 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5779 expr
= build_typed_address (expr
, type
);
5780 return convert_from_reference (expr
);
5783 /* Resolve overloaded address here rather than once in
5784 implicit_conversion and again in the inverse code below. */
5785 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5787 expr
= instantiate_type (type
, expr
, complain
);
5788 intype
= TREE_TYPE (expr
);
5791 /* [expr.static.cast]
5793 An expression e can be explicitly converted to a type T using a
5794 static_cast of the form static_cast<T>(e) if the declaration T
5795 t(e);" is well-formed, for some invented temporary variable
5797 result
= perform_direct_initialization_if_possible (type
, expr
,
5798 c_cast_p
, complain
);
5801 result
= convert_from_reference (result
);
5803 /* [expr.static.cast]
5805 If T is a reference type, the result is an lvalue; otherwise,
5806 the result is an rvalue. */
5807 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5808 result
= rvalue (result
);
5812 /* [expr.static.cast]
5814 Any expression can be explicitly converted to type cv void. */
5815 if (TREE_CODE (type
) == VOID_TYPE
)
5816 return convert_to_void (expr
, ICV_CAST
, complain
);
5818 /* [expr.static.cast]
5820 The inverse of any standard conversion sequence (clause _conv_),
5821 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5822 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5823 (_conv.bool_) conversions, can be performed explicitly using
5824 static_cast subject to the restriction that the explicit
5825 conversion does not cast away constness (_expr.const.cast_), and
5826 the following additional rules for specific cases: */
5827 /* For reference, the conversions not excluded are: integral
5828 promotions, floating point promotion, integral conversions,
5829 floating point conversions, floating-integral conversions,
5830 pointer conversions, and pointer to member conversions. */
5833 A value of integral _or enumeration_ type can be explicitly
5834 converted to an enumeration type. */
5835 /* The effect of all that is that any conversion between any two
5836 types which are integral, floating, or enumeration types can be
5838 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5839 || SCALAR_FLOAT_TYPE_P (type
))
5840 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5841 || SCALAR_FLOAT_TYPE_P (intype
)))
5842 return ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5844 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5845 && CLASS_TYPE_P (TREE_TYPE (type
))
5846 && CLASS_TYPE_P (TREE_TYPE (intype
))
5847 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5848 (TREE_TYPE (intype
))),
5849 build_pointer_type (TYPE_MAIN_VARIANT
5850 (TREE_TYPE (type
)))))
5855 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
5857 return error_mark_node
;
5858 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
5859 c_cast_p
? ba_unique
: ba_check
,
5861 expr
= build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
5862 return cp_fold_convert(type
, expr
);
5865 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5866 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5873 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
5874 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
5876 if (TYPE_PTRMEM_P (type
))
5878 t1
= (build_ptrmem_type
5880 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
5881 t2
= (build_ptrmem_type
5883 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
5890 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
5893 && check_for_casting_away_constness (intype
, type
,
5896 return error_mark_node
;
5897 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
5898 c_cast_p
, complain
);
5902 /* [expr.static.cast]
5904 An rvalue of type "pointer to cv void" can be explicitly
5905 converted to a pointer to object type. A value of type pointer
5906 to object converted to "pointer to cv void" and back to the
5907 original pointer type will have its original value. */
5908 if (TREE_CODE (intype
) == POINTER_TYPE
5909 && VOID_TYPE_P (TREE_TYPE (intype
))
5910 && TYPE_PTROB_P (type
))
5913 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
5915 return error_mark_node
;
5916 return build_nop (type
, expr
);
5920 return error_mark_node
;
5923 /* Return an expression representing static_cast<TYPE>(EXPR). */
5926 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5931 if (type
== error_mark_node
|| expr
== error_mark_node
)
5932 return error_mark_node
;
5934 if (processing_template_decl
)
5936 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
5937 /* We don't know if it will or will not have side effects. */
5938 TREE_SIDE_EFFECTS (expr
) = 1;
5939 return convert_from_reference (expr
);
5942 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5943 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5944 if (TREE_CODE (type
) != REFERENCE_TYPE
5945 && TREE_CODE (expr
) == NOP_EXPR
5946 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5947 expr
= TREE_OPERAND (expr
, 0);
5949 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
5954 if (complain
& tf_error
)
5955 error ("invalid static_cast from type %qT to type %qT",
5956 TREE_TYPE (expr
), type
);
5957 return error_mark_node
;
5960 /* EXPR is an expression with member function or pointer-to-member
5961 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5962 not permitted by ISO C++, but we accept it in some modes. If we
5963 are not in one of those modes, issue a diagnostic. Return the
5964 converted expression. */
5967 convert_member_func_to_ptr (tree type
, tree expr
)
5972 intype
= TREE_TYPE (expr
);
5973 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
5974 || TREE_CODE (intype
) == METHOD_TYPE
);
5976 if (pedantic
|| warn_pmf2ptr
)
5977 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
5978 "converting from %qT to %qT", intype
, type
);
5980 if (TREE_CODE (intype
) == METHOD_TYPE
)
5981 expr
= build_addr_func (expr
);
5982 else if (TREE_CODE (expr
) == PTRMEM_CST
)
5983 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
5986 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
5987 decl
= build_address (decl
);
5988 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
5991 return build_nop (type
, expr
);
5994 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
5995 If C_CAST_P is true, this reinterpret cast is being done as part of
5996 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
5997 indicate whether or not reinterpret_cast was valid. */
6000 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6001 bool *valid_p
, tsubst_flags_t complain
)
6005 /* Assume the cast is invalid. */
6009 if (type
== error_mark_node
|| error_operand_p (expr
))
6010 return error_mark_node
;
6012 intype
= TREE_TYPE (expr
);
6014 /* Save casted types in the function's used types hash table. */
6015 used_types_insert (type
);
6017 /* [expr.reinterpret.cast]
6018 An lvalue expression of type T1 can be cast to the type
6019 "reference to T2" if an expression of type "pointer to T1" can be
6020 explicitly converted to the type "pointer to T2" using a
6021 reinterpret_cast. */
6022 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6024 if (! real_lvalue_p (expr
))
6026 if (complain
& tf_error
)
6027 error ("invalid cast of an rvalue expression of type "
6030 return error_mark_node
;
6033 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6034 "B" are related class types; the reinterpret_cast does not
6035 adjust the pointer. */
6036 if (TYPE_PTR_P (intype
)
6037 && (complain
& tf_warning
)
6038 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
6039 COMPARE_BASE
| COMPARE_DERIVED
)))
6040 warning (0, "casting %qT to %qT does not dereference pointer",
6043 expr
= cp_build_addr_expr (expr
, complain
);
6045 if (warn_strict_aliasing
> 2)
6046 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
6048 if (expr
!= error_mark_node
)
6049 expr
= build_reinterpret_cast_1
6050 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
6052 if (expr
!= error_mark_node
)
6053 /* cp_build_indirect_ref isn't right for rvalue refs. */
6054 expr
= convert_from_reference (fold_convert (type
, expr
));
6058 /* As a G++ extension, we consider conversions from member
6059 functions, and pointers to member functions to
6060 pointer-to-function and pointer-to-void types. If
6061 -Wno-pmf-conversions has not been specified,
6062 convert_member_func_to_ptr will issue an error message. */
6063 if ((TYPE_PTRMEMFUNC_P (intype
)
6064 || TREE_CODE (intype
) == METHOD_TYPE
)
6065 && TYPE_PTR_P (type
)
6066 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6067 || VOID_TYPE_P (TREE_TYPE (type
))))
6068 return convert_member_func_to_ptr (type
, expr
);
6070 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6071 array-to-pointer, and function-to-pointer conversions are
6073 expr
= decay_conversion (expr
);
6075 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6076 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6077 if (TREE_CODE (expr
) == NOP_EXPR
6078 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6079 expr
= TREE_OPERAND (expr
, 0);
6081 if (error_operand_p (expr
))
6082 return error_mark_node
;
6084 intype
= TREE_TYPE (expr
);
6086 /* [expr.reinterpret.cast]
6087 A pointer can be converted to any integral type large enough to
6088 hold it. ... A value of type std::nullptr_t can be converted to
6089 an integral type; the conversion has the same meaning and
6090 validity as a conversion of (void*)0 to the integral type. */
6091 if (CP_INTEGRAL_TYPE_P (type
)
6092 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
6094 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
6096 if (complain
& tf_error
)
6097 permerror (input_location
, "cast from %qT to %qT loses precision",
6100 return error_mark_node
;
6102 if (NULLPTR_TYPE_P (intype
))
6103 return build_int_cst (type
, 0);
6105 /* [expr.reinterpret.cast]
6106 A value of integral or enumeration type can be explicitly
6107 converted to a pointer. */
6108 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6111 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6112 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6113 return fold_if_not_in_template (build_nop (type
, expr
));
6114 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6115 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6120 && check_for_casting_away_constness (intype
, type
,
6121 REINTERPRET_CAST_EXPR
,
6123 return error_mark_node
;
6124 /* Warn about possible alignment problems. */
6125 if (STRICT_ALIGNMENT
&& warn_cast_align
6126 && (complain
& tf_warning
)
6127 && !VOID_TYPE_P (type
)
6128 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6129 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6130 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6131 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6132 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6133 "increases required alignment of target type", intype
, type
);
6135 /* We need to strip nops here, because the front end likes to
6136 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6138 if (warn_strict_aliasing
<= 2)
6139 strict_aliasing_warning (intype
, type
, sexpr
);
6141 return fold_if_not_in_template (build_nop (type
, expr
));
6143 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6144 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6146 if (pedantic
&& (complain
& tf_warning
))
6147 /* Only issue a warning, as we have always supported this
6148 where possible, and it is necessary in some cases. DR 195
6149 addresses this issue, but as of 2004/10/26 is still in
6151 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6152 return fold_if_not_in_template (build_nop (type
, expr
));
6154 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6155 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6156 else if (TREE_CODE (intype
) == VECTOR_TYPE
6157 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6158 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6163 if (complain
& tf_error
)
6164 error ("invalid cast from type %qT to type %qT", intype
, type
);
6165 return error_mark_node
;
6168 return cp_convert (type
, expr
);
6172 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6174 if (type
== error_mark_node
|| expr
== error_mark_node
)
6175 return error_mark_node
;
6177 if (processing_template_decl
)
6179 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6181 if (!TREE_SIDE_EFFECTS (t
)
6182 && type_dependent_expression_p (expr
))
6183 /* There might turn out to be side effects inside expr. */
6184 TREE_SIDE_EFFECTS (t
) = 1;
6185 return convert_from_reference (t
);
6188 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6189 /*valid_p=*/NULL
, complain
);
6192 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6193 return an appropriate expression. Otherwise, return
6194 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6195 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6196 performing a C-style cast, its value upon return will indicate
6197 whether or not the conversion succeeded. */
6200 build_const_cast_1 (tree dst_type
, tree expr
, tsubst_flags_t complain
,
6204 tree reference_type
;
6206 /* Callers are responsible for handling error_mark_node as a
6207 destination type. */
6208 gcc_assert (dst_type
!= error_mark_node
);
6209 /* In a template, callers should be building syntactic
6210 representations of casts, not using this machinery. */
6211 gcc_assert (!processing_template_decl
);
6213 /* Assume the conversion is invalid. */
6217 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6219 if (complain
& tf_error
)
6220 error ("invalid use of const_cast with type %qT, "
6221 "which is not a pointer, "
6222 "reference, nor a pointer-to-data-member type", dst_type
);
6223 return error_mark_node
;
6226 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6228 if (complain
& tf_error
)
6229 error ("invalid use of const_cast with type %qT, which is a pointer "
6230 "or reference to a function type", dst_type
);
6231 return error_mark_node
;
6234 /* Save casted types in the function's used types hash table. */
6235 used_types_insert (dst_type
);
6237 src_type
= TREE_TYPE (expr
);
6238 /* Expressions do not really have reference types. */
6239 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6240 src_type
= TREE_TYPE (src_type
);
6242 /* [expr.const.cast]
6244 An lvalue of type T1 can be explicitly converted to an lvalue of
6245 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6246 types) if a pointer to T1 can be explicitly converted to the type
6247 pointer to T2 using a const_cast. */
6248 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6250 reference_type
= dst_type
;
6251 if (! real_lvalue_p (expr
))
6253 if (complain
& tf_error
)
6254 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6255 src_type
, dst_type
);
6256 return error_mark_node
;
6258 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6259 src_type
= build_pointer_type (src_type
);
6263 reference_type
= NULL_TREE
;
6264 /* If the destination type is not a reference type, the
6265 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6266 conversions are performed. */
6267 src_type
= type_decays_to (src_type
);
6268 if (src_type
== error_mark_node
)
6269 return error_mark_node
;
6272 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6273 && comp_ptr_ttypes_const (dst_type
, src_type
))
6278 /* This cast is actually a C-style cast. Issue a warning if
6279 the user is making a potentially unsafe cast. */
6280 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
,
6285 expr
= cp_build_addr_expr (expr
, complain
);
6286 expr
= build_nop (reference_type
, expr
);
6287 return convert_from_reference (expr
);
6291 expr
= decay_conversion (expr
);
6292 /* build_c_cast puts on a NOP_EXPR to make the result not an
6293 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6294 non-lvalue context. */
6295 if (TREE_CODE (expr
) == NOP_EXPR
6296 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6297 expr
= TREE_OPERAND (expr
, 0);
6298 return build_nop (dst_type
, expr
);
6302 if (complain
& tf_error
)
6303 error ("invalid const_cast from type %qT to type %qT",
6304 src_type
, dst_type
);
6305 return error_mark_node
;
6309 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6311 if (type
== error_mark_node
|| error_operand_p (expr
))
6312 return error_mark_node
;
6314 if (processing_template_decl
)
6316 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6318 if (!TREE_SIDE_EFFECTS (t
)
6319 && type_dependent_expression_p (expr
))
6320 /* There might turn out to be side effects inside expr. */
6321 TREE_SIDE_EFFECTS (t
) = 1;
6322 return convert_from_reference (t
);
6325 return build_const_cast_1 (type
, expr
, complain
,
6329 /* Like cp_build_c_cast, but for the c-common bits. */
6332 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6334 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6337 /* Build an expression representing an explicit C-style cast to type
6338 TYPE of expression EXPR. */
6341 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6347 if (type
== error_mark_node
|| error_operand_p (expr
))
6348 return error_mark_node
;
6350 if (processing_template_decl
)
6352 tree t
= build_min (CAST_EXPR
, type
,
6353 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6354 /* We don't know if it will or will not have side effects. */
6355 TREE_SIDE_EFFECTS (t
) = 1;
6356 return convert_from_reference (t
);
6359 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6360 'Class') should always be retained, because this information aids
6361 in method lookup. */
6362 if (objc_is_object_ptr (type
)
6363 && objc_is_object_ptr (TREE_TYPE (expr
)))
6364 return build_nop (type
, expr
);
6366 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6367 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6368 if (TREE_CODE (type
) != REFERENCE_TYPE
6369 && TREE_CODE (value
) == NOP_EXPR
6370 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6371 value
= TREE_OPERAND (value
, 0);
6373 if (TREE_CODE (type
) == ARRAY_TYPE
)
6375 /* Allow casting from T1* to T2[] because Cfront allows it.
6376 NIHCL uses it. It is not valid ISO C++ however. */
6377 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6379 if (complain
& tf_error
)
6380 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6382 return error_mark_node
;
6383 type
= build_pointer_type (TREE_TYPE (type
));
6387 if (complain
& tf_error
)
6388 error ("ISO C++ forbids casting to an array type %qT", type
);
6389 return error_mark_node
;
6393 if (TREE_CODE (type
) == FUNCTION_TYPE
6394 || TREE_CODE (type
) == METHOD_TYPE
)
6396 if (complain
& tf_error
)
6397 error ("invalid cast to function type %qT", type
);
6398 return error_mark_node
;
6401 if (TREE_CODE (type
) == POINTER_TYPE
6402 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
6403 /* Casting to an integer of smaller size is an error detected elsewhere. */
6404 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
6405 /* Don't warn about converting any constant. */
6406 && !TREE_CONSTANT (value
))
6407 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
6408 "cast to pointer from integer of different size");
6410 /* A C-style cast can be a const_cast. */
6411 result
= build_const_cast_1 (type
, value
, complain
& tf_warning
,
6416 /* Or a static cast. */
6417 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6418 &valid_p
, complain
);
6419 /* Or a reinterpret_cast. */
6421 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6422 &valid_p
, complain
);
6423 /* The static_cast or reinterpret_cast may be followed by a
6426 /* A valid cast may result in errors if, for example, a
6427 conversion to am ambiguous base class is required. */
6428 && !error_operand_p (result
))
6432 /* Non-class rvalues always have cv-unqualified type. */
6433 if (!CLASS_TYPE_P (type
))
6434 type
= TYPE_MAIN_VARIANT (type
);
6435 result_type
= TREE_TYPE (result
);
6436 if (!CLASS_TYPE_P (result_type
))
6437 result_type
= TYPE_MAIN_VARIANT (result_type
);
6438 /* If the type of RESULT does not match TYPE, perform a
6439 const_cast to make it match. If the static_cast or
6440 reinterpret_cast succeeded, we will differ by at most
6441 cv-qualification, so the follow-on const_cast is guaranteed
6443 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6445 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6446 gcc_assert (valid_p
);
6451 return error_mark_node
;
6454 /* For use from the C common bits. */
6456 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6457 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6458 enum tree_code modifycode
,
6459 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6460 tree rhs_origtype ATTRIBUTE_UNUSED
)
6462 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6465 /* Build an assignment expression of lvalue LHS from value RHS.
6466 MODIFYCODE is the code for a binary operator that we use
6467 to combine the old value of LHS with RHS to get the new value.
6468 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6470 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6473 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6474 tsubst_flags_t complain
)
6478 tree lhstype
= TREE_TYPE (lhs
);
6479 tree olhstype
= lhstype
;
6480 bool plain_assign
= (modifycode
== NOP_EXPR
);
6482 /* Avoid duplicate error messages from operands that had errors. */
6483 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6484 return error_mark_node
;
6486 /* Handle control structure constructs used as "lvalues". */
6487 switch (TREE_CODE (lhs
))
6489 /* Handle --foo = 5; as these are valid constructs in C++. */
6490 case PREDECREMENT_EXPR
:
6491 case PREINCREMENT_EXPR
:
6492 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6493 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6494 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6495 TREE_OPERAND (lhs
, 1));
6496 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6497 modifycode
, rhs
, complain
);
6498 if (newrhs
== error_mark_node
)
6499 return error_mark_node
;
6500 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6502 /* Handle (a, b) used as an "lvalue". */
6504 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6505 modifycode
, rhs
, complain
);
6506 if (newrhs
== error_mark_node
)
6507 return error_mark_node
;
6508 return build2 (COMPOUND_EXPR
, lhstype
,
6509 TREE_OPERAND (lhs
, 0), newrhs
);
6512 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6513 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6514 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6515 TREE_OPERAND (lhs
, 1));
6516 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6518 if (newrhs
== error_mark_node
)
6519 return error_mark_node
;
6520 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6524 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6525 when neither operand has side-effects. */
6526 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6527 return error_mark_node
;
6529 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6530 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6532 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6533 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6535 TREE_OPERAND (lhs
, 0),
6536 TREE_OPERAND (lhs
, 1)),
6537 TREE_OPERAND (lhs
, 0),
6538 TREE_OPERAND (lhs
, 1));
6541 /* Handle (a ? b : c) used as an "lvalue". */
6544 /* Produce (a ? (b = rhs) : (c = rhs))
6545 except that the RHS goes through a save-expr
6546 so the code to compute it is only emitted once. */
6548 tree preeval
= NULL_TREE
;
6550 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6552 if (complain
& tf_error
)
6553 error ("void value not ignored as it ought to be");
6554 return error_mark_node
;
6557 rhs
= stabilize_expr (rhs
, &preeval
);
6559 /* Check this here to avoid odd errors when trying to convert
6560 a throw to the type of the COND_EXPR. */
6561 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6562 return error_mark_node
;
6564 cond
= build_conditional_expr
6565 (TREE_OPERAND (lhs
, 0),
6566 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6567 modifycode
, rhs
, complain
),
6568 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6569 modifycode
, rhs
, complain
),
6572 if (cond
== error_mark_node
)
6574 /* Make sure the code to compute the rhs comes out
6575 before the split. */
6577 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6585 if (modifycode
== INIT_EXPR
)
6587 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6588 /* Do the default thing. */;
6589 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6591 /* Compound literal. */
6592 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6593 /* Call convert to generate an error; see PR 11063. */
6594 rhs
= convert (lhstype
, rhs
);
6595 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6596 TREE_SIDE_EFFECTS (result
) = 1;
6599 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6600 /* Do the default thing. */;
6603 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6604 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6605 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6607 release_tree_vector (rhs_vec
);
6608 if (result
== NULL_TREE
)
6609 return error_mark_node
;
6615 lhs
= require_complete_type_sfinae (lhs
, complain
);
6616 if (lhs
== error_mark_node
)
6617 return error_mark_node
;
6619 if (modifycode
== NOP_EXPR
)
6621 if (c_dialect_objc ())
6623 result
= objc_maybe_build_modify_expr (lhs
, rhs
);
6628 /* `operator=' is not an inheritable operator. */
6629 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6630 /* Do the default thing. */;
6633 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6634 lhs
, rhs
, make_node (NOP_EXPR
),
6635 /*overloaded_p=*/NULL
,
6637 if (result
== NULL_TREE
)
6638 return error_mark_node
;
6645 /* A binary op has been requested. Combine the old LHS
6646 value with the RHS producing the value we should actually
6647 store into the LHS. */
6648 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6649 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6650 || MAYBE_CLASS_TYPE_P (lhstype
)));
6652 lhs
= stabilize_reference (lhs
);
6653 newrhs
= cp_build_binary_op (input_location
,
6654 modifycode
, lhs
, rhs
,
6656 if (newrhs
== error_mark_node
)
6658 if (complain
& tf_error
)
6659 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6660 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6661 return error_mark_node
;
6664 /* Now it looks like a plain assignment. */
6665 modifycode
= NOP_EXPR
;
6666 if (c_dialect_objc ())
6668 result
= objc_maybe_build_modify_expr (lhs
, newrhs
);
6673 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6674 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6677 /* The left-hand side must be an lvalue. */
6678 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6679 return error_mark_node
;
6681 /* Warn about modifying something that is `const'. Don't warn if
6682 this is initialization. */
6683 if (modifycode
!= INIT_EXPR
6684 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6685 /* Functions are not modifiable, even though they are
6687 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6688 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6689 /* If it's an aggregate and any field is const, then it is
6690 effectively const. */
6691 || (CLASS_TYPE_P (lhstype
)
6692 && C_TYPE_FIELDS_READONLY (lhstype
))))
6694 if (complain
& tf_error
)
6695 cxx_readonly_error (lhs
, lv_assign
);
6697 return error_mark_node
;
6700 /* If storing into a structure or union member, it may have been given a
6701 lowered bitfield type. We need to convert to the declared type first,
6702 so retrieve it now. */
6704 olhstype
= unlowered_expr_type (lhs
);
6706 /* Convert new value to destination type. */
6708 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6712 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6714 if (modifycode
!= INIT_EXPR
)
6716 if (complain
& tf_error
)
6717 error ("assigning to an array from an initializer list");
6718 return error_mark_node
;
6720 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6721 return error_mark_node
;
6722 newrhs
= digest_init (lhstype
, newrhs
, complain
);
6725 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6726 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6728 if (complain
& tf_error
)
6729 error ("incompatible types in assignment of %qT to %qT",
6730 TREE_TYPE (rhs
), lhstype
);
6731 return error_mark_node
;
6734 /* Allow array assignment in compiler-generated code. */
6735 else if (!current_function_decl
6736 || !DECL_ARTIFICIAL (current_function_decl
))
6738 /* This routine is used for both initialization and assignment.
6739 Make sure the diagnostic message differentiates the context. */
6740 if (complain
& tf_error
)
6742 if (modifycode
== INIT_EXPR
)
6743 error ("array used as initializer");
6745 error ("invalid array assignment");
6747 return error_mark_node
;
6750 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6751 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6752 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6753 /*explicit_value_init_p=*/false,
6754 from_array
, complain
);
6757 if (modifycode
== INIT_EXPR
)
6758 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6759 LOOKUP_ONLYCONVERTING. */
6760 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6761 ICR_INIT
, NULL_TREE
, 0,
6764 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
6765 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6767 if (!same_type_p (lhstype
, olhstype
))
6768 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6770 if (modifycode
!= INIT_EXPR
)
6772 if (TREE_CODE (newrhs
) == CALL_EXPR
6773 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6774 newrhs
= build_cplus_new (lhstype
, newrhs
, complain
);
6776 /* Can't initialize directly from a TARGET_EXPR, since that would
6777 cause the lhs to be constructed twice, and possibly result in
6778 accidental self-initialization. So we force the TARGET_EXPR to be
6779 expanded without a target. */
6780 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6781 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6782 TREE_OPERAND (newrhs
, 0));
6785 if (newrhs
== error_mark_node
)
6786 return error_mark_node
;
6788 if (c_dialect_objc () && flag_objc_gc
)
6790 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6796 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6797 lhstype
, lhs
, newrhs
);
6799 TREE_SIDE_EFFECTS (result
) = 1;
6801 TREE_NO_WARNING (result
) = 1;
6807 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6808 tsubst_flags_t complain
)
6810 if (processing_template_decl
)
6811 return build_min_nt (MODOP_EXPR
, lhs
,
6812 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6814 if (modifycode
!= NOP_EXPR
)
6816 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6817 make_node (modifycode
),
6818 /*overloaded_p=*/NULL
,
6822 TREE_NO_WARNING (rval
) = 1;
6826 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6829 /* Helper function for get_delta_difference which assumes FROM is a base
6830 class of TO. Returns a delta for the conversion of pointer-to-member
6831 of FROM to pointer-to-member of TO. If the conversion is invalid and
6832 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
6833 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6834 If C_CAST_P is true, this conversion is taking place as part of a
6838 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
,
6839 tsubst_flags_t complain
)
6843 base_access access
= c_cast_p
? ba_unique
: ba_check
;
6845 /* Note: ba_quiet does not distinguish between access control and
6847 if (!(complain
& tf_error
))
6850 binfo
= lookup_base (to
, from
, access
, &kind
);
6852 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6854 if (!(complain
& tf_error
))
6855 return error_mark_node
;
6857 error (" in pointer to member function conversion");
6858 return size_zero_node
;
6862 if (kind
!= bk_via_virtual
)
6863 return BINFO_OFFSET (binfo
);
6865 /* FROM is a virtual base class of TO. Issue an error or warning
6866 depending on whether or not this is a reinterpret cast. */
6868 if (!(complain
& tf_error
))
6869 return error_mark_node
;
6871 error ("pointer to member conversion via virtual base %qT",
6872 BINFO_TYPE (binfo_from_vbase (binfo
)));
6874 return size_zero_node
;
6881 /* Get difference in deltas for different pointer to member function
6882 types. If the conversion is invalid and tf_error is not set in
6883 COMPLAIN, returns error_mark_node, otherwise returns an integer
6884 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
6885 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
6886 conversions as well. If C_CAST_P is true this conversion is taking
6887 place as part of a C-style cast.
6889 Note that the naming of FROM and TO is kind of backwards; the return
6890 value is what we add to a TO in order to get a FROM. They are named
6891 this way because we call this function to find out how to convert from
6892 a pointer to member of FROM to a pointer to member of TO. */
6895 get_delta_difference (tree from
, tree to
,
6896 bool allow_inverse_p
,
6897 bool c_cast_p
, tsubst_flags_t complain
)
6901 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
6902 /* Pointer to member of incomplete class is permitted*/
6903 result
= size_zero_node
;
6905 result
= get_delta_difference_1 (from
, to
, c_cast_p
, complain
);
6907 if (result
== error_mark_node
)
6908 return error_mark_node
;
6912 if (!allow_inverse_p
)
6914 if (!(complain
& tf_error
))
6915 return error_mark_node
;
6917 error_not_base_type (from
, to
);
6918 error (" in pointer to member conversion");
6919 result
= size_zero_node
;
6923 result
= get_delta_difference_1 (to
, from
, c_cast_p
, complain
);
6925 if (result
== error_mark_node
)
6926 return error_mark_node
;
6929 result
= size_diffop_loc (input_location
,
6930 size_zero_node
, result
);
6933 if (!(complain
& tf_error
))
6934 return error_mark_node
;
6936 error_not_base_type (from
, to
);
6937 error (" in pointer to member conversion");
6938 result
= size_zero_node
;
6943 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
6947 /* Return a constructor for the pointer-to-member-function TYPE using
6948 the other components as specified. */
6951 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
6956 VEC(constructor_elt
, gc
) *v
;
6958 /* Pull the FIELD_DECLs out of the type. */
6959 pfn_field
= TYPE_FIELDS (type
);
6960 delta_field
= DECL_CHAIN (pfn_field
);
6962 /* Make sure DELTA has the type we want. */
6963 delta
= convert_and_check (delta_type_node
, delta
);
6965 /* Convert to the correct target type if necessary. */
6966 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
6968 /* Finish creating the initializer. */
6969 v
= VEC_alloc(constructor_elt
, gc
, 2);
6970 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
6971 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
6972 u
= build_constructor (type
, v
);
6973 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
6974 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
6975 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
6977 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
6982 /* Build a constructor for a pointer to member function. It can be
6983 used to initialize global variables, local variable, or used
6984 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6987 If FORCE is nonzero, then force this conversion, even if
6988 we would rather not do it. Usually set when using an explicit
6989 cast. A C-style cast is being processed iff C_CAST_P is true.
6991 Return error_mark_node, if something goes wrong. */
6994 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
,
6995 tsubst_flags_t complain
)
7001 if (error_operand_p (pfn
))
7002 return error_mark_node
;
7004 pfn_type
= TREE_TYPE (pfn
);
7005 to_type
= build_ptrmemfunc_type (type
);
7007 /* Handle multiple conversions of pointer to member functions. */
7008 if (TYPE_PTRMEMFUNC_P (pfn_type
))
7010 tree delta
= NULL_TREE
;
7011 tree npfn
= NULL_TREE
;
7015 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
7016 error ("invalid conversion to type %qT from type %qT",
7019 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
7020 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
7022 c_cast_p
, complain
);
7023 if (n
== error_mark_node
)
7024 return error_mark_node
;
7026 /* We don't have to do any conversion to convert a
7027 pointer-to-member to its own type. But, we don't want to
7028 just return a PTRMEM_CST if there's an explicit cast; that
7029 cast should make the expression an invalid template argument. */
7030 if (TREE_CODE (pfn
) != PTRMEM_CST
)
7032 if (same_type_p (to_type
, pfn_type
))
7034 else if (integer_zerop (n
))
7035 return build_reinterpret_cast (to_type
, pfn
,
7036 tf_warning_or_error
);
7039 if (TREE_SIDE_EFFECTS (pfn
))
7040 pfn
= save_expr (pfn
);
7042 /* Obtain the function pointer and the current DELTA. */
7043 if (TREE_CODE (pfn
) == PTRMEM_CST
)
7044 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
7047 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
7048 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
7051 /* Just adjust the DELTA field. */
7052 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7053 (TREE_TYPE (delta
), ptrdiff_type_node
));
7054 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
7055 n
= cp_build_binary_op (input_location
,
7056 LSHIFT_EXPR
, n
, integer_one_node
,
7057 tf_warning_or_error
);
7058 delta
= cp_build_binary_op (input_location
,
7059 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
7060 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
7063 /* Handle null pointer to member function conversions. */
7064 if (null_ptr_cst_p (pfn
))
7066 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
7067 return build_ptrmemfunc1 (to_type
,
7072 if (type_unknown_p (pfn
))
7073 return instantiate_type (type
, pfn
, tf_warning_or_error
);
7075 fn
= TREE_OPERAND (pfn
, 0);
7076 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7077 /* In a template, we will have preserved the
7079 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
7080 return make_ptrmem_cst (to_type
, fn
);
7083 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7086 ??? There is no consistency as to the types returned for the above
7087 values. Some code acts as if it were a sizetype and some as if it were
7088 integer_type_node. */
7091 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
7093 tree type
= TREE_TYPE (cst
);
7094 tree fn
= PTRMEM_CST_MEMBER (cst
);
7095 tree ptr_class
, fn_class
;
7097 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7099 /* The class that the function belongs to. */
7100 fn_class
= DECL_CONTEXT (fn
);
7102 /* The class that we're creating a pointer to member of. */
7103 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
7105 /* First, calculate the adjustment to the function's class. */
7106 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
7107 /*c_cast_p=*/0, tf_warning_or_error
);
7109 if (!DECL_VIRTUAL_P (fn
))
7110 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
7113 /* If we're dealing with a virtual function, we have to adjust 'this'
7114 again, to point to the base which provides the vtable entry for
7115 fn; the call will do the opposite adjustment. */
7116 tree orig_class
= DECL_CONTEXT (fn
);
7117 tree binfo
= binfo_or_else (orig_class
, fn_class
);
7118 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7119 *delta
, BINFO_OFFSET (binfo
));
7120 *delta
= fold_if_not_in_template (*delta
);
7122 /* We set PFN to the vtable offset at which the function can be
7123 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7124 case delta is shifted left, and then incremented). */
7125 *pfn
= DECL_VINDEX (fn
);
7126 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
7127 TYPE_SIZE_UNIT (vtable_entry_type
));
7128 *pfn
= fold_if_not_in_template (*pfn
);
7130 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
7132 case ptrmemfunc_vbit_in_pfn
:
7133 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
7135 *pfn
= fold_if_not_in_template (*pfn
);
7138 case ptrmemfunc_vbit_in_delta
:
7139 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
7140 *delta
, integer_one_node
);
7141 *delta
= fold_if_not_in_template (*delta
);
7142 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7143 *delta
, integer_one_node
);
7144 *delta
= fold_if_not_in_template (*delta
);
7151 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
7152 *pfn
= fold_if_not_in_template (*pfn
);
7156 /* Return an expression for PFN from the pointer-to-member function
7160 pfn_from_ptrmemfunc (tree t
)
7162 if (TREE_CODE (t
) == PTRMEM_CST
)
7167 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7172 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
7175 /* Return an expression for DELTA from the pointer-to-member function
7179 delta_from_ptrmemfunc (tree t
)
7181 if (TREE_CODE (t
) == PTRMEM_CST
)
7186 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7191 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7194 /* Convert value RHS to type TYPE as preparation for an assignment to
7195 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
7196 implicit conversion is. If FNDECL is non-NULL, we are doing the
7197 conversion in order to pass the PARMNUMth argument of FNDECL.
7198 If FNDECL is NULL, we are doing the conversion in function pointer
7199 argument passing, conversion in initialization, etc. */
7202 convert_for_assignment (tree type
, tree rhs
,
7203 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7204 tsubst_flags_t complain
, int flags
)
7207 enum tree_code coder
;
7209 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7210 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7211 rhs
= TREE_OPERAND (rhs
, 0);
7213 rhstype
= TREE_TYPE (rhs
);
7214 coder
= TREE_CODE (rhstype
);
7216 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7217 && vector_types_convertible_p (type
, rhstype
, true))
7219 rhs
= mark_rvalue_use (rhs
);
7220 return convert (type
, rhs
);
7223 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7224 return error_mark_node
;
7225 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7226 return error_mark_node
;
7228 /* The RHS of an assignment cannot have void type. */
7229 if (coder
== VOID_TYPE
)
7231 if (complain
& tf_error
)
7232 error ("void value not ignored as it ought to be");
7233 return error_mark_node
;
7236 /* Simplify the RHS if possible. */
7237 if (TREE_CODE (rhs
) == CONST_DECL
)
7238 rhs
= DECL_INITIAL (rhs
);
7240 if (c_dialect_objc ())
7244 tree rname
= fndecl
;
7255 selector
= objc_message_selector ();
7257 if (selector
&& parmno
> 1)
7264 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7266 rhs
= mark_rvalue_use (rhs
);
7267 return convert (type
, rhs
);
7273 The expression is implicitly converted (clause _conv_) to the
7274 cv-unqualified type of the left operand.
7276 We allow bad conversions here because by the time we get to this point
7277 we are committed to doing the conversion. If we end up doing a bad
7278 conversion, convert_like will complain. */
7279 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7281 /* When -Wno-pmf-conversions is use, we just silently allow
7282 conversions from pointers-to-members to plain pointers. If
7283 the conversion doesn't work, cp_convert will complain. */
7285 && TYPE_PTR_P (type
)
7286 && TYPE_PTRMEMFUNC_P (rhstype
))
7287 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7290 if (complain
& tf_error
)
7292 /* If the right-hand side has unknown type, then it is an
7293 overloaded function. Call instantiate_type to get error
7295 if (rhstype
== unknown_type_node
)
7296 instantiate_type (type
, rhs
, tf_warning_or_error
);
7298 error ("cannot convert %qT to %qT for argument %qP to %qD",
7299 rhstype
, type
, parmnum
, fndecl
);
7303 case ICR_DEFAULT_ARGUMENT
:
7304 error ("cannot convert %qT to %qT in default argument",
7308 error ("cannot convert %qT to %qT in argument passing",
7311 case ICR_CONVERTING
:
7312 error ("cannot convert %qT to %qT",
7316 error ("cannot convert %qT to %qT in initialization",
7320 error ("cannot convert %qT to %qT in return",
7324 error ("cannot convert %qT to %qT in assignment",
7331 return error_mark_node
;
7334 if (warn_missing_format_attribute
)
7336 const enum tree_code codel
= TREE_CODE (type
);
7337 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7339 && check_missing_format_attribute (type
, rhstype
)
7340 && (complain
& tf_warning
))
7344 case ICR_DEFAULT_ARGUMENT
:
7346 warning (OPT_Wmissing_format_attribute
,
7347 "parameter %qP of %qD might be a candidate "
7348 "for a format attribute", parmnum
, fndecl
);
7350 warning (OPT_Wmissing_format_attribute
,
7351 "parameter might be a candidate "
7352 "for a format attribute");
7354 case ICR_CONVERTING
:
7355 warning (OPT_Wmissing_format_attribute
,
7356 "target of conversion might be a candidate "
7357 "for a format attribute");
7360 warning (OPT_Wmissing_format_attribute
,
7361 "target of initialization might be a candidate "
7362 "for a format attribute");
7365 warning (OPT_Wmissing_format_attribute
,
7366 "return type might be a candidate "
7367 "for a format attribute");
7370 warning (OPT_Wmissing_format_attribute
,
7371 "left-hand side of assignment might be a candidate "
7372 "for a format attribute");
7379 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7381 if (warn_parentheses
7382 && TREE_CODE (type
) == BOOLEAN_TYPE
7383 && TREE_CODE (rhs
) == MODIFY_EXPR
7384 && !TREE_NO_WARNING (rhs
)
7385 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7386 && (complain
& tf_warning
))
7388 location_t loc
= EXPR_LOC_OR_HERE (rhs
);
7390 warning_at (loc
, OPT_Wparentheses
,
7391 "suggest parentheses around assignment used as truth value");
7392 TREE_NO_WARNING (rhs
) = 1;
7395 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7399 /* Convert RHS to be of type TYPE.
7400 If EXP is nonzero, it is the target of the initialization.
7401 ERRTYPE indicates what kind of error the implicit conversion is.
7403 Two major differences between the behavior of
7404 `convert_for_assignment' and `convert_for_initialization'
7405 are that references are bashed in the former, while
7406 copied in the latter, and aggregates are assigned in
7407 the former (operator=) while initialized in the
7410 If using constructor make sure no conversion operator exists, if one does
7411 exist, an ambiguity exists.
7413 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7416 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7417 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7418 tsubst_flags_t complain
)
7420 enum tree_code codel
= TREE_CODE (type
);
7422 enum tree_code coder
;
7424 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7425 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7426 if (TREE_CODE (rhs
) == NOP_EXPR
7427 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7428 && codel
!= REFERENCE_TYPE
)
7429 rhs
= TREE_OPERAND (rhs
, 0);
7431 if (type
== error_mark_node
7432 || rhs
== error_mark_node
7433 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7434 return error_mark_node
;
7436 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7437 && TREE_CODE (type
) != ARRAY_TYPE
7438 && (TREE_CODE (type
) != REFERENCE_TYPE
7439 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7440 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7441 && (TREE_CODE (type
) != REFERENCE_TYPE
7442 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7443 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7444 rhs
= decay_conversion (rhs
);
7446 rhstype
= TREE_TYPE (rhs
);
7447 coder
= TREE_CODE (rhstype
);
7449 if (coder
== ERROR_MARK
)
7450 return error_mark_node
;
7452 /* We accept references to incomplete types, so we can
7453 return here before checking if RHS is of complete type. */
7455 if (codel
== REFERENCE_TYPE
)
7457 /* This should eventually happen in convert_arguments. */
7458 int savew
= 0, savee
= 0;
7461 savew
= warningcount
, savee
= errorcount
;
7462 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7463 /*cleanup=*/NULL
, complain
);
7466 if (warningcount
> savew
)
7467 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7468 else if (errorcount
> savee
)
7469 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7475 exp
= require_complete_type_sfinae (exp
, complain
);
7476 if (exp
== error_mark_node
)
7477 return error_mark_node
;
7479 rhstype
= non_reference (rhstype
);
7481 type
= complete_type (type
);
7483 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7484 /* Don't try to do copy-initialization if we already have
7485 direct-initialization. */
7488 if (MAYBE_CLASS_TYPE_P (type
))
7489 return perform_implicit_conversion_flags (type
, rhs
, complain
, flags
);
7491 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7495 /* If RETVAL is the address of, or a reference to, a local variable or
7496 temporary give an appropriate warning. */
7499 maybe_warn_about_returning_address_of_local (tree retval
)
7501 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7502 tree whats_returned
= retval
;
7506 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7507 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7508 else if (CONVERT_EXPR_P (whats_returned
)
7509 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7510 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7515 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7517 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7519 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7521 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7522 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7524 warning (0, "returning reference to temporary");
7527 if (TREE_CODE (whats_returned
) == VAR_DECL
7528 && DECL_NAME (whats_returned
)
7529 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7531 warning (0, "reference to non-lvalue returned");
7536 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7537 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7538 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7540 if (DECL_P (whats_returned
)
7541 && DECL_NAME (whats_returned
)
7542 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7543 && !(TREE_STATIC (whats_returned
)
7544 || TREE_PUBLIC (whats_returned
)))
7546 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7547 warning (0, "reference to local variable %q+D returned",
7550 warning (0, "address of local variable %q+D returned",
7556 /* Check that returning RETVAL from the current function is valid.
7557 Return an expression explicitly showing all conversions required to
7558 change RETVAL into the function return type, and to assign it to
7559 the DECL_RESULT for the function. Set *NO_WARNING to true if
7560 code reaches end of non-void function warning shouldn't be issued
7561 on this RETURN_EXPR. */
7564 check_return_expr (tree retval
, bool *no_warning
)
7567 /* The type actually returned by the function, after any
7570 int fn_returns_value_p
;
7571 bool named_return_value_okay_p
;
7573 *no_warning
= false;
7575 /* A `volatile' function is one that isn't supposed to return, ever.
7576 (This is a G++ extension, used to get better code for functions
7577 that call the `volatile' function.) */
7578 if (TREE_THIS_VOLATILE (current_function_decl
))
7579 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7581 /* Check for various simple errors. */
7582 if (DECL_DESTRUCTOR_P (current_function_decl
))
7585 error ("returning a value from a destructor");
7588 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7590 if (in_function_try_handler
)
7591 /* If a return statement appears in a handler of the
7592 function-try-block of a constructor, the program is ill-formed. */
7593 error ("cannot return from a handler of a function-try-block of a constructor");
7595 /* You can't return a value from a constructor. */
7596 error ("returning a value from a constructor");
7600 /* As an extension, deduce lambda return type from a return statement
7601 anywhere in the body. */
7602 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7604 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7605 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7607 tree type
= lambda_return_type (retval
);
7608 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7610 if (VOID_TYPE_P (type
))
7612 else if (oldtype
== NULL_TREE
)
7614 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7615 "can only be deduced when the return statement is "
7616 "the only statement in the function body");
7617 apply_lambda_return_type (lambda
, type
);
7619 else if (!same_type_p (type
, oldtype
))
7620 error ("inconsistent types %qT and %qT deduced for "
7621 "lambda return type", type
, oldtype
);
7625 if (processing_template_decl
)
7627 current_function_returns_value
= 1;
7628 if (check_for_bare_parameter_packs (retval
))
7629 retval
= error_mark_node
;
7633 /* When no explicit return-value is given in a function with a named
7634 return value, the named return value is used. */
7635 result
= DECL_RESULT (current_function_decl
);
7636 valtype
= TREE_TYPE (result
);
7637 gcc_assert (valtype
!= NULL_TREE
);
7638 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7639 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7642 /* Check for a return statement with no return value in a function
7643 that's supposed to return a value. */
7644 if (!retval
&& fn_returns_value_p
)
7646 permerror (input_location
, "return-statement with no value, in function returning %qT",
7648 /* Clear this, so finish_function won't say that we reach the
7649 end of a non-void function (which we don't, we gave a
7651 current_function_returns_null
= 0;
7652 /* And signal caller that TREE_NO_WARNING should be set on the
7653 RETURN_EXPR to avoid control reaches end of non-void function
7654 warnings in tree-cfg.c. */
7657 /* Check for a return statement with a value in a function that
7658 isn't supposed to return a value. */
7659 else if (retval
&& !fn_returns_value_p
)
7661 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7662 /* You can return a `void' value from a function of `void'
7663 type. In that case, we have to evaluate the expression for
7664 its side-effects. */
7665 finish_expr_stmt (retval
);
7667 permerror (input_location
, "return-statement with a value, in function "
7668 "returning 'void'");
7669 current_function_returns_null
= 1;
7671 /* There's really no value to return, after all. */
7675 /* Remember that this function can sometimes return without a
7677 current_function_returns_null
= 1;
7679 /* Remember that this function did return a value. */
7680 current_function_returns_value
= 1;
7682 /* Check for erroneous operands -- but after giving ourselves a
7683 chance to provide an error about returning a value from a void
7685 if (error_operand_p (retval
))
7687 current_function_return_value
= error_mark_node
;
7688 return error_mark_node
;
7691 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7692 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7693 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7694 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7696 && retval
&& null_ptr_cst_p (retval
))
7697 warning (0, "%<operator new%> must not return NULL unless it is "
7698 "declared %<throw()%> (or -fcheck-new is in effect)");
7700 /* Effective C++ rule 15. See also start_function. */
7702 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7706 /* The function return type must be a reference to the current
7708 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7709 && same_type_ignoring_top_level_qualifiers_p
7710 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7712 /* Returning '*this' is obviously OK. */
7713 if (retval
== current_class_ref
)
7715 /* If we are calling a function whose return type is the same of
7716 the current class reference, it is ok. */
7717 else if (TREE_CODE (retval
) == INDIRECT_REF
7718 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7723 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7726 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7728 [...] For a function with a class return type, if the expression
7729 in the return statement is the name of a local object, and the cv-
7730 unqualified type of the local object is the same as the function
7731 return type, an implementation is permitted to omit creating the tem-
7732 porary object to hold the function return value [...]
7734 So, if this is a value-returning function that always returns the same
7735 local variable, remember it.
7737 It might be nice to be more flexible, and choose the first suitable
7738 variable even if the function sometimes returns something else, but
7739 then we run the risk of clobbering the variable we chose if the other
7740 returned expression uses the chosen variable somehow. And people expect
7741 this restriction, anyway. (jason 2000-11-19)
7743 See finish_function and finalize_nrv for the rest of this optimization. */
7745 named_return_value_okay_p
=
7746 (retval
!= NULL_TREE
7747 /* Must be a local, automatic variable. */
7748 && TREE_CODE (retval
) == VAR_DECL
7749 && DECL_CONTEXT (retval
) == current_function_decl
7750 && ! TREE_STATIC (retval
)
7751 && ! DECL_ANON_UNION_VAR_P (retval
)
7752 && (DECL_ALIGN (retval
)
7753 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7754 /* The cv-unqualified type of the returned value must be the
7755 same as the cv-unqualified return type of the
7757 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7759 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7760 /* And the returned value must be non-volatile. */
7761 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7763 if (fn_returns_value_p
&& flag_elide_constructors
)
7765 if (named_return_value_okay_p
7766 && (current_function_return_value
== NULL_TREE
7767 || current_function_return_value
== retval
))
7768 current_function_return_value
= retval
;
7770 current_function_return_value
= error_mark_node
;
7773 /* We don't need to do any conversions when there's nothing being
7778 /* Do any required conversions. */
7779 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7780 /* No conversions are required. */
7784 /* The type the function is declared to return. */
7785 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7786 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7788 /* The functype's return type will have been set to void, if it
7789 was an incomplete type. Just treat this as 'return;' */
7790 if (VOID_TYPE_P (functype
))
7791 return error_mark_node
;
7793 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7794 treated as an rvalue for the purposes of overload resolution to
7795 favor move constructors over copy constructors.
7797 Note that these conditions are similar to, but not as strict as,
7798 the conditions for the named return value optimization. */
7799 if ((cxx_dialect
!= cxx98
)
7800 && (TREE_CODE (retval
) == VAR_DECL
7801 || TREE_CODE (retval
) == PARM_DECL
)
7802 && DECL_CONTEXT (retval
) == current_function_decl
7803 && !TREE_STATIC (retval
)
7804 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7806 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7807 /* This is only interesting for class type. */
7808 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7809 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7811 /* First convert the value to the function's return type, then
7812 to the type of return value's location to handle the
7813 case that functype is smaller than the valtype. */
7814 retval
= convert_for_initialization
7815 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
7816 tf_warning_or_error
);
7817 retval
= convert (valtype
, retval
);
7819 /* If the conversion failed, treat this just like `return;'. */
7820 if (retval
== error_mark_node
)
7822 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7823 else if (! cfun
->returns_struct
7824 && TREE_CODE (retval
) == TARGET_EXPR
7825 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7826 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7827 TREE_OPERAND (retval
, 0));
7829 maybe_warn_about_returning_address_of_local (retval
);
7832 /* Actually copy the value returned into the appropriate location. */
7833 if (retval
&& retval
!= result
)
7834 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7840 /* Returns nonzero if the pointer-type FROM can be converted to the
7841 pointer-type TO via a qualification conversion. If CONSTP is -1,
7842 then we return nonzero if the pointers are similar, and the
7843 cv-qualification signature of FROM is a proper subset of that of TO.
7845 If CONSTP is positive, then all outer pointers have been
7849 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7851 bool to_more_cv_qualified
= false;
7852 bool is_opaque_pointer
= false;
7854 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7856 if (TREE_CODE (to
) != TREE_CODE (from
))
7859 if (TREE_CODE (from
) == OFFSET_TYPE
7860 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7861 TYPE_OFFSET_BASETYPE (to
)))
7864 /* Const and volatile mean something different for function types,
7865 so the usual checks are not appropriate. */
7866 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7868 if (!at_least_as_qualified_p (to
, from
))
7871 if (!at_least_as_qualified_p (from
, to
))
7875 to_more_cv_qualified
= true;
7879 constp
&= TYPE_READONLY (to
);
7882 if (TREE_CODE (to
) == VECTOR_TYPE
)
7883 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7885 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
7886 return ((constp
>= 0 || to_more_cv_qualified
)
7887 && (is_opaque_pointer
7888 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
7892 /* When comparing, say, char ** to char const **, this function takes
7893 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7894 types to this function. */
7897 comp_ptr_ttypes (tree to
, tree from
)
7899 return comp_ptr_ttypes_real (to
, from
, 1);
7902 /* Returns true iff FNTYPE is a non-class type that involves
7903 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7904 if a parameter type is ill-formed. */
7907 error_type_p (const_tree type
)
7911 switch (TREE_CODE (type
))
7917 case REFERENCE_TYPE
:
7919 return error_type_p (TREE_TYPE (type
));
7923 if (error_type_p (TREE_TYPE (type
)))
7925 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7926 if (error_type_p (TREE_VALUE (t
)))
7931 if (TYPE_PTRMEMFUNC_P (type
))
7932 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
7940 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7941 type or inheritance-related types, regardless of cv-quals. */
7944 ptr_reasonably_similar (const_tree to
, const_tree from
)
7946 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7948 /* Any target type is similar enough to void. */
7949 if (TREE_CODE (to
) == VOID_TYPE
)
7950 return !error_type_p (from
);
7951 if (TREE_CODE (from
) == VOID_TYPE
)
7952 return !error_type_p (to
);
7954 if (TREE_CODE (to
) != TREE_CODE (from
))
7957 if (TREE_CODE (from
) == OFFSET_TYPE
7958 && comptypes (TYPE_OFFSET_BASETYPE (to
),
7959 TYPE_OFFSET_BASETYPE (from
),
7960 COMPARE_BASE
| COMPARE_DERIVED
))
7963 if (TREE_CODE (to
) == VECTOR_TYPE
7964 && vector_types_convertible_p (to
, from
, false))
7967 if (TREE_CODE (to
) == INTEGER_TYPE
7968 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
7971 if (TREE_CODE (to
) == FUNCTION_TYPE
)
7972 return !error_type_p (to
) && !error_type_p (from
);
7974 if (TREE_CODE (to
) != POINTER_TYPE
)
7976 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
7977 COMPARE_BASE
| COMPARE_DERIVED
);
7981 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
7982 pointer-to-member types) are the same, ignoring cv-qualification at
7986 comp_ptr_ttypes_const (tree to
, tree from
)
7988 bool is_opaque_pointer
= false;
7990 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7992 if (TREE_CODE (to
) != TREE_CODE (from
))
7995 if (TREE_CODE (from
) == OFFSET_TYPE
7996 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
7997 TYPE_OFFSET_BASETYPE (to
)))
8000 if (TREE_CODE (to
) == VECTOR_TYPE
)
8001 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
8003 if (TREE_CODE (to
) != POINTER_TYPE
)
8004 return (is_opaque_pointer
8005 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
8009 /* Returns the type qualifiers for this type, including the qualifiers on the
8010 elements for an array type. */
8013 cp_type_quals (const_tree type
)
8016 /* This CONST_CAST is okay because strip_array_types returns its
8017 argument unmodified and we assign it to a const_tree. */
8018 type
= strip_array_types (CONST_CAST_TREE (type
));
8019 if (type
== error_mark_node
8020 /* Quals on a FUNCTION_TYPE are memfn quals. */
8021 || TREE_CODE (type
) == FUNCTION_TYPE
)
8022 return TYPE_UNQUALIFIED
;
8023 quals
= TYPE_QUALS (type
);
8024 /* METHOD and REFERENCE_TYPEs should never have quals. */
8025 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
8026 && TREE_CODE (type
) != REFERENCE_TYPE
)
8027 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
8028 == TYPE_UNQUALIFIED
));
8032 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
8036 type_memfn_quals (const_tree type
)
8038 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8039 return TYPE_QUALS (type
);
8040 else if (TREE_CODE (type
) == METHOD_TYPE
)
8041 return cp_type_quals (class_of_this_parm (type
));
8046 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
8050 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
)
8052 /* Could handle METHOD_TYPE here if necessary. */
8053 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8054 if (TYPE_QUALS (type
) == memfn_quals
)
8056 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
8058 return build_qualified_type (type
, memfn_quals
);
8061 /* Returns nonzero if TYPE is const or volatile. */
8064 cv_qualified_p (const_tree type
)
8066 int quals
= cp_type_quals (type
);
8067 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
8070 /* Returns nonzero if the TYPE contains a mutable member. */
8073 cp_has_mutable_p (const_tree type
)
8075 /* This CONST_CAST is okay because strip_array_types returns its
8076 argument unmodified and we assign it to a const_tree. */
8077 type
= strip_array_types (CONST_CAST_TREE(type
));
8079 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
8082 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
8083 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
8084 approximation. In particular, consider:
8087 struct S { int i; };
8088 const S s = { f(); }
8090 Here, we will make "s" as TREE_READONLY (because it is declared
8091 "const") -- only to reverse ourselves upon seeing that the
8092 initializer is non-constant. */
8095 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
8097 tree type
= TREE_TYPE (decl
);
8099 if (type
== error_mark_node
)
8102 if (TREE_CODE (decl
) == TYPE_DECL
)
8105 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
8106 && type_quals
!= TYPE_UNQUALIFIED
));
8108 /* Avoid setting TREE_READONLY incorrectly. */
8109 if (/* If the object has a constructor, the constructor may modify
8111 TYPE_NEEDS_CONSTRUCTING (type
)
8112 /* If the type isn't complete, we don't know yet if it will need
8114 || !COMPLETE_TYPE_P (type
)
8115 /* If the type has a mutable component, that component might be
8117 || TYPE_HAS_MUTABLE_P (type
))
8118 type_quals
&= ~TYPE_QUAL_CONST
;
8120 c_apply_type_quals_to_decl (type_quals
, decl
);
8123 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8124 exemplar types such that casting T1 to T2 is casting away constness
8125 if and only if there is no implicit conversion from T1 to T2. */
8128 casts_away_constness_r (tree
*t1
, tree
*t2
)
8133 /* [expr.const.cast]
8135 For multi-level pointer to members and multi-level mixed pointers
8136 and pointers to members (conv.qual), the "member" aspect of a
8137 pointer to member level is ignored when determining if a const
8138 cv-qualifier has been cast away. */
8139 /* [expr.const.cast]
8141 For two pointer types:
8143 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8144 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8147 casting from X1 to X2 casts away constness if, for a non-pointer
8148 type T there does not exist an implicit conversion (clause
8151 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8155 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8156 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
8157 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
8159 *t1
= cp_build_qualified_type (void_type_node
,
8160 cp_type_quals (*t1
));
8161 *t2
= cp_build_qualified_type (void_type_node
,
8162 cp_type_quals (*t2
));
8166 quals1
= cp_type_quals (*t1
);
8167 quals2
= cp_type_quals (*t2
);
8169 if (TYPE_PTRMEM_P (*t1
))
8170 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
8172 *t1
= TREE_TYPE (*t1
);
8173 if (TYPE_PTRMEM_P (*t2
))
8174 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
8176 *t2
= TREE_TYPE (*t2
);
8178 casts_away_constness_r (t1
, t2
);
8179 *t1
= build_pointer_type (*t1
);
8180 *t2
= build_pointer_type (*t2
);
8181 *t1
= cp_build_qualified_type (*t1
, quals1
);
8182 *t2
= cp_build_qualified_type (*t2
, quals2
);
8185 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8188 ??? This function returns non-zero if casting away qualifiers not
8189 just const. We would like to return to the caller exactly which
8190 qualifiers are casted away to give more accurate diagnostics.
8194 casts_away_constness (tree t1
, tree t2
)
8196 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
8198 /* [expr.const.cast]
8200 Casting from an lvalue of type T1 to an lvalue of type T2
8201 using a reference cast casts away constness if a cast from an
8202 rvalue of type "pointer to T1" to the type "pointer to T2"
8203 casts away constness. */
8204 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
8205 return casts_away_constness (build_pointer_type (t1
),
8206 build_pointer_type (TREE_TYPE (t2
)));
8209 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
8210 /* [expr.const.cast]
8212 Casting from an rvalue of type "pointer to data member of X
8213 of type T1" to the type "pointer to data member of Y of type
8214 T2" casts away constness if a cast from an rvalue of type
8215 "pointer to T1" to the type "pointer to T2" casts away
8217 return casts_away_constness
8218 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
8219 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
8221 /* Casting away constness is only something that makes sense for
8222 pointer or reference types. */
8223 if (TREE_CODE (t1
) != POINTER_TYPE
8224 || TREE_CODE (t2
) != POINTER_TYPE
)
8227 /* Top-level qualifiers don't matter. */
8228 t1
= TYPE_MAIN_VARIANT (t1
);
8229 t2
= TYPE_MAIN_VARIANT (t2
);
8230 casts_away_constness_r (&t1
, &t2
);
8231 if (!can_convert (t2
, t1
))
8237 /* If T is a REFERENCE_TYPE return the type to which T refers.
8238 Otherwise, return T itself. */
8241 non_reference (tree t
)
8243 if (TREE_CODE (t
) == REFERENCE_TYPE
)
8249 /* Return nonzero if REF is an lvalue valid for this language;
8250 otherwise, print an error message and return zero. USE says
8251 how the lvalue is being used and so selects the error message. */
8254 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
8256 cp_lvalue_kind kind
= lvalue_kind (ref
);
8258 if (kind
== clk_none
)
8260 if (complain
& tf_error
)
8261 lvalue_error (input_location
, use
);
8264 else if (kind
& (clk_rvalueref
|clk_class
))
8266 if (!(complain
& tf_error
))
8268 if (kind
& clk_class
)
8269 /* Make this a permerror because we used to accept it. */
8270 permerror (input_location
, "using temporary as lvalue");
8272 error ("using xvalue (rvalue reference) as lvalue");