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 /* Scoped enums don't promote. */
1957 if (SCOPED_ENUM_P (type
))
1959 promoted_type
= type_promotes_to (type
);
1960 if (type
!= promoted_type
)
1961 expr
= cp_convert (promoted_type
, expr
);
1965 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1966 decay_conversion to one. */
1969 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
1973 if (TREE_CODE (totype
) != POINTER_TYPE
)
1976 t
= TREE_TYPE (totype
);
1977 if (!same_type_p (t
, char_type_node
)
1978 && !same_type_p (t
, char16_type_node
)
1979 && !same_type_p (t
, char32_type_node
)
1980 && !same_type_p (t
, wchar_type_node
))
1983 if (TREE_CODE (exp
) == STRING_CST
)
1985 /* Make sure that we don't try to convert between char and wide chars. */
1986 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
1991 /* Is this a string constant which has decayed to 'const char *'? */
1992 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
1993 if (!same_type_p (TREE_TYPE (exp
), t
))
1996 if (TREE_CODE (exp
) != ADDR_EXPR
1997 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2001 /* This warning is not very useful, as it complains about printf. */
2003 warning (OPT_Wwrite_strings
,
2004 "deprecated conversion from string constant to %qT",
2010 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2011 can, for example, use as an lvalue. This code used to be in
2012 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2013 expressions, where we're dealing with aggregates. But now it's again only
2014 called from unary_complex_lvalue. The case (in particular) that led to
2015 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2019 rationalize_conditional_expr (enum tree_code code
, tree t
,
2020 tsubst_flags_t complain
)
2022 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2023 the first operand is always the one to be used if both operands
2024 are equal, so we know what conditional expression this used to be. */
2025 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2027 tree op0
= TREE_OPERAND (t
, 0);
2028 tree op1
= TREE_OPERAND (t
, 1);
2030 /* The following code is incorrect if either operand side-effects. */
2031 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2032 && !TREE_SIDE_EFFECTS (op1
));
2034 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
2035 ? LE_EXPR
: GE_EXPR
),
2036 op0
, TREE_CODE (op0
),
2037 op1
, TREE_CODE (op1
),
2038 /*overloaded_p=*/NULL
,
2040 cp_build_unary_op (code
, op0
, 0, complain
),
2041 cp_build_unary_op (code
, op1
, 0, complain
),
2046 build_conditional_expr (TREE_OPERAND (t
, 0),
2047 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2049 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2054 /* Given the TYPE of an anonymous union field inside T, return the
2055 FIELD_DECL for the field. If not found return NULL_TREE. Because
2056 anonymous unions can nest, we must also search all anonymous unions
2057 that are directly reachable. */
2060 lookup_anon_field (tree t
, tree type
)
2064 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2066 if (TREE_STATIC (field
))
2068 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2071 /* If we find it directly, return the field. */
2072 if (DECL_NAME (field
) == NULL_TREE
2073 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2078 /* Otherwise, it could be nested, search harder. */
2079 if (DECL_NAME (field
) == NULL_TREE
2080 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2082 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2090 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2091 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2092 non-NULL, it indicates the path to the base used to name MEMBER.
2093 If PRESERVE_REFERENCE is true, the expression returned will have
2094 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2095 returned will have the type referred to by the reference.
2097 This function does not perform access control; that is either done
2098 earlier by the parser when the name of MEMBER is resolved to MEMBER
2099 itself, or later when overload resolution selects one of the
2100 functions indicated by MEMBER. */
2103 build_class_member_access_expr (tree object
, tree member
,
2104 tree access_path
, bool preserve_reference
,
2105 tsubst_flags_t complain
)
2109 tree result
= NULL_TREE
;
2111 if (error_operand_p (object
) || error_operand_p (member
))
2112 return error_mark_node
;
2114 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2118 The type of the first expression shall be "class object" (of a
2120 object_type
= TREE_TYPE (object
);
2121 if (!currently_open_class (object_type
)
2122 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2123 return error_mark_node
;
2124 if (!CLASS_TYPE_P (object_type
))
2126 if (complain
& tf_error
)
2127 error ("request for member %qD in %qE, which is of non-class type %qT",
2128 member
, object
, object_type
);
2129 return error_mark_node
;
2132 /* The standard does not seem to actually say that MEMBER must be a
2133 member of OBJECT_TYPE. However, that is clearly what is
2135 if (DECL_P (member
))
2137 member_scope
= DECL_CLASS_CONTEXT (member
);
2139 if (TREE_DEPRECATED (member
))
2140 warn_deprecated_use (member
, NULL_TREE
);
2143 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2144 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2145 presently be the anonymous union. Go outwards until we find a
2146 type related to OBJECT_TYPE. */
2147 while (ANON_AGGR_TYPE_P (member_scope
)
2148 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2150 member_scope
= TYPE_CONTEXT (member_scope
);
2151 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2153 if (complain
& tf_error
)
2155 if (TREE_CODE (member
) == FIELD_DECL
)
2156 error ("invalid use of nonstatic data member %qE", member
);
2158 error ("%qD is not a member of %qT", member
, object_type
);
2160 return error_mark_node
;
2163 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2164 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2165 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2167 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2169 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2172 /* In [expr.ref], there is an explicit list of the valid choices for
2173 MEMBER. We check for each of those cases here. */
2174 if (TREE_CODE (member
) == VAR_DECL
)
2176 /* A static data member. */
2178 mark_exp_read (object
);
2179 /* If OBJECT has side-effects, they are supposed to occur. */
2180 if (TREE_SIDE_EFFECTS (object
))
2181 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2183 else if (TREE_CODE (member
) == FIELD_DECL
)
2185 /* A non-static data member. */
2190 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
2191 && integer_zerop (TREE_OPERAND (object
, 0)));
2193 /* Convert OBJECT to the type of MEMBER. */
2194 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2195 TYPE_MAIN_VARIANT (member_scope
)))
2200 binfo
= lookup_base (access_path
? access_path
: object_type
,
2201 member_scope
, ba_unique
, &kind
);
2202 if (binfo
== error_mark_node
)
2203 return error_mark_node
;
2205 /* It is invalid to try to get to a virtual base of a
2206 NULL object. The most common cause is invalid use of
2208 if (null_object_p
&& kind
== bk_via_virtual
)
2210 if (complain
& tf_error
)
2212 error ("invalid access to non-static data member %qD of "
2215 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2217 return error_mark_node
;
2220 /* Convert to the base. */
2221 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2223 /* If we found the base successfully then we should be able
2224 to convert to it successfully. */
2225 gcc_assert (object
!= error_mark_node
);
2228 /* Complain about other invalid uses of offsetof, even though they will
2229 give the right answer. Note that we complain whether or not they
2230 actually used the offsetof macro, since there's no way to know at this
2231 point. So we just give a warning, instead of a pedwarn. */
2232 /* Do not produce this warning for base class field references, because
2233 we know for a fact that didn't come from offsetof. This does occur
2234 in various testsuite cases where a null object is passed where a
2235 vtable access is required. */
2236 if (null_object_p
&& warn_invalid_offsetof
2237 && CLASSTYPE_NON_STD_LAYOUT (object_type
)
2238 && !DECL_FIELD_IS_BASE (member
)
2239 && cp_unevaluated_operand
== 0
2240 && (complain
& tf_warning
))
2242 warning (OPT_Winvalid_offsetof
,
2243 "invalid access to non-static data member %qD "
2244 " of NULL object", member
);
2245 warning (OPT_Winvalid_offsetof
,
2246 "(perhaps the %<offsetof%> macro was used incorrectly)");
2249 /* If MEMBER is from an anonymous aggregate, we have converted
2250 OBJECT so that it refers to the class containing the
2251 anonymous union. Generate a reference to the anonymous union
2252 itself, and recur to find MEMBER. */
2253 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2254 /* When this code is called from build_field_call, the
2255 object already has the type of the anonymous union.
2256 That is because the COMPONENT_REF was already
2257 constructed, and was then disassembled before calling
2258 build_field_call. After the function-call code is
2259 cleaned up, this waste can be eliminated. */
2260 && (!same_type_ignoring_top_level_qualifiers_p
2261 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2263 tree anonymous_union
;
2265 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2266 DECL_CONTEXT (member
));
2267 object
= build_class_member_access_expr (object
,
2269 /*access_path=*/NULL_TREE
,
2274 /* Compute the type of the field, as described in [expr.ref]. */
2275 type_quals
= TYPE_UNQUALIFIED
;
2276 member_type
= TREE_TYPE (member
);
2277 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2279 type_quals
= (cp_type_quals (member_type
)
2280 | cp_type_quals (object_type
));
2282 /* A field is const (volatile) if the enclosing object, or the
2283 field itself, is const (volatile). But, a mutable field is
2284 not const, even within a const object. */
2285 if (DECL_MUTABLE_P (member
))
2286 type_quals
&= ~TYPE_QUAL_CONST
;
2287 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2290 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
2292 result
= fold_if_not_in_template (result
);
2294 /* Mark the expression const or volatile, as appropriate. Even
2295 though we've dealt with the type above, we still have to mark the
2296 expression itself. */
2297 if (type_quals
& TYPE_QUAL_CONST
)
2298 TREE_READONLY (result
) = 1;
2299 if (type_quals
& TYPE_QUAL_VOLATILE
)
2300 TREE_THIS_VOLATILE (result
) = 1;
2302 else if (BASELINK_P (member
))
2304 /* The member is a (possibly overloaded) member function. */
2308 /* If the MEMBER is exactly one static member function, then we
2309 know the type of the expression. Otherwise, we must wait
2310 until overload resolution has been performed. */
2311 functions
= BASELINK_FUNCTIONS (member
);
2312 if (TREE_CODE (functions
) == FUNCTION_DECL
2313 && DECL_STATIC_FUNCTION_P (functions
))
2314 type
= TREE_TYPE (functions
);
2316 type
= unknown_type_node
;
2317 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2318 base. That will happen when the function is called. */
2319 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2321 else if (TREE_CODE (member
) == CONST_DECL
)
2323 /* The member is an enumerator. */
2325 /* If OBJECT has side-effects, they are supposed to occur. */
2326 if (TREE_SIDE_EFFECTS (object
))
2327 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2332 if (complain
& tf_error
)
2333 error ("invalid use of %qD", member
);
2334 return error_mark_node
;
2337 if (!preserve_reference
)
2340 If E2 is declared to have type "reference to T", then ... the
2341 type of E1.E2 is T. */
2342 result
= convert_from_reference (result
);
2347 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2348 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2351 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2353 tree object_type
= TREE_TYPE (object
);
2354 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2357 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2359 error ("qualified type %qT does not match destructor name ~%qT",
2361 return error_mark_node
;
2363 if (TREE_CODE (dtor_type
) == IDENTIFIER_NODE
)
2365 /* In a template, names we can't find a match for are still accepted
2366 destructor names, and we check them here. */
2367 if (check_dtor_name (object_type
, dtor_type
))
2368 dtor_type
= object_type
;
2371 error ("object type %qT does not match destructor name ~%qT",
2372 object_type
, dtor_type
);
2373 return error_mark_node
;
2377 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2379 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2380 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2381 return error_mark_node
;
2383 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2384 /*protect=*/1, /*want_type=*/false);
2385 expr
= (adjust_result_of_qualified_name_lookup
2386 (expr
, dtor_type
, object_type
));
2390 /* An expression of the form "A::template B" has been resolved to
2391 DECL. Issue a diagnostic if B is not a template or template
2395 check_template_keyword (tree decl
)
2397 /* The standard says:
2401 If a name prefixed by the keyword template is not a member
2402 template, the program is ill-formed.
2404 DR 228 removed the restriction that the template be a member
2407 DR 96, if accepted would add the further restriction that explicit
2408 template arguments must be provided if the template keyword is
2409 used, but, as of 2005-10-16, that DR is still in "drafting". If
2410 this DR is accepted, then the semantic checks here can be
2411 simplified, as the entity named must in fact be a template
2412 specialization, rather than, as at present, a set of overloaded
2413 functions containing at least one template function. */
2414 if (TREE_CODE (decl
) != TEMPLATE_DECL
2415 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2417 if (!is_overloaded_fn (decl
))
2418 permerror (input_location
, "%qD is not a template", decl
);
2423 if (BASELINK_P (fns
))
2424 fns
= BASELINK_FUNCTIONS (fns
);
2427 tree fn
= OVL_CURRENT (fns
);
2428 if (TREE_CODE (fn
) == TEMPLATE_DECL
2429 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2431 if (TREE_CODE (fn
) == FUNCTION_DECL
2432 && DECL_USE_TEMPLATE (fn
)
2433 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2435 fns
= OVL_NEXT (fns
);
2438 permerror (input_location
, "%qD is not a template", decl
);
2443 /* This function is called by the parser to process a class member
2444 access expression of the form OBJECT.NAME. NAME is a node used by
2445 the parser to represent a name; it is not yet a DECL. It may,
2446 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2447 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2448 there is no reason to do the lookup twice, so the parser keeps the
2449 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2450 be a template via the use of the "A::template B" syntax. */
2453 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2454 tsubst_flags_t complain
)
2459 tree access_path
= NULL_TREE
;
2460 tree orig_object
= object
;
2461 tree orig_name
= name
;
2463 if (object
== error_mark_node
|| name
== error_mark_node
)
2464 return error_mark_node
;
2466 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2467 if (!objc_is_public (object
, name
))
2468 return error_mark_node
;
2470 object_type
= TREE_TYPE (object
);
2472 if (processing_template_decl
)
2474 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2475 dependent_type_p (object_type
)
2476 /* If NAME is just an IDENTIFIER_NODE, then the expression
2478 || TREE_CODE (object
) == IDENTIFIER_NODE
2479 /* If NAME is "f<args>", where either 'f' or 'args' is
2480 dependent, then the expression is dependent. */
2481 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2482 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2483 TREE_OPERAND (name
, 1)))
2484 /* If NAME is "T::X" where "T" is dependent, then the
2485 expression is dependent. */
2486 || (TREE_CODE (name
) == SCOPE_REF
2487 && TYPE_P (TREE_OPERAND (name
, 0))
2488 && dependent_type_p (TREE_OPERAND (name
, 0))))
2489 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2490 object
= build_non_dependent_expr (object
);
2492 else if (c_dialect_objc ()
2493 && TREE_CODE (name
) == IDENTIFIER_NODE
2494 && (expr
= objc_maybe_build_component_ref (object
, name
)))
2499 The type of the first expression shall be "class object" (of a
2501 if (!currently_open_class (object_type
)
2502 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2503 return error_mark_node
;
2504 if (!CLASS_TYPE_P (object_type
))
2506 if (complain
& tf_error
)
2507 error ("request for member %qD in %qE, which is of non-class type %qT",
2508 name
, object
, object_type
);
2509 return error_mark_node
;
2512 if (BASELINK_P (name
))
2513 /* A member function that has already been looked up. */
2517 bool is_template_id
= false;
2518 tree template_args
= NULL_TREE
;
2521 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2523 is_template_id
= true;
2524 template_args
= TREE_OPERAND (name
, 1);
2525 name
= TREE_OPERAND (name
, 0);
2527 if (TREE_CODE (name
) == OVERLOAD
)
2528 name
= DECL_NAME (get_first_fn (name
));
2529 else if (DECL_P (name
))
2530 name
= DECL_NAME (name
);
2533 if (TREE_CODE (name
) == SCOPE_REF
)
2535 /* A qualified name. The qualifying class or namespace `S'
2536 has already been looked up; it is either a TYPE or a
2538 scope
= TREE_OPERAND (name
, 0);
2539 name
= TREE_OPERAND (name
, 1);
2541 /* If SCOPE is a namespace, then the qualified name does not
2542 name a member of OBJECT_TYPE. */
2543 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2545 if (complain
& tf_error
)
2546 error ("%<%D::%D%> is not a member of %qT",
2547 scope
, name
, object_type
);
2548 return error_mark_node
;
2551 gcc_assert (CLASS_TYPE_P (scope
));
2552 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2553 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2555 if (constructor_name_p (name
, scope
))
2557 if (complain
& tf_error
)
2558 error ("cannot call constructor %<%T::%D%> directly",
2560 return error_mark_node
;
2563 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2564 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2565 if (access_path
== error_mark_node
)
2566 return error_mark_node
;
2569 if (complain
& tf_error
)
2570 error ("%qT is not a base of %qT", scope
, object_type
);
2571 return error_mark_node
;
2577 access_path
= object_type
;
2580 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2581 member
= lookup_destructor (object
, scope
, name
);
2584 /* Look up the member. */
2585 member
= lookup_member (access_path
, name
, /*protect=*/1,
2586 /*want_type=*/false);
2587 if (member
== NULL_TREE
)
2589 if (complain
& tf_error
)
2590 error ("%qD has no member named %qE", object_type
, name
);
2591 return error_mark_node
;
2593 if (member
== error_mark_node
)
2594 return error_mark_node
;
2599 tree templ
= member
;
2601 if (BASELINK_P (templ
))
2602 templ
= lookup_template_function (templ
, template_args
);
2605 if (complain
& tf_error
)
2606 error ("%qD is not a member template function", name
);
2607 return error_mark_node
;
2612 if (TREE_DEPRECATED (member
))
2613 warn_deprecated_use (member
, NULL_TREE
);
2616 check_template_keyword (member
);
2618 expr
= build_class_member_access_expr (object
, member
, access_path
,
2619 /*preserve_reference=*/false,
2621 if (processing_template_decl
&& expr
!= error_mark_node
)
2623 if (BASELINK_P (member
))
2625 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2626 BASELINK_QUALIFIED_P (member
) = 1;
2629 return build_min_non_dep (COMPONENT_REF
, expr
,
2630 orig_object
, orig_name
,
2637 /* Return an expression for the MEMBER_NAME field in the internal
2638 representation of PTRMEM, a pointer-to-member function. (Each
2639 pointer-to-member function type gets its own RECORD_TYPE so it is
2640 more convenient to access the fields by name than by FIELD_DECL.)
2641 This routine converts the NAME to a FIELD_DECL and then creates the
2642 node for the complete expression. */
2645 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2651 /* This code is a stripped down version of
2652 build_class_member_access_expr. It does not work to use that
2653 routine directly because it expects the object to be of class
2655 ptrmem_type
= TREE_TYPE (ptrmem
);
2656 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2657 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2658 /*want_type=*/false);
2659 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2660 cp_type_quals (ptrmem_type
));
2661 return fold_build3_loc (input_location
,
2662 COMPONENT_REF
, member_type
,
2663 ptrmem
, member
, NULL_TREE
);
2666 /* Given an expression PTR for a pointer, return an expression
2667 for the value pointed to.
2668 ERRORSTRING is the name of the operator to appear in error messages.
2670 This function may need to overload OPERATOR_FNNAME.
2671 Must also handle REFERENCE_TYPEs for C++. */
2674 build_x_indirect_ref (tree expr
, ref_operator errorstring
,
2675 tsubst_flags_t complain
)
2677 tree orig_expr
= expr
;
2680 if (processing_template_decl
)
2682 /* Retain the type if we know the operand is a pointer so that
2683 describable_type doesn't make auto deduction break. */
2684 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2685 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2686 if (type_dependent_expression_p (expr
))
2687 return build_min_nt (INDIRECT_REF
, expr
);
2688 expr
= build_non_dependent_expr (expr
);
2691 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2692 NULL_TREE
, /*overloaded_p=*/NULL
, complain
);
2694 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2696 if (processing_template_decl
&& rval
!= error_mark_node
)
2697 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2702 /* Helper function called from c-common. */
2704 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2705 tree ptr
, ref_operator errorstring
)
2707 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2711 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2712 tsubst_flags_t complain
)
2716 if (ptr
== error_mark_node
)
2717 return error_mark_node
;
2719 if (ptr
== current_class_ptr
)
2720 return current_class_ref
;
2722 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2723 ? ptr
: decay_conversion (ptr
));
2724 type
= TREE_TYPE (pointer
);
2726 if (POINTER_TYPE_P (type
))
2730 If the type of the expression is "pointer to T," the type
2731 of the result is "T." */
2732 tree t
= TREE_TYPE (type
);
2734 if (CONVERT_EXPR_P (ptr
)
2735 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2737 /* If a warning is issued, mark it to avoid duplicates from
2738 the backend. This only needs to be done at
2739 warn_strict_aliasing > 2. */
2740 if (warn_strict_aliasing
> 2)
2741 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2742 type
, TREE_OPERAND (ptr
, 0)))
2743 TREE_NO_WARNING (ptr
) = 1;
2746 if (VOID_TYPE_P (t
))
2748 /* A pointer to incomplete type (other than cv void) can be
2749 dereferenced [expr.unary.op]/1 */
2750 if (complain
& tf_error
)
2751 error ("%qT is not a pointer-to-object type", type
);
2752 return error_mark_node
;
2754 else if (TREE_CODE (pointer
) == ADDR_EXPR
2755 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2756 /* The POINTER was something like `&x'. We simplify `*&x' to
2758 return TREE_OPERAND (pointer
, 0);
2761 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2763 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2764 so that we get the proper error message if the result is used
2765 to assign to. Also, &* is supposed to be a no-op. */
2766 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2767 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2768 TREE_SIDE_EFFECTS (ref
)
2769 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2773 else if (!(complain
& tf_error
))
2774 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2776 /* `pointer' won't be an error_mark_node if we were given a
2777 pointer to member, so it's cool to check for this here. */
2778 else if (TYPE_PTR_TO_MEMBER_P (type
))
2779 switch (errorstring
)
2781 case RO_ARRAY_INDEXING
:
2782 error ("invalid use of array indexing on pointer to member");
2785 error ("invalid use of unary %<*%> on pointer to member");
2787 case RO_IMPLICIT_CONVERSION
:
2788 error ("invalid use of implicit conversion on pointer to member");
2793 else if (pointer
!= error_mark_node
)
2794 invalid_indirection_error (input_location
, type
, errorstring
);
2796 return error_mark_node
;
2799 /* This handles expressions of the form "a[i]", which denotes
2802 This is logically equivalent in C to *(a+i), but we may do it differently.
2803 If A is a variable or a member, we generate a primitive ARRAY_REF.
2804 This avoids forcing the array out of registers, and can work on
2805 arrays that are not lvalues (for example, members of structures returned
2808 If INDEX is of some user-defined type, it must be converted to
2809 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2810 will inherit the type of the array, which will be some pointer type.
2812 LOC is the location to use in building the array reference. */
2815 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
2816 tsubst_flags_t complain
)
2822 if (complain
& tf_error
)
2823 error_at (loc
, "subscript missing in array reference");
2824 return error_mark_node
;
2827 if (TREE_TYPE (array
) == error_mark_node
2828 || TREE_TYPE (idx
) == error_mark_node
)
2829 return error_mark_node
;
2831 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2833 switch (TREE_CODE (array
))
2837 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2839 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2840 TREE_OPERAND (array
, 0), value
);
2841 SET_EXPR_LOCATION (ret
, loc
);
2846 ret
= build_conditional_expr
2847 (TREE_OPERAND (array
, 0),
2848 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2850 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
2852 tf_warning_or_error
);
2853 protected_set_expr_location (ret
, loc
);
2860 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2864 warn_array_subscript_with_type_char (idx
);
2866 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2868 if (complain
& tf_error
)
2869 error_at (loc
, "array subscript is not an integer");
2870 return error_mark_node
;
2873 /* Apply integral promotions *after* noticing character types.
2874 (It is unclear why we do these promotions -- the standard
2875 does not say that we should. In fact, the natural thing would
2876 seem to be to convert IDX to ptrdiff_t; we're performing
2877 pointer arithmetic.) */
2878 idx
= perform_integral_promotions (idx
);
2880 /* An array that is indexed by a non-constant
2881 cannot be stored in a register; we must be able to do
2882 address arithmetic on its address.
2883 Likewise an array of elements of variable size. */
2884 if (TREE_CODE (idx
) != INTEGER_CST
2885 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2886 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2889 if (!cxx_mark_addressable (array
))
2890 return error_mark_node
;
2893 /* An array that is indexed by a constant value which is not within
2894 the array bounds cannot be stored in a register either; because we
2895 would get a crash in store_bit_field/extract_bit_field when trying
2896 to access a non-existent part of the register. */
2897 if (TREE_CODE (idx
) == INTEGER_CST
2898 && TYPE_DOMAIN (TREE_TYPE (array
))
2899 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
2901 if (!cxx_mark_addressable (array
))
2902 return error_mark_node
;
2905 if (!lvalue_p (array
) && (complain
& tf_error
))
2906 pedwarn (loc
, OPT_pedantic
,
2907 "ISO C++ forbids subscripting non-lvalue array");
2909 /* Note in C++ it is valid to subscript a `register' array, since
2910 it is valid to take the address of something with that
2911 storage specification. */
2915 while (TREE_CODE (foo
) == COMPONENT_REF
)
2916 foo
= TREE_OPERAND (foo
, 0);
2917 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
)
2918 && (complain
& tf_warning
))
2919 warning_at (loc
, OPT_Wextra
,
2920 "subscripting array declared %<register%>");
2923 type
= TREE_TYPE (TREE_TYPE (array
));
2924 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
2925 /* Array ref is const/volatile if the array elements are
2926 or if the array is.. */
2927 TREE_READONLY (rval
)
2928 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
2929 TREE_SIDE_EFFECTS (rval
)
2930 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
2931 TREE_THIS_VOLATILE (rval
)
2932 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
2933 ret
= require_complete_type_sfinae (fold_if_not_in_template (rval
),
2935 protected_set_expr_location (ret
, loc
);
2940 tree ar
= default_conversion (array
);
2941 tree ind
= default_conversion (idx
);
2943 /* Put the integer in IND to simplify error checking. */
2944 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
2951 if (ar
== error_mark_node
)
2954 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
2956 if (complain
& tf_error
)
2957 error_at (loc
, "subscripted value is neither array nor pointer");
2958 return error_mark_node
;
2960 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
2962 if (complain
& tf_error
)
2963 error_at (loc
, "array subscript is not an integer");
2964 return error_mark_node
;
2967 warn_array_subscript_with_type_char (idx
);
2969 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
2974 protected_set_expr_location (ret
, loc
);
2979 /* Entry point for Obj-C++. */
2982 build_array_ref (location_t loc
, tree array
, tree idx
)
2984 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
2987 /* Resolve a pointer to member function. INSTANCE is the object
2988 instance to use, if the member points to a virtual member.
2990 This used to avoid checking for virtual functions if basetype
2991 has no virtual functions, according to an earlier ANSI draft.
2992 With the final ISO C++ rules, such an optimization is
2993 incorrect: A pointer to a derived member can be static_cast
2994 to pointer-to-base-member, as long as the dynamic object
2995 later has the right member. */
2998 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
3000 if (TREE_CODE (function
) == OFFSET_REF
)
3001 function
= TREE_OPERAND (function
, 1);
3003 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3005 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
3006 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3008 tree instance_ptr
= *instance_ptrptr
;
3009 tree instance_save_expr
= 0;
3010 if (instance_ptr
== error_mark_node
)
3012 if (TREE_CODE (function
) == PTRMEM_CST
)
3014 /* Extracting the function address from a pmf is only
3015 allowed with -Wno-pmf-conversions. It only works for
3017 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
3018 e1
= convert (fntype
, e1
);
3023 error ("object missing in use of %qE", function
);
3024 return error_mark_node
;
3028 if (TREE_SIDE_EFFECTS (instance_ptr
))
3029 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3031 if (TREE_SIDE_EFFECTS (function
))
3032 function
= save_expr (function
);
3034 /* Start by extracting all the information from the PMF itself. */
3035 e3
= pfn_from_ptrmemfunc (function
);
3036 delta
= delta_from_ptrmemfunc (function
);
3037 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3038 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3040 case ptrmemfunc_vbit_in_pfn
:
3041 e1
= cp_build_binary_op (input_location
,
3042 BIT_AND_EXPR
, idx
, integer_one_node
,
3043 tf_warning_or_error
);
3044 idx
= cp_build_binary_op (input_location
,
3045 MINUS_EXPR
, idx
, integer_one_node
,
3046 tf_warning_or_error
);
3049 case ptrmemfunc_vbit_in_delta
:
3050 e1
= cp_build_binary_op (input_location
,
3051 BIT_AND_EXPR
, delta
, integer_one_node
,
3052 tf_warning_or_error
);
3053 delta
= cp_build_binary_op (input_location
,
3054 RSHIFT_EXPR
, delta
, integer_one_node
,
3055 tf_warning_or_error
);
3062 /* Convert down to the right base before using the instance. A
3063 special case is that in a pointer to member of class C, C may
3064 be incomplete. In that case, the function will of course be
3065 a member of C, and no conversion is required. In fact,
3066 lookup_base will fail in that case, because incomplete
3067 classes do not have BINFOs. */
3068 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3069 if (!same_type_ignoring_top_level_qualifiers_p
3070 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3072 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3073 basetype
, ba_check
, NULL
);
3074 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3076 if (instance_ptr
== error_mark_node
)
3077 return error_mark_node
;
3079 /* ...and then the delta in the PMF. */
3080 instance_ptr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (instance_ptr
),
3081 instance_ptr
, fold_convert (sizetype
, delta
));
3083 /* Hand back the adjusted 'this' argument to our caller. */
3084 *instance_ptrptr
= instance_ptr
;
3086 /* Next extract the vtable pointer from the object. */
3087 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3089 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, tf_warning_or_error
);
3090 /* If the object is not dynamic the access invokes undefined
3091 behavior. As it is not executed in this case silence the
3092 spurious warnings it may provoke. */
3093 TREE_NO_WARNING (vtbl
) = 1;
3095 /* Finally, extract the function pointer from the vtable. */
3096 e2
= fold_build2_loc (input_location
,
3097 POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
,
3098 fold_convert (sizetype
, idx
));
3099 e2
= cp_build_indirect_ref (e2
, RO_NULL
, tf_warning_or_error
);
3100 TREE_CONSTANT (e2
) = 1;
3102 /* When using function descriptors, the address of the
3103 vtable entry is treated as a function pointer. */
3104 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3105 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3106 cp_build_addr_expr (e2
, tf_warning_or_error
));
3108 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3109 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
3111 /* Make sure this doesn't get evaluated first inside one of the
3112 branches of the COND_EXPR. */
3113 if (instance_save_expr
)
3114 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3115 instance_save_expr
, e1
);
3122 /* Used by the C-common bits. */
3124 build_function_call (location_t loc ATTRIBUTE_UNUSED
,
3125 tree function
, tree params
)
3127 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3130 /* Used by the C-common bits. */
3132 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED
,
3133 tree function
, VEC(tree
,gc
) *params
,
3134 VEC(tree
,gc
) *origtypes ATTRIBUTE_UNUSED
)
3136 VEC(tree
,gc
) *orig_params
= params
;
3137 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3138 tf_warning_or_error
);
3140 /* cp_build_function_call_vec can reallocate PARAMS by adding
3141 default arguments. That should never happen here. Verify
3143 gcc_assert (params
== orig_params
);
3148 /* Build a function call using a tree list of arguments. */
3151 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3156 vec
= make_tree_vector ();
3157 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3158 VEC_safe_push (tree
, gc
, vec
, TREE_VALUE (params
));
3159 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3160 release_tree_vector (vec
);
3164 /* Build a function call using varargs. */
3167 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3173 vec
= make_tree_vector ();
3174 va_start (args
, complain
);
3175 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3176 VEC_safe_push (tree
, gc
, vec
, t
);
3178 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3179 release_tree_vector (vec
);
3183 /* Build a function call using a vector of arguments. PARAMS may be
3184 NULL if there are no parameters. This changes the contents of
3188 cp_build_function_call_vec (tree function
, VEC(tree
,gc
) **params
,
3189 tsubst_flags_t complain
)
3191 tree fntype
, fndecl
;
3193 tree original
= function
;
3197 VEC(tree
,gc
) *allocated
= NULL
;
3200 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3201 expressions, like those used for ObjC messenger dispatches. */
3202 if (params
!= NULL
&& !VEC_empty (tree
, *params
))
3203 function
= objc_rewrite_function_call (function
,
3204 VEC_index (tree
, *params
, 0));
3206 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3207 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3208 if (TREE_CODE (function
) == NOP_EXPR
3209 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3210 function
= TREE_OPERAND (function
, 0);
3212 if (TREE_CODE (function
) == FUNCTION_DECL
)
3214 mark_used (function
);
3217 /* Convert anything with function type to a pointer-to-function. */
3218 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
3219 pedwarn (input_location
, OPT_pedantic
,
3220 "ISO C++ forbids calling %<::main%> from within program");
3222 function
= build_addr_func (function
);
3228 function
= build_addr_func (function
);
3231 if (function
== error_mark_node
)
3232 return error_mark_node
;
3234 fntype
= TREE_TYPE (function
);
3236 if (TYPE_PTRMEMFUNC_P (fntype
))
3238 if (complain
& tf_error
)
3239 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3240 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3241 original
, original
);
3242 return error_mark_node
;
3245 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
3246 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3248 if (!((TREE_CODE (fntype
) == POINTER_TYPE
3249 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
3251 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3253 if (complain
& tf_error
)
3254 error ("%qE cannot be used as a function", original
);
3255 return error_mark_node
;
3258 /* fntype now gets the type of function pointed to. */
3259 fntype
= TREE_TYPE (fntype
);
3260 parm_types
= TYPE_ARG_TYPES (fntype
);
3264 allocated
= make_tree_vector ();
3265 params
= &allocated
;
3268 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3271 return error_mark_node
;
3273 argarray
= VEC_address (tree
, *params
);
3275 /* Check for errors in format strings and inappropriately
3277 check_function_arguments (fntype
, nargs
, argarray
);
3279 ret
= build_cxx_call (function
, nargs
, argarray
);
3281 if (allocated
!= NULL
)
3282 release_tree_vector (allocated
);
3287 /* Subroutine of convert_arguments.
3288 Warn about wrong number of args are genereted. */
3291 warn_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3295 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3297 if (DECL_NAME (fndecl
) == NULL_TREE
3298 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3301 ? G_("too many arguments to constructor %q#D")
3302 : G_("too few arguments to constructor %q#D"),
3307 ? G_("too many arguments to member function %q#D")
3308 : G_("too few arguments to member function %q#D"),
3314 ? G_("too many arguments to function %q#D")
3315 : G_("too few arguments to function %q#D"),
3317 inform (DECL_SOURCE_LOCATION (fndecl
),
3322 if (c_dialect_objc () && objc_message_selector ())
3325 ? G_("too many arguments to method %q#D")
3326 : G_("too few arguments to method %q#D"),
3327 objc_message_selector ());
3329 error_at (loc
, too_many_p
? G_("too many arguments to function")
3330 : G_("too few arguments to function"));
3334 /* Convert the actual parameter expressions in the list VALUES to the
3335 types in the list TYPELIST. The converted expressions are stored
3336 back in the VALUES vector.
3337 If parmdecls is exhausted, or when an element has NULL as its type,
3338 perform the default conversions.
3340 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3342 This is also where warnings about wrong number of args are generated.
3344 Returns the actual number of arguments processed (which might be less
3345 than the length of the vector), or -1 on error.
3347 In C++, unspecified trailing parameters can be filled in with their
3348 default arguments, if such were specified. Do so here. */
3351 convert_arguments (tree typelist
, VEC(tree
,gc
) **values
, tree fndecl
,
3352 int flags
, tsubst_flags_t complain
)
3357 /* Argument passing is always copy-initialization. */
3358 flags
|= LOOKUP_ONLYCONVERTING
;
3360 for (i
= 0, typetail
= typelist
;
3361 i
< VEC_length (tree
, *values
);
3364 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3365 tree val
= VEC_index (tree
, *values
, i
);
3367 if (val
== error_mark_node
|| type
== error_mark_node
)
3370 if (type
== void_type_node
)
3372 if (complain
& tf_error
)
3374 warn_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3381 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3382 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3383 if (TREE_CODE (val
) == NOP_EXPR
3384 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3385 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3386 val
= TREE_OPERAND (val
, 0);
3388 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3390 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3391 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3392 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3393 val
= decay_conversion (val
);
3396 if (val
== error_mark_node
)
3401 /* Formal parm type is specified by a function prototype. */
3404 if (!COMPLETE_TYPE_P (complete_type (type
)))
3406 if (complain
& tf_error
)
3409 error ("parameter %P of %qD has incomplete type %qT",
3412 error ("parameter %P has incomplete type %qT", i
, type
);
3414 parmval
= error_mark_node
;
3418 parmval
= convert_for_initialization
3419 (NULL_TREE
, type
, val
, flags
,
3420 ICR_ARGPASS
, fndecl
, i
, complain
);
3421 parmval
= convert_for_arg_passing (type
, parmval
);
3424 if (parmval
== error_mark_node
)
3427 VEC_replace (tree
, *values
, i
, parmval
);
3431 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3432 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3433 /* Don't do ellipsis conversion for __built_in_constant_p
3434 as this will result in spurious errors for non-trivial
3436 val
= require_complete_type_sfinae (val
, complain
);
3438 val
= convert_arg_to_ellipsis (val
);
3440 VEC_replace (tree
, *values
, i
, val
);
3444 typetail
= TREE_CHAIN (typetail
);
3447 if (typetail
!= 0 && typetail
!= void_list_node
)
3449 /* See if there are default arguments that can be used. Because
3450 we hold default arguments in the FUNCTION_TYPE (which is so
3451 wrong), we can see default parameters here from deduced
3452 contexts (and via typeof) for indirect function calls.
3453 Fortunately we know whether we have a function decl to
3454 provide default arguments in a language conformant
3456 if (fndecl
&& TREE_PURPOSE (typetail
)
3457 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3459 for (; typetail
!= void_list_node
; ++i
)
3462 = convert_default_arg (TREE_VALUE (typetail
),
3463 TREE_PURPOSE (typetail
),
3466 if (parmval
== error_mark_node
)
3469 VEC_safe_push (tree
, gc
, *values
, parmval
);
3470 typetail
= TREE_CHAIN (typetail
);
3471 /* ends with `...'. */
3472 if (typetail
== NULL_TREE
)
3478 if (complain
& tf_error
)
3479 warn_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3487 /* Build a binary-operation expression, after performing default
3488 conversions on the operands. CODE is the kind of expression to
3489 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3490 are the tree codes which correspond to ARG1 and ARG2 when issuing
3491 warnings about possibly misplaced parentheses. They may differ
3492 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3493 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3494 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3495 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3496 ARG2_CODE as ERROR_MARK. */
3499 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3500 tree arg2
, enum tree_code arg2_code
, bool *overloaded_p
,
3501 tsubst_flags_t complain
)
3510 if (processing_template_decl
)
3512 if (type_dependent_expression_p (arg1
)
3513 || type_dependent_expression_p (arg2
))
3514 return build_min_nt (code
, arg1
, arg2
);
3515 arg1
= build_non_dependent_expr (arg1
);
3516 arg2
= build_non_dependent_expr (arg2
);
3519 if (code
== DOTSTAR_EXPR
)
3520 expr
= build_m_component_ref (arg1
, arg2
);
3522 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3523 overloaded_p
, complain
);
3525 /* Check for cases such as x+y<<z which users are likely to
3526 misinterpret. But don't warn about obj << x + y, since that is a
3527 common idiom for I/O. */
3528 if (warn_parentheses
3529 && (complain
& tf_warning
)
3530 && !processing_template_decl
3531 && !error_operand_p (arg1
)
3532 && !error_operand_p (arg2
)
3533 && (code
!= LSHIFT_EXPR
3534 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3535 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3537 if (processing_template_decl
&& expr
!= error_mark_node
)
3538 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3543 /* Build and return an ARRAY_REF expression. */
3546 build_x_array_ref (tree arg1
, tree arg2
, tsubst_flags_t complain
)
3548 tree orig_arg1
= arg1
;
3549 tree orig_arg2
= arg2
;
3552 if (processing_template_decl
)
3554 if (type_dependent_expression_p (arg1
)
3555 || type_dependent_expression_p (arg2
))
3556 return build_min_nt (ARRAY_REF
, arg1
, arg2
,
3557 NULL_TREE
, NULL_TREE
);
3558 arg1
= build_non_dependent_expr (arg1
);
3559 arg2
= build_non_dependent_expr (arg2
);
3562 expr
= build_new_op (ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3563 /*overloaded_p=*/NULL
, complain
);
3565 if (processing_template_decl
&& expr
!= error_mark_node
)
3566 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3567 NULL_TREE
, NULL_TREE
);
3571 /* For the c-common bits. */
3573 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3574 int convert_p ATTRIBUTE_UNUSED
)
3576 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3580 /* Build a binary-operation expression without default conversions.
3581 CODE is the kind of expression to build.
3582 LOCATION is the location_t of the operator in the source code.
3583 This function differs from `build' in several ways:
3584 the data type of the result is computed and recorded in it,
3585 warnings are generated if arg data types are invalid,
3586 special handling for addition and subtraction of pointers is known,
3587 and some optimization is done (operations on narrow ints
3588 are done in the narrower type when that gives the same result).
3589 Constant folding is also done before the result is returned.
3591 Note that the operands will never have enumeral types
3592 because either they have just had the default conversions performed
3593 or they have both just been converted to some other type in which
3594 the arithmetic is to be done.
3596 C++: must do special pointer arithmetic when implementing
3597 multiple inheritance, and deal with pointer to member functions. */
3600 cp_build_binary_op (location_t location
,
3601 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3602 tsubst_flags_t complain
)
3605 enum tree_code code0
, code1
;
3607 const char *invalid_op_diag
;
3609 /* Expression code to give to the expression when it is built.
3610 Normally this is CODE, which is what the caller asked for,
3611 but in some special cases we change it. */
3612 enum tree_code resultcode
= code
;
3614 /* Data type in which the computation is to be performed.
3615 In the simplest cases this is the common type of the arguments. */
3616 tree result_type
= NULL
;
3618 /* Nonzero means operands have already been type-converted
3619 in whatever way is necessary.
3620 Zero means they need to be converted to RESULT_TYPE. */
3623 /* Nonzero means create the expression with this type, rather than
3625 tree build_type
= 0;
3627 /* Nonzero means after finally constructing the expression
3628 convert it to this type. */
3629 tree final_type
= 0;
3633 /* Nonzero if this is an operation like MIN or MAX which can
3634 safely be computed in short if both args are promoted shorts.
3635 Also implies COMMON.
3636 -1 indicates a bitwise operation; this makes a difference
3637 in the exact conditions for when it is safe to do the operation
3638 in a narrower mode. */
3641 /* Nonzero if this is a comparison operation;
3642 if both args are promoted shorts, compare the original shorts.
3643 Also implies COMMON. */
3644 int short_compare
= 0;
3646 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3649 /* True if both operands have arithmetic type. */
3650 bool arithmetic_types_p
;
3652 /* Apply default conversions. */
3656 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3657 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3658 || code
== TRUTH_XOR_EXPR
)
3660 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
3661 op0
= decay_conversion (op0
);
3662 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
3663 op1
= decay_conversion (op1
);
3667 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
3668 op0
= default_conversion (op0
);
3669 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
3670 op1
= default_conversion (op1
);
3673 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3674 STRIP_TYPE_NOPS (op0
);
3675 STRIP_TYPE_NOPS (op1
);
3677 /* DTRT if one side is an overloaded function, but complain about it. */
3678 if (type_unknown_p (op0
))
3680 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3681 if (t
!= error_mark_node
)
3683 if (complain
& tf_error
)
3684 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3689 if (type_unknown_p (op1
))
3691 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3692 if (t
!= error_mark_node
)
3694 if (complain
& tf_error
)
3695 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3701 type0
= TREE_TYPE (op0
);
3702 type1
= TREE_TYPE (op1
);
3704 /* The expression codes of the data types of the arguments tell us
3705 whether the arguments are integers, floating, pointers, etc. */
3706 code0
= TREE_CODE (type0
);
3707 code1
= TREE_CODE (type1
);
3709 /* If an error was already reported for one of the arguments,
3710 avoid reporting another error. */
3711 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3712 return error_mark_node
;
3714 if ((invalid_op_diag
3715 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3717 error (invalid_op_diag
);
3718 return error_mark_node
;
3721 /* Issue warnings about peculiar, but valid, uses of NULL. */
3722 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3723 /* It's reasonable to use pointer values as operands of &&
3724 and ||, so NULL is no exception. */
3725 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3726 && ( /* Both are NULL (or 0) and the operation was not a
3727 comparison or a pointer subtraction. */
3728 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3729 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
3730 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3731 || (!null_ptr_cst_p (orig_op0
)
3732 && !TYPE_PTR_P (type0
) && !TYPE_PTR_TO_MEMBER_P (type0
))
3733 || (!null_ptr_cst_p (orig_op1
)
3734 && !TYPE_PTR_P (type1
) && !TYPE_PTR_TO_MEMBER_P (type1
)))
3735 && (complain
& tf_warning
))
3736 /* Some sort of arithmetic operation involving NULL was
3738 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3743 /* Subtraction of two similar pointers.
3744 We must subtract them as integers, then divide by object size. */
3745 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3746 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3748 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3749 /* In all other cases except pointer - int, the usual arithmetic
3751 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3756 /* The pointer - int case is just like pointer + int; fall
3759 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3760 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3764 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3765 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3766 if (processing_template_decl
)
3768 result_type
= TREE_TYPE (ptr_operand
);
3771 return cp_pointer_int_sum (code
,
3782 case TRUNC_DIV_EXPR
:
3784 case FLOOR_DIV_EXPR
:
3785 case ROUND_DIV_EXPR
:
3786 case EXACT_DIV_EXPR
:
3787 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3788 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3789 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3790 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3792 enum tree_code tcode0
= code0
, tcode1
= code1
;
3794 warn_for_div_by_zero (location
, op1
);
3796 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3797 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3798 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3799 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3801 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3802 resultcode
= RDIV_EXPR
;
3804 /* When dividing two signed integers, we have to promote to int.
3805 unless we divide by a constant != -1. Note that default
3806 conversion will have been performed on the operands at this
3807 point, so we have to dig out the original type to find out if
3809 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3810 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3811 || (TREE_CODE (op1
) == INTEGER_CST
3812 && ! integer_all_onesp (op1
)));
3821 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3822 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3823 && !VECTOR_FLOAT_TYPE_P (type0
)
3824 && !VECTOR_FLOAT_TYPE_P (type1
)))
3828 case TRUNC_MOD_EXPR
:
3829 case FLOOR_MOD_EXPR
:
3830 warn_for_div_by_zero (location
, op1
);
3832 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3833 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
3834 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
3836 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3838 /* Although it would be tempting to shorten always here, that loses
3839 on some targets, since the modulo instruction is undefined if the
3840 quotient can't be represented in the computation mode. We shorten
3841 only if unsigned or if dividing by something we know != -1. */
3842 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3843 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3844 || (TREE_CODE (op1
) == INTEGER_CST
3845 && ! integer_all_onesp (op1
)));
3850 case TRUTH_ANDIF_EXPR
:
3851 case TRUTH_ORIF_EXPR
:
3852 case TRUTH_AND_EXPR
:
3854 result_type
= boolean_type_node
;
3857 /* Shift operations: result has same type as first operand;
3858 always convert second operand to int.
3859 Also set SHORT_SHIFT if shifting rightward. */
3862 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3864 result_type
= type0
;
3865 if (TREE_CODE (op1
) == INTEGER_CST
)
3867 if (tree_int_cst_lt (op1
, integer_zero_node
))
3869 if ((complain
& tf_warning
)
3870 && c_inhibit_evaluation_warnings
== 0)
3871 warning (0, "right shift count is negative");
3875 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3876 && (complain
& tf_warning
)
3877 && c_inhibit_evaluation_warnings
== 0)
3878 warning (0, "right shift count >= width of type");
3881 /* Convert the shift-count to an integer, regardless of
3882 size of value being shifted. */
3883 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3884 op1
= cp_convert (integer_type_node
, op1
);
3885 /* Avoid converting op1 to result_type later. */
3891 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3893 result_type
= type0
;
3894 if (TREE_CODE (op1
) == INTEGER_CST
)
3896 if (tree_int_cst_lt (op1
, integer_zero_node
))
3898 if ((complain
& tf_warning
)
3899 && c_inhibit_evaluation_warnings
== 0)
3900 warning (0, "left shift count is negative");
3902 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3904 if ((complain
& tf_warning
)
3905 && c_inhibit_evaluation_warnings
== 0)
3906 warning (0, "left shift count >= width of type");
3909 /* Convert the shift-count to an integer, regardless of
3910 size of value being shifted. */
3911 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3912 op1
= cp_convert (integer_type_node
, op1
);
3913 /* Avoid converting op1 to result_type later. */
3920 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3922 result_type
= type0
;
3923 if (TREE_CODE (op1
) == INTEGER_CST
)
3925 if (tree_int_cst_lt (op1
, integer_zero_node
))
3927 if (complain
& tf_warning
)
3928 warning (0, (code
== LROTATE_EXPR
)
3929 ? G_("left rotate count is negative")
3930 : G_("right rotate count is negative"));
3932 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3934 if (complain
& tf_warning
)
3935 warning (0, (code
== LROTATE_EXPR
)
3936 ? G_("left rotate count >= width of type")
3937 : G_("right rotate count >= width of type"));
3940 /* Convert the shift-count to an integer, regardless of
3941 size of value being shifted. */
3942 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3943 op1
= cp_convert (integer_type_node
, op1
);
3949 if ((complain
& tf_warning
)
3950 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
3951 warning (OPT_Wfloat_equal
,
3952 "comparing floating point with == or != is unsafe");
3953 if ((complain
& tf_warning
)
3954 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
3955 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
3956 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
3958 build_type
= boolean_type_node
;
3959 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3960 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
3961 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3962 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
3964 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3965 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
3966 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3967 CPO_COMPARISON
, complain
);
3968 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
3969 && null_ptr_cst_p (op1
))
3971 if (TREE_CODE (op0
) == ADDR_EXPR
3972 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
3974 if (complain
& tf_warning
)
3975 warning (OPT_Waddress
, "the address of %qD will never be NULL",
3976 TREE_OPERAND (op0
, 0));
3978 result_type
= type0
;
3980 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
3981 && null_ptr_cst_p (op0
))
3983 if (TREE_CODE (op1
) == ADDR_EXPR
3984 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
3986 if (complain
& tf_warning
)
3987 warning (OPT_Waddress
, "the address of %qD will never be NULL",
3988 TREE_OPERAND (op1
, 0));
3990 result_type
= type1
;
3992 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
3993 /* One of the operands must be of nullptr_t type. */
3994 result_type
= TREE_TYPE (nullptr_node
);
3995 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3997 result_type
= type0
;
3998 if (complain
& tf_error
)
3999 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4001 return error_mark_node
;
4003 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4005 result_type
= type1
;
4006 if (complain
& tf_error
)
4007 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4009 return error_mark_node
;
4011 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
4013 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4014 == ptrmemfunc_vbit_in_delta
)
4016 tree pfn0
= pfn_from_ptrmemfunc (op0
);
4017 tree delta0
= delta_from_ptrmemfunc (op0
);
4018 tree e1
= cp_build_binary_op (location
,
4021 build_zero_cst (TREE_TYPE (pfn0
)),
4023 tree e2
= cp_build_binary_op (location
,
4028 e2
= cp_build_binary_op (location
,
4029 EQ_EXPR
, e2
, integer_zero_node
,
4031 op0
= cp_build_binary_op (location
,
4032 TRUTH_ANDIF_EXPR
, e1
, e2
,
4034 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
4038 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4039 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
4041 result_type
= TREE_TYPE (op0
);
4043 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4044 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4045 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4048 /* E will be the final comparison. */
4050 /* E1 and E2 are for scratch. */
4058 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4059 CPO_COMPARISON
, complain
);
4061 if (!same_type_p (TREE_TYPE (op0
), type
))
4062 op0
= cp_convert_and_check (type
, op0
);
4063 if (!same_type_p (TREE_TYPE (op1
), type
))
4064 op1
= cp_convert_and_check (type
, op1
);
4066 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4067 return error_mark_node
;
4069 if (TREE_SIDE_EFFECTS (op0
))
4070 op0
= save_expr (op0
);
4071 if (TREE_SIDE_EFFECTS (op1
))
4072 op1
= save_expr (op1
);
4074 pfn0
= pfn_from_ptrmemfunc (op0
);
4075 pfn1
= pfn_from_ptrmemfunc (op1
);
4076 delta0
= delta_from_ptrmemfunc (op0
);
4077 delta1
= delta_from_ptrmemfunc (op1
);
4078 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4079 == ptrmemfunc_vbit_in_delta
)
4084 && ((op0.delta == op1.delta)
4085 || (!op0.pfn && op0.delta & 1 == 0
4086 && op1.delta & 1 == 0))
4088 The reason for the `!op0.pfn' bit is that a NULL
4089 pointer-to-member is any member with a zero PFN and
4090 LSB of the DELTA field is 0. */
4092 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4096 e1
= cp_build_binary_op (location
,
4097 EQ_EXPR
, e1
, integer_zero_node
,
4099 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4103 e2
= cp_build_binary_op (location
,
4104 EQ_EXPR
, e2
, integer_zero_node
,
4106 e1
= cp_build_binary_op (location
,
4107 TRUTH_ANDIF_EXPR
, e2
, e1
,
4109 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4111 build_zero_cst (TREE_TYPE (pfn0
)),
4113 e2
= cp_build_binary_op (location
,
4114 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4115 e1
= cp_build_binary_op (location
,
4116 EQ_EXPR
, delta0
, delta1
, complain
);
4117 e1
= cp_build_binary_op (location
,
4118 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4125 && (!op0.pfn || op0.delta == op1.delta))
4127 The reason for the `!op0.pfn' bit is that a NULL
4128 pointer-to-member is any member with a zero PFN; the
4129 DELTA field is unspecified. */
4131 e1
= cp_build_binary_op (location
,
4132 EQ_EXPR
, delta0
, delta1
, complain
);
4133 e2
= cp_build_binary_op (location
,
4136 build_zero_cst (TREE_TYPE (pfn0
)),
4138 e1
= cp_build_binary_op (location
,
4139 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4141 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4142 e
= cp_build_binary_op (location
,
4143 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4144 if (code
== EQ_EXPR
)
4146 return cp_build_binary_op (location
,
4147 EQ_EXPR
, e
, integer_zero_node
, complain
);
4151 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4152 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4154 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4155 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4163 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4164 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4166 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4167 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4168 CPO_COMPARISON
, complain
);
4175 if (TREE_CODE (orig_op0
) == STRING_CST
4176 || TREE_CODE (orig_op1
) == STRING_CST
)
4178 if (complain
& tf_warning
)
4179 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4182 build_type
= boolean_type_node
;
4183 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4184 || code0
== ENUMERAL_TYPE
)
4185 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4186 || code1
== ENUMERAL_TYPE
))
4188 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4189 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4190 CPO_COMPARISON
, complain
);
4191 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4192 result_type
= type0
;
4193 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4194 result_type
= type1
;
4195 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4196 /* One of the operands must be of nullptr_t type. */
4197 result_type
= TREE_TYPE (nullptr_node
);
4198 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4200 result_type
= type0
;
4201 if (complain
& tf_error
)
4202 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4204 return error_mark_node
;
4206 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4208 result_type
= type1
;
4209 if (complain
& tf_error
)
4210 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4212 return error_mark_node
;
4216 case UNORDERED_EXPR
:
4223 build_type
= integer_type_node
;
4224 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4226 if (complain
& tf_error
)
4227 error ("unordered comparison on non-floating point argument");
4228 return error_mark_node
;
4237 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4238 || code0
== ENUMERAL_TYPE
)
4239 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4240 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4241 arithmetic_types_p
= 1;
4244 arithmetic_types_p
= 0;
4245 /* Vector arithmetic is only allowed when both sides are vectors. */
4246 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4248 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4249 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4252 binary_op_error (location
, code
, type0
, type1
);
4253 return error_mark_node
;
4255 arithmetic_types_p
= 1;
4258 /* Determine the RESULT_TYPE, if it is not already known. */
4260 && arithmetic_types_p
4261 && (shorten
|| common
|| short_compare
))
4263 result_type
= cp_common_type (type0
, type1
);
4264 do_warn_double_promotion (result_type
, type0
, type1
,
4265 "implicit conversion from %qT to %qT "
4266 "to match other operand of binary "
4273 if (complain
& tf_error
)
4274 error ("invalid operands of types %qT and %qT to binary %qO",
4275 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4276 return error_mark_node
;
4279 /* If we're in a template, the only thing we need to know is the
4281 if (processing_template_decl
)
4283 /* Since the middle-end checks the type when doing a build2, we
4284 need to build the tree in pieces. This built tree will never
4285 get out of the front-end as we replace it when instantiating
4287 tree tmp
= build2 (resultcode
,
4288 build_type
? build_type
: result_type
,
4290 TREE_OPERAND (tmp
, 0) = op0
;
4294 if (arithmetic_types_p
)
4296 bool first_complex
= (code0
== COMPLEX_TYPE
);
4297 bool second_complex
= (code1
== COMPLEX_TYPE
);
4298 int none_complex
= (!first_complex
&& !second_complex
);
4300 /* Adapted from patch for c/24581. */
4301 if (first_complex
!= second_complex
4302 && (code
== PLUS_EXPR
4303 || code
== MINUS_EXPR
4304 || code
== MULT_EXPR
4305 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4306 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4307 && flag_signed_zeros
)
4309 /* An operation on mixed real/complex operands must be
4310 handled specially, but the language-independent code can
4311 more easily optimize the plain complex arithmetic if
4312 -fno-signed-zeros. */
4313 tree real_type
= TREE_TYPE (result_type
);
4317 if (TREE_TYPE (op0
) != result_type
)
4318 op0
= cp_convert_and_check (result_type
, op0
);
4319 if (TREE_TYPE (op1
) != real_type
)
4320 op1
= cp_convert_and_check (real_type
, op1
);
4324 if (TREE_TYPE (op0
) != real_type
)
4325 op0
= cp_convert_and_check (real_type
, op0
);
4326 if (TREE_TYPE (op1
) != result_type
)
4327 op1
= cp_convert_and_check (result_type
, op1
);
4329 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4330 return error_mark_node
;
4333 op0
= save_expr (op0
);
4334 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4335 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4339 case TRUNC_DIV_EXPR
:
4340 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4344 real
= build2 (resultcode
, real_type
, real
, op1
);
4352 op1
= save_expr (op1
);
4353 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4354 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4358 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4361 real
= build2 (resultcode
, real_type
, op0
, real
);
4364 real
= build2 (resultcode
, real_type
, op0
, real
);
4365 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4371 real
= fold_if_not_in_template (real
);
4372 imag
= fold_if_not_in_template (imag
);
4373 result
= build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4374 result
= fold_if_not_in_template (result
);
4378 /* For certain operations (which identify themselves by shorten != 0)
4379 if both args were extended from the same smaller type,
4380 do the arithmetic in that type and then extend.
4382 shorten !=0 and !=1 indicates a bitwise operation.
4383 For them, this optimization is safe only if
4384 both args are zero-extended or both are sign-extended.
4385 Otherwise, we might change the result.
4386 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4387 but calculated in (unsigned short) it would be (unsigned short)-1. */
4389 if (shorten
&& none_complex
)
4391 final_type
= result_type
;
4392 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4396 /* Comparison operations are shortened too but differently.
4397 They identify themselves by setting short_compare = 1. */
4401 /* Don't write &op0, etc., because that would prevent op0
4402 from being kept in a register.
4403 Instead, make copies of the our local variables and
4404 pass the copies by reference, then copy them back afterward. */
4405 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4406 enum tree_code xresultcode
= resultcode
;
4408 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4410 return cp_convert (boolean_type_node
, val
);
4411 op0
= xop0
, op1
= xop1
;
4413 resultcode
= xresultcode
;
4416 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4417 && warn_sign_compare
4418 && !TREE_NO_WARNING (orig_op0
)
4419 && !TREE_NO_WARNING (orig_op1
)
4420 /* Do not warn until the template is instantiated; we cannot
4421 bound the ranges of the arguments until that point. */
4422 && !processing_template_decl
4423 && (complain
& tf_warning
)
4424 && c_inhibit_evaluation_warnings
== 0)
4426 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4427 result_type
, resultcode
);
4431 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4432 Then the expression will be built.
4433 It will be given type FINAL_TYPE if that is nonzero;
4434 otherwise, it will be given type RESULT_TYPE. */
4437 if (TREE_TYPE (op0
) != result_type
)
4438 op0
= cp_convert_and_check (result_type
, op0
);
4439 if (TREE_TYPE (op1
) != result_type
)
4440 op1
= cp_convert_and_check (result_type
, op1
);
4442 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4443 return error_mark_node
;
4446 if (build_type
== NULL_TREE
)
4447 build_type
= result_type
;
4449 result
= build2 (resultcode
, build_type
, op0
, op1
);
4450 result
= fold_if_not_in_template (result
);
4451 if (final_type
!= 0)
4452 result
= cp_convert (final_type
, result
);
4454 if (TREE_OVERFLOW_P (result
)
4455 && !TREE_OVERFLOW_P (op0
)
4456 && !TREE_OVERFLOW_P (op1
))
4457 overflow_warning (location
, result
);
4462 /* Return a tree for the sum or difference (RESULTCODE says which)
4463 of pointer PTROP and integer INTOP. */
4466 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4468 tree res_type
= TREE_TYPE (ptrop
);
4470 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4471 in certain circumstance (when it's valid to do so). So we need
4472 to make sure it's complete. We don't need to check here, if we
4473 can actually complete it at all, as those checks will be done in
4474 pointer_int_sum() anyway. */
4475 complete_type (TREE_TYPE (res_type
));
4477 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4478 fold_if_not_in_template (intop
));
4481 /* Return a tree for the difference of pointers OP0 and OP1.
4482 The resulting tree has type int. */
4485 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4488 tree restype
= ptrdiff_type_node
;
4489 tree target_type
= TREE_TYPE (ptrtype
);
4491 if (!complete_type_or_else (target_type
, NULL_TREE
))
4492 return error_mark_node
;
4494 if (TREE_CODE (target_type
) == VOID_TYPE
)
4495 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4496 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4497 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4498 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4499 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4501 /* First do the subtraction as integers;
4502 then drop through to build the divide operator. */
4504 op0
= cp_build_binary_op (input_location
,
4506 cp_convert (restype
, op0
),
4507 cp_convert (restype
, op1
),
4508 tf_warning_or_error
);
4510 /* This generates an error if op1 is a pointer to an incomplete type. */
4511 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4512 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4514 op1
= (TYPE_PTROB_P (ptrtype
)
4515 ? size_in_bytes (target_type
)
4516 : integer_one_node
);
4518 /* Do the division. */
4520 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4521 return fold_if_not_in_template (result
);
4524 /* Construct and perhaps optimize a tree representation
4525 for a unary operation. CODE, a tree_code, specifies the operation
4526 and XARG is the operand. */
4529 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4531 tree orig_expr
= xarg
;
4535 if (processing_template_decl
)
4537 if (type_dependent_expression_p (xarg
))
4538 return build_min_nt (code
, xarg
, NULL_TREE
);
4540 xarg
= build_non_dependent_expr (xarg
);
4545 /* [expr.unary.op] says:
4547 The address of an object of incomplete type can be taken.
4549 (And is just the ordinary address operator, not an overloaded
4550 "operator &".) However, if the type is a template
4551 specialization, we must complete the type at this point so that
4552 an overloaded "operator &" will be available if required. */
4553 if (code
== ADDR_EXPR
4554 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4555 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4556 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4557 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4558 /* Don't look for a function. */;
4560 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4561 /*overloaded_p=*/NULL
, complain
);
4562 if (!exp
&& code
== ADDR_EXPR
)
4564 if (is_overloaded_fn (xarg
))
4566 tree fn
= get_first_fn (xarg
);
4567 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4569 error (DECL_CONSTRUCTOR_P (fn
)
4570 ? G_("taking address of constructor %qE")
4571 : G_("taking address of destructor %qE"),
4573 return error_mark_node
;
4577 /* A pointer to member-function can be formed only by saying
4579 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4580 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4582 if (TREE_CODE (xarg
) != OFFSET_REF
4583 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4585 error ("invalid use of %qE to form a pointer-to-member-function",
4587 if (TREE_CODE (xarg
) != OFFSET_REF
)
4588 inform (input_location
, " a qualified-id is required");
4589 return error_mark_node
;
4593 error ("parentheses around %qE cannot be used to form a"
4594 " pointer-to-member-function",
4596 PTRMEM_OK_P (xarg
) = 1;
4600 if (TREE_CODE (xarg
) == OFFSET_REF
)
4602 ptrmem
= PTRMEM_OK_P (xarg
);
4604 if (!ptrmem
&& !flag_ms_extensions
4605 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4607 /* A single non-static member, make sure we don't allow a
4608 pointer-to-member. */
4609 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4610 TREE_OPERAND (xarg
, 0),
4611 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4612 PTRMEM_OK_P (xarg
) = ptrmem
;
4616 exp
= cp_build_addr_expr_strict (xarg
, complain
);
4619 if (processing_template_decl
&& exp
!= error_mark_node
)
4620 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4621 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4622 if (TREE_CODE (exp
) == ADDR_EXPR
)
4623 PTRMEM_OK_P (exp
) = ptrmem
;
4627 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4628 constants, where a null value is represented by an INTEGER_CST of
4632 cp_truthvalue_conversion (tree expr
)
4634 tree type
= TREE_TYPE (expr
);
4635 if (TYPE_PTRMEM_P (type
))
4636 return build_binary_op (EXPR_LOCATION (expr
),
4637 NE_EXPR
, expr
, integer_zero_node
, 1);
4639 return c_common_truthvalue_conversion (input_location
, expr
);
4642 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4645 condition_conversion (tree expr
)
4648 if (processing_template_decl
)
4650 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4651 tf_warning_or_error
, LOOKUP_NORMAL
);
4652 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4656 /* Returns the address of T. This function will fold away
4657 ADDR_EXPR of INDIRECT_REF. */
4660 build_address (tree t
)
4662 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4663 return error_mark_node
;
4664 t
= build_fold_addr_expr (t
);
4665 if (TREE_CODE (t
) != ADDR_EXPR
)
4670 /* Returns the address of T with type TYPE. */
4673 build_typed_address (tree t
, tree type
)
4675 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4676 return error_mark_node
;
4677 t
= build_fold_addr_expr_with_type (t
, type
);
4678 if (TREE_CODE (t
) != ADDR_EXPR
)
4683 /* Return a NOP_EXPR converting EXPR to TYPE. */
4686 build_nop (tree type
, tree expr
)
4688 if (type
== error_mark_node
|| error_operand_p (expr
))
4690 return build1 (NOP_EXPR
, type
, expr
);
4693 /* Take the address of ARG, whatever that means under C++ semantics.
4694 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
4695 and class rvalues as well.
4697 Nothing should call this function directly; instead, callers should use
4698 cp_build_addr_expr or cp_build_addr_expr_strict. */
4701 cp_build_addr_expr_1 (tree arg
, bool strict_lvalue
, tsubst_flags_t complain
)
4706 if (!arg
|| error_operand_p (arg
))
4707 return error_mark_node
;
4709 arg
= mark_lvalue_use (arg
);
4710 argtype
= lvalue_type (arg
);
4712 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
4713 || !IDENTIFIER_OPNAME_P (arg
));
4715 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
4716 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
4718 /* They're trying to take the address of a unique non-static
4719 member function. This is ill-formed (except in MS-land),
4720 but let's try to DTRT.
4721 Note: We only handle unique functions here because we don't
4722 want to complain if there's a static overload; non-unique
4723 cases will be handled by instantiate_type. But we need to
4724 handle this case here to allow casts on the resulting PMF.
4725 We could defer this in non-MS mode, but it's easier to give
4726 a useful error here. */
4728 /* Inside constant member functions, the `this' pointer
4729 contains an extra const qualifier. TYPE_MAIN_VARIANT
4730 is used here to remove this const from the diagnostics
4731 and the created OFFSET_REF. */
4732 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
4733 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
4736 if (! flag_ms_extensions
)
4738 tree name
= DECL_NAME (fn
);
4739 if (!(complain
& tf_error
))
4740 return error_mark_node
;
4741 else if (current_class_type
4742 && TREE_OPERAND (arg
, 0) == current_class_ref
)
4743 /* An expression like &memfn. */
4744 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
4745 " or parenthesized non-static member function to form"
4746 " a pointer to member function. Say %<&%T::%D%>",
4749 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
4750 " function to form a pointer to member function."
4754 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
4757 /* Uninstantiated types are all functions. Taking the
4758 address of a function is a no-op, so just return the
4760 if (type_unknown_p (arg
))
4761 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4763 if (TREE_CODE (arg
) == OFFSET_REF
)
4764 /* We want a pointer to member; bypass all the code for actually taking
4765 the address of something. */
4768 /* Anything not already handled and not a true memory reference
4770 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4771 && TREE_CODE (argtype
) != METHOD_TYPE
)
4773 cp_lvalue_kind kind
= lvalue_kind (arg
);
4774 if (kind
== clk_none
)
4776 if (complain
& tf_error
)
4777 lvalue_error (input_location
, lv_addressof
);
4778 return error_mark_node
;
4780 if (strict_lvalue
&& (kind
& (clk_rvalueref
|clk_class
)))
4782 if (!(complain
& tf_error
))
4783 return error_mark_node
;
4784 if (kind
& clk_class
)
4785 /* Make this a permerror because we used to accept it. */
4786 permerror (input_location
, "taking address of temporary");
4788 error ("taking address of xvalue (rvalue reference)");
4792 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4794 tree type
= build_pointer_type (TREE_TYPE (argtype
));
4795 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4798 else if (pedantic
&& DECL_MAIN_P (arg
))
4801 /* Apparently a lot of autoconf scripts for C++ packages do this,
4802 so only complain if -pedantic. */
4803 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
4804 pedwarn (input_location
, OPT_pedantic
,
4805 "ISO C++ forbids taking address of function %<::main%>");
4806 else if (flag_pedantic_errors
)
4807 return error_mark_node
;
4810 /* Let &* cancel out to simplify resulting code. */
4811 if (TREE_CODE (arg
) == INDIRECT_REF
)
4813 /* We don't need to have `current_class_ptr' wrapped in a
4814 NON_LVALUE_EXPR node. */
4815 if (arg
== current_class_ref
)
4816 return current_class_ptr
;
4818 arg
= TREE_OPERAND (arg
, 0);
4819 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
4821 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
4822 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4825 /* Don't let this be an lvalue. */
4830 /* ??? Cope with user tricks that amount to offsetof. */
4831 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4832 && TREE_CODE (argtype
) != METHOD_TYPE
4833 && argtype
!= unknown_type_node
4834 && (val
= get_base_address (arg
))
4835 && COMPLETE_TYPE_P (TREE_TYPE (val
))
4836 && TREE_CODE (val
) == INDIRECT_REF
4837 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
4839 tree type
= build_pointer_type (argtype
);
4840 tree op0
= fold_convert (type
, TREE_OPERAND (val
, 0));
4841 tree op1
= fold_convert (sizetype
, fold_offsetof (arg
, val
));
4842 return fold_build2 (POINTER_PLUS_EXPR
, type
, op0
, op1
);
4845 /* Handle complex lvalues (when permitted)
4846 by reduction to simpler cases. */
4847 val
= unary_complex_lvalue (ADDR_EXPR
, arg
);
4851 switch (TREE_CODE (arg
))
4855 case FIX_TRUNC_EXPR
:
4856 /* Even if we're not being pedantic, we cannot allow this
4857 extension when we're instantiating in a SFINAE
4859 if (! lvalue_p (arg
) && complain
== tf_none
)
4861 if (complain
& tf_error
)
4862 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4864 return error_mark_node
;
4869 arg
= BASELINK_FUNCTIONS (arg
);
4873 arg
= OVL_CURRENT (arg
);
4878 /* Turn a reference to a non-static data member into a
4879 pointer-to-member. */
4884 gcc_assert (PTRMEM_OK_P (arg
));
4886 t
= TREE_OPERAND (arg
, 1);
4887 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
4889 if (complain
& tf_error
)
4890 error ("cannot create pointer to reference member %qD", t
);
4891 return error_mark_node
;
4894 type
= build_ptrmem_type (context_for_name_lookup (t
),
4896 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
4904 if (argtype
!= error_mark_node
)
4905 argtype
= build_pointer_type (argtype
);
4907 /* In a template, we are processing a non-dependent expression
4908 so we can just form an ADDR_EXPR with the correct type. */
4909 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
4911 val
= build_address (arg
);
4912 if (TREE_CODE (arg
) == OFFSET_REF
)
4913 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
4915 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
4917 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
4919 /* We can only get here with a single static member
4921 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4922 && DECL_STATIC_FUNCTION_P (fn
));
4924 val
= build_address (fn
);
4925 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
4926 /* Do not lose object's side effects. */
4927 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
4928 TREE_OPERAND (arg
, 0), val
);
4930 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
4932 if (complain
& tf_error
)
4933 error ("attempt to take address of bit-field structure member %qD",
4934 TREE_OPERAND (arg
, 1));
4935 return error_mark_node
;
4939 tree object
= TREE_OPERAND (arg
, 0);
4940 tree field
= TREE_OPERAND (arg
, 1);
4941 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4942 (TREE_TYPE (object
), decl_type_context (field
)));
4943 val
= build_address (arg
);
4946 if (TREE_CODE (argtype
) == POINTER_TYPE
4947 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
4949 build_ptrmemfunc_type (argtype
);
4950 val
= build_ptrmemfunc (argtype
, val
, 0,
4952 tf_warning_or_error
);
4958 /* Take the address of ARG if it has one, even if it's an rvalue. */
4961 cp_build_addr_expr (tree arg
, tsubst_flags_t complain
)
4963 return cp_build_addr_expr_1 (arg
, 0, complain
);
4966 /* Take the address of ARG, but only if it's an lvalue. */
4969 cp_build_addr_expr_strict (tree arg
, tsubst_flags_t complain
)
4971 return cp_build_addr_expr_1 (arg
, 1, complain
);
4974 /* C++: Must handle pointers to members.
4976 Perhaps type instantiation should be extended to handle conversion
4977 from aggregates to types we don't yet know we want? (Or are those
4978 cases typically errors which should be reported?)
4980 NOCONVERT nonzero suppresses the default promotions
4981 (such as from short to int). */
4984 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
4985 tsubst_flags_t complain
)
4987 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4990 const char *errstring
= NULL
;
4992 const char *invalid_op_diag
;
4994 if (!arg
|| error_operand_p (arg
))
4995 return error_mark_node
;
4997 if ((invalid_op_diag
4998 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
5003 error (invalid_op_diag
);
5004 return error_mark_node
;
5009 case UNARY_PLUS_EXPR
:
5012 int flags
= WANT_ARITH
| WANT_ENUM
;
5013 /* Unary plus (but not unary minus) is allowed on pointers. */
5014 if (code
== UNARY_PLUS_EXPR
)
5015 flags
|= WANT_POINTER
;
5016 arg
= build_expr_type_conversion (flags
, arg
, true);
5018 errstring
= (code
== NEGATE_EXPR
5019 ? _("wrong type argument to unary minus")
5020 : _("wrong type argument to unary plus"));
5023 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5024 arg
= perform_integral_promotions (arg
);
5026 /* Make sure the result is not an lvalue: a unary plus or minus
5027 expression is always a rvalue. */
5034 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5038 arg
= default_conversion (arg
);
5040 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
5041 | WANT_VECTOR_OR_COMPLEX
,
5043 errstring
= _("wrong type argument to bit-complement");
5044 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5045 arg
= perform_integral_promotions (arg
);
5049 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5050 errstring
= _("wrong type argument to abs");
5051 else if (!noconvert
)
5052 arg
= default_conversion (arg
);
5056 /* Conjugating a real value is a no-op, but allow it anyway. */
5057 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5058 errstring
= _("wrong type argument to conjugation");
5059 else if (!noconvert
)
5060 arg
= default_conversion (arg
);
5063 case TRUTH_NOT_EXPR
:
5064 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
5066 val
= invert_truthvalue_loc (input_location
, arg
);
5067 if (arg
!= error_mark_node
)
5069 errstring
= _("in argument to unary !");
5077 arg
= build_real_imag_expr (input_location
, code
, arg
);
5078 if (arg
== error_mark_node
)
5081 return fold_if_not_in_template (arg
);
5083 case PREINCREMENT_EXPR
:
5084 case POSTINCREMENT_EXPR
:
5085 case PREDECREMENT_EXPR
:
5086 case POSTDECREMENT_EXPR
:
5087 /* Handle complex lvalues (when permitted)
5088 by reduction to simpler cases. */
5090 val
= unary_complex_lvalue (code
, arg
);
5094 arg
= mark_lvalue_use (arg
);
5096 /* Increment or decrement the real part of the value,
5097 and don't change the imaginary part. */
5098 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5102 arg
= stabilize_reference (arg
);
5103 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
5104 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
5105 real
= cp_build_unary_op (code
, real
, 1, complain
);
5106 if (real
== error_mark_node
|| imag
== error_mark_node
)
5107 return error_mark_node
;
5108 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
5112 /* Report invalid types. */
5114 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
5117 if (code
== PREINCREMENT_EXPR
)
5118 errstring
= _("no pre-increment operator for type");
5119 else if (code
== POSTINCREMENT_EXPR
)
5120 errstring
= _("no post-increment operator for type");
5121 else if (code
== PREDECREMENT_EXPR
)
5122 errstring
= _("no pre-decrement operator for type");
5124 errstring
= _("no post-decrement operator for type");
5127 else if (arg
== error_mark_node
)
5128 return error_mark_node
;
5130 /* Report something read-only. */
5132 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
5133 || TREE_READONLY (arg
))
5135 if (complain
& tf_error
)
5136 cxx_readonly_error (arg
, ((code
== PREINCREMENT_EXPR
5137 || code
== POSTINCREMENT_EXPR
)
5138 ? lv_increment
: lv_decrement
));
5140 return error_mark_node
;
5145 tree declared_type
= unlowered_expr_type (arg
);
5147 argtype
= TREE_TYPE (arg
);
5149 /* ARM $5.2.5 last annotation says this should be forbidden. */
5150 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
5152 if (complain
& tf_error
)
5153 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
5154 ? G_("ISO C++ forbids incrementing an enum")
5155 : G_("ISO C++ forbids decrementing an enum"));
5157 return error_mark_node
;
5160 /* Compute the increment. */
5162 if (TREE_CODE (argtype
) == POINTER_TYPE
)
5164 tree type
= complete_type (TREE_TYPE (argtype
));
5166 if (!COMPLETE_OR_VOID_TYPE_P (type
))
5168 if (complain
& tf_error
)
5169 error (((code
== PREINCREMENT_EXPR
5170 || code
== POSTINCREMENT_EXPR
))
5171 ? G_("cannot increment a pointer to incomplete type %qT")
5172 : G_("cannot decrement a pointer to incomplete type %qT"),
5173 TREE_TYPE (argtype
));
5175 return error_mark_node
;
5177 else if ((pedantic
|| warn_pointer_arith
)
5178 && !TYPE_PTROB_P (argtype
))
5180 if (complain
& tf_error
)
5181 permerror (input_location
, (code
== PREINCREMENT_EXPR
5182 || code
== POSTINCREMENT_EXPR
)
5183 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
5184 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
5187 return error_mark_node
;
5190 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
5193 inc
= integer_one_node
;
5195 inc
= cp_convert (argtype
, inc
);
5197 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
5198 need to ask Objective-C to build the increment or decrement
5199 expression for it. */
5200 if (objc_is_property_ref (arg
))
5201 return objc_build_incr_expr_for_property_ref (input_location
, code
,
5204 /* Complain about anything else that is not a true lvalue. */
5205 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
5206 || code
== POSTINCREMENT_EXPR
)
5207 ? lv_increment
: lv_decrement
),
5209 return error_mark_node
;
5211 /* Forbid using -- on `bool'. */
5212 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
5214 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
5216 if (complain
& tf_error
)
5217 error ("invalid use of Boolean expression as operand "
5218 "to %<operator--%>");
5219 return error_mark_node
;
5221 val
= boolean_increment (code
, arg
);
5224 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
5226 TREE_SIDE_EFFECTS (val
) = 1;
5231 /* Note that this operation never does default_conversion
5232 regardless of NOCONVERT. */
5233 return cp_build_addr_expr (arg
, complain
);
5242 argtype
= TREE_TYPE (arg
);
5243 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5246 if (complain
& tf_error
)
5247 error ("%s", errstring
);
5248 return error_mark_node
;
5251 /* Hook for the c-common bits that build a unary op. */
5253 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5254 enum tree_code code
, tree xarg
, int noconvert
)
5256 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5259 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5260 for certain kinds of expressions which are not really lvalues
5261 but which we can accept as lvalues.
5263 If ARG is not a kind of expression we can handle, return
5267 unary_complex_lvalue (enum tree_code code
, tree arg
)
5269 /* Inside a template, making these kinds of adjustments is
5270 pointless; we are only concerned with the type of the
5272 if (processing_template_decl
)
5275 /* Handle (a, b) used as an "lvalue". */
5276 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5278 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5279 tf_warning_or_error
);
5280 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5281 TREE_OPERAND (arg
, 0), real_result
);
5284 /* Handle (a ? b : c) used as an "lvalue". */
5285 if (TREE_CODE (arg
) == COND_EXPR
5286 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5287 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5289 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5290 if (TREE_CODE (arg
) == MODIFY_EXPR
5291 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5292 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5294 tree lvalue
= TREE_OPERAND (arg
, 0);
5295 if (TREE_SIDE_EFFECTS (lvalue
))
5297 lvalue
= stabilize_reference (lvalue
);
5298 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5299 lvalue
, TREE_OPERAND (arg
, 1));
5301 return unary_complex_lvalue
5302 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5305 if (code
!= ADDR_EXPR
)
5308 /* Handle (a = b) used as an "lvalue" for `&'. */
5309 if (TREE_CODE (arg
) == MODIFY_EXPR
5310 || TREE_CODE (arg
) == INIT_EXPR
)
5312 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5313 tf_warning_or_error
);
5314 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5316 TREE_NO_WARNING (arg
) = 1;
5320 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5321 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5322 || TREE_CODE (arg
) == OFFSET_REF
)
5325 /* We permit compiler to make function calls returning
5326 objects of aggregate type look like lvalues. */
5330 if (TREE_CODE (targ
) == SAVE_EXPR
)
5331 targ
= TREE_OPERAND (targ
, 0);
5333 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5335 if (TREE_CODE (arg
) == SAVE_EXPR
)
5338 targ
= build_cplus_new (TREE_TYPE (arg
), arg
, tf_warning_or_error
);
5339 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5342 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5343 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5344 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5347 /* Don't let anything else be handled specially. */
5351 /* Mark EXP saying that we need to be able to take the
5352 address of it; it should not be allocated in a register.
5353 Value is true if successful.
5355 C++: we do not allow `current_class_ptr' to be addressable. */
5358 cxx_mark_addressable (tree exp
)
5363 switch (TREE_CODE (x
))
5370 x
= TREE_OPERAND (x
, 0);
5374 if (x
== current_class_ptr
)
5376 error ("cannot take the address of %<this%>, which is an rvalue expression");
5377 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5383 /* Caller should not be trying to mark initialized
5384 constant fields addressable. */
5385 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5386 || DECL_IN_AGGR_P (x
) == 0
5388 || DECL_EXTERNAL (x
));
5392 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5393 && !DECL_ARTIFICIAL (x
))
5395 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5398 ("address of explicit register variable %qD requested", x
);
5401 else if (extra_warnings
)
5403 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5405 TREE_ADDRESSABLE (x
) = 1;
5410 TREE_ADDRESSABLE (x
) = 1;
5414 TREE_ADDRESSABLE (x
) = 1;
5418 TREE_ADDRESSABLE (x
) = 1;
5419 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5427 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5430 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5431 tsubst_flags_t complain
)
5433 tree orig_ifexp
= ifexp
;
5434 tree orig_op1
= op1
;
5435 tree orig_op2
= op2
;
5438 if (processing_template_decl
)
5440 /* The standard says that the expression is type-dependent if
5441 IFEXP is type-dependent, even though the eventual type of the
5442 expression doesn't dependent on IFEXP. */
5443 if (type_dependent_expression_p (ifexp
)
5444 /* As a GNU extension, the middle operand may be omitted. */
5445 || (op1
&& type_dependent_expression_p (op1
))
5446 || type_dependent_expression_p (op2
))
5447 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5448 ifexp
= build_non_dependent_expr (ifexp
);
5450 op1
= build_non_dependent_expr (op1
);
5451 op2
= build_non_dependent_expr (op2
);
5454 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5455 if (processing_template_decl
&& expr
!= error_mark_node
)
5456 return build_min_non_dep (COND_EXPR
, expr
,
5457 orig_ifexp
, orig_op1
, orig_op2
);
5461 /* Given a list of expressions, return a compound expression
5462 that performs them all and returns the value of the last of them. */
5465 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
,
5466 tsubst_flags_t complain
)
5468 tree expr
= TREE_VALUE (list
);
5470 if (TREE_CHAIN (list
))
5472 if (complain
& tf_error
)
5476 permerror (input_location
, "expression list treated as compound "
5477 "expression in initializer");
5480 permerror (input_location
, "expression list treated as compound "
5481 "expression in mem-initializer");
5484 permerror (input_location
, "expression list treated as compound "
5485 "expression in functional cast");
5491 return error_mark_node
;
5493 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5494 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5501 /* Like build_x_compound_expr_from_list, but using a VEC. */
5504 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5506 if (VEC_empty (tree
, vec
))
5508 else if (VEC_length (tree
, vec
) == 1)
5509 return VEC_index (tree
, vec
, 0);
5517 permerror (input_location
,
5518 "%s expression list treated as compound expression",
5521 expr
= VEC_index (tree
, vec
, 0);
5522 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5523 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5529 /* Handle overloading of the ',' operator when needed. */
5532 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5535 tree orig_op1
= op1
;
5536 tree orig_op2
= op2
;
5538 if (processing_template_decl
)
5540 if (type_dependent_expression_p (op1
)
5541 || type_dependent_expression_p (op2
))
5542 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5543 op1
= build_non_dependent_expr (op1
);
5544 op2
= build_non_dependent_expr (op2
);
5547 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5548 /*overloaded_p=*/NULL
, complain
);
5550 result
= cp_build_compound_expr (op1
, op2
, complain
);
5552 if (processing_template_decl
&& result
!= error_mark_node
)
5553 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5558 /* Like cp_build_compound_expr, but for the c-common bits. */
5561 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5563 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5566 /* Build a compound expression. */
5569 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5571 lhs
= convert_to_void (lhs
, ICV_LEFT_OF_COMMA
, complain
);
5573 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5574 return error_mark_node
;
5576 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5578 /* If the rhs is a TARGET_EXPR, then build the compound
5579 expression inside the target_expr's initializer. This
5580 helps the compiler to eliminate unnecessary temporaries. */
5581 tree init
= TREE_OPERAND (rhs
, 1);
5583 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5584 TREE_OPERAND (rhs
, 1) = init
;
5589 if (type_unknown_p (rhs
))
5591 error ("no context to resolve type of %qE", rhs
);
5592 return error_mark_node
;
5595 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5598 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5599 casts away constness. CAST gives the type of cast. Returns true
5600 if the cast is ill-formed, false if it is well-formed.
5602 ??? This function warns for casting away any qualifier not just
5603 const. We would like to specify exactly what qualifiers are casted
5608 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5609 enum tree_code cast
, tsubst_flags_t complain
)
5611 /* C-style casts are allowed to cast away constness. With
5612 WARN_CAST_QUAL, we still want to issue a warning. */
5613 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5616 if (!casts_away_constness (src_type
, dest_type
))
5622 if (complain
& tf_warning
)
5623 warning (OPT_Wcast_qual
,
5624 "cast from type %qT to type %qT casts away qualifiers",
5625 src_type
, dest_type
);
5628 case STATIC_CAST_EXPR
:
5629 if (complain
& tf_error
)
5630 error ("static_cast from type %qT to type %qT casts away qualifiers",
5631 src_type
, dest_type
);
5634 case REINTERPRET_CAST_EXPR
:
5635 if (complain
& tf_error
)
5636 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5637 src_type
, dest_type
);
5645 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5646 (another pointer-to-member type in the same hierarchy) and return
5647 the converted expression. If ALLOW_INVERSE_P is permitted, a
5648 pointer-to-derived may be converted to pointer-to-base; otherwise,
5649 only the other direction is permitted. If C_CAST_P is true, this
5650 conversion is taking place as part of a C-style cast. */
5653 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5654 bool c_cast_p
, tsubst_flags_t complain
)
5656 if (TYPE_PTRMEM_P (type
))
5660 if (TREE_CODE (expr
) == PTRMEM_CST
)
5661 expr
= cplus_expand_constant (expr
);
5662 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5663 TYPE_PTRMEM_CLASS_TYPE (type
),
5665 c_cast_p
, complain
);
5666 if (delta
== error_mark_node
)
5667 return error_mark_node
;
5669 if (!integer_zerop (delta
))
5671 tree cond
, op1
, op2
;
5673 cond
= cp_build_binary_op (input_location
,
5676 build_int_cst (TREE_TYPE (expr
), -1),
5677 tf_warning_or_error
);
5678 op1
= build_nop (ptrdiff_type_node
, expr
);
5679 op2
= cp_build_binary_op (input_location
,
5680 PLUS_EXPR
, op1
, delta
,
5681 tf_warning_or_error
);
5683 expr
= fold_build3_loc (input_location
,
5684 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5688 return build_nop (type
, expr
);
5691 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5692 allow_inverse_p
, c_cast_p
, complain
);
5695 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5696 this static_cast is being attempted as one of the possible casts
5697 allowed by a C-style cast. (In that case, accessibility of base
5698 classes is not considered, and it is OK to cast away
5699 constness.) Return the result of the cast. *VALID_P is set to
5700 indicate whether or not the cast was valid. */
5703 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5704 bool *valid_p
, tsubst_flags_t complain
)
5709 /* Assume the cast is valid. */
5712 intype
= TREE_TYPE (expr
);
5714 /* Save casted types in the function's used types hash table. */
5715 used_types_insert (type
);
5717 /* [expr.static.cast]
5719 An lvalue of type "cv1 B", where B is a class type, can be cast
5720 to type "reference to cv2 D", where D is a class derived (clause
5721 _class.derived_) from B, if a valid standard conversion from
5722 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5723 same cv-qualification as, or greater cv-qualification than, cv1,
5724 and B is not a virtual base class of D. */
5725 /* We check this case before checking the validity of "TYPE t =
5726 EXPR;" below because for this case:
5729 struct D : public B { D(const B&); };
5731 void f() { static_cast<const D&>(b); }
5733 we want to avoid constructing a new D. The standard is not
5734 completely clear about this issue, but our interpretation is
5735 consistent with other compilers. */
5736 if (TREE_CODE (type
) == REFERENCE_TYPE
5737 && CLASS_TYPE_P (TREE_TYPE (type
))
5738 && CLASS_TYPE_P (intype
)
5739 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5740 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5741 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5742 build_pointer_type (TYPE_MAIN_VARIANT
5743 (TREE_TYPE (type
))))
5745 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5749 /* There is a standard conversion from "D*" to "B*" even if "B"
5750 is ambiguous or inaccessible. If this is really a
5751 static_cast, then we check both for inaccessibility and
5752 ambiguity. However, if this is a static_cast being performed
5753 because the user wrote a C-style cast, then accessibility is
5755 base
= lookup_base (TREE_TYPE (type
), intype
,
5756 c_cast_p
? ba_unique
: ba_check
,
5759 /* Convert from "B*" to "D*". This function will check that "B"
5760 is not a virtual base of "D". */
5761 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5762 base
, /*nonnull=*/false);
5763 /* Convert the pointer to a reference -- but then remember that
5764 there are no expressions with reference type in C++.
5766 We call rvalue so that there's an actual tree code
5767 (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
5768 is a variable with the same type, the conversion would get folded
5769 away, leaving just the variable and causing lvalue_kind to give
5770 the wrong answer. */
5771 return convert_from_reference (rvalue (cp_fold_convert (type
, expr
)));
5774 /* "A glvalue of type cv1 T1 can be cast to type rvalue reference to
5775 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5776 if (TREE_CODE (type
) == REFERENCE_TYPE
5777 && TYPE_REF_IS_RVALUE (type
)
5778 && lvalue_or_rvalue_with_address_p (expr
)
5779 && reference_related_p (TREE_TYPE (type
), intype
)
5780 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5782 expr
= build_typed_address (expr
, type
);
5783 return convert_from_reference (expr
);
5786 /* Resolve overloaded address here rather than once in
5787 implicit_conversion and again in the inverse code below. */
5788 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5790 expr
= instantiate_type (type
, expr
, complain
);
5791 intype
= TREE_TYPE (expr
);
5794 /* [expr.static.cast]
5796 An expression e can be explicitly converted to a type T using a
5797 static_cast of the form static_cast<T>(e) if the declaration T
5798 t(e);" is well-formed, for some invented temporary variable
5800 result
= perform_direct_initialization_if_possible (type
, expr
,
5801 c_cast_p
, complain
);
5804 result
= convert_from_reference (result
);
5806 /* [expr.static.cast]
5808 If T is a reference type, the result is an lvalue; otherwise,
5809 the result is an rvalue. */
5810 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5811 result
= rvalue (result
);
5815 /* [expr.static.cast]
5817 Any expression can be explicitly converted to type cv void. */
5818 if (TREE_CODE (type
) == VOID_TYPE
)
5819 return convert_to_void (expr
, ICV_CAST
, complain
);
5821 /* [expr.static.cast]
5823 The inverse of any standard conversion sequence (clause _conv_),
5824 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5825 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5826 (_conv.bool_) conversions, can be performed explicitly using
5827 static_cast subject to the restriction that the explicit
5828 conversion does not cast away constness (_expr.const.cast_), and
5829 the following additional rules for specific cases: */
5830 /* For reference, the conversions not excluded are: integral
5831 promotions, floating point promotion, integral conversions,
5832 floating point conversions, floating-integral conversions,
5833 pointer conversions, and pointer to member conversions. */
5836 A value of integral _or enumeration_ type can be explicitly
5837 converted to an enumeration type. */
5838 /* The effect of all that is that any conversion between any two
5839 types which are integral, floating, or enumeration types can be
5841 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5842 || SCALAR_FLOAT_TYPE_P (type
))
5843 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5844 || SCALAR_FLOAT_TYPE_P (intype
)))
5845 return ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5847 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5848 && CLASS_TYPE_P (TREE_TYPE (type
))
5849 && CLASS_TYPE_P (TREE_TYPE (intype
))
5850 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5851 (TREE_TYPE (intype
))),
5852 build_pointer_type (TYPE_MAIN_VARIANT
5853 (TREE_TYPE (type
)))))
5858 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
5860 return error_mark_node
;
5861 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
5862 c_cast_p
? ba_unique
: ba_check
,
5864 expr
= build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
5865 return cp_fold_convert(type
, expr
);
5868 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5869 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5876 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
5877 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
5879 if (TYPE_PTRMEM_P (type
))
5881 t1
= (build_ptrmem_type
5883 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
5884 t2
= (build_ptrmem_type
5886 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
5893 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
5896 && check_for_casting_away_constness (intype
, type
,
5899 return error_mark_node
;
5900 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
5901 c_cast_p
, complain
);
5905 /* [expr.static.cast]
5907 An rvalue of type "pointer to cv void" can be explicitly
5908 converted to a pointer to object type. A value of type pointer
5909 to object converted to "pointer to cv void" and back to the
5910 original pointer type will have its original value. */
5911 if (TREE_CODE (intype
) == POINTER_TYPE
5912 && VOID_TYPE_P (TREE_TYPE (intype
))
5913 && TYPE_PTROB_P (type
))
5916 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
5918 return error_mark_node
;
5919 return build_nop (type
, expr
);
5923 return error_mark_node
;
5926 /* Return an expression representing static_cast<TYPE>(EXPR). */
5929 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5934 if (type
== error_mark_node
|| expr
== error_mark_node
)
5935 return error_mark_node
;
5937 if (processing_template_decl
)
5939 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
5940 /* We don't know if it will or will not have side effects. */
5941 TREE_SIDE_EFFECTS (expr
) = 1;
5942 return convert_from_reference (expr
);
5945 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5946 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5947 if (TREE_CODE (type
) != REFERENCE_TYPE
5948 && TREE_CODE (expr
) == NOP_EXPR
5949 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5950 expr
= TREE_OPERAND (expr
, 0);
5952 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
5957 if (complain
& tf_error
)
5958 error ("invalid static_cast from type %qT to type %qT",
5959 TREE_TYPE (expr
), type
);
5960 return error_mark_node
;
5963 /* EXPR is an expression with member function or pointer-to-member
5964 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5965 not permitted by ISO C++, but we accept it in some modes. If we
5966 are not in one of those modes, issue a diagnostic. Return the
5967 converted expression. */
5970 convert_member_func_to_ptr (tree type
, tree expr
)
5975 intype
= TREE_TYPE (expr
);
5976 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
5977 || TREE_CODE (intype
) == METHOD_TYPE
);
5979 if (pedantic
|| warn_pmf2ptr
)
5980 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
5981 "converting from %qT to %qT", intype
, type
);
5983 if (TREE_CODE (intype
) == METHOD_TYPE
)
5984 expr
= build_addr_func (expr
);
5985 else if (TREE_CODE (expr
) == PTRMEM_CST
)
5986 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
5989 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
5990 decl
= build_address (decl
);
5991 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
5994 return build_nop (type
, expr
);
5997 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
5998 If C_CAST_P is true, this reinterpret cast is being done as part of
5999 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
6000 indicate whether or not reinterpret_cast was valid. */
6003 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6004 bool *valid_p
, tsubst_flags_t complain
)
6008 /* Assume the cast is invalid. */
6012 if (type
== error_mark_node
|| error_operand_p (expr
))
6013 return error_mark_node
;
6015 intype
= TREE_TYPE (expr
);
6017 /* Save casted types in the function's used types hash table. */
6018 used_types_insert (type
);
6020 /* [expr.reinterpret.cast]
6021 An lvalue expression of type T1 can be cast to the type
6022 "reference to T2" if an expression of type "pointer to T1" can be
6023 explicitly converted to the type "pointer to T2" using a
6024 reinterpret_cast. */
6025 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6027 if (! real_lvalue_p (expr
))
6029 if (complain
& tf_error
)
6030 error ("invalid cast of an rvalue expression of type "
6033 return error_mark_node
;
6036 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6037 "B" are related class types; the reinterpret_cast does not
6038 adjust the pointer. */
6039 if (TYPE_PTR_P (intype
)
6040 && (complain
& tf_warning
)
6041 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
6042 COMPARE_BASE
| COMPARE_DERIVED
)))
6043 warning (0, "casting %qT to %qT does not dereference pointer",
6046 expr
= cp_build_addr_expr (expr
, complain
);
6048 if (warn_strict_aliasing
> 2)
6049 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
6051 if (expr
!= error_mark_node
)
6052 expr
= build_reinterpret_cast_1
6053 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
6055 if (expr
!= error_mark_node
)
6056 /* cp_build_indirect_ref isn't right for rvalue refs. */
6057 expr
= convert_from_reference (fold_convert (type
, expr
));
6061 /* As a G++ extension, we consider conversions from member
6062 functions, and pointers to member functions to
6063 pointer-to-function and pointer-to-void types. If
6064 -Wno-pmf-conversions has not been specified,
6065 convert_member_func_to_ptr will issue an error message. */
6066 if ((TYPE_PTRMEMFUNC_P (intype
)
6067 || TREE_CODE (intype
) == METHOD_TYPE
)
6068 && TYPE_PTR_P (type
)
6069 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6070 || VOID_TYPE_P (TREE_TYPE (type
))))
6071 return convert_member_func_to_ptr (type
, expr
);
6073 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6074 array-to-pointer, and function-to-pointer conversions are
6076 expr
= decay_conversion (expr
);
6078 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6079 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6080 if (TREE_CODE (expr
) == NOP_EXPR
6081 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6082 expr
= TREE_OPERAND (expr
, 0);
6084 if (error_operand_p (expr
))
6085 return error_mark_node
;
6087 intype
= TREE_TYPE (expr
);
6089 /* [expr.reinterpret.cast]
6090 A pointer can be converted to any integral type large enough to
6091 hold it. ... A value of type std::nullptr_t can be converted to
6092 an integral type; the conversion has the same meaning and
6093 validity as a conversion of (void*)0 to the integral type. */
6094 if (CP_INTEGRAL_TYPE_P (type
)
6095 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
6097 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
6099 if (complain
& tf_error
)
6100 permerror (input_location
, "cast from %qT to %qT loses precision",
6103 return error_mark_node
;
6105 if (NULLPTR_TYPE_P (intype
))
6106 return build_int_cst (type
, 0);
6108 /* [expr.reinterpret.cast]
6109 A value of integral or enumeration type can be explicitly
6110 converted to a pointer. */
6111 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6114 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6115 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6116 return fold_if_not_in_template (build_nop (type
, expr
));
6117 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6118 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6123 && check_for_casting_away_constness (intype
, type
,
6124 REINTERPRET_CAST_EXPR
,
6126 return error_mark_node
;
6127 /* Warn about possible alignment problems. */
6128 if (STRICT_ALIGNMENT
&& warn_cast_align
6129 && (complain
& tf_warning
)
6130 && !VOID_TYPE_P (type
)
6131 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6132 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6133 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6134 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6135 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6136 "increases required alignment of target type", intype
, type
);
6138 /* We need to strip nops here, because the front end likes to
6139 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6141 if (warn_strict_aliasing
<= 2)
6142 strict_aliasing_warning (intype
, type
, sexpr
);
6144 return fold_if_not_in_template (build_nop (type
, expr
));
6146 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6147 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6149 if (pedantic
&& (complain
& tf_warning
))
6150 /* Only issue a warning, as we have always supported this
6151 where possible, and it is necessary in some cases. DR 195
6152 addresses this issue, but as of 2004/10/26 is still in
6154 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6155 return fold_if_not_in_template (build_nop (type
, expr
));
6157 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6158 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6159 else if (TREE_CODE (intype
) == VECTOR_TYPE
6160 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6161 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6166 if (complain
& tf_error
)
6167 error ("invalid cast from type %qT to type %qT", intype
, type
);
6168 return error_mark_node
;
6171 return cp_convert (type
, expr
);
6175 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6177 if (type
== error_mark_node
|| expr
== error_mark_node
)
6178 return error_mark_node
;
6180 if (processing_template_decl
)
6182 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6184 if (!TREE_SIDE_EFFECTS (t
)
6185 && type_dependent_expression_p (expr
))
6186 /* There might turn out to be side effects inside expr. */
6187 TREE_SIDE_EFFECTS (t
) = 1;
6188 return convert_from_reference (t
);
6191 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6192 /*valid_p=*/NULL
, complain
);
6195 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6196 return an appropriate expression. Otherwise, return
6197 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6198 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6199 performing a C-style cast, its value upon return will indicate
6200 whether or not the conversion succeeded. */
6203 build_const_cast_1 (tree dst_type
, tree expr
, tsubst_flags_t complain
,
6207 tree reference_type
;
6209 /* Callers are responsible for handling error_mark_node as a
6210 destination type. */
6211 gcc_assert (dst_type
!= error_mark_node
);
6212 /* In a template, callers should be building syntactic
6213 representations of casts, not using this machinery. */
6214 gcc_assert (!processing_template_decl
);
6216 /* Assume the conversion is invalid. */
6220 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6222 if (complain
& tf_error
)
6223 error ("invalid use of const_cast with type %qT, "
6224 "which is not a pointer, "
6225 "reference, nor a pointer-to-data-member type", dst_type
);
6226 return error_mark_node
;
6229 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6231 if (complain
& tf_error
)
6232 error ("invalid use of const_cast with type %qT, which is a pointer "
6233 "or reference to a function type", dst_type
);
6234 return error_mark_node
;
6237 /* Save casted types in the function's used types hash table. */
6238 used_types_insert (dst_type
);
6240 src_type
= TREE_TYPE (expr
);
6241 /* Expressions do not really have reference types. */
6242 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6243 src_type
= TREE_TYPE (src_type
);
6245 /* [expr.const.cast]
6247 For two object types T1 and T2, if a pointer to T1 can be explicitly
6248 converted to the type "pointer to T2" using a const_cast, then the
6249 following conversions can also be made:
6251 -- an lvalue of type T1 can be explicitly converted to an lvalue of
6252 type T2 using the cast const_cast<T2&>;
6254 -- a glvalue of type T1 can be explicitly converted to an xvalue of
6255 type T2 using the cast const_cast<T2&&>; and
6257 -- if T1 is a class type, a prvalue of type T1 can be explicitly
6258 converted to an xvalue of type T2 using the cast const_cast<T2&&>. */
6260 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6262 reference_type
= dst_type
;
6263 if (!TYPE_REF_IS_RVALUE (dst_type
)
6264 ? real_lvalue_p (expr
)
6265 : (CLASS_TYPE_P (TREE_TYPE (dst_type
))
6267 : lvalue_or_rvalue_with_address_p (expr
)))
6271 if (complain
& tf_error
)
6272 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6273 src_type
, dst_type
);
6274 return error_mark_node
;
6276 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6277 src_type
= build_pointer_type (src_type
);
6281 reference_type
= NULL_TREE
;
6282 /* If the destination type is not a reference type, the
6283 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6284 conversions are performed. */
6285 src_type
= type_decays_to (src_type
);
6286 if (src_type
== error_mark_node
)
6287 return error_mark_node
;
6290 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6291 && comp_ptr_ttypes_const (dst_type
, src_type
))
6296 /* This cast is actually a C-style cast. Issue a warning if
6297 the user is making a potentially unsafe cast. */
6298 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
,
6303 expr
= cp_build_addr_expr (expr
, complain
);
6304 expr
= build_nop (reference_type
, expr
);
6305 return convert_from_reference (expr
);
6309 expr
= decay_conversion (expr
);
6310 /* build_c_cast puts on a NOP_EXPR to make the result not an
6311 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6312 non-lvalue context. */
6313 if (TREE_CODE (expr
) == NOP_EXPR
6314 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6315 expr
= TREE_OPERAND (expr
, 0);
6316 return build_nop (dst_type
, expr
);
6320 if (complain
& tf_error
)
6321 error ("invalid const_cast from type %qT to type %qT",
6322 src_type
, dst_type
);
6323 return error_mark_node
;
6327 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6329 if (type
== error_mark_node
|| error_operand_p (expr
))
6330 return error_mark_node
;
6332 if (processing_template_decl
)
6334 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6336 if (!TREE_SIDE_EFFECTS (t
)
6337 && type_dependent_expression_p (expr
))
6338 /* There might turn out to be side effects inside expr. */
6339 TREE_SIDE_EFFECTS (t
) = 1;
6340 return convert_from_reference (t
);
6343 return build_const_cast_1 (type
, expr
, complain
,
6347 /* Like cp_build_c_cast, but for the c-common bits. */
6350 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6352 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6355 /* Build an expression representing an explicit C-style cast to type
6356 TYPE of expression EXPR. */
6359 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6365 if (type
== error_mark_node
|| error_operand_p (expr
))
6366 return error_mark_node
;
6368 if (processing_template_decl
)
6370 tree t
= build_min (CAST_EXPR
, type
,
6371 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6372 /* We don't know if it will or will not have side effects. */
6373 TREE_SIDE_EFFECTS (t
) = 1;
6374 return convert_from_reference (t
);
6377 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6378 'Class') should always be retained, because this information aids
6379 in method lookup. */
6380 if (objc_is_object_ptr (type
)
6381 && objc_is_object_ptr (TREE_TYPE (expr
)))
6382 return build_nop (type
, expr
);
6384 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6385 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6386 if (TREE_CODE (type
) != REFERENCE_TYPE
6387 && TREE_CODE (value
) == NOP_EXPR
6388 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6389 value
= TREE_OPERAND (value
, 0);
6391 if (TREE_CODE (type
) == ARRAY_TYPE
)
6393 /* Allow casting from T1* to T2[] because Cfront allows it.
6394 NIHCL uses it. It is not valid ISO C++ however. */
6395 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6397 if (complain
& tf_error
)
6398 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6400 return error_mark_node
;
6401 type
= build_pointer_type (TREE_TYPE (type
));
6405 if (complain
& tf_error
)
6406 error ("ISO C++ forbids casting to an array type %qT", type
);
6407 return error_mark_node
;
6411 if (TREE_CODE (type
) == FUNCTION_TYPE
6412 || TREE_CODE (type
) == METHOD_TYPE
)
6414 if (complain
& tf_error
)
6415 error ("invalid cast to function type %qT", type
);
6416 return error_mark_node
;
6419 if (TREE_CODE (type
) == POINTER_TYPE
6420 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
6421 /* Casting to an integer of smaller size is an error detected elsewhere. */
6422 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
6423 /* Don't warn about converting any constant. */
6424 && !TREE_CONSTANT (value
))
6425 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
6426 "cast to pointer from integer of different size");
6428 /* A C-style cast can be a const_cast. */
6429 result
= build_const_cast_1 (type
, value
, complain
& tf_warning
,
6434 /* Or a static cast. */
6435 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6436 &valid_p
, complain
);
6437 /* Or a reinterpret_cast. */
6439 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6440 &valid_p
, complain
);
6441 /* The static_cast or reinterpret_cast may be followed by a
6444 /* A valid cast may result in errors if, for example, a
6445 conversion to am ambiguous base class is required. */
6446 && !error_operand_p (result
))
6450 /* Non-class rvalues always have cv-unqualified type. */
6451 if (!CLASS_TYPE_P (type
))
6452 type
= TYPE_MAIN_VARIANT (type
);
6453 result_type
= TREE_TYPE (result
);
6454 if (!CLASS_TYPE_P (result_type
) && TREE_CODE (type
) != REFERENCE_TYPE
)
6455 result_type
= TYPE_MAIN_VARIANT (result_type
);
6456 /* If the type of RESULT does not match TYPE, perform a
6457 const_cast to make it match. If the static_cast or
6458 reinterpret_cast succeeded, we will differ by at most
6459 cv-qualification, so the follow-on const_cast is guaranteed
6461 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6463 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6464 gcc_assert (valid_p
);
6469 return error_mark_node
;
6472 /* For use from the C common bits. */
6474 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6475 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6476 enum tree_code modifycode
,
6477 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6478 tree rhs_origtype ATTRIBUTE_UNUSED
)
6480 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6483 /* Build an assignment expression of lvalue LHS from value RHS.
6484 MODIFYCODE is the code for a binary operator that we use
6485 to combine the old value of LHS with RHS to get the new value.
6486 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6488 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6491 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6492 tsubst_flags_t complain
)
6496 tree lhstype
= TREE_TYPE (lhs
);
6497 tree olhstype
= lhstype
;
6498 bool plain_assign
= (modifycode
== NOP_EXPR
);
6500 /* Avoid duplicate error messages from operands that had errors. */
6501 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6502 return error_mark_node
;
6504 /* Handle control structure constructs used as "lvalues". */
6505 switch (TREE_CODE (lhs
))
6507 /* Handle --foo = 5; as these are valid constructs in C++. */
6508 case PREDECREMENT_EXPR
:
6509 case PREINCREMENT_EXPR
:
6510 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6511 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6512 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6513 TREE_OPERAND (lhs
, 1));
6514 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6515 modifycode
, rhs
, complain
);
6516 if (newrhs
== error_mark_node
)
6517 return error_mark_node
;
6518 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6520 /* Handle (a, b) used as an "lvalue". */
6522 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6523 modifycode
, rhs
, complain
);
6524 if (newrhs
== error_mark_node
)
6525 return error_mark_node
;
6526 return build2 (COMPOUND_EXPR
, lhstype
,
6527 TREE_OPERAND (lhs
, 0), newrhs
);
6530 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6531 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6532 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6533 TREE_OPERAND (lhs
, 1));
6534 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6536 if (newrhs
== error_mark_node
)
6537 return error_mark_node
;
6538 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6542 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6543 when neither operand has side-effects. */
6544 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6545 return error_mark_node
;
6547 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6548 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6550 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6551 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6553 TREE_OPERAND (lhs
, 0),
6554 TREE_OPERAND (lhs
, 1)),
6555 TREE_OPERAND (lhs
, 0),
6556 TREE_OPERAND (lhs
, 1));
6559 /* Handle (a ? b : c) used as an "lvalue". */
6562 /* Produce (a ? (b = rhs) : (c = rhs))
6563 except that the RHS goes through a save-expr
6564 so the code to compute it is only emitted once. */
6566 tree preeval
= NULL_TREE
;
6568 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6570 if (complain
& tf_error
)
6571 error ("void value not ignored as it ought to be");
6572 return error_mark_node
;
6575 rhs
= stabilize_expr (rhs
, &preeval
);
6577 /* Check this here to avoid odd errors when trying to convert
6578 a throw to the type of the COND_EXPR. */
6579 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6580 return error_mark_node
;
6582 cond
= build_conditional_expr
6583 (TREE_OPERAND (lhs
, 0),
6584 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6585 modifycode
, rhs
, complain
),
6586 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6587 modifycode
, rhs
, complain
),
6590 if (cond
== error_mark_node
)
6592 /* Make sure the code to compute the rhs comes out
6593 before the split. */
6595 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6603 if (modifycode
== INIT_EXPR
)
6605 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6606 /* Do the default thing. */;
6607 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6609 /* Compound literal. */
6610 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6611 /* Call convert to generate an error; see PR 11063. */
6612 rhs
= convert (lhstype
, rhs
);
6613 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6614 TREE_SIDE_EFFECTS (result
) = 1;
6617 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6618 /* Do the default thing. */;
6621 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6622 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6623 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6625 release_tree_vector (rhs_vec
);
6626 if (result
== NULL_TREE
)
6627 return error_mark_node
;
6633 lhs
= require_complete_type_sfinae (lhs
, complain
);
6634 if (lhs
== error_mark_node
)
6635 return error_mark_node
;
6637 if (modifycode
== NOP_EXPR
)
6639 if (c_dialect_objc ())
6641 result
= objc_maybe_build_modify_expr (lhs
, rhs
);
6646 /* `operator=' is not an inheritable operator. */
6647 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6648 /* Do the default thing. */;
6651 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6652 lhs
, rhs
, make_node (NOP_EXPR
),
6653 /*overloaded_p=*/NULL
,
6655 if (result
== NULL_TREE
)
6656 return error_mark_node
;
6663 /* A binary op has been requested. Combine the old LHS
6664 value with the RHS producing the value we should actually
6665 store into the LHS. */
6666 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6667 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6668 || MAYBE_CLASS_TYPE_P (lhstype
)));
6670 lhs
= stabilize_reference (lhs
);
6671 newrhs
= cp_build_binary_op (input_location
,
6672 modifycode
, lhs
, rhs
,
6674 if (newrhs
== error_mark_node
)
6676 if (complain
& tf_error
)
6677 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6678 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6679 return error_mark_node
;
6682 /* Now it looks like a plain assignment. */
6683 modifycode
= NOP_EXPR
;
6684 if (c_dialect_objc ())
6686 result
= objc_maybe_build_modify_expr (lhs
, newrhs
);
6691 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6692 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6695 /* The left-hand side must be an lvalue. */
6696 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6697 return error_mark_node
;
6699 /* Warn about modifying something that is `const'. Don't warn if
6700 this is initialization. */
6701 if (modifycode
!= INIT_EXPR
6702 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6703 /* Functions are not modifiable, even though they are
6705 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6706 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6707 /* If it's an aggregate and any field is const, then it is
6708 effectively const. */
6709 || (CLASS_TYPE_P (lhstype
)
6710 && C_TYPE_FIELDS_READONLY (lhstype
))))
6712 if (complain
& tf_error
)
6713 cxx_readonly_error (lhs
, lv_assign
);
6715 return error_mark_node
;
6718 /* If storing into a structure or union member, it may have been given a
6719 lowered bitfield type. We need to convert to the declared type first,
6720 so retrieve it now. */
6722 olhstype
= unlowered_expr_type (lhs
);
6724 /* Convert new value to destination type. */
6726 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6730 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6732 if (modifycode
!= INIT_EXPR
)
6734 if (complain
& tf_error
)
6735 error ("assigning to an array from an initializer list");
6736 return error_mark_node
;
6738 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6739 return error_mark_node
;
6740 newrhs
= digest_init (lhstype
, newrhs
, complain
);
6743 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6744 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6746 if (complain
& tf_error
)
6747 error ("incompatible types in assignment of %qT to %qT",
6748 TREE_TYPE (rhs
), lhstype
);
6749 return error_mark_node
;
6752 /* Allow array assignment in compiler-generated code. */
6753 else if (!current_function_decl
6754 || !DECL_DEFAULTED_FN (current_function_decl
))
6756 /* This routine is used for both initialization and assignment.
6757 Make sure the diagnostic message differentiates the context. */
6758 if (complain
& tf_error
)
6760 if (modifycode
== INIT_EXPR
)
6761 error ("array used as initializer");
6763 error ("invalid array assignment");
6765 return error_mark_node
;
6768 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6769 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6770 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6771 /*explicit_value_init_p=*/false,
6772 from_array
, complain
);
6775 if (modifycode
== INIT_EXPR
)
6776 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6777 LOOKUP_ONLYCONVERTING. */
6778 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6779 ICR_INIT
, NULL_TREE
, 0,
6782 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
6783 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6785 if (!same_type_p (lhstype
, olhstype
))
6786 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6788 if (modifycode
!= INIT_EXPR
)
6790 if (TREE_CODE (newrhs
) == CALL_EXPR
6791 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6792 newrhs
= build_cplus_new (lhstype
, newrhs
, complain
);
6794 /* Can't initialize directly from a TARGET_EXPR, since that would
6795 cause the lhs to be constructed twice, and possibly result in
6796 accidental self-initialization. So we force the TARGET_EXPR to be
6797 expanded without a target. */
6798 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6799 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6800 TREE_OPERAND (newrhs
, 0));
6803 if (newrhs
== error_mark_node
)
6804 return error_mark_node
;
6806 if (c_dialect_objc () && flag_objc_gc
)
6808 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6814 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6815 lhstype
, lhs
, newrhs
);
6817 TREE_SIDE_EFFECTS (result
) = 1;
6819 TREE_NO_WARNING (result
) = 1;
6825 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6826 tsubst_flags_t complain
)
6828 if (processing_template_decl
)
6829 return build_min_nt (MODOP_EXPR
, lhs
,
6830 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6832 if (modifycode
!= NOP_EXPR
)
6834 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6835 make_node (modifycode
),
6836 /*overloaded_p=*/NULL
,
6840 TREE_NO_WARNING (rval
) = 1;
6844 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6847 /* Helper function for get_delta_difference which assumes FROM is a base
6848 class of TO. Returns a delta for the conversion of pointer-to-member
6849 of FROM to pointer-to-member of TO. If the conversion is invalid and
6850 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
6851 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6852 If C_CAST_P is true, this conversion is taking place as part of a
6856 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
,
6857 tsubst_flags_t complain
)
6861 base_access access
= c_cast_p
? ba_unique
: ba_check
;
6863 /* Note: ba_quiet does not distinguish between access control and
6865 if (!(complain
& tf_error
))
6868 binfo
= lookup_base (to
, from
, access
, &kind
);
6870 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6872 if (!(complain
& tf_error
))
6873 return error_mark_node
;
6875 error (" in pointer to member function conversion");
6876 return size_zero_node
;
6880 if (kind
!= bk_via_virtual
)
6881 return BINFO_OFFSET (binfo
);
6883 /* FROM is a virtual base class of TO. Issue an error or warning
6884 depending on whether or not this is a reinterpret cast. */
6886 if (!(complain
& tf_error
))
6887 return error_mark_node
;
6889 error ("pointer to member conversion via virtual base %qT",
6890 BINFO_TYPE (binfo_from_vbase (binfo
)));
6892 return size_zero_node
;
6899 /* Get difference in deltas for different pointer to member function
6900 types. If the conversion is invalid and tf_error is not set in
6901 COMPLAIN, returns error_mark_node, otherwise returns an integer
6902 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
6903 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
6904 conversions as well. If C_CAST_P is true this conversion is taking
6905 place as part of a C-style cast.
6907 Note that the naming of FROM and TO is kind of backwards; the return
6908 value is what we add to a TO in order to get a FROM. They are named
6909 this way because we call this function to find out how to convert from
6910 a pointer to member of FROM to a pointer to member of TO. */
6913 get_delta_difference (tree from
, tree to
,
6914 bool allow_inverse_p
,
6915 bool c_cast_p
, tsubst_flags_t complain
)
6919 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
6920 /* Pointer to member of incomplete class is permitted*/
6921 result
= size_zero_node
;
6923 result
= get_delta_difference_1 (from
, to
, c_cast_p
, complain
);
6925 if (result
== error_mark_node
)
6926 return error_mark_node
;
6930 if (!allow_inverse_p
)
6932 if (!(complain
& tf_error
))
6933 return error_mark_node
;
6935 error_not_base_type (from
, to
);
6936 error (" in pointer to member conversion");
6937 result
= size_zero_node
;
6941 result
= get_delta_difference_1 (to
, from
, c_cast_p
, complain
);
6943 if (result
== error_mark_node
)
6944 return error_mark_node
;
6947 result
= size_diffop_loc (input_location
,
6948 size_zero_node
, result
);
6951 if (!(complain
& tf_error
))
6952 return error_mark_node
;
6954 error_not_base_type (from
, to
);
6955 error (" in pointer to member conversion");
6956 result
= size_zero_node
;
6961 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
6965 /* Return a constructor for the pointer-to-member-function TYPE using
6966 the other components as specified. */
6969 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
6974 VEC(constructor_elt
, gc
) *v
;
6976 /* Pull the FIELD_DECLs out of the type. */
6977 pfn_field
= TYPE_FIELDS (type
);
6978 delta_field
= DECL_CHAIN (pfn_field
);
6980 /* Make sure DELTA has the type we want. */
6981 delta
= convert_and_check (delta_type_node
, delta
);
6983 /* Convert to the correct target type if necessary. */
6984 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
6986 /* Finish creating the initializer. */
6987 v
= VEC_alloc(constructor_elt
, gc
, 2);
6988 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
6989 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
6990 u
= build_constructor (type
, v
);
6991 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
6992 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
6993 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
6995 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
7000 /* Build a constructor for a pointer to member function. It can be
7001 used to initialize global variables, local variable, or used
7002 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
7005 If FORCE is nonzero, then force this conversion, even if
7006 we would rather not do it. Usually set when using an explicit
7007 cast. A C-style cast is being processed iff C_CAST_P is true.
7009 Return error_mark_node, if something goes wrong. */
7012 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
,
7013 tsubst_flags_t complain
)
7019 if (error_operand_p (pfn
))
7020 return error_mark_node
;
7022 pfn_type
= TREE_TYPE (pfn
);
7023 to_type
= build_ptrmemfunc_type (type
);
7025 /* Handle multiple conversions of pointer to member functions. */
7026 if (TYPE_PTRMEMFUNC_P (pfn_type
))
7028 tree delta
= NULL_TREE
;
7029 tree npfn
= NULL_TREE
;
7033 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
7034 error ("invalid conversion to type %qT from type %qT",
7037 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
7038 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
7040 c_cast_p
, complain
);
7041 if (n
== error_mark_node
)
7042 return error_mark_node
;
7044 /* We don't have to do any conversion to convert a
7045 pointer-to-member to its own type. But, we don't want to
7046 just return a PTRMEM_CST if there's an explicit cast; that
7047 cast should make the expression an invalid template argument. */
7048 if (TREE_CODE (pfn
) != PTRMEM_CST
)
7050 if (same_type_p (to_type
, pfn_type
))
7052 else if (integer_zerop (n
))
7053 return build_reinterpret_cast (to_type
, pfn
,
7054 tf_warning_or_error
);
7057 if (TREE_SIDE_EFFECTS (pfn
))
7058 pfn
= save_expr (pfn
);
7060 /* Obtain the function pointer and the current DELTA. */
7061 if (TREE_CODE (pfn
) == PTRMEM_CST
)
7062 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
7065 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
7066 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
7069 /* Just adjust the DELTA field. */
7070 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7071 (TREE_TYPE (delta
), ptrdiff_type_node
));
7072 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
7073 n
= cp_build_binary_op (input_location
,
7074 LSHIFT_EXPR
, n
, integer_one_node
,
7075 tf_warning_or_error
);
7076 delta
= cp_build_binary_op (input_location
,
7077 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
7078 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
7081 /* Handle null pointer to member function conversions. */
7082 if (null_ptr_cst_p (pfn
))
7084 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
7085 return build_ptrmemfunc1 (to_type
,
7090 if (type_unknown_p (pfn
))
7091 return instantiate_type (type
, pfn
, tf_warning_or_error
);
7093 fn
= TREE_OPERAND (pfn
, 0);
7094 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7095 /* In a template, we will have preserved the
7097 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
7098 return make_ptrmem_cst (to_type
, fn
);
7101 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7104 ??? There is no consistency as to the types returned for the above
7105 values. Some code acts as if it were a sizetype and some as if it were
7106 integer_type_node. */
7109 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
7111 tree type
= TREE_TYPE (cst
);
7112 tree fn
= PTRMEM_CST_MEMBER (cst
);
7113 tree ptr_class
, fn_class
;
7115 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7117 /* The class that the function belongs to. */
7118 fn_class
= DECL_CONTEXT (fn
);
7120 /* The class that we're creating a pointer to member of. */
7121 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
7123 /* First, calculate the adjustment to the function's class. */
7124 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
7125 /*c_cast_p=*/0, tf_warning_or_error
);
7127 if (!DECL_VIRTUAL_P (fn
))
7128 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
7131 /* If we're dealing with a virtual function, we have to adjust 'this'
7132 again, to point to the base which provides the vtable entry for
7133 fn; the call will do the opposite adjustment. */
7134 tree orig_class
= DECL_CONTEXT (fn
);
7135 tree binfo
= binfo_or_else (orig_class
, fn_class
);
7136 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7137 *delta
, BINFO_OFFSET (binfo
));
7138 *delta
= fold_if_not_in_template (*delta
);
7140 /* We set PFN to the vtable offset at which the function can be
7141 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7142 case delta is shifted left, and then incremented). */
7143 *pfn
= DECL_VINDEX (fn
);
7144 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
7145 TYPE_SIZE_UNIT (vtable_entry_type
));
7146 *pfn
= fold_if_not_in_template (*pfn
);
7148 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
7150 case ptrmemfunc_vbit_in_pfn
:
7151 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
7153 *pfn
= fold_if_not_in_template (*pfn
);
7156 case ptrmemfunc_vbit_in_delta
:
7157 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
7158 *delta
, integer_one_node
);
7159 *delta
= fold_if_not_in_template (*delta
);
7160 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7161 *delta
, integer_one_node
);
7162 *delta
= fold_if_not_in_template (*delta
);
7169 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
7170 *pfn
= fold_if_not_in_template (*pfn
);
7174 /* Return an expression for PFN from the pointer-to-member function
7178 pfn_from_ptrmemfunc (tree t
)
7180 if (TREE_CODE (t
) == PTRMEM_CST
)
7185 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7190 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
7193 /* Return an expression for DELTA from the pointer-to-member function
7197 delta_from_ptrmemfunc (tree t
)
7199 if (TREE_CODE (t
) == PTRMEM_CST
)
7204 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7209 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7212 /* Convert value RHS to type TYPE as preparation for an assignment to
7213 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
7214 implicit conversion is. If FNDECL is non-NULL, we are doing the
7215 conversion in order to pass the PARMNUMth argument of FNDECL.
7216 If FNDECL is NULL, we are doing the conversion in function pointer
7217 argument passing, conversion in initialization, etc. */
7220 convert_for_assignment (tree type
, tree rhs
,
7221 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7222 tsubst_flags_t complain
, int flags
)
7225 enum tree_code coder
;
7227 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7228 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7229 rhs
= TREE_OPERAND (rhs
, 0);
7231 rhstype
= TREE_TYPE (rhs
);
7232 coder
= TREE_CODE (rhstype
);
7234 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7235 && vector_types_convertible_p (type
, rhstype
, true))
7237 rhs
= mark_rvalue_use (rhs
);
7238 return convert (type
, rhs
);
7241 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7242 return error_mark_node
;
7243 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7244 return error_mark_node
;
7246 /* The RHS of an assignment cannot have void type. */
7247 if (coder
== VOID_TYPE
)
7249 if (complain
& tf_error
)
7250 error ("void value not ignored as it ought to be");
7251 return error_mark_node
;
7254 /* Simplify the RHS if possible. */
7255 if (TREE_CODE (rhs
) == CONST_DECL
)
7256 rhs
= DECL_INITIAL (rhs
);
7258 if (c_dialect_objc ())
7262 tree rname
= fndecl
;
7273 selector
= objc_message_selector ();
7275 if (selector
&& parmno
> 1)
7282 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7284 rhs
= mark_rvalue_use (rhs
);
7285 return convert (type
, rhs
);
7291 The expression is implicitly converted (clause _conv_) to the
7292 cv-unqualified type of the left operand.
7294 We allow bad conversions here because by the time we get to this point
7295 we are committed to doing the conversion. If we end up doing a bad
7296 conversion, convert_like will complain. */
7297 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7299 /* When -Wno-pmf-conversions is use, we just silently allow
7300 conversions from pointers-to-members to plain pointers. If
7301 the conversion doesn't work, cp_convert will complain. */
7303 && TYPE_PTR_P (type
)
7304 && TYPE_PTRMEMFUNC_P (rhstype
))
7305 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7308 if (complain
& tf_error
)
7310 /* If the right-hand side has unknown type, then it is an
7311 overloaded function. Call instantiate_type to get error
7313 if (rhstype
== unknown_type_node
)
7314 instantiate_type (type
, rhs
, tf_warning_or_error
);
7316 error ("cannot convert %qT to %qT for argument %qP to %qD",
7317 rhstype
, type
, parmnum
, fndecl
);
7321 case ICR_DEFAULT_ARGUMENT
:
7322 error ("cannot convert %qT to %qT in default argument",
7326 error ("cannot convert %qT to %qT in argument passing",
7329 case ICR_CONVERTING
:
7330 error ("cannot convert %qT to %qT",
7334 error ("cannot convert %qT to %qT in initialization",
7338 error ("cannot convert %qT to %qT in return",
7342 error ("cannot convert %qT to %qT in assignment",
7349 return error_mark_node
;
7352 if (warn_missing_format_attribute
)
7354 const enum tree_code codel
= TREE_CODE (type
);
7355 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7357 && check_missing_format_attribute (type
, rhstype
)
7358 && (complain
& tf_warning
))
7362 case ICR_DEFAULT_ARGUMENT
:
7364 warning (OPT_Wmissing_format_attribute
,
7365 "parameter %qP of %qD might be a candidate "
7366 "for a format attribute", parmnum
, fndecl
);
7368 warning (OPT_Wmissing_format_attribute
,
7369 "parameter might be a candidate "
7370 "for a format attribute");
7372 case ICR_CONVERTING
:
7373 warning (OPT_Wmissing_format_attribute
,
7374 "target of conversion might be a candidate "
7375 "for a format attribute");
7378 warning (OPT_Wmissing_format_attribute
,
7379 "target of initialization might be a candidate "
7380 "for a format attribute");
7383 warning (OPT_Wmissing_format_attribute
,
7384 "return type might be a candidate "
7385 "for a format attribute");
7388 warning (OPT_Wmissing_format_attribute
,
7389 "left-hand side of assignment might be a candidate "
7390 "for a format attribute");
7397 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7399 if (warn_parentheses
7400 && TREE_CODE (type
) == BOOLEAN_TYPE
7401 && TREE_CODE (rhs
) == MODIFY_EXPR
7402 && !TREE_NO_WARNING (rhs
)
7403 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7404 && (complain
& tf_warning
))
7406 location_t loc
= EXPR_LOC_OR_HERE (rhs
);
7408 warning_at (loc
, OPT_Wparentheses
,
7409 "suggest parentheses around assignment used as truth value");
7410 TREE_NO_WARNING (rhs
) = 1;
7413 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7417 /* Convert RHS to be of type TYPE.
7418 If EXP is nonzero, it is the target of the initialization.
7419 ERRTYPE indicates what kind of error the implicit conversion is.
7421 Two major differences between the behavior of
7422 `convert_for_assignment' and `convert_for_initialization'
7423 are that references are bashed in the former, while
7424 copied in the latter, and aggregates are assigned in
7425 the former (operator=) while initialized in the
7428 If using constructor make sure no conversion operator exists, if one does
7429 exist, an ambiguity exists.
7431 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7434 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7435 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7436 tsubst_flags_t complain
)
7438 enum tree_code codel
= TREE_CODE (type
);
7440 enum tree_code coder
;
7442 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7443 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7444 if (TREE_CODE (rhs
) == NOP_EXPR
7445 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7446 && codel
!= REFERENCE_TYPE
)
7447 rhs
= TREE_OPERAND (rhs
, 0);
7449 if (type
== error_mark_node
7450 || rhs
== error_mark_node
7451 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7452 return error_mark_node
;
7454 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7455 && TREE_CODE (type
) != ARRAY_TYPE
7456 && (TREE_CODE (type
) != REFERENCE_TYPE
7457 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7458 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7459 && (TREE_CODE (type
) != REFERENCE_TYPE
7460 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7461 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7462 rhs
= decay_conversion (rhs
);
7464 rhstype
= TREE_TYPE (rhs
);
7465 coder
= TREE_CODE (rhstype
);
7467 if (coder
== ERROR_MARK
)
7468 return error_mark_node
;
7470 /* We accept references to incomplete types, so we can
7471 return here before checking if RHS is of complete type. */
7473 if (codel
== REFERENCE_TYPE
)
7475 /* This should eventually happen in convert_arguments. */
7476 int savew
= 0, savee
= 0;
7479 savew
= warningcount
, savee
= errorcount
;
7480 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7481 /*cleanup=*/NULL
, complain
);
7484 if (warningcount
> savew
)
7485 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7486 else if (errorcount
> savee
)
7487 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7493 exp
= require_complete_type_sfinae (exp
, complain
);
7494 if (exp
== error_mark_node
)
7495 return error_mark_node
;
7497 rhstype
= non_reference (rhstype
);
7499 type
= complete_type (type
);
7501 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7502 /* Don't try to do copy-initialization if we already have
7503 direct-initialization. */
7506 if (MAYBE_CLASS_TYPE_P (type
))
7507 return perform_implicit_conversion_flags (type
, rhs
, complain
, flags
);
7509 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7513 /* If RETVAL is the address of, or a reference to, a local variable or
7514 temporary give an appropriate warning. */
7517 maybe_warn_about_returning_address_of_local (tree retval
)
7519 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7520 tree whats_returned
= retval
;
7524 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7525 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7526 else if (CONVERT_EXPR_P (whats_returned
)
7527 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7528 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7533 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7535 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7537 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7539 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7540 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7542 warning (0, "returning reference to temporary");
7545 if (TREE_CODE (whats_returned
) == VAR_DECL
7546 && DECL_NAME (whats_returned
)
7547 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7549 warning (0, "reference to non-lvalue returned");
7554 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7555 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7556 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7558 if (DECL_P (whats_returned
)
7559 && DECL_NAME (whats_returned
)
7560 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7561 && !(TREE_STATIC (whats_returned
)
7562 || TREE_PUBLIC (whats_returned
)))
7564 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7565 warning (0, "reference to local variable %q+D returned",
7568 warning (0, "address of local variable %q+D returned",
7574 /* Check that returning RETVAL from the current function is valid.
7575 Return an expression explicitly showing all conversions required to
7576 change RETVAL into the function return type, and to assign it to
7577 the DECL_RESULT for the function. Set *NO_WARNING to true if
7578 code reaches end of non-void function warning shouldn't be issued
7579 on this RETURN_EXPR. */
7582 check_return_expr (tree retval
, bool *no_warning
)
7585 /* The type actually returned by the function, after any
7588 int fn_returns_value_p
;
7589 bool named_return_value_okay_p
;
7591 *no_warning
= false;
7593 /* A `volatile' function is one that isn't supposed to return, ever.
7594 (This is a G++ extension, used to get better code for functions
7595 that call the `volatile' function.) */
7596 if (TREE_THIS_VOLATILE (current_function_decl
))
7597 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7599 /* Check for various simple errors. */
7600 if (DECL_DESTRUCTOR_P (current_function_decl
))
7603 error ("returning a value from a destructor");
7606 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7608 if (in_function_try_handler
)
7609 /* If a return statement appears in a handler of the
7610 function-try-block of a constructor, the program is ill-formed. */
7611 error ("cannot return from a handler of a function-try-block of a constructor");
7613 /* You can't return a value from a constructor. */
7614 error ("returning a value from a constructor");
7618 /* As an extension, deduce lambda return type from a return statement
7619 anywhere in the body. */
7620 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7622 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7623 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7625 tree type
= lambda_return_type (retval
);
7626 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7628 if (VOID_TYPE_P (type
))
7630 else if (oldtype
== NULL_TREE
)
7632 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7633 "can only be deduced when the return statement is "
7634 "the only statement in the function body");
7635 apply_lambda_return_type (lambda
, type
);
7637 else if (!same_type_p (type
, oldtype
))
7638 error ("inconsistent types %qT and %qT deduced for "
7639 "lambda return type", type
, oldtype
);
7643 if (processing_template_decl
)
7645 current_function_returns_value
= 1;
7646 if (check_for_bare_parameter_packs (retval
))
7647 retval
= error_mark_node
;
7651 /* When no explicit return-value is given in a function with a named
7652 return value, the named return value is used. */
7653 result
= DECL_RESULT (current_function_decl
);
7654 valtype
= TREE_TYPE (result
);
7655 gcc_assert (valtype
!= NULL_TREE
);
7656 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7657 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7660 /* Check for a return statement with no return value in a function
7661 that's supposed to return a value. */
7662 if (!retval
&& fn_returns_value_p
)
7664 permerror (input_location
, "return-statement with no value, in function returning %qT",
7666 /* Clear this, so finish_function won't say that we reach the
7667 end of a non-void function (which we don't, we gave a
7669 current_function_returns_null
= 0;
7670 /* And signal caller that TREE_NO_WARNING should be set on the
7671 RETURN_EXPR to avoid control reaches end of non-void function
7672 warnings in tree-cfg.c. */
7675 /* Check for a return statement with a value in a function that
7676 isn't supposed to return a value. */
7677 else if (retval
&& !fn_returns_value_p
)
7679 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7680 /* You can return a `void' value from a function of `void'
7681 type. In that case, we have to evaluate the expression for
7682 its side-effects. */
7683 finish_expr_stmt (retval
);
7685 permerror (input_location
, "return-statement with a value, in function "
7686 "returning 'void'");
7687 current_function_returns_null
= 1;
7689 /* There's really no value to return, after all. */
7693 /* Remember that this function can sometimes return without a
7695 current_function_returns_null
= 1;
7697 /* Remember that this function did return a value. */
7698 current_function_returns_value
= 1;
7700 /* Check for erroneous operands -- but after giving ourselves a
7701 chance to provide an error about returning a value from a void
7703 if (error_operand_p (retval
))
7705 current_function_return_value
= error_mark_node
;
7706 return error_mark_node
;
7709 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7710 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7711 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7712 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7714 && retval
&& null_ptr_cst_p (retval
))
7715 warning (0, "%<operator new%> must not return NULL unless it is "
7716 "declared %<throw()%> (or -fcheck-new is in effect)");
7718 /* Effective C++ rule 15. See also start_function. */
7720 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7724 /* The function return type must be a reference to the current
7726 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7727 && same_type_ignoring_top_level_qualifiers_p
7728 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7730 /* Returning '*this' is obviously OK. */
7731 if (retval
== current_class_ref
)
7733 /* If we are calling a function whose return type is the same of
7734 the current class reference, it is ok. */
7735 else if (TREE_CODE (retval
) == INDIRECT_REF
7736 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7741 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7744 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7746 [...] For a function with a class return type, if the expression
7747 in the return statement is the name of a local object, and the cv-
7748 unqualified type of the local object is the same as the function
7749 return type, an implementation is permitted to omit creating the tem-
7750 porary object to hold the function return value [...]
7752 So, if this is a value-returning function that always returns the same
7753 local variable, remember it.
7755 It might be nice to be more flexible, and choose the first suitable
7756 variable even if the function sometimes returns something else, but
7757 then we run the risk of clobbering the variable we chose if the other
7758 returned expression uses the chosen variable somehow. And people expect
7759 this restriction, anyway. (jason 2000-11-19)
7761 See finish_function and finalize_nrv for the rest of this optimization. */
7763 named_return_value_okay_p
=
7764 (retval
!= NULL_TREE
7765 /* Must be a local, automatic variable. */
7766 && TREE_CODE (retval
) == VAR_DECL
7767 && DECL_CONTEXT (retval
) == current_function_decl
7768 && ! TREE_STATIC (retval
)
7769 && ! DECL_ANON_UNION_VAR_P (retval
)
7770 && (DECL_ALIGN (retval
)
7771 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7772 /* The cv-unqualified type of the returned value must be the
7773 same as the cv-unqualified return type of the
7775 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7777 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7778 /* And the returned value must be non-volatile. */
7779 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7781 if (fn_returns_value_p
&& flag_elide_constructors
)
7783 if (named_return_value_okay_p
7784 && (current_function_return_value
== NULL_TREE
7785 || current_function_return_value
== retval
))
7786 current_function_return_value
= retval
;
7788 current_function_return_value
= error_mark_node
;
7791 /* We don't need to do any conversions when there's nothing being
7796 /* Do any required conversions. */
7797 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7798 /* No conversions are required. */
7802 /* The type the function is declared to return. */
7803 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7804 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7806 /* The functype's return type will have been set to void, if it
7807 was an incomplete type. Just treat this as 'return;' */
7808 if (VOID_TYPE_P (functype
))
7809 return error_mark_node
;
7811 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7812 treated as an rvalue for the purposes of overload resolution to
7813 favor move constructors over copy constructors.
7815 Note that these conditions are similar to, but not as strict as,
7816 the conditions for the named return value optimization. */
7817 if ((cxx_dialect
!= cxx98
)
7818 && (TREE_CODE (retval
) == VAR_DECL
7819 || TREE_CODE (retval
) == PARM_DECL
)
7820 && DECL_CONTEXT (retval
) == current_function_decl
7821 && !TREE_STATIC (retval
)
7822 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7824 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7825 /* This is only interesting for class type. */
7826 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7827 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7829 /* First convert the value to the function's return type, then
7830 to the type of return value's location to handle the
7831 case that functype is smaller than the valtype. */
7832 retval
= convert_for_initialization
7833 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
7834 tf_warning_or_error
);
7835 retval
= convert (valtype
, retval
);
7837 /* If the conversion failed, treat this just like `return;'. */
7838 if (retval
== error_mark_node
)
7840 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7841 else if (! cfun
->returns_struct
7842 && TREE_CODE (retval
) == TARGET_EXPR
7843 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7844 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7845 TREE_OPERAND (retval
, 0));
7847 maybe_warn_about_returning_address_of_local (retval
);
7850 /* Actually copy the value returned into the appropriate location. */
7851 if (retval
&& retval
!= result
)
7852 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7858 /* Returns nonzero if the pointer-type FROM can be converted to the
7859 pointer-type TO via a qualification conversion. If CONSTP is -1,
7860 then we return nonzero if the pointers are similar, and the
7861 cv-qualification signature of FROM is a proper subset of that of TO.
7863 If CONSTP is positive, then all outer pointers have been
7867 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7869 bool to_more_cv_qualified
= false;
7870 bool is_opaque_pointer
= false;
7872 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7874 if (TREE_CODE (to
) != TREE_CODE (from
))
7877 if (TREE_CODE (from
) == OFFSET_TYPE
7878 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7879 TYPE_OFFSET_BASETYPE (to
)))
7882 /* Const and volatile mean something different for function types,
7883 so the usual checks are not appropriate. */
7884 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7886 if (!at_least_as_qualified_p (to
, from
))
7889 if (!at_least_as_qualified_p (from
, to
))
7893 to_more_cv_qualified
= true;
7897 constp
&= TYPE_READONLY (to
);
7900 if (TREE_CODE (to
) == VECTOR_TYPE
)
7901 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7903 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
7904 return ((constp
>= 0 || to_more_cv_qualified
)
7905 && (is_opaque_pointer
7906 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
7910 /* When comparing, say, char ** to char const **, this function takes
7911 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7912 types to this function. */
7915 comp_ptr_ttypes (tree to
, tree from
)
7917 return comp_ptr_ttypes_real (to
, from
, 1);
7920 /* Returns true iff FNTYPE is a non-class type that involves
7921 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7922 if a parameter type is ill-formed. */
7925 error_type_p (const_tree type
)
7929 switch (TREE_CODE (type
))
7935 case REFERENCE_TYPE
:
7937 return error_type_p (TREE_TYPE (type
));
7941 if (error_type_p (TREE_TYPE (type
)))
7943 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7944 if (error_type_p (TREE_VALUE (t
)))
7949 if (TYPE_PTRMEMFUNC_P (type
))
7950 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
7958 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7959 type or inheritance-related types, regardless of cv-quals. */
7962 ptr_reasonably_similar (const_tree to
, const_tree from
)
7964 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7966 /* Any target type is similar enough to void. */
7967 if (TREE_CODE (to
) == VOID_TYPE
)
7968 return !error_type_p (from
);
7969 if (TREE_CODE (from
) == VOID_TYPE
)
7970 return !error_type_p (to
);
7972 if (TREE_CODE (to
) != TREE_CODE (from
))
7975 if (TREE_CODE (from
) == OFFSET_TYPE
7976 && comptypes (TYPE_OFFSET_BASETYPE (to
),
7977 TYPE_OFFSET_BASETYPE (from
),
7978 COMPARE_BASE
| COMPARE_DERIVED
))
7981 if (TREE_CODE (to
) == VECTOR_TYPE
7982 && vector_types_convertible_p (to
, from
, false))
7985 if (TREE_CODE (to
) == INTEGER_TYPE
7986 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
7989 if (TREE_CODE (to
) == FUNCTION_TYPE
)
7990 return !error_type_p (to
) && !error_type_p (from
);
7992 if (TREE_CODE (to
) != POINTER_TYPE
)
7994 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
7995 COMPARE_BASE
| COMPARE_DERIVED
);
7999 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
8000 pointer-to-member types) are the same, ignoring cv-qualification at
8004 comp_ptr_ttypes_const (tree to
, tree from
)
8006 bool is_opaque_pointer
= false;
8008 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
8010 if (TREE_CODE (to
) != TREE_CODE (from
))
8013 if (TREE_CODE (from
) == OFFSET_TYPE
8014 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
8015 TYPE_OFFSET_BASETYPE (to
)))
8018 if (TREE_CODE (to
) == VECTOR_TYPE
)
8019 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
8021 if (TREE_CODE (to
) != POINTER_TYPE
)
8022 return (is_opaque_pointer
8023 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
8027 /* Returns the type qualifiers for this type, including the qualifiers on the
8028 elements for an array type. */
8031 cp_type_quals (const_tree type
)
8034 /* This CONST_CAST is okay because strip_array_types returns its
8035 argument unmodified and we assign it to a const_tree. */
8036 type
= strip_array_types (CONST_CAST_TREE (type
));
8037 if (type
== error_mark_node
8038 /* Quals on a FUNCTION_TYPE are memfn quals. */
8039 || TREE_CODE (type
) == FUNCTION_TYPE
)
8040 return TYPE_UNQUALIFIED
;
8041 quals
= TYPE_QUALS (type
);
8042 /* METHOD and REFERENCE_TYPEs should never have quals. */
8043 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
8044 && TREE_CODE (type
) != REFERENCE_TYPE
)
8045 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
8046 == TYPE_UNQUALIFIED
));
8050 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
8054 type_memfn_quals (const_tree type
)
8056 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8057 return TYPE_QUALS (type
);
8058 else if (TREE_CODE (type
) == METHOD_TYPE
)
8059 return cp_type_quals (class_of_this_parm (type
));
8064 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
8068 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
)
8070 /* Could handle METHOD_TYPE here if necessary. */
8071 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8072 if (TYPE_QUALS (type
) == memfn_quals
)
8074 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
8076 return build_qualified_type (type
, memfn_quals
);
8079 /* Returns nonzero if TYPE is const or volatile. */
8082 cv_qualified_p (const_tree type
)
8084 int quals
= cp_type_quals (type
);
8085 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
8088 /* Returns nonzero if the TYPE contains a mutable member. */
8091 cp_has_mutable_p (const_tree type
)
8093 /* This CONST_CAST is okay because strip_array_types returns its
8094 argument unmodified and we assign it to a const_tree. */
8095 type
= strip_array_types (CONST_CAST_TREE(type
));
8097 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
8100 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
8101 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
8102 approximation. In particular, consider:
8105 struct S { int i; };
8106 const S s = { f(); }
8108 Here, we will make "s" as TREE_READONLY (because it is declared
8109 "const") -- only to reverse ourselves upon seeing that the
8110 initializer is non-constant. */
8113 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
8115 tree type
= TREE_TYPE (decl
);
8117 if (type
== error_mark_node
)
8120 if (TREE_CODE (decl
) == TYPE_DECL
)
8123 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
8124 && type_quals
!= TYPE_UNQUALIFIED
));
8126 /* Avoid setting TREE_READONLY incorrectly. */
8127 if (/* If the object has a constructor, the constructor may modify
8129 TYPE_NEEDS_CONSTRUCTING (type
)
8130 /* If the type isn't complete, we don't know yet if it will need
8132 || !COMPLETE_TYPE_P (type
)
8133 /* If the type has a mutable component, that component might be
8135 || TYPE_HAS_MUTABLE_P (type
))
8136 type_quals
&= ~TYPE_QUAL_CONST
;
8138 c_apply_type_quals_to_decl (type_quals
, decl
);
8141 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8142 exemplar types such that casting T1 to T2 is casting away constness
8143 if and only if there is no implicit conversion from T1 to T2. */
8146 casts_away_constness_r (tree
*t1
, tree
*t2
)
8151 /* [expr.const.cast]
8153 For multi-level pointer to members and multi-level mixed pointers
8154 and pointers to members (conv.qual), the "member" aspect of a
8155 pointer to member level is ignored when determining if a const
8156 cv-qualifier has been cast away. */
8157 /* [expr.const.cast]
8159 For two pointer types:
8161 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8162 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8165 casting from X1 to X2 casts away constness if, for a non-pointer
8166 type T there does not exist an implicit conversion (clause
8169 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8173 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8174 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
8175 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
8177 *t1
= cp_build_qualified_type (void_type_node
,
8178 cp_type_quals (*t1
));
8179 *t2
= cp_build_qualified_type (void_type_node
,
8180 cp_type_quals (*t2
));
8184 quals1
= cp_type_quals (*t1
);
8185 quals2
= cp_type_quals (*t2
);
8187 if (TYPE_PTRMEM_P (*t1
))
8188 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
8190 *t1
= TREE_TYPE (*t1
);
8191 if (TYPE_PTRMEM_P (*t2
))
8192 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
8194 *t2
= TREE_TYPE (*t2
);
8196 casts_away_constness_r (t1
, t2
);
8197 *t1
= build_pointer_type (*t1
);
8198 *t2
= build_pointer_type (*t2
);
8199 *t1
= cp_build_qualified_type (*t1
, quals1
);
8200 *t2
= cp_build_qualified_type (*t2
, quals2
);
8203 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8206 ??? This function returns non-zero if casting away qualifiers not
8207 just const. We would like to return to the caller exactly which
8208 qualifiers are casted away to give more accurate diagnostics.
8212 casts_away_constness (tree t1
, tree t2
)
8214 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
8216 /* [expr.const.cast]
8218 Casting from an lvalue of type T1 to an lvalue of type T2
8219 using a reference cast casts away constness if a cast from an
8220 rvalue of type "pointer to T1" to the type "pointer to T2"
8221 casts away constness. */
8222 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
8223 return casts_away_constness (build_pointer_type (t1
),
8224 build_pointer_type (TREE_TYPE (t2
)));
8227 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
8228 /* [expr.const.cast]
8230 Casting from an rvalue of type "pointer to data member of X
8231 of type T1" to the type "pointer to data member of Y of type
8232 T2" casts away constness if a cast from an rvalue of type
8233 "pointer to T1" to the type "pointer to T2" casts away
8235 return casts_away_constness
8236 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
8237 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
8239 /* Casting away constness is only something that makes sense for
8240 pointer or reference types. */
8241 if (TREE_CODE (t1
) != POINTER_TYPE
8242 || TREE_CODE (t2
) != POINTER_TYPE
)
8245 /* Top-level qualifiers don't matter. */
8246 t1
= TYPE_MAIN_VARIANT (t1
);
8247 t2
= TYPE_MAIN_VARIANT (t2
);
8248 casts_away_constness_r (&t1
, &t2
);
8249 if (!can_convert (t2
, t1
))
8255 /* If T is a REFERENCE_TYPE return the type to which T refers.
8256 Otherwise, return T itself. */
8259 non_reference (tree t
)
8261 if (TREE_CODE (t
) == REFERENCE_TYPE
)
8267 /* Return nonzero if REF is an lvalue valid for this language;
8268 otherwise, print an error message and return zero. USE says
8269 how the lvalue is being used and so selects the error message. */
8272 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
8274 cp_lvalue_kind kind
= lvalue_kind (ref
);
8276 if (kind
== clk_none
)
8278 if (complain
& tf_error
)
8279 lvalue_error (input_location
, use
);
8282 else if (kind
& (clk_rvalueref
|clk_class
))
8284 if (!(complain
& tf_error
))
8286 if (kind
& clk_class
)
8287 /* Make this a permerror because we used to accept it. */
8288 permerror (input_location
, "using temporary as lvalue");
8290 error ("using xvalue (rvalue reference) as lvalue");