1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011
4 Free Software Foundation, Inc.
5 Hacked by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
24 /* This file is part of the C++ front end.
25 It contains routines to build C++ expressions given their operands,
26 including computing the types of the result, C and C++ specific error
27 checks, and some optimization. */
31 #include "coretypes.h"
37 #include "diagnostic.h"
41 #include "c-family/c-common.h"
42 #include "c-family/c-objc.h"
45 static tree
pfn_from_ptrmemfunc (tree
);
46 static tree
delta_from_ptrmemfunc (tree
);
47 static tree
convert_for_assignment (tree
, tree
, impl_conv_rhs
, tree
, int,
49 static tree
cp_pointer_int_sum (enum tree_code
, tree
, tree
);
50 static tree
rationalize_conditional_expr (enum tree_code
, tree
,
52 static int comp_ptr_ttypes_real (tree
, tree
, int);
53 static bool comp_except_types (tree
, tree
, bool);
54 static bool comp_array_types (const_tree
, const_tree
, bool);
55 static tree
pointer_diff (tree
, tree
, tree
);
56 static tree
get_delta_difference (tree
, tree
, bool, bool, tsubst_flags_t
);
57 static void casts_away_constness_r (tree
*, tree
*);
58 static bool casts_away_constness (tree
, tree
);
59 static void maybe_warn_about_returning_address_of_local (tree
);
60 static tree
lookup_destructor (tree
, tree
, tree
);
61 static void warn_args_num (location_t
, tree
, bool);
62 static int convert_arguments (tree
, VEC(tree
,gc
) **, tree
, int,
65 /* Do `exp = require_complete_type (exp);' to make sure exp
66 does not have an incomplete type. (That includes void types.)
67 Returns error_mark_node if the VALUE does not have
68 complete type when this function returns. */
71 require_complete_type_sfinae (tree value
, tsubst_flags_t complain
)
75 if (processing_template_decl
|| value
== error_mark_node
)
78 if (TREE_CODE (value
) == OVERLOAD
)
79 type
= unknown_type_node
;
81 type
= TREE_TYPE (value
);
83 if (type
== error_mark_node
)
84 return error_mark_node
;
86 /* First, detect a valid value with a complete type. */
87 if (COMPLETE_TYPE_P (type
))
90 if (complete_type_or_maybe_complain (type
, value
, complain
))
93 return error_mark_node
;
97 require_complete_type (tree value
)
99 return require_complete_type_sfinae (value
, tf_warning_or_error
);
102 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
103 a template instantiation, do the instantiation. Returns TYPE,
104 whether or not it could be completed, unless something goes
105 horribly wrong, in which case the error_mark_node is returned. */
108 complete_type (tree type
)
110 if (type
== NULL_TREE
)
111 /* Rather than crash, we return something sure to cause an error
113 return error_mark_node
;
115 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
117 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
119 tree t
= complete_type (TREE_TYPE (type
));
120 unsigned int needs_constructing
, has_nontrivial_dtor
;
121 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
124 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
126 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
127 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
129 TYPE_NEEDS_CONSTRUCTING (t
) = needs_constructing
;
130 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = has_nontrivial_dtor
;
133 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
134 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
139 /* Like complete_type, but issue an error if the TYPE cannot be completed.
140 VALUE is used for informative diagnostics.
141 Returns NULL_TREE if the type cannot be made complete. */
144 complete_type_or_maybe_complain (tree type
, tree value
, tsubst_flags_t complain
)
146 type
= complete_type (type
);
147 if (type
== error_mark_node
)
148 /* We already issued an error. */
150 else if (!COMPLETE_TYPE_P (type
))
152 if (complain
& tf_error
)
153 cxx_incomplete_type_diagnostic (value
, type
, DK_ERROR
);
161 complete_type_or_else (tree type
, tree value
)
163 return complete_type_or_maybe_complain (type
, value
, tf_warning_or_error
);
166 /* Return truthvalue of whether type of EXP is instantiated. */
169 type_unknown_p (const_tree exp
)
171 return (TREE_CODE (exp
) == TREE_LIST
172 || TREE_TYPE (exp
) == unknown_type_node
);
176 /* Return the common type of two parameter lists.
177 We assume that comptypes has already been done and returned 1;
178 if that isn't so, this may crash.
180 As an optimization, free the space we allocate if the parameter
181 lists are already common. */
184 commonparms (tree p1
, tree p2
)
186 tree oldargs
= p1
, newargs
, n
;
190 len
= list_length (p1
);
191 newargs
= tree_last (p1
);
193 if (newargs
== void_list_node
)
202 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
207 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
209 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
211 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
214 else if (! TREE_PURPOSE (p1
))
216 if (TREE_PURPOSE (p2
))
218 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
224 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
226 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
228 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
231 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
234 TREE_VALUE (n
) = TREE_VALUE (p1
);
242 /* Given a type, perhaps copied for a typedef,
243 find the "original" version of it. */
245 original_type (tree t
)
247 int quals
= cp_type_quals (t
);
248 while (t
!= error_mark_node
249 && TYPE_NAME (t
) != NULL_TREE
)
251 tree x
= TYPE_NAME (t
);
252 if (TREE_CODE (x
) != TYPE_DECL
)
254 x
= DECL_ORIGINAL_TYPE (x
);
259 return cp_build_qualified_type (t
, quals
);
262 /* Return the common type for two arithmetic types T1 and T2 under the
263 usual arithmetic conversions. The default conversions have already
264 been applied, and enumerated types converted to their compatible
268 cp_common_type (tree t1
, tree t2
)
270 enum tree_code code1
= TREE_CODE (t1
);
271 enum tree_code code2
= TREE_CODE (t2
);
275 /* In what follows, we slightly generalize the rules given in [expr] so
276 as to deal with `long long' and `complex'. First, merge the
278 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
280 if (SCOPED_ENUM_P (t1
) || SCOPED_ENUM_P (t2
))
282 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
283 return build_type_attribute_variant (t1
, attributes
);
288 /* FIXME: Attributes. */
289 gcc_assert (ARITHMETIC_TYPE_P (t1
)
290 || TREE_CODE (t1
) == VECTOR_TYPE
291 || UNSCOPED_ENUM_P (t1
));
292 gcc_assert (ARITHMETIC_TYPE_P (t2
)
293 || TREE_CODE (t2
) == VECTOR_TYPE
294 || UNSCOPED_ENUM_P (t2
));
296 /* If one type is complex, form the common type of the non-complex
297 components, then make that complex. Use T1 or T2 if it is the
299 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
301 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
302 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
304 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
306 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
307 return build_type_attribute_variant (t1
, attributes
);
308 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
309 return build_type_attribute_variant (t2
, attributes
);
311 return build_type_attribute_variant (build_complex_type (subtype
),
315 if (code1
== VECTOR_TYPE
)
317 /* When we get here we should have two vectors of the same size.
318 Just prefer the unsigned one if present. */
319 if (TYPE_UNSIGNED (t1
))
320 return build_type_attribute_variant (t1
, attributes
);
322 return build_type_attribute_variant (t2
, attributes
);
325 /* If only one is real, use it as the result. */
326 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
327 return build_type_attribute_variant (t1
, attributes
);
328 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
329 return build_type_attribute_variant (t2
, attributes
);
331 /* Both real or both integers; use the one with greater precision. */
332 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
333 return build_type_attribute_variant (t1
, attributes
);
334 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
335 return build_type_attribute_variant (t2
, attributes
);
337 /* The types are the same; no need to do anything fancy. */
338 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
339 return build_type_attribute_variant (t1
, attributes
);
341 if (code1
!= REAL_TYPE
)
343 /* If one is unsigned long long, then convert the other to unsigned
345 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
346 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
347 return build_type_attribute_variant (long_long_unsigned_type_node
,
349 /* If one is a long long, and the other is an unsigned long, and
350 long long can represent all the values of an unsigned long, then
351 convert to a long long. Otherwise, convert to an unsigned long
352 long. Otherwise, if either operand is long long, convert the
355 Since we're here, we know the TYPE_PRECISION is the same;
356 therefore converting to long long cannot represent all the values
357 of an unsigned long, so we choose unsigned long long in that
359 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
360 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
362 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
363 ? long_long_unsigned_type_node
364 : long_long_integer_type_node
);
365 return build_type_attribute_variant (t
, attributes
);
367 if (int128_integer_type_node
!= NULL_TREE
368 && (same_type_p (TYPE_MAIN_VARIANT (t1
),
369 int128_integer_type_node
)
370 || same_type_p (TYPE_MAIN_VARIANT (t2
),
371 int128_integer_type_node
)))
373 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
374 ? int128_unsigned_type_node
375 : int128_integer_type_node
);
376 return build_type_attribute_variant (t
, attributes
);
379 /* Go through the same procedure, but for longs. */
380 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
381 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
382 return build_type_attribute_variant (long_unsigned_type_node
,
384 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
385 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
387 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
388 ? long_unsigned_type_node
: long_integer_type_node
);
389 return build_type_attribute_variant (t
, attributes
);
391 /* Otherwise prefer the unsigned one. */
392 if (TYPE_UNSIGNED (t1
))
393 return build_type_attribute_variant (t1
, attributes
);
395 return build_type_attribute_variant (t2
, attributes
);
399 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
400 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
401 return build_type_attribute_variant (long_double_type_node
,
403 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
404 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
405 return build_type_attribute_variant (double_type_node
,
407 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
408 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
409 return build_type_attribute_variant (float_type_node
,
412 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
413 the standard C++ floating-point types. Logic earlier in this
414 function has already eliminated the possibility that
415 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
416 compelling reason to choose one or the other. */
417 return build_type_attribute_variant (t1
, attributes
);
421 /* T1 and T2 are arithmetic or enumeration types. Return the type
422 that will result from the "usual arithmetic conversions" on T1 and
423 T2 as described in [expr]. */
426 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
428 gcc_assert (ARITHMETIC_TYPE_P (t1
)
429 || TREE_CODE (t1
) == VECTOR_TYPE
430 || UNSCOPED_ENUM_P (t1
));
431 gcc_assert (ARITHMETIC_TYPE_P (t2
)
432 || TREE_CODE (t2
) == VECTOR_TYPE
433 || UNSCOPED_ENUM_P (t2
));
435 /* Perform the integral promotions. We do not promote real types here. */
436 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1
)
437 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2
))
439 t1
= type_promotes_to (t1
);
440 t2
= type_promotes_to (t2
);
443 return cp_common_type (t1
, t2
);
447 composite_pointer_error (diagnostic_t kind
, tree t1
, tree t2
,
448 composite_pointer_operation operation
)
453 emit_diagnostic (kind
, input_location
, 0,
454 "comparison between "
455 "distinct pointer types %qT and %qT lacks a cast",
459 emit_diagnostic (kind
, input_location
, 0,
460 "conversion between "
461 "distinct pointer types %qT and %qT lacks a cast",
464 case CPO_CONDITIONAL_EXPR
:
465 emit_diagnostic (kind
, input_location
, 0,
466 "conditional expression between "
467 "distinct pointer types %qT and %qT lacks a cast",
475 /* Subroutine of composite_pointer_type to implement the recursive
476 case. See that function for documentation of the parameters. */
479 composite_pointer_type_r (tree t1
, tree t2
,
480 composite_pointer_operation operation
,
481 tsubst_flags_t complain
)
488 /* Determine the types pointed to by T1 and T2. */
489 if (TREE_CODE (t1
) == POINTER_TYPE
)
491 pointee1
= TREE_TYPE (t1
);
492 pointee2
= TREE_TYPE (t2
);
496 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
497 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
502 Otherwise, the composite pointer type is a pointer type
503 similar (_conv.qual_) to the type of one of the operands,
504 with a cv-qualification signature (_conv.qual_) that is the
505 union of the cv-qualification signatures of the operand
507 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
508 result_type
= pointee1
;
509 else if ((TREE_CODE (pointee1
) == POINTER_TYPE
510 && TREE_CODE (pointee2
) == POINTER_TYPE
)
511 || (TYPE_PTR_TO_MEMBER_P (pointee1
)
512 && TYPE_PTR_TO_MEMBER_P (pointee2
)))
513 result_type
= composite_pointer_type_r (pointee1
, pointee2
, operation
,
517 if (complain
& tf_error
)
518 composite_pointer_error (DK_PERMERROR
, t1
, t2
, operation
);
520 return error_mark_node
;
521 result_type
= void_type_node
;
523 result_type
= cp_build_qualified_type (result_type
,
524 (cp_type_quals (pointee1
)
525 | cp_type_quals (pointee2
)));
526 /* If the original types were pointers to members, so is the
528 if (TYPE_PTR_TO_MEMBER_P (t1
))
530 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
531 TYPE_PTRMEM_CLASS_TYPE (t2
)))
533 if (complain
& tf_error
)
534 composite_pointer_error (DK_PERMERROR
, t1
, t2
, operation
);
536 return error_mark_node
;
538 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
542 result_type
= build_pointer_type (result_type
);
544 /* Merge the attributes. */
545 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
546 return build_type_attribute_variant (result_type
, attributes
);
549 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
550 ARG1 and ARG2 are the values with those types. The OPERATION is to
551 describe the operation between the pointer types,
552 in case an error occurs.
554 This routine also implements the computation of a common type for
555 pointers-to-members as per [expr.eq]. */
558 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
559 composite_pointer_operation operation
,
560 tsubst_flags_t complain
)
567 If one operand is a null pointer constant, the composite pointer
568 type is the type of the other operand. */
569 if (null_ptr_cst_p (arg1
))
571 if (null_ptr_cst_p (arg2
))
578 If one of the operands has type "pointer to cv1 void*", then
579 the other has type "pointer to cv2T", and the composite pointer
580 type is "pointer to cv12 void", where cv12 is the union of cv1
583 If either type is a pointer to void, make sure it is T1. */
584 if (TREE_CODE (t2
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t2
)))
592 /* Now, if T1 is a pointer to void, merge the qualifiers. */
593 if (TREE_CODE (t1
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t1
)))
598 if (TYPE_PTRFN_P (t2
) && (complain
& tf_error
))
603 pedwarn (input_location
, OPT_pedantic
,
604 "ISO C++ forbids comparison between "
605 "pointer of type %<void *%> and pointer-to-function");
608 pedwarn (input_location
, OPT_pedantic
,
609 "ISO C++ forbids conversion between "
610 "pointer of type %<void *%> and pointer-to-function");
612 case CPO_CONDITIONAL_EXPR
:
613 pedwarn (input_location
, OPT_pedantic
,
614 "ISO C++ forbids conditional expression between "
615 "pointer of type %<void *%> and pointer-to-function");
622 = cp_build_qualified_type (void_type_node
,
623 (cp_type_quals (TREE_TYPE (t1
))
624 | cp_type_quals (TREE_TYPE (t2
))));
625 result_type
= build_pointer_type (result_type
);
626 /* Merge the attributes. */
627 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
628 return build_type_attribute_variant (result_type
, attributes
);
631 if (c_dialect_objc () && TREE_CODE (t1
) == POINTER_TYPE
632 && TREE_CODE (t2
) == POINTER_TYPE
)
634 if (objc_have_common_type (t1
, t2
, -3, NULL_TREE
))
635 return objc_common_type (t1
, t2
);
638 /* [expr.eq] permits the application of a pointer conversion to
639 bring the pointers to a common type. */
640 if (TREE_CODE (t1
) == POINTER_TYPE
&& TREE_CODE (t2
) == POINTER_TYPE
641 && CLASS_TYPE_P (TREE_TYPE (t1
))
642 && CLASS_TYPE_P (TREE_TYPE (t2
))
643 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
646 class1
= TREE_TYPE (t1
);
647 class2
= TREE_TYPE (t2
);
649 if (DERIVED_FROM_P (class1
, class2
))
650 t2
= (build_pointer_type
651 (cp_build_qualified_type (class1
, cp_type_quals (class2
))));
652 else if (DERIVED_FROM_P (class2
, class1
))
653 t1
= (build_pointer_type
654 (cp_build_qualified_type (class2
, cp_type_quals (class1
))));
657 if (complain
& tf_error
)
658 composite_pointer_error (DK_ERROR
, t1
, t2
, operation
);
659 return error_mark_node
;
662 /* [expr.eq] permits the application of a pointer-to-member
663 conversion to change the class type of one of the types. */
664 else if (TYPE_PTR_TO_MEMBER_P (t1
)
665 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
666 TYPE_PTRMEM_CLASS_TYPE (t2
)))
668 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
669 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
671 if (DERIVED_FROM_P (class1
, class2
))
672 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
673 else if (DERIVED_FROM_P (class2
, class1
))
674 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
677 if (complain
& tf_error
)
681 error ("comparison between distinct "
682 "pointer-to-member types %qT and %qT lacks a cast",
686 error ("conversion between distinct "
687 "pointer-to-member types %qT and %qT lacks a cast",
690 case CPO_CONDITIONAL_EXPR
:
691 error ("conditional expression between distinct "
692 "pointer-to-member types %qT and %qT lacks a cast",
698 return error_mark_node
;
702 return composite_pointer_type_r (t1
, t2
, operation
, complain
);
705 /* Return the merged type of two types.
706 We assume that comptypes has already been done and returned 1;
707 if that isn't so, this may crash.
709 This just combines attributes and default arguments; any other
710 differences would cause the two types to compare unalike. */
713 merge_types (tree t1
, tree t2
)
715 enum tree_code code1
;
716 enum tree_code code2
;
719 /* Save time if the two types are the same. */
722 if (original_type (t1
) == original_type (t2
))
725 /* If one type is nonsense, use the other. */
726 if (t1
== error_mark_node
)
728 if (t2
== error_mark_node
)
731 /* Merge the attributes. */
732 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
734 if (TYPE_PTRMEMFUNC_P (t1
))
735 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
736 if (TYPE_PTRMEMFUNC_P (t2
))
737 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
739 code1
= TREE_CODE (t1
);
740 code2
= TREE_CODE (t2
);
743 gcc_assert (code1
== TYPENAME_TYPE
|| code2
== TYPENAME_TYPE
);
744 if (code1
== TYPENAME_TYPE
)
746 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
747 code1
= TREE_CODE (t1
);
751 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
752 code2
= TREE_CODE (t2
);
760 /* For two pointers, do this recursively on the target type. */
762 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
763 int quals
= cp_type_quals (t1
);
765 if (code1
== POINTER_TYPE
)
766 t1
= build_pointer_type (target
);
768 t1
= cp_build_reference_type (target
, TYPE_REF_IS_RVALUE (t1
));
769 t1
= build_type_attribute_variant (t1
, attributes
);
770 t1
= cp_build_qualified_type (t1
, quals
);
772 if (TREE_CODE (target
) == METHOD_TYPE
)
773 t1
= build_ptrmemfunc_type (t1
);
782 quals
= cp_type_quals (t1
);
783 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
784 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
785 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
787 t1
= cp_build_qualified_type (t1
, quals
);
793 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
794 /* Save space: see if the result is identical to one of the args. */
795 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
796 return build_type_attribute_variant (t1
, attributes
);
797 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
798 return build_type_attribute_variant (t2
, attributes
);
799 /* Merge the element types, and have a size if either arg has one. */
800 t1
= build_cplus_array_type
801 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
806 /* Function types: prefer the one that specified arg types.
807 If both do, merge the arg types. Also merge the return types. */
809 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
810 tree p1
= TYPE_ARG_TYPES (t1
);
811 tree p2
= TYPE_ARG_TYPES (t2
);
815 /* Save space: see if the result is identical to one of the args. */
816 if (valtype
== TREE_TYPE (t1
) && ! p2
)
817 return cp_build_type_attribute_variant (t1
, attributes
);
818 if (valtype
== TREE_TYPE (t2
) && ! p1
)
819 return cp_build_type_attribute_variant (t2
, attributes
);
821 /* Simple way if one arg fails to specify argument types. */
822 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
824 else if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
827 parms
= commonparms (p1
, p2
);
829 rval
= build_function_type (valtype
, parms
);
830 gcc_assert (type_memfn_quals (t1
) == type_memfn_quals (t2
));
831 rval
= apply_memfn_quals (rval
, type_memfn_quals (t1
));
832 raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
833 TYPE_RAISES_EXCEPTIONS (t2
));
834 t1
= build_exception_variant (rval
, raises
);
840 /* Get this value the long way, since TYPE_METHOD_BASETYPE
841 is just the main variant of this. */
842 tree basetype
= class_of_this_parm (t2
);
843 tree raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
844 TYPE_RAISES_EXCEPTIONS (t2
));
847 /* If this was a member function type, get back to the
848 original type of type member function (i.e., without
849 the class instance variable up front. */
850 t1
= build_function_type (TREE_TYPE (t1
),
851 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
852 t2
= build_function_type (TREE_TYPE (t2
),
853 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
854 t3
= merge_types (t1
, t2
);
855 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
856 TYPE_ARG_TYPES (t3
));
857 t1
= build_exception_variant (t3
, raises
);
862 /* There is no need to merge attributes into a TYPENAME_TYPE.
863 When the type is instantiated it will have whatever
864 attributes result from the instantiation. */
870 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
872 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
875 return cp_build_type_attribute_variant (t1
, attributes
);
878 /* Return the ARRAY_TYPE type without its domain. */
881 strip_array_domain (tree type
)
884 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
885 if (TYPE_DOMAIN (type
) == NULL_TREE
)
887 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
888 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
891 /* Wrapper around cp_common_type that is used by c-common.c and other
892 front end optimizations that remove promotions.
894 Return the common type for two arithmetic types T1 and T2 under the
895 usual arithmetic conversions. The default conversions have already
896 been applied, and enumerated types converted to their compatible
900 common_type (tree t1
, tree t2
)
902 /* If one type is nonsense, use the other */
903 if (t1
== error_mark_node
)
905 if (t2
== error_mark_node
)
908 return cp_common_type (t1
, t2
);
911 /* Return the common type of two pointer types T1 and T2. This is the
912 type for the result of most arithmetic operations if the operands
913 have the given two types.
915 We assume that comp_target_types has already been done and returned
916 nonzero; if that isn't so, this may crash. */
919 common_pointer_type (tree t1
, tree t2
)
921 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
922 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
923 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
925 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
926 CPO_CONVERSION
, tf_warning_or_error
);
929 /* Compare two exception specifier types for exactness or subsetness, if
930 allowed. Returns false for mismatch, true for match (same, or
933 [except.spec] "If a class X ... objects of class X or any class publicly
934 and unambiguously derived from X. Similarly, if a pointer type Y * ...
935 exceptions of type Y * or that are pointers to any type publicly and
936 unambiguously derived from Y. Otherwise a function only allows exceptions
937 that have the same type ..."
938 This does not mention cv qualifiers and is different to what throw
939 [except.throw] and catch [except.catch] will do. They will ignore the
940 top level cv qualifiers, and allow qualifiers in the pointer to class
943 We implement the letter of the standard. */
946 comp_except_types (tree a
, tree b
, bool exact
)
948 if (same_type_p (a
, b
))
952 if (cp_type_quals (a
) || cp_type_quals (b
))
955 if (TREE_CODE (a
) == POINTER_TYPE
956 && TREE_CODE (b
) == POINTER_TYPE
)
960 if (cp_type_quals (a
) || cp_type_quals (b
))
964 if (TREE_CODE (a
) != RECORD_TYPE
965 || TREE_CODE (b
) != RECORD_TYPE
)
968 if (PUBLICLY_UNIQUELY_DERIVED_P (a
, b
))
974 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
975 If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
976 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
977 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
978 are unordered, but we've already filtered out duplicates. Most lists will
979 be in order, we should try to make use of that. */
982 comp_except_specs (const_tree t1
, const_tree t2
, int exact
)
991 /* First handle noexcept. */
992 if (exact
< ce_exact
)
994 /* noexcept(false) is compatible with no exception-specification,
995 and stricter than any spec. */
996 if (t1
== noexcept_false_spec
)
997 return t2
== NULL_TREE
|| exact
== ce_derived
;
998 /* Even a derived noexcept(false) is compatible with no
999 exception-specification. */
1000 if (t2
== noexcept_false_spec
)
1001 return t1
== NULL_TREE
;
1003 /* Otherwise, if we aren't looking for an exact match, noexcept is
1004 equivalent to throw(). */
1005 if (t1
== noexcept_true_spec
)
1006 t1
= empty_except_spec
;
1007 if (t2
== noexcept_true_spec
)
1008 t2
= empty_except_spec
;
1011 /* If any noexcept is left, it is only comparable to itself;
1012 either we're looking for an exact match or we're redeclaring a
1013 template with dependent noexcept. */
1014 if ((t1
&& TREE_PURPOSE (t1
))
1015 || (t2
&& TREE_PURPOSE (t2
)))
1017 && cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)));
1019 if (t1
== NULL_TREE
) /* T1 is ... */
1020 return t2
== NULL_TREE
|| exact
== ce_derived
;
1021 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1022 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1023 if (t2
== NULL_TREE
) /* T2 is ... */
1025 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1026 return exact
== ce_derived
;
1028 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1029 Count how many we find, to determine exactness. For exact matching and
1030 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1032 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1034 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1036 tree a
= TREE_VALUE (probe
);
1037 tree b
= TREE_VALUE (t2
);
1039 if (comp_except_types (a
, b
, exact
))
1041 if (probe
== base
&& exact
> ce_derived
)
1042 base
= TREE_CHAIN (probe
);
1047 if (probe
== NULL_TREE
)
1050 return exact
== ce_derived
|| base
== NULL_TREE
|| length
== list_length (t1
);
1053 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1054 [] can match [size]. */
1057 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1066 /* The type of the array elements must be the same. */
1067 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1070 d1
= TYPE_DOMAIN (t1
);
1071 d2
= TYPE_DOMAIN (t2
);
1076 /* If one of the arrays is dimensionless, and the other has a
1077 dimension, they are of different types. However, it is valid to
1085 declarations for an array object can specify
1086 array types that differ by the presence or absence of a major
1087 array bound (_dcl.array_). */
1089 return allow_redeclaration
;
1091 /* Check that the dimensions are the same. */
1093 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1095 max1
= TYPE_MAX_VALUE (d1
);
1096 max2
= TYPE_MAX_VALUE (d2
);
1097 if (processing_template_decl
&& !abi_version_at_least (2)
1098 && !value_dependent_expression_p (max1
)
1099 && !value_dependent_expression_p (max2
))
1101 /* With abi-1 we do not fold non-dependent array bounds, (and
1102 consequently mangle them incorrectly). We must therefore
1103 fold them here, to verify the domains have the same
1109 if (!cp_tree_equal (max1
, max2
))
1115 /* Compare the relative position of T1 and T2 into their respective
1116 template parameter list.
1117 T1 and T2 must be template parameter types.
1118 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1121 comp_template_parms_position (tree t1
, tree t2
)
1123 tree index1
, index2
;
1124 gcc_assert (t1
&& t2
1125 && TREE_CODE (t1
) == TREE_CODE (t2
)
1126 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1127 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1128 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1130 index1
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t1
));
1131 index2
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t2
));
1133 /* If T1 and T2 belong to template parm lists of different size,
1134 let's assume they are different. */
1135 if (TEMPLATE_PARM_NUM_SIBLINGS (index1
)
1136 != TEMPLATE_PARM_NUM_SIBLINGS (index2
))
1139 /* Then compare their relative position. */
1140 if (TEMPLATE_PARM_IDX (index1
) != TEMPLATE_PARM_IDX (index2
)
1141 || TEMPLATE_PARM_LEVEL (index1
) != TEMPLATE_PARM_LEVEL (index2
)
1142 || (TEMPLATE_PARM_PARAMETER_PACK (index1
)
1143 != TEMPLATE_PARM_PARAMETER_PACK (index2
)))
1149 /* Subroutine in comptypes. */
1152 structural_comptypes (tree t1
, tree t2
, int strict
)
1157 /* Suppress errors caused by previously reported errors. */
1158 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1161 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1163 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1164 current instantiation. */
1165 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1166 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1168 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1169 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1171 if (TYPE_PTRMEMFUNC_P (t1
))
1172 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1173 if (TYPE_PTRMEMFUNC_P (t2
))
1174 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1176 /* Different classes of types can't be compatible. */
1177 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1180 /* Qualifiers must match. For array types, we will check when we
1181 recur on the array element types. */
1182 if (TREE_CODE (t1
) != ARRAY_TYPE
1183 && cp_type_quals (t1
) != cp_type_quals (t2
))
1185 if (TREE_CODE (t1
) == FUNCTION_TYPE
1186 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1188 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1191 /* Allow for two different type nodes which have essentially the same
1192 definition. Note that we already checked for equality of the type
1193 qualifiers (just above). */
1195 if (TREE_CODE (t1
) != ARRAY_TYPE
1196 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1200 /* Compare the types. Break out if they could be the same. */
1201 switch (TREE_CODE (t1
))
1205 /* All void and bool types are the same. */
1209 case FIXED_POINT_TYPE
:
1211 /* With these nodes, we can't determine type equivalence by
1212 looking at what is stored in the nodes themselves, because
1213 two nodes might have different TYPE_MAIN_VARIANTs but still
1214 represent the same type. For example, wchar_t and int could
1215 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1216 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1217 and are distinct types. On the other hand, int and the
1220 typedef int INT __attribute((may_alias));
1222 have identical properties, different TYPE_MAIN_VARIANTs, but
1223 represent the same type. The canonical type system keeps
1224 track of equivalence in this case, so we fall back on it. */
1225 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1227 case TEMPLATE_TEMPLATE_PARM
:
1228 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1229 if (!comp_template_parms_position (t1
, t2
))
1231 if (!comp_template_parms
1232 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1233 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1235 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1237 /* Don't check inheritance. */
1238 strict
= COMPARE_STRICT
;
1243 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1244 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1245 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1246 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1249 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1251 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1257 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1258 strict
& ~COMPARE_REDECLARATION
))
1260 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1264 case REFERENCE_TYPE
:
1265 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1267 /* fall through to checks for pointer types */
1270 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1271 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
)
1272 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1278 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1280 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1285 /* Target types must match incl. qualifiers. */
1286 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1290 case TEMPLATE_TYPE_PARM
:
1291 /* If T1 and T2 don't have the same relative position in their
1292 template parameters set, they can't be equal. */
1293 if (!comp_template_parms_position (t1
, t2
))
1298 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1299 TYPENAME_TYPE_FULLNAME (t2
)))
1301 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1305 case UNBOUND_CLASS_TEMPLATE
:
1306 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1308 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1313 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1318 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1319 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1323 case TYPE_PACK_EXPANSION
:
1324 return same_type_p (PACK_EXPANSION_PATTERN (t1
),
1325 PACK_EXPANSION_PATTERN (t2
));
1328 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1329 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1330 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1331 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1332 || (DECLTYPE_FOR_LAMBDA_RETURN (t1
)
1333 != DECLTYPE_FOR_LAMBDA_RETURN (t2
))
1334 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1335 DECLTYPE_TYPE_EXPR (t2
)))
1339 case UNDERLYING_TYPE
:
1340 return same_type_p (UNDERLYING_TYPE_TYPE (t1
),
1341 UNDERLYING_TYPE_TYPE (t2
));
1347 /* If we get here, we know that from a target independent POV the
1348 types are the same. Make sure the target attributes are also
1350 return comp_type_attributes (t1
, t2
);
1353 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1354 is a bitwise-or of the COMPARE_* flags. */
1357 comptypes (tree t1
, tree t2
, int strict
)
1359 if (strict
== COMPARE_STRICT
)
1364 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1367 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1368 /* At least one of the types requires structural equality, so
1369 perform a deep check. */
1370 return structural_comptypes (t1
, t2
, strict
);
1372 #ifdef ENABLE_CHECKING
1373 if (USE_CANONICAL_TYPES
)
1375 bool result
= structural_comptypes (t1
, t2
, strict
);
1377 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1378 /* The two types are structurally equivalent, but their
1379 canonical types were different. This is a failure of the
1380 canonical type propagation code.*/
1382 ("canonical types differ for identical types %T and %T",
1384 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1385 /* Two types are structurally different, but the canonical
1386 types are the same. This means we were over-eager in
1387 assigning canonical types. */
1389 ("same canonical type node for different types %T and %T",
1395 if (USE_CANONICAL_TYPES
)
1396 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1399 return structural_comptypes (t1
, t2
, strict
);
1401 else if (strict
== COMPARE_STRUCTURAL
)
1402 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1404 return structural_comptypes (t1
, t2
, strict
);
1407 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1408 top-level qualifiers. */
1411 same_type_ignoring_top_level_qualifiers_p (tree type1
, tree type2
)
1413 if (type1
== error_mark_node
|| type2
== error_mark_node
)
1416 return same_type_p (TYPE_MAIN_VARIANT (type1
), TYPE_MAIN_VARIANT (type2
));
1419 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1422 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1424 int q1
= cp_type_quals (type1
);
1425 int q2
= cp_type_quals (type2
);
1427 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1428 return (q1
& q2
) == q2
;
1431 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1432 more cv-qualified that TYPE1, and 0 otherwise. */
1435 comp_cv_qualification (const_tree type1
, const_tree type2
)
1437 int q1
= cp_type_quals (type1
);
1438 int q2
= cp_type_quals (type2
);
1443 if ((q1
& q2
) == q2
)
1445 else if ((q1
& q2
) == q1
)
1451 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1452 subset of the cv-qualification signature of TYPE2, and the types
1453 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1456 comp_cv_qual_signature (tree type1
, tree type2
)
1458 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1460 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1466 /* Subroutines of `comptypes'. */
1468 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1469 equivalent in the sense that functions with those parameter types
1470 can have equivalent types. The two lists must be equivalent,
1471 element by element. */
1474 compparms (const_tree parms1
, const_tree parms2
)
1478 /* An unspecified parmlist matches any specified parmlist
1479 whose argument types don't need default promotions. */
1481 for (t1
= parms1
, t2
= parms2
;
1483 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1485 /* If one parmlist is shorter than the other,
1486 they fail to match. */
1489 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1496 /* Process a sizeof or alignof expression where the operand is a
1500 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1505 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1506 if (type
== error_mark_node
)
1507 return error_mark_node
;
1509 type
= non_reference (type
);
1510 if (TREE_CODE (type
) == METHOD_TYPE
)
1513 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
1514 "invalid application of %qs to a member function",
1515 operator_name_info
[(int) op
].name
);
1516 value
= size_one_node
;
1519 dependent_p
= dependent_type_p (type
);
1521 complete_type (type
);
1523 /* VLA types will have a non-constant size. In the body of an
1524 uninstantiated template, we don't need to try to compute the
1525 value, because the sizeof expression is not an integral
1526 constant expression in that case. And, if we do try to
1527 compute the value, we'll likely end up with SAVE_EXPRs, which
1528 the template substitution machinery does not expect to see. */
1529 || (processing_template_decl
1530 && COMPLETE_TYPE_P (type
)
1531 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1533 value
= build_min (op
, size_type_node
, type
);
1534 TREE_READONLY (value
) = 1;
1538 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1543 /* Return the size of the type, without producing any warnings for
1544 types whose size cannot be taken. This routine should be used only
1545 in some other routine that has already produced a diagnostic about
1546 using the size of such a type. */
1548 cxx_sizeof_nowarn (tree type
)
1550 if (TREE_CODE (type
) == FUNCTION_TYPE
1551 || TREE_CODE (type
) == VOID_TYPE
1552 || TREE_CODE (type
) == ERROR_MARK
)
1553 return size_one_node
;
1554 else if (!COMPLETE_TYPE_P (type
))
1555 return size_zero_node
;
1557 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1560 /* Process a sizeof expression where the operand is an expression. */
1563 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1565 if (e
== error_mark_node
)
1566 return error_mark_node
;
1568 if (processing_template_decl
)
1570 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1571 TREE_SIDE_EFFECTS (e
) = 0;
1572 TREE_READONLY (e
) = 1;
1577 /* To get the size of a static data member declared as an array of
1578 unknown bound, we need to instantiate it. */
1579 if (TREE_CODE (e
) == VAR_DECL
1580 && VAR_HAD_UNKNOWN_BOUND (e
)
1581 && DECL_TEMPLATE_INSTANTIATION (e
))
1582 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1584 e
= mark_type_use (e
);
1586 if (TREE_CODE (e
) == COMPONENT_REF
1587 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1588 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1590 if (complain
& tf_error
)
1591 error ("invalid application of %<sizeof%> to a bit-field");
1593 return error_mark_node
;
1596 else if (is_overloaded_fn (e
))
1598 if (complain
& tf_error
)
1599 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1602 return error_mark_node
;
1605 else if (type_unknown_p (e
))
1607 if (complain
& tf_error
)
1608 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1610 return error_mark_node
;
1616 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1619 /* Implement the __alignof keyword: Return the minimum required
1620 alignment of E, measured in bytes. For VAR_DECL's and
1621 FIELD_DECL's return DECL_ALIGN (which can be set from an
1622 "aligned" __attribute__ specification). */
1625 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1629 if (e
== error_mark_node
)
1630 return error_mark_node
;
1632 if (processing_template_decl
)
1634 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1635 TREE_SIDE_EFFECTS (e
) = 0;
1636 TREE_READONLY (e
) = 1;
1641 e
= mark_type_use (e
);
1643 if (TREE_CODE (e
) == VAR_DECL
)
1644 t
= size_int (DECL_ALIGN_UNIT (e
));
1645 else if (TREE_CODE (e
) == COMPONENT_REF
1646 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1647 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1649 if (complain
& tf_error
)
1650 error ("invalid application of %<__alignof%> to a bit-field");
1652 return error_mark_node
;
1655 else if (TREE_CODE (e
) == COMPONENT_REF
1656 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1657 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1658 else if (is_overloaded_fn (e
))
1660 if (complain
& tf_error
)
1661 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1664 return error_mark_node
;
1665 if (TREE_CODE (e
) == FUNCTION_DECL
)
1666 t
= size_int (DECL_ALIGN_UNIT (e
));
1670 else if (type_unknown_p (e
))
1672 if (complain
& tf_error
)
1673 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1675 return error_mark_node
;
1679 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1680 complain
& tf_error
);
1682 return fold_convert (size_type_node
, t
);
1685 /* Process a sizeof or alignof expression E with code OP where the operand
1686 is an expression. */
1689 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1691 if (op
== SIZEOF_EXPR
)
1692 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1694 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1697 /* EXPR is being used in a context that is not a function call.
1702 The expression can be used only as the left-hand operand of a
1703 member function call.
1705 [expr.mptr.operator]
1707 If the result of .* or ->* is a function, then that result can be
1708 used only as the operand for the function call operator ().
1710 by issuing an error message if appropriate. Returns true iff EXPR
1711 violates these rules. */
1714 invalid_nonstatic_memfn_p (const_tree expr
, tsubst_flags_t complain
)
1716 if (expr
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1718 if (complain
& tf_error
)
1719 error ("invalid use of non-static member function");
1725 /* If EXP is a reference to a bitfield, and the type of EXP does not
1726 match the declared type of the bitfield, return the declared type
1727 of the bitfield. Otherwise, return NULL_TREE. */
1730 is_bitfield_expr_with_lowered_type (const_tree exp
)
1732 switch (TREE_CODE (exp
))
1735 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1736 ? TREE_OPERAND (exp
, 1)
1737 : TREE_OPERAND (exp
, 0)))
1739 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1742 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1746 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1752 field
= TREE_OPERAND (exp
, 1);
1753 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1755 if (same_type_ignoring_top_level_qualifiers_p
1756 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1758 return DECL_BIT_FIELD_TYPE (field
);
1762 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1763 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1764 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1772 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1773 bitfield with a lowered type, the type of EXP is returned, rather
1777 unlowered_expr_type (const_tree exp
)
1780 tree etype
= TREE_TYPE (exp
);
1782 type
= is_bitfield_expr_with_lowered_type (exp
);
1784 type
= cp_build_qualified_type (type
, cp_type_quals (etype
));
1791 /* Perform the conversions in [expr] that apply when an lvalue appears
1792 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1793 function-to-pointer conversions. In addition, manifest constants
1794 are replaced by their values, and bitfield references are converted
1795 to their declared types. Note that this function does not perform the
1796 lvalue-to-rvalue conversion for class types. If you need that conversion
1797 to for class types, then you probably need to use force_rvalue.
1799 Although the returned value is being used as an rvalue, this
1800 function does not wrap the returned expression in a
1801 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1802 that the return value is no longer an lvalue. */
1805 decay_conversion (tree exp
)
1808 enum tree_code code
;
1810 type
= TREE_TYPE (exp
);
1811 if (type
== error_mark_node
)
1812 return error_mark_node
;
1814 exp
= mark_rvalue_use (exp
);
1816 exp
= resolve_nondeduced_context (exp
);
1817 if (type_unknown_p (exp
))
1819 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1820 return error_mark_node
;
1823 /* FIXME remove? at least need to remember that this isn't really a
1824 constant expression if EXP isn't decl_constant_var_p, like with
1825 C_MAYBE_CONST_EXPR. */
1826 exp
= decl_constant_value (exp
);
1827 if (error_operand_p (exp
))
1828 return error_mark_node
;
1830 if (NULLPTR_TYPE_P (type
))
1831 return nullptr_node
;
1833 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1834 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1835 code
= TREE_CODE (type
);
1836 if (code
== VOID_TYPE
)
1838 error ("void value not ignored as it ought to be");
1839 return error_mark_node
;
1841 if (invalid_nonstatic_memfn_p (exp
, tf_warning_or_error
))
1842 return error_mark_node
;
1843 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1844 return cp_build_addr_expr (exp
, tf_warning_or_error
);
1845 if (code
== ARRAY_TYPE
)
1850 if (TREE_CODE (exp
) == INDIRECT_REF
)
1851 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1852 TREE_OPERAND (exp
, 0));
1854 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1856 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1857 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1858 TREE_OPERAND (exp
, 0), op1
);
1862 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1864 error ("invalid use of non-lvalue array");
1865 return error_mark_node
;
1868 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1870 if (TREE_CODE (exp
) == VAR_DECL
)
1872 if (!cxx_mark_addressable (exp
))
1873 return error_mark_node
;
1874 adr
= build_nop (ptrtype
, build_address (exp
));
1877 /* This way is better for a COMPONENT_REF since it can
1878 simplify the offset for a component. */
1879 adr
= cp_build_addr_expr (exp
, tf_warning_or_error
);
1880 return cp_convert (ptrtype
, adr
);
1883 /* If a bitfield is used in a context where integral promotion
1884 applies, then the caller is expected to have used
1885 default_conversion. That function promotes bitfields correctly
1886 before calling this function. At this point, if we have a
1887 bitfield referenced, we may assume that is not subject to
1888 promotion, and that, therefore, the type of the resulting rvalue
1889 is the declared type of the bitfield. */
1890 exp
= convert_bitfield_to_declared_type (exp
);
1892 /* We do not call rvalue() here because we do not want to wrap EXP
1893 in a NON_LVALUE_EXPR. */
1897 Non-class rvalues always have cv-unqualified types. */
1898 type
= TREE_TYPE (exp
);
1899 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
1900 exp
= build_nop (cv_unqualified (type
), exp
);
1905 /* Perform preparatory conversions, as part of the "usual arithmetic
1906 conversions". In particular, as per [expr]:
1908 Whenever an lvalue expression appears as an operand of an
1909 operator that expects the rvalue for that operand, the
1910 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1911 standard conversions are applied to convert the expression to an
1914 In addition, we perform integral promotions here, as those are
1915 applied to both operands to a binary operator before determining
1916 what additional conversions should apply. */
1919 default_conversion (tree exp
)
1921 /* Check for target-specific promotions. */
1922 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
1924 exp
= cp_convert (promoted_type
, exp
);
1925 /* Perform the integral promotions first so that bitfield
1926 expressions (which may promote to "int", even if the bitfield is
1927 declared "unsigned") are promoted correctly. */
1928 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
1929 exp
= perform_integral_promotions (exp
);
1930 /* Perform the other conversions. */
1931 exp
= decay_conversion (exp
);
1936 /* EXPR is an expression with an integral or enumeration type.
1937 Perform the integral promotions in [conv.prom], and return the
1941 perform_integral_promotions (tree expr
)
1946 expr
= mark_rvalue_use (expr
);
1950 If the bitfield has an enumerated type, it is treated as any
1951 other value of that type for promotion purposes. */
1952 type
= is_bitfield_expr_with_lowered_type (expr
);
1953 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
1954 type
= TREE_TYPE (expr
);
1955 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
1956 promoted_type
= type_promotes_to (type
);
1957 if (type
!= promoted_type
)
1958 expr
= cp_convert (promoted_type
, expr
);
1962 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1963 decay_conversion to one. */
1966 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
1970 if (TREE_CODE (totype
) != POINTER_TYPE
)
1973 t
= TREE_TYPE (totype
);
1974 if (!same_type_p (t
, char_type_node
)
1975 && !same_type_p (t
, char16_type_node
)
1976 && !same_type_p (t
, char32_type_node
)
1977 && !same_type_p (t
, wchar_type_node
))
1980 if (TREE_CODE (exp
) == STRING_CST
)
1982 /* Make sure that we don't try to convert between char and wide chars. */
1983 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
1988 /* Is this a string constant which has decayed to 'const char *'? */
1989 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
1990 if (!same_type_p (TREE_TYPE (exp
), t
))
1993 if (TREE_CODE (exp
) != ADDR_EXPR
1994 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
1998 /* This warning is not very useful, as it complains about printf. */
2000 warning (OPT_Wwrite_strings
,
2001 "deprecated conversion from string constant to %qT",
2007 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2008 can, for example, use as an lvalue. This code used to be in
2009 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2010 expressions, where we're dealing with aggregates. But now it's again only
2011 called from unary_complex_lvalue. The case (in particular) that led to
2012 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2016 rationalize_conditional_expr (enum tree_code code
, tree t
,
2017 tsubst_flags_t complain
)
2019 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2020 the first operand is always the one to be used if both operands
2021 are equal, so we know what conditional expression this used to be. */
2022 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2024 tree op0
= TREE_OPERAND (t
, 0);
2025 tree op1
= TREE_OPERAND (t
, 1);
2027 /* The following code is incorrect if either operand side-effects. */
2028 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2029 && !TREE_SIDE_EFFECTS (op1
));
2031 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
2032 ? LE_EXPR
: GE_EXPR
),
2033 op0
, TREE_CODE (op0
),
2034 op1
, TREE_CODE (op1
),
2035 /*overloaded_p=*/NULL
,
2037 cp_build_unary_op (code
, op0
, 0, complain
),
2038 cp_build_unary_op (code
, op1
, 0, complain
),
2043 build_conditional_expr (TREE_OPERAND (t
, 0),
2044 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2046 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2051 /* Given the TYPE of an anonymous union field inside T, return the
2052 FIELD_DECL for the field. If not found return NULL_TREE. Because
2053 anonymous unions can nest, we must also search all anonymous unions
2054 that are directly reachable. */
2057 lookup_anon_field (tree t
, tree type
)
2061 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2063 if (TREE_STATIC (field
))
2065 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2068 /* If we find it directly, return the field. */
2069 if (DECL_NAME (field
) == NULL_TREE
2070 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2075 /* Otherwise, it could be nested, search harder. */
2076 if (DECL_NAME (field
) == NULL_TREE
2077 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2079 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2087 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2088 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2089 non-NULL, it indicates the path to the base used to name MEMBER.
2090 If PRESERVE_REFERENCE is true, the expression returned will have
2091 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2092 returned will have the type referred to by the reference.
2094 This function does not perform access control; that is either done
2095 earlier by the parser when the name of MEMBER is resolved to MEMBER
2096 itself, or later when overload resolution selects one of the
2097 functions indicated by MEMBER. */
2100 build_class_member_access_expr (tree object
, tree member
,
2101 tree access_path
, bool preserve_reference
,
2102 tsubst_flags_t complain
)
2106 tree result
= NULL_TREE
;
2108 if (error_operand_p (object
) || error_operand_p (member
))
2109 return error_mark_node
;
2111 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2115 The type of the first expression shall be "class object" (of a
2117 object_type
= TREE_TYPE (object
);
2118 if (!currently_open_class (object_type
)
2119 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2120 return error_mark_node
;
2121 if (!CLASS_TYPE_P (object_type
))
2123 if (complain
& tf_error
)
2124 error ("request for member %qD in %qE, which is of non-class type %qT",
2125 member
, object
, object_type
);
2126 return error_mark_node
;
2129 /* The standard does not seem to actually say that MEMBER must be a
2130 member of OBJECT_TYPE. However, that is clearly what is
2132 if (DECL_P (member
))
2134 member_scope
= DECL_CLASS_CONTEXT (member
);
2136 if (TREE_DEPRECATED (member
))
2137 warn_deprecated_use (member
, NULL_TREE
);
2140 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2141 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2142 presently be the anonymous union. Go outwards until we find a
2143 type related to OBJECT_TYPE. */
2144 while (ANON_AGGR_TYPE_P (member_scope
)
2145 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2147 member_scope
= TYPE_CONTEXT (member_scope
);
2148 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2150 if (complain
& tf_error
)
2152 if (TREE_CODE (member
) == FIELD_DECL
)
2153 error ("invalid use of nonstatic data member %qE", member
);
2155 error ("%qD is not a member of %qT", member
, object_type
);
2157 return error_mark_node
;
2160 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2161 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2162 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2164 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2166 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2169 /* In [expr.ref], there is an explicit list of the valid choices for
2170 MEMBER. We check for each of those cases here. */
2171 if (TREE_CODE (member
) == VAR_DECL
)
2173 /* A static data member. */
2175 mark_exp_read (object
);
2176 /* If OBJECT has side-effects, they are supposed to occur. */
2177 if (TREE_SIDE_EFFECTS (object
))
2178 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2180 else if (TREE_CODE (member
) == FIELD_DECL
)
2182 /* A non-static data member. */
2187 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
2188 && integer_zerop (TREE_OPERAND (object
, 0)));
2190 /* Convert OBJECT to the type of MEMBER. */
2191 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2192 TYPE_MAIN_VARIANT (member_scope
)))
2197 binfo
= lookup_base (access_path
? access_path
: object_type
,
2198 member_scope
, ba_unique
, &kind
);
2199 if (binfo
== error_mark_node
)
2200 return error_mark_node
;
2202 /* It is invalid to try to get to a virtual base of a
2203 NULL object. The most common cause is invalid use of
2205 if (null_object_p
&& kind
== bk_via_virtual
)
2207 if (complain
& tf_error
)
2209 error ("invalid access to non-static data member %qD of "
2212 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2214 return error_mark_node
;
2217 /* Convert to the base. */
2218 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2220 /* If we found the base successfully then we should be able
2221 to convert to it successfully. */
2222 gcc_assert (object
!= error_mark_node
);
2225 /* Complain about other invalid uses of offsetof, even though they will
2226 give the right answer. Note that we complain whether or not they
2227 actually used the offsetof macro, since there's no way to know at this
2228 point. So we just give a warning, instead of a pedwarn. */
2229 /* Do not produce this warning for base class field references, because
2230 we know for a fact that didn't come from offsetof. This does occur
2231 in various testsuite cases where a null object is passed where a
2232 vtable access is required. */
2233 if (null_object_p
&& warn_invalid_offsetof
2234 && CLASSTYPE_NON_STD_LAYOUT (object_type
)
2235 && !DECL_FIELD_IS_BASE (member
)
2236 && cp_unevaluated_operand
== 0
2237 && (complain
& tf_warning
))
2239 warning (OPT_Winvalid_offsetof
,
2240 "invalid access to non-static data member %qD "
2241 " of NULL object", member
);
2242 warning (OPT_Winvalid_offsetof
,
2243 "(perhaps the %<offsetof%> macro was used incorrectly)");
2246 /* If MEMBER is from an anonymous aggregate, we have converted
2247 OBJECT so that it refers to the class containing the
2248 anonymous union. Generate a reference to the anonymous union
2249 itself, and recur to find MEMBER. */
2250 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2251 /* When this code is called from build_field_call, the
2252 object already has the type of the anonymous union.
2253 That is because the COMPONENT_REF was already
2254 constructed, and was then disassembled before calling
2255 build_field_call. After the function-call code is
2256 cleaned up, this waste can be eliminated. */
2257 && (!same_type_ignoring_top_level_qualifiers_p
2258 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2260 tree anonymous_union
;
2262 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2263 DECL_CONTEXT (member
));
2264 object
= build_class_member_access_expr (object
,
2266 /*access_path=*/NULL_TREE
,
2271 /* Compute the type of the field, as described in [expr.ref]. */
2272 type_quals
= TYPE_UNQUALIFIED
;
2273 member_type
= TREE_TYPE (member
);
2274 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2276 type_quals
= (cp_type_quals (member_type
)
2277 | cp_type_quals (object_type
));
2279 /* A field is const (volatile) if the enclosing object, or the
2280 field itself, is const (volatile). But, a mutable field is
2281 not const, even within a const object. */
2282 if (DECL_MUTABLE_P (member
))
2283 type_quals
&= ~TYPE_QUAL_CONST
;
2284 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2287 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
2289 result
= fold_if_not_in_template (result
);
2291 /* Mark the expression const or volatile, as appropriate. Even
2292 though we've dealt with the type above, we still have to mark the
2293 expression itself. */
2294 if (type_quals
& TYPE_QUAL_CONST
)
2295 TREE_READONLY (result
) = 1;
2296 if (type_quals
& TYPE_QUAL_VOLATILE
)
2297 TREE_THIS_VOLATILE (result
) = 1;
2299 else if (BASELINK_P (member
))
2301 /* The member is a (possibly overloaded) member function. */
2305 /* If the MEMBER is exactly one static member function, then we
2306 know the type of the expression. Otherwise, we must wait
2307 until overload resolution has been performed. */
2308 functions
= BASELINK_FUNCTIONS (member
);
2309 if (TREE_CODE (functions
) == FUNCTION_DECL
2310 && DECL_STATIC_FUNCTION_P (functions
))
2311 type
= TREE_TYPE (functions
);
2313 type
= unknown_type_node
;
2314 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2315 base. That will happen when the function is called. */
2316 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2318 else if (TREE_CODE (member
) == CONST_DECL
)
2320 /* The member is an enumerator. */
2322 /* If OBJECT has side-effects, they are supposed to occur. */
2323 if (TREE_SIDE_EFFECTS (object
))
2324 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2329 if (complain
& tf_error
)
2330 error ("invalid use of %qD", member
);
2331 return error_mark_node
;
2334 if (!preserve_reference
)
2337 If E2 is declared to have type "reference to T", then ... the
2338 type of E1.E2 is T. */
2339 result
= convert_from_reference (result
);
2344 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2345 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2348 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2350 tree object_type
= TREE_TYPE (object
);
2351 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2354 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2356 error ("qualified type %qT does not match destructor name ~%qT",
2358 return error_mark_node
;
2360 if (TREE_CODE (dtor_type
) == IDENTIFIER_NODE
)
2362 /* In a template, names we can't find a match for are still accepted
2363 destructor names, and we check them here. */
2364 if (check_dtor_name (object_type
, dtor_type
))
2365 dtor_type
= object_type
;
2368 error ("object type %qT does not match destructor name ~%qT",
2369 object_type
, dtor_type
);
2370 return error_mark_node
;
2374 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2376 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2377 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2378 return error_mark_node
;
2380 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2381 /*protect=*/1, /*want_type=*/false);
2382 expr
= (adjust_result_of_qualified_name_lookup
2383 (expr
, dtor_type
, object_type
));
2387 /* An expression of the form "A::template B" has been resolved to
2388 DECL. Issue a diagnostic if B is not a template or template
2392 check_template_keyword (tree decl
)
2394 /* The standard says:
2398 If a name prefixed by the keyword template is not a member
2399 template, the program is ill-formed.
2401 DR 228 removed the restriction that the template be a member
2404 DR 96, if accepted would add the further restriction that explicit
2405 template arguments must be provided if the template keyword is
2406 used, but, as of 2005-10-16, that DR is still in "drafting". If
2407 this DR is accepted, then the semantic checks here can be
2408 simplified, as the entity named must in fact be a template
2409 specialization, rather than, as at present, a set of overloaded
2410 functions containing at least one template function. */
2411 if (TREE_CODE (decl
) != TEMPLATE_DECL
2412 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2414 if (!is_overloaded_fn (decl
))
2415 permerror (input_location
, "%qD is not a template", decl
);
2420 if (BASELINK_P (fns
))
2421 fns
= BASELINK_FUNCTIONS (fns
);
2424 tree fn
= OVL_CURRENT (fns
);
2425 if (TREE_CODE (fn
) == TEMPLATE_DECL
2426 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2428 if (TREE_CODE (fn
) == FUNCTION_DECL
2429 && DECL_USE_TEMPLATE (fn
)
2430 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2432 fns
= OVL_NEXT (fns
);
2435 permerror (input_location
, "%qD is not a template", decl
);
2440 /* This function is called by the parser to process a class member
2441 access expression of the form OBJECT.NAME. NAME is a node used by
2442 the parser to represent a name; it is not yet a DECL. It may,
2443 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2444 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2445 there is no reason to do the lookup twice, so the parser keeps the
2446 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2447 be a template via the use of the "A::template B" syntax. */
2450 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2451 tsubst_flags_t complain
)
2456 tree access_path
= NULL_TREE
;
2457 tree orig_object
= object
;
2458 tree orig_name
= name
;
2460 if (object
== error_mark_node
|| name
== error_mark_node
)
2461 return error_mark_node
;
2463 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2464 if (!objc_is_public (object
, name
))
2465 return error_mark_node
;
2467 object_type
= TREE_TYPE (object
);
2469 if (processing_template_decl
)
2471 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2472 dependent_type_p (object_type
)
2473 /* If NAME is just an IDENTIFIER_NODE, then the expression
2475 || TREE_CODE (object
) == IDENTIFIER_NODE
2476 /* If NAME is "f<args>", where either 'f' or 'args' is
2477 dependent, then the expression is dependent. */
2478 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2479 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2480 TREE_OPERAND (name
, 1)))
2481 /* If NAME is "T::X" where "T" is dependent, then the
2482 expression is dependent. */
2483 || (TREE_CODE (name
) == SCOPE_REF
2484 && TYPE_P (TREE_OPERAND (name
, 0))
2485 && dependent_type_p (TREE_OPERAND (name
, 0))))
2486 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2487 object
= build_non_dependent_expr (object
);
2489 else if (c_dialect_objc ()
2490 && TREE_CODE (name
) == IDENTIFIER_NODE
2491 && (expr
= objc_maybe_build_component_ref (object
, name
)))
2496 The type of the first expression shall be "class object" (of a
2498 if (!currently_open_class (object_type
)
2499 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2500 return error_mark_node
;
2501 if (!CLASS_TYPE_P (object_type
))
2503 if (complain
& tf_error
)
2504 error ("request for member %qD in %qE, which is of non-class type %qT",
2505 name
, object
, object_type
);
2506 return error_mark_node
;
2509 if (BASELINK_P (name
))
2510 /* A member function that has already been looked up. */
2514 bool is_template_id
= false;
2515 tree template_args
= NULL_TREE
;
2518 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2520 is_template_id
= true;
2521 template_args
= TREE_OPERAND (name
, 1);
2522 name
= TREE_OPERAND (name
, 0);
2524 if (TREE_CODE (name
) == OVERLOAD
)
2525 name
= DECL_NAME (get_first_fn (name
));
2526 else if (DECL_P (name
))
2527 name
= DECL_NAME (name
);
2530 if (TREE_CODE (name
) == SCOPE_REF
)
2532 /* A qualified name. The qualifying class or namespace `S'
2533 has already been looked up; it is either a TYPE or a
2535 scope
= TREE_OPERAND (name
, 0);
2536 name
= TREE_OPERAND (name
, 1);
2538 /* If SCOPE is a namespace, then the qualified name does not
2539 name a member of OBJECT_TYPE. */
2540 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2542 if (complain
& tf_error
)
2543 error ("%<%D::%D%> is not a member of %qT",
2544 scope
, name
, object_type
);
2545 return error_mark_node
;
2548 gcc_assert (CLASS_TYPE_P (scope
));
2549 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2550 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2552 if (constructor_name_p (name
, scope
))
2554 if (complain
& tf_error
)
2555 error ("cannot call constructor %<%T::%D%> directly",
2557 return error_mark_node
;
2560 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2561 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2562 if (access_path
== error_mark_node
)
2563 return error_mark_node
;
2566 if (complain
& tf_error
)
2567 error ("%qT is not a base of %qT", scope
, object_type
);
2568 return error_mark_node
;
2574 access_path
= object_type
;
2577 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2578 member
= lookup_destructor (object
, scope
, name
);
2581 /* Look up the member. */
2582 member
= lookup_member (access_path
, name
, /*protect=*/1,
2583 /*want_type=*/false);
2584 if (member
== NULL_TREE
)
2586 if (complain
& tf_error
)
2587 error ("%qD has no member named %qE", object_type
, name
);
2588 return error_mark_node
;
2590 if (member
== error_mark_node
)
2591 return error_mark_node
;
2596 tree templ
= member
;
2598 if (BASELINK_P (templ
))
2599 templ
= lookup_template_function (templ
, template_args
);
2602 if (complain
& tf_error
)
2603 error ("%qD is not a member template function", name
);
2604 return error_mark_node
;
2609 if (TREE_DEPRECATED (member
))
2610 warn_deprecated_use (member
, NULL_TREE
);
2613 check_template_keyword (member
);
2615 expr
= build_class_member_access_expr (object
, member
, access_path
,
2616 /*preserve_reference=*/false,
2618 if (processing_template_decl
&& expr
!= error_mark_node
)
2620 if (BASELINK_P (member
))
2622 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2623 BASELINK_QUALIFIED_P (member
) = 1;
2626 return build_min_non_dep (COMPONENT_REF
, expr
,
2627 orig_object
, orig_name
,
2634 /* Return an expression for the MEMBER_NAME field in the internal
2635 representation of PTRMEM, a pointer-to-member function. (Each
2636 pointer-to-member function type gets its own RECORD_TYPE so it is
2637 more convenient to access the fields by name than by FIELD_DECL.)
2638 This routine converts the NAME to a FIELD_DECL and then creates the
2639 node for the complete expression. */
2642 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2648 /* This code is a stripped down version of
2649 build_class_member_access_expr. It does not work to use that
2650 routine directly because it expects the object to be of class
2652 ptrmem_type
= TREE_TYPE (ptrmem
);
2653 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2654 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2655 /*want_type=*/false);
2656 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2657 cp_type_quals (ptrmem_type
));
2658 return fold_build3_loc (input_location
,
2659 COMPONENT_REF
, member_type
,
2660 ptrmem
, member
, NULL_TREE
);
2663 /* Given an expression PTR for a pointer, return an expression
2664 for the value pointed to.
2665 ERRORSTRING is the name of the operator to appear in error messages.
2667 This function may need to overload OPERATOR_FNNAME.
2668 Must also handle REFERENCE_TYPEs for C++. */
2671 build_x_indirect_ref (tree expr
, ref_operator errorstring
,
2672 tsubst_flags_t complain
)
2674 tree orig_expr
= expr
;
2677 if (processing_template_decl
)
2679 /* Retain the type if we know the operand is a pointer so that
2680 describable_type doesn't make auto deduction break. */
2681 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2682 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2683 if (type_dependent_expression_p (expr
))
2684 return build_min_nt (INDIRECT_REF
, expr
);
2685 expr
= build_non_dependent_expr (expr
);
2688 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2689 NULL_TREE
, /*overloaded_p=*/NULL
, complain
);
2691 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2693 if (processing_template_decl
&& rval
!= error_mark_node
)
2694 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2699 /* Helper function called from c-common. */
2701 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2702 tree ptr
, ref_operator errorstring
)
2704 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2708 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2709 tsubst_flags_t complain
)
2713 if (ptr
== error_mark_node
)
2714 return error_mark_node
;
2716 if (ptr
== current_class_ptr
)
2717 return current_class_ref
;
2719 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2720 ? ptr
: decay_conversion (ptr
));
2721 type
= TREE_TYPE (pointer
);
2723 if (POINTER_TYPE_P (type
))
2727 If the type of the expression is "pointer to T," the type
2728 of the result is "T." */
2729 tree t
= TREE_TYPE (type
);
2731 if (CONVERT_EXPR_P (ptr
)
2732 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2734 /* If a warning is issued, mark it to avoid duplicates from
2735 the backend. This only needs to be done at
2736 warn_strict_aliasing > 2. */
2737 if (warn_strict_aliasing
> 2)
2738 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2739 type
, TREE_OPERAND (ptr
, 0)))
2740 TREE_NO_WARNING (ptr
) = 1;
2743 if (VOID_TYPE_P (t
))
2745 /* A pointer to incomplete type (other than cv void) can be
2746 dereferenced [expr.unary.op]/1 */
2747 if (complain
& tf_error
)
2748 error ("%qT is not a pointer-to-object type", type
);
2749 return error_mark_node
;
2751 else if (TREE_CODE (pointer
) == ADDR_EXPR
2752 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2753 /* The POINTER was something like `&x'. We simplify `*&x' to
2755 return TREE_OPERAND (pointer
, 0);
2758 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2760 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2761 so that we get the proper error message if the result is used
2762 to assign to. Also, &* is supposed to be a no-op. */
2763 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2764 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2765 TREE_SIDE_EFFECTS (ref
)
2766 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2770 else if (!(complain
& tf_error
))
2771 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2773 /* `pointer' won't be an error_mark_node if we were given a
2774 pointer to member, so it's cool to check for this here. */
2775 else if (TYPE_PTR_TO_MEMBER_P (type
))
2776 switch (errorstring
)
2778 case RO_ARRAY_INDEXING
:
2779 error ("invalid use of array indexing on pointer to member");
2782 error ("invalid use of unary %<*%> on pointer to member");
2784 case RO_IMPLICIT_CONVERSION
:
2785 error ("invalid use of implicit conversion on pointer to member");
2790 else if (pointer
!= error_mark_node
)
2791 invalid_indirection_error (input_location
, type
, errorstring
);
2793 return error_mark_node
;
2796 /* This handles expressions of the form "a[i]", which denotes
2799 This is logically equivalent in C to *(a+i), but we may do it differently.
2800 If A is a variable or a member, we generate a primitive ARRAY_REF.
2801 This avoids forcing the array out of registers, and can work on
2802 arrays that are not lvalues (for example, members of structures returned
2805 If INDEX is of some user-defined type, it must be converted to
2806 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2807 will inherit the type of the array, which will be some pointer type.
2809 LOC is the location to use in building the array reference. */
2812 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
2813 tsubst_flags_t complain
)
2819 if (complain
& tf_error
)
2820 error_at (loc
, "subscript missing in array reference");
2821 return error_mark_node
;
2824 if (TREE_TYPE (array
) == error_mark_node
2825 || TREE_TYPE (idx
) == error_mark_node
)
2826 return error_mark_node
;
2828 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2830 switch (TREE_CODE (array
))
2834 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2836 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2837 TREE_OPERAND (array
, 0), value
);
2838 SET_EXPR_LOCATION (ret
, loc
);
2843 ret
= build_conditional_expr
2844 (TREE_OPERAND (array
, 0),
2845 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2847 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
2849 tf_warning_or_error
);
2850 protected_set_expr_location (ret
, loc
);
2857 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2861 warn_array_subscript_with_type_char (idx
);
2863 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2865 if (complain
& tf_error
)
2866 error_at (loc
, "array subscript is not an integer");
2867 return error_mark_node
;
2870 /* Apply integral promotions *after* noticing character types.
2871 (It is unclear why we do these promotions -- the standard
2872 does not say that we should. In fact, the natural thing would
2873 seem to be to convert IDX to ptrdiff_t; we're performing
2874 pointer arithmetic.) */
2875 idx
= perform_integral_promotions (idx
);
2877 /* An array that is indexed by a non-constant
2878 cannot be stored in a register; we must be able to do
2879 address arithmetic on its address.
2880 Likewise an array of elements of variable size. */
2881 if (TREE_CODE (idx
) != INTEGER_CST
2882 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2883 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2886 if (!cxx_mark_addressable (array
))
2887 return error_mark_node
;
2890 /* An array that is indexed by a constant value which is not within
2891 the array bounds cannot be stored in a register either; because we
2892 would get a crash in store_bit_field/extract_bit_field when trying
2893 to access a non-existent part of the register. */
2894 if (TREE_CODE (idx
) == INTEGER_CST
2895 && TYPE_DOMAIN (TREE_TYPE (array
))
2896 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
2898 if (!cxx_mark_addressable (array
))
2899 return error_mark_node
;
2902 if (!lvalue_p (array
) && (complain
& tf_error
))
2903 pedwarn (loc
, OPT_pedantic
,
2904 "ISO C++ forbids subscripting non-lvalue array");
2906 /* Note in C++ it is valid to subscript a `register' array, since
2907 it is valid to take the address of something with that
2908 storage specification. */
2912 while (TREE_CODE (foo
) == COMPONENT_REF
)
2913 foo
= TREE_OPERAND (foo
, 0);
2914 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
)
2915 && (complain
& tf_warning
))
2916 warning_at (loc
, OPT_Wextra
,
2917 "subscripting array declared %<register%>");
2920 type
= TREE_TYPE (TREE_TYPE (array
));
2921 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
2922 /* Array ref is const/volatile if the array elements are
2923 or if the array is.. */
2924 TREE_READONLY (rval
)
2925 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
2926 TREE_SIDE_EFFECTS (rval
)
2927 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
2928 TREE_THIS_VOLATILE (rval
)
2929 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
2930 ret
= require_complete_type_sfinae (fold_if_not_in_template (rval
),
2932 protected_set_expr_location (ret
, loc
);
2937 tree ar
= default_conversion (array
);
2938 tree ind
= default_conversion (idx
);
2940 /* Put the integer in IND to simplify error checking. */
2941 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
2948 if (ar
== error_mark_node
)
2951 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
2953 if (complain
& tf_error
)
2954 error_at (loc
, "subscripted value is neither array nor pointer");
2955 return error_mark_node
;
2957 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
2959 if (complain
& tf_error
)
2960 error_at (loc
, "array subscript is not an integer");
2961 return error_mark_node
;
2964 warn_array_subscript_with_type_char (idx
);
2966 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
2971 protected_set_expr_location (ret
, loc
);
2976 /* Entry point for Obj-C++. */
2979 build_array_ref (location_t loc
, tree array
, tree idx
)
2981 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
2984 /* Resolve a pointer to member function. INSTANCE is the object
2985 instance to use, if the member points to a virtual member.
2987 This used to avoid checking for virtual functions if basetype
2988 has no virtual functions, according to an earlier ANSI draft.
2989 With the final ISO C++ rules, such an optimization is
2990 incorrect: A pointer to a derived member can be static_cast
2991 to pointer-to-base-member, as long as the dynamic object
2992 later has the right member. */
2995 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
2997 if (TREE_CODE (function
) == OFFSET_REF
)
2998 function
= TREE_OPERAND (function
, 1);
3000 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3002 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
3003 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3005 tree instance_ptr
= *instance_ptrptr
;
3006 tree instance_save_expr
= 0;
3007 if (instance_ptr
== error_mark_node
)
3009 if (TREE_CODE (function
) == PTRMEM_CST
)
3011 /* Extracting the function address from a pmf is only
3012 allowed with -Wno-pmf-conversions. It only works for
3014 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
3015 e1
= convert (fntype
, e1
);
3020 error ("object missing in use of %qE", function
);
3021 return error_mark_node
;
3025 if (TREE_SIDE_EFFECTS (instance_ptr
))
3026 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3028 if (TREE_SIDE_EFFECTS (function
))
3029 function
= save_expr (function
);
3031 /* Start by extracting all the information from the PMF itself. */
3032 e3
= pfn_from_ptrmemfunc (function
);
3033 delta
= delta_from_ptrmemfunc (function
);
3034 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3035 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3037 case ptrmemfunc_vbit_in_pfn
:
3038 e1
= cp_build_binary_op (input_location
,
3039 BIT_AND_EXPR
, idx
, integer_one_node
,
3040 tf_warning_or_error
);
3041 idx
= cp_build_binary_op (input_location
,
3042 MINUS_EXPR
, idx
, integer_one_node
,
3043 tf_warning_or_error
);
3046 case ptrmemfunc_vbit_in_delta
:
3047 e1
= cp_build_binary_op (input_location
,
3048 BIT_AND_EXPR
, delta
, integer_one_node
,
3049 tf_warning_or_error
);
3050 delta
= cp_build_binary_op (input_location
,
3051 RSHIFT_EXPR
, delta
, integer_one_node
,
3052 tf_warning_or_error
);
3059 /* Convert down to the right base before using the instance. A
3060 special case is that in a pointer to member of class C, C may
3061 be incomplete. In that case, the function will of course be
3062 a member of C, and no conversion is required. In fact,
3063 lookup_base will fail in that case, because incomplete
3064 classes do not have BINFOs. */
3065 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3066 if (!same_type_ignoring_top_level_qualifiers_p
3067 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3069 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3070 basetype
, ba_check
, NULL
);
3071 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3073 if (instance_ptr
== error_mark_node
)
3074 return error_mark_node
;
3076 /* ...and then the delta in the PMF. */
3077 instance_ptr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (instance_ptr
),
3078 instance_ptr
, fold_convert (sizetype
, delta
));
3080 /* Hand back the adjusted 'this' argument to our caller. */
3081 *instance_ptrptr
= instance_ptr
;
3083 /* Next extract the vtable pointer from the object. */
3084 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3086 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, tf_warning_or_error
);
3087 /* If the object is not dynamic the access invokes undefined
3088 behavior. As it is not executed in this case silence the
3089 spurious warnings it may provoke. */
3090 TREE_NO_WARNING (vtbl
) = 1;
3092 /* Finally, extract the function pointer from the vtable. */
3093 e2
= fold_build2_loc (input_location
,
3094 POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
,
3095 fold_convert (sizetype
, idx
));
3096 e2
= cp_build_indirect_ref (e2
, RO_NULL
, tf_warning_or_error
);
3097 TREE_CONSTANT (e2
) = 1;
3099 /* When using function descriptors, the address of the
3100 vtable entry is treated as a function pointer. */
3101 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3102 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3103 cp_build_addr_expr (e2
, tf_warning_or_error
));
3105 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3106 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
3108 /* Make sure this doesn't get evaluated first inside one of the
3109 branches of the COND_EXPR. */
3110 if (instance_save_expr
)
3111 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3112 instance_save_expr
, e1
);
3119 /* Used by the C-common bits. */
3121 build_function_call (location_t loc ATTRIBUTE_UNUSED
,
3122 tree function
, tree params
)
3124 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3127 /* Used by the C-common bits. */
3129 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED
,
3130 tree function
, VEC(tree
,gc
) *params
,
3131 VEC(tree
,gc
) *origtypes ATTRIBUTE_UNUSED
)
3133 VEC(tree
,gc
) *orig_params
= params
;
3134 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3135 tf_warning_or_error
);
3137 /* cp_build_function_call_vec can reallocate PARAMS by adding
3138 default arguments. That should never happen here. Verify
3140 gcc_assert (params
== orig_params
);
3145 /* Build a function call using a tree list of arguments. */
3148 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3153 vec
= make_tree_vector ();
3154 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3155 VEC_safe_push (tree
, gc
, vec
, TREE_VALUE (params
));
3156 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3157 release_tree_vector (vec
);
3161 /* Build a function call using varargs. */
3164 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3170 vec
= make_tree_vector ();
3171 va_start (args
, complain
);
3172 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3173 VEC_safe_push (tree
, gc
, vec
, t
);
3175 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3176 release_tree_vector (vec
);
3180 /* Build a function call using a vector of arguments. PARAMS may be
3181 NULL if there are no parameters. This changes the contents of
3185 cp_build_function_call_vec (tree function
, VEC(tree
,gc
) **params
,
3186 tsubst_flags_t complain
)
3188 tree fntype
, fndecl
;
3190 tree original
= function
;
3194 VEC(tree
,gc
) *allocated
= NULL
;
3197 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3198 expressions, like those used for ObjC messenger dispatches. */
3199 if (params
!= NULL
&& !VEC_empty (tree
, *params
))
3200 function
= objc_rewrite_function_call (function
,
3201 VEC_index (tree
, *params
, 0));
3203 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3204 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3205 if (TREE_CODE (function
) == NOP_EXPR
3206 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3207 function
= TREE_OPERAND (function
, 0);
3209 if (TREE_CODE (function
) == FUNCTION_DECL
)
3211 mark_used (function
);
3214 /* Convert anything with function type to a pointer-to-function. */
3215 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
3216 pedwarn (input_location
, OPT_pedantic
,
3217 "ISO C++ forbids calling %<::main%> from within program");
3219 function
= build_addr_func (function
);
3225 function
= build_addr_func (function
);
3228 if (function
== error_mark_node
)
3229 return error_mark_node
;
3231 fntype
= TREE_TYPE (function
);
3233 if (TYPE_PTRMEMFUNC_P (fntype
))
3235 if (complain
& tf_error
)
3236 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3237 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3238 original
, original
);
3239 return error_mark_node
;
3242 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
3243 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3245 if (!((TREE_CODE (fntype
) == POINTER_TYPE
3246 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
3248 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3250 if (complain
& tf_error
)
3251 error ("%qE cannot be used as a function", original
);
3252 return error_mark_node
;
3255 /* fntype now gets the type of function pointed to. */
3256 fntype
= TREE_TYPE (fntype
);
3257 parm_types
= TYPE_ARG_TYPES (fntype
);
3261 allocated
= make_tree_vector ();
3262 params
= &allocated
;
3265 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3268 return error_mark_node
;
3270 argarray
= VEC_address (tree
, *params
);
3272 /* Check for errors in format strings and inappropriately
3274 check_function_arguments (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
,
3277 ret
= build_cxx_call (function
, nargs
, argarray
);
3279 if (allocated
!= NULL
)
3280 release_tree_vector (allocated
);
3285 /* Subroutine of convert_arguments.
3286 Warn about wrong number of args are genereted. */
3289 warn_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3293 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3295 if (DECL_NAME (fndecl
) == NULL_TREE
3296 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3299 ? G_("too many arguments to constructor %q#D")
3300 : G_("too few arguments to constructor %q#D"),
3305 ? G_("too many arguments to member function %q#D")
3306 : G_("too few arguments to member function %q#D"),
3312 ? G_("too many arguments to function %q#D")
3313 : G_("too few arguments to function %q#D"),
3315 inform (DECL_SOURCE_LOCATION (fndecl
),
3320 if (c_dialect_objc () && objc_message_selector ())
3323 ? G_("too many arguments to method %q#D")
3324 : G_("too few arguments to method %q#D"),
3325 objc_message_selector ());
3327 error_at (loc
, too_many_p
? G_("too many arguments to function")
3328 : G_("too few arguments to function"));
3332 /* Convert the actual parameter expressions in the list VALUES to the
3333 types in the list TYPELIST. The converted expressions are stored
3334 back in the VALUES vector.
3335 If parmdecls is exhausted, or when an element has NULL as its type,
3336 perform the default conversions.
3338 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3340 This is also where warnings about wrong number of args are generated.
3342 Returns the actual number of arguments processed (which might be less
3343 than the length of the vector), or -1 on error.
3345 In C++, unspecified trailing parameters can be filled in with their
3346 default arguments, if such were specified. Do so here. */
3349 convert_arguments (tree typelist
, VEC(tree
,gc
) **values
, tree fndecl
,
3350 int flags
, tsubst_flags_t complain
)
3355 /* Argument passing is always copy-initialization. */
3356 flags
|= LOOKUP_ONLYCONVERTING
;
3358 for (i
= 0, typetail
= typelist
;
3359 i
< VEC_length (tree
, *values
);
3362 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3363 tree val
= VEC_index (tree
, *values
, i
);
3365 if (val
== error_mark_node
|| type
== error_mark_node
)
3368 if (type
== void_type_node
)
3370 if (complain
& tf_error
)
3372 warn_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3379 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3380 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3381 if (TREE_CODE (val
) == NOP_EXPR
3382 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3383 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3384 val
= TREE_OPERAND (val
, 0);
3386 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3388 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3389 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3390 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3391 val
= decay_conversion (val
);
3394 if (val
== error_mark_node
)
3399 /* Formal parm type is specified by a function prototype. */
3402 if (!COMPLETE_TYPE_P (complete_type (type
)))
3404 if (complain
& tf_error
)
3407 error ("parameter %P of %qD has incomplete type %qT",
3410 error ("parameter %P has incomplete type %qT", i
, type
);
3412 parmval
= error_mark_node
;
3416 parmval
= convert_for_initialization
3417 (NULL_TREE
, type
, val
, flags
,
3418 ICR_ARGPASS
, fndecl
, i
, complain
);
3419 parmval
= convert_for_arg_passing (type
, parmval
);
3422 if (parmval
== error_mark_node
)
3425 VEC_replace (tree
, *values
, i
, parmval
);
3429 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3430 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3431 /* Don't do ellipsis conversion for __built_in_constant_p
3432 as this will result in spurious errors for non-trivial
3434 val
= require_complete_type_sfinae (val
, complain
);
3436 val
= convert_arg_to_ellipsis (val
);
3438 VEC_replace (tree
, *values
, i
, val
);
3442 typetail
= TREE_CHAIN (typetail
);
3445 if (typetail
!= 0 && typetail
!= void_list_node
)
3447 /* See if there are default arguments that can be used. Because
3448 we hold default arguments in the FUNCTION_TYPE (which is so
3449 wrong), we can see default parameters here from deduced
3450 contexts (and via typeof) for indirect function calls.
3451 Fortunately we know whether we have a function decl to
3452 provide default arguments in a language conformant
3454 if (fndecl
&& TREE_PURPOSE (typetail
)
3455 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3457 for (; typetail
!= void_list_node
; ++i
)
3460 = convert_default_arg (TREE_VALUE (typetail
),
3461 TREE_PURPOSE (typetail
),
3464 if (parmval
== error_mark_node
)
3467 VEC_safe_push (tree
, gc
, *values
, parmval
);
3468 typetail
= TREE_CHAIN (typetail
);
3469 /* ends with `...'. */
3470 if (typetail
== NULL_TREE
)
3476 if (complain
& tf_error
)
3477 warn_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3485 /* Build a binary-operation expression, after performing default
3486 conversions on the operands. CODE is the kind of expression to
3487 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3488 are the tree codes which correspond to ARG1 and ARG2 when issuing
3489 warnings about possibly misplaced parentheses. They may differ
3490 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3491 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3492 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3493 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3494 ARG2_CODE as ERROR_MARK. */
3497 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3498 tree arg2
, enum tree_code arg2_code
, bool *overloaded_p
,
3499 tsubst_flags_t complain
)
3508 if (processing_template_decl
)
3510 if (type_dependent_expression_p (arg1
)
3511 || type_dependent_expression_p (arg2
))
3512 return build_min_nt (code
, arg1
, arg2
);
3513 arg1
= build_non_dependent_expr (arg1
);
3514 arg2
= build_non_dependent_expr (arg2
);
3517 if (code
== DOTSTAR_EXPR
)
3518 expr
= build_m_component_ref (arg1
, arg2
);
3520 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3521 overloaded_p
, complain
);
3523 /* Check for cases such as x+y<<z which users are likely to
3524 misinterpret. But don't warn about obj << x + y, since that is a
3525 common idiom for I/O. */
3526 if (warn_parentheses
3527 && (complain
& tf_warning
)
3528 && !processing_template_decl
3529 && !error_operand_p (arg1
)
3530 && !error_operand_p (arg2
)
3531 && (code
!= LSHIFT_EXPR
3532 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3533 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3535 if (processing_template_decl
&& expr
!= error_mark_node
)
3536 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3541 /* Build and return an ARRAY_REF expression. */
3544 build_x_array_ref (tree arg1
, tree arg2
, tsubst_flags_t complain
)
3546 tree orig_arg1
= arg1
;
3547 tree orig_arg2
= arg2
;
3550 if (processing_template_decl
)
3552 if (type_dependent_expression_p (arg1
)
3553 || type_dependent_expression_p (arg2
))
3554 return build_min_nt (ARRAY_REF
, arg1
, arg2
,
3555 NULL_TREE
, NULL_TREE
);
3556 arg1
= build_non_dependent_expr (arg1
);
3557 arg2
= build_non_dependent_expr (arg2
);
3560 expr
= build_new_op (ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3561 /*overloaded_p=*/NULL
, complain
);
3563 if (processing_template_decl
&& expr
!= error_mark_node
)
3564 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3565 NULL_TREE
, NULL_TREE
);
3569 /* For the c-common bits. */
3571 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3572 int convert_p ATTRIBUTE_UNUSED
)
3574 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3578 /* Build a binary-operation expression without default conversions.
3579 CODE is the kind of expression to build.
3580 LOCATION is the location_t of the operator in the source code.
3581 This function differs from `build' in several ways:
3582 the data type of the result is computed and recorded in it,
3583 warnings are generated if arg data types are invalid,
3584 special handling for addition and subtraction of pointers is known,
3585 and some optimization is done (operations on narrow ints
3586 are done in the narrower type when that gives the same result).
3587 Constant folding is also done before the result is returned.
3589 Note that the operands will never have enumeral types
3590 because either they have just had the default conversions performed
3591 or they have both just been converted to some other type in which
3592 the arithmetic is to be done.
3594 C++: must do special pointer arithmetic when implementing
3595 multiple inheritance, and deal with pointer to member functions. */
3598 cp_build_binary_op (location_t location
,
3599 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3600 tsubst_flags_t complain
)
3603 enum tree_code code0
, code1
;
3605 const char *invalid_op_diag
;
3607 /* Expression code to give to the expression when it is built.
3608 Normally this is CODE, which is what the caller asked for,
3609 but in some special cases we change it. */
3610 enum tree_code resultcode
= code
;
3612 /* Data type in which the computation is to be performed.
3613 In the simplest cases this is the common type of the arguments. */
3614 tree result_type
= NULL
;
3616 /* Nonzero means operands have already been type-converted
3617 in whatever way is necessary.
3618 Zero means they need to be converted to RESULT_TYPE. */
3621 /* Nonzero means create the expression with this type, rather than
3623 tree build_type
= 0;
3625 /* Nonzero means after finally constructing the expression
3626 convert it to this type. */
3627 tree final_type
= 0;
3631 /* Nonzero if this is an operation like MIN or MAX which can
3632 safely be computed in short if both args are promoted shorts.
3633 Also implies COMMON.
3634 -1 indicates a bitwise operation; this makes a difference
3635 in the exact conditions for when it is safe to do the operation
3636 in a narrower mode. */
3639 /* Nonzero if this is a comparison operation;
3640 if both args are promoted shorts, compare the original shorts.
3641 Also implies COMMON. */
3642 int short_compare
= 0;
3644 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3647 /* True if both operands have arithmetic type. */
3648 bool arithmetic_types_p
;
3650 /* Apply default conversions. */
3654 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3655 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3656 || code
== TRUTH_XOR_EXPR
)
3658 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
3659 op0
= decay_conversion (op0
);
3660 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
3661 op1
= decay_conversion (op1
);
3665 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
3666 op0
= default_conversion (op0
);
3667 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
3668 op1
= default_conversion (op1
);
3671 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3672 STRIP_TYPE_NOPS (op0
);
3673 STRIP_TYPE_NOPS (op1
);
3675 /* DTRT if one side is an overloaded function, but complain about it. */
3676 if (type_unknown_p (op0
))
3678 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3679 if (t
!= error_mark_node
)
3681 if (complain
& tf_error
)
3682 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3687 if (type_unknown_p (op1
))
3689 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3690 if (t
!= error_mark_node
)
3692 if (complain
& tf_error
)
3693 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3699 type0
= TREE_TYPE (op0
);
3700 type1
= TREE_TYPE (op1
);
3702 /* The expression codes of the data types of the arguments tell us
3703 whether the arguments are integers, floating, pointers, etc. */
3704 code0
= TREE_CODE (type0
);
3705 code1
= TREE_CODE (type1
);
3707 /* If an error was already reported for one of the arguments,
3708 avoid reporting another error. */
3709 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3710 return error_mark_node
;
3712 if ((invalid_op_diag
3713 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3715 error (invalid_op_diag
);
3716 return error_mark_node
;
3719 /* Issue warnings about peculiar, but valid, uses of NULL. */
3720 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3721 /* It's reasonable to use pointer values as operands of &&
3722 and ||, so NULL is no exception. */
3723 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3724 && ( /* Both are NULL (or 0) and the operation was not a
3725 comparison or a pointer subtraction. */
3726 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3727 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
3728 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3729 || (!null_ptr_cst_p (orig_op0
)
3730 && !TYPE_PTR_P (type0
) && !TYPE_PTR_TO_MEMBER_P (type0
))
3731 || (!null_ptr_cst_p (orig_op1
)
3732 && !TYPE_PTR_P (type1
) && !TYPE_PTR_TO_MEMBER_P (type1
)))
3733 && (complain
& tf_warning
))
3734 /* Some sort of arithmetic operation involving NULL was
3736 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3741 /* Subtraction of two similar pointers.
3742 We must subtract them as integers, then divide by object size. */
3743 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3744 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3746 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3747 /* In all other cases except pointer - int, the usual arithmetic
3749 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3754 /* The pointer - int case is just like pointer + int; fall
3757 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3758 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3762 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3763 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3764 if (processing_template_decl
)
3766 result_type
= TREE_TYPE (ptr_operand
);
3769 return cp_pointer_int_sum (code
,
3780 case TRUNC_DIV_EXPR
:
3782 case FLOOR_DIV_EXPR
:
3783 case ROUND_DIV_EXPR
:
3784 case EXACT_DIV_EXPR
:
3785 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3786 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3787 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3788 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3790 enum tree_code tcode0
= code0
, tcode1
= code1
;
3792 warn_for_div_by_zero (location
, op1
);
3794 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3795 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3796 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3797 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3799 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3800 resultcode
= RDIV_EXPR
;
3802 /* When dividing two signed integers, we have to promote to int.
3803 unless we divide by a constant != -1. Note that default
3804 conversion will have been performed on the operands at this
3805 point, so we have to dig out the original type to find out if
3807 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3808 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3809 || (TREE_CODE (op1
) == INTEGER_CST
3810 && ! integer_all_onesp (op1
)));
3819 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3820 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3821 && !VECTOR_FLOAT_TYPE_P (type0
)
3822 && !VECTOR_FLOAT_TYPE_P (type1
)))
3826 case TRUNC_MOD_EXPR
:
3827 case FLOOR_MOD_EXPR
:
3828 warn_for_div_by_zero (location
, op1
);
3830 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3831 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
3832 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
3834 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3836 /* Although it would be tempting to shorten always here, that loses
3837 on some targets, since the modulo instruction is undefined if the
3838 quotient can't be represented in the computation mode. We shorten
3839 only if unsigned or if dividing by something we know != -1. */
3840 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3841 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3842 || (TREE_CODE (op1
) == INTEGER_CST
3843 && ! integer_all_onesp (op1
)));
3848 case TRUTH_ANDIF_EXPR
:
3849 case TRUTH_ORIF_EXPR
:
3850 case TRUTH_AND_EXPR
:
3852 result_type
= boolean_type_node
;
3855 /* Shift operations: result has same type as first operand;
3856 always convert second operand to int.
3857 Also set SHORT_SHIFT if shifting rightward. */
3860 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3862 result_type
= type0
;
3863 if (TREE_CODE (op1
) == INTEGER_CST
)
3865 if (tree_int_cst_lt (op1
, integer_zero_node
))
3867 if ((complain
& tf_warning
)
3868 && c_inhibit_evaluation_warnings
== 0)
3869 warning (0, "right shift count is negative");
3873 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3874 && (complain
& tf_warning
)
3875 && c_inhibit_evaluation_warnings
== 0)
3876 warning (0, "right shift count >= width of type");
3879 /* Convert the shift-count to an integer, regardless of
3880 size of value being shifted. */
3881 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3882 op1
= cp_convert (integer_type_node
, op1
);
3883 /* Avoid converting op1 to result_type later. */
3889 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3891 result_type
= type0
;
3892 if (TREE_CODE (op1
) == INTEGER_CST
)
3894 if (tree_int_cst_lt (op1
, integer_zero_node
))
3896 if ((complain
& tf_warning
)
3897 && c_inhibit_evaluation_warnings
== 0)
3898 warning (0, "left shift count is negative");
3900 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3902 if ((complain
& tf_warning
)
3903 && c_inhibit_evaluation_warnings
== 0)
3904 warning (0, "left shift count >= width of type");
3907 /* Convert the shift-count to an integer, regardless of
3908 size of value being shifted. */
3909 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3910 op1
= cp_convert (integer_type_node
, op1
);
3911 /* Avoid converting op1 to result_type later. */
3918 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3920 result_type
= type0
;
3921 if (TREE_CODE (op1
) == INTEGER_CST
)
3923 if (tree_int_cst_lt (op1
, integer_zero_node
))
3925 if (complain
& tf_warning
)
3926 warning (0, (code
== LROTATE_EXPR
)
3927 ? G_("left rotate count is negative")
3928 : G_("right rotate count is negative"));
3930 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3932 if (complain
& tf_warning
)
3933 warning (0, (code
== LROTATE_EXPR
)
3934 ? G_("left rotate count >= width of type")
3935 : G_("right rotate count >= width of type"));
3938 /* Convert the shift-count to an integer, regardless of
3939 size of value being shifted. */
3940 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3941 op1
= cp_convert (integer_type_node
, op1
);
3947 if ((complain
& tf_warning
)
3948 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
3949 warning (OPT_Wfloat_equal
,
3950 "comparing floating point with == or != is unsafe");
3951 if ((complain
& tf_warning
)
3952 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
3953 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
3954 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
3956 build_type
= boolean_type_node
;
3957 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3958 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
3959 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3960 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
3962 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3963 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
3964 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3965 CPO_COMPARISON
, complain
);
3966 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
3967 && null_ptr_cst_p (op1
))
3969 if (TREE_CODE (op0
) == ADDR_EXPR
3970 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
3972 if (complain
& tf_warning
)
3973 warning (OPT_Waddress
, "the address of %qD will never be NULL",
3974 TREE_OPERAND (op0
, 0));
3976 result_type
= type0
;
3978 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
3979 && null_ptr_cst_p (op0
))
3981 if (TREE_CODE (op1
) == ADDR_EXPR
3982 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
3984 if (complain
& tf_warning
)
3985 warning (OPT_Waddress
, "the address of %qD will never be NULL",
3986 TREE_OPERAND (op1
, 0));
3988 result_type
= type1
;
3990 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
3991 /* One of the operands must be of nullptr_t type. */
3992 result_type
= TREE_TYPE (nullptr_node
);
3993 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3995 result_type
= type0
;
3996 if (complain
& tf_error
)
3997 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
3999 return error_mark_node
;
4001 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4003 result_type
= type1
;
4004 if (complain
& tf_error
)
4005 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4007 return error_mark_node
;
4009 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
4011 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4012 == ptrmemfunc_vbit_in_delta
)
4014 tree pfn0
= pfn_from_ptrmemfunc (op0
);
4015 tree delta0
= delta_from_ptrmemfunc (op0
);
4016 tree e1
= cp_build_binary_op (location
,
4019 build_zero_cst (TREE_TYPE (pfn0
)),
4021 tree e2
= cp_build_binary_op (location
,
4026 e2
= cp_build_binary_op (location
,
4027 EQ_EXPR
, e2
, integer_zero_node
,
4029 op0
= cp_build_binary_op (location
,
4030 TRUTH_ANDIF_EXPR
, e1
, e2
,
4032 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
4036 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4037 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
4039 result_type
= TREE_TYPE (op0
);
4041 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4042 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4043 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4046 /* E will be the final comparison. */
4048 /* E1 and E2 are for scratch. */
4056 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4057 CPO_COMPARISON
, complain
);
4059 if (!same_type_p (TREE_TYPE (op0
), type
))
4060 op0
= cp_convert_and_check (type
, op0
);
4061 if (!same_type_p (TREE_TYPE (op1
), type
))
4062 op1
= cp_convert_and_check (type
, op1
);
4064 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4065 return error_mark_node
;
4067 if (TREE_SIDE_EFFECTS (op0
))
4068 op0
= save_expr (op0
);
4069 if (TREE_SIDE_EFFECTS (op1
))
4070 op1
= save_expr (op1
);
4072 pfn0
= pfn_from_ptrmemfunc (op0
);
4073 pfn1
= pfn_from_ptrmemfunc (op1
);
4074 delta0
= delta_from_ptrmemfunc (op0
);
4075 delta1
= delta_from_ptrmemfunc (op1
);
4076 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4077 == ptrmemfunc_vbit_in_delta
)
4082 && ((op0.delta == op1.delta)
4083 || (!op0.pfn && op0.delta & 1 == 0
4084 && op1.delta & 1 == 0))
4086 The reason for the `!op0.pfn' bit is that a NULL
4087 pointer-to-member is any member with a zero PFN and
4088 LSB of the DELTA field is 0. */
4090 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4094 e1
= cp_build_binary_op (location
,
4095 EQ_EXPR
, e1
, integer_zero_node
,
4097 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4101 e2
= cp_build_binary_op (location
,
4102 EQ_EXPR
, e2
, integer_zero_node
,
4104 e1
= cp_build_binary_op (location
,
4105 TRUTH_ANDIF_EXPR
, e2
, e1
,
4107 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4109 build_zero_cst (TREE_TYPE (pfn0
)),
4111 e2
= cp_build_binary_op (location
,
4112 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4113 e1
= cp_build_binary_op (location
,
4114 EQ_EXPR
, delta0
, delta1
, complain
);
4115 e1
= cp_build_binary_op (location
,
4116 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4123 && (!op0.pfn || op0.delta == op1.delta))
4125 The reason for the `!op0.pfn' bit is that a NULL
4126 pointer-to-member is any member with a zero PFN; the
4127 DELTA field is unspecified. */
4129 e1
= cp_build_binary_op (location
,
4130 EQ_EXPR
, delta0
, delta1
, complain
);
4131 e2
= cp_build_binary_op (location
,
4134 build_zero_cst (TREE_TYPE (pfn0
)),
4136 e1
= cp_build_binary_op (location
,
4137 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4139 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4140 e
= cp_build_binary_op (location
,
4141 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4142 if (code
== EQ_EXPR
)
4144 return cp_build_binary_op (location
,
4145 EQ_EXPR
, e
, integer_zero_node
, complain
);
4149 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4150 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4152 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4153 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4161 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4162 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4164 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4165 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4166 CPO_COMPARISON
, complain
);
4173 if (TREE_CODE (orig_op0
) == STRING_CST
4174 || TREE_CODE (orig_op1
) == STRING_CST
)
4176 if (complain
& tf_warning
)
4177 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4180 build_type
= boolean_type_node
;
4181 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4182 || code0
== ENUMERAL_TYPE
)
4183 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4184 || code1
== ENUMERAL_TYPE
))
4186 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4187 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4188 CPO_COMPARISON
, complain
);
4189 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4190 result_type
= type0
;
4191 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4192 result_type
= type1
;
4193 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4194 /* One of the operands must be of nullptr_t type. */
4195 result_type
= TREE_TYPE (nullptr_node
);
4196 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4198 result_type
= type0
;
4199 if (complain
& tf_error
)
4200 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4202 return error_mark_node
;
4204 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4206 result_type
= type1
;
4207 if (complain
& tf_error
)
4208 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4210 return error_mark_node
;
4214 case UNORDERED_EXPR
:
4221 build_type
= integer_type_node
;
4222 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4224 if (complain
& tf_error
)
4225 error ("unordered comparison on non-floating point argument");
4226 return error_mark_node
;
4235 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4236 || code0
== ENUMERAL_TYPE
)
4237 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4238 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4239 arithmetic_types_p
= 1;
4242 arithmetic_types_p
= 0;
4243 /* Vector arithmetic is only allowed when both sides are vectors. */
4244 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4246 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4247 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4250 binary_op_error (location
, code
, type0
, type1
);
4251 return error_mark_node
;
4253 arithmetic_types_p
= 1;
4256 /* Determine the RESULT_TYPE, if it is not already known. */
4258 && arithmetic_types_p
4259 && (shorten
|| common
|| short_compare
))
4261 result_type
= cp_common_type (type0
, type1
);
4262 do_warn_double_promotion (result_type
, type0
, type1
,
4263 "implicit conversion from %qT to %qT "
4264 "to match other operand of binary "
4271 if (complain
& tf_error
)
4272 error ("invalid operands of types %qT and %qT to binary %qO",
4273 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4274 return error_mark_node
;
4277 /* If we're in a template, the only thing we need to know is the
4279 if (processing_template_decl
)
4281 /* Since the middle-end checks the type when doing a build2, we
4282 need to build the tree in pieces. This built tree will never
4283 get out of the front-end as we replace it when instantiating
4285 tree tmp
= build2 (resultcode
,
4286 build_type
? build_type
: result_type
,
4288 TREE_OPERAND (tmp
, 0) = op0
;
4292 if (arithmetic_types_p
)
4294 bool first_complex
= (code0
== COMPLEX_TYPE
);
4295 bool second_complex
= (code1
== COMPLEX_TYPE
);
4296 int none_complex
= (!first_complex
&& !second_complex
);
4298 /* Adapted from patch for c/24581. */
4299 if (first_complex
!= second_complex
4300 && (code
== PLUS_EXPR
4301 || code
== MINUS_EXPR
4302 || code
== MULT_EXPR
4303 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4304 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4305 && flag_signed_zeros
)
4307 /* An operation on mixed real/complex operands must be
4308 handled specially, but the language-independent code can
4309 more easily optimize the plain complex arithmetic if
4310 -fno-signed-zeros. */
4311 tree real_type
= TREE_TYPE (result_type
);
4315 if (TREE_TYPE (op0
) != result_type
)
4316 op0
= cp_convert_and_check (result_type
, op0
);
4317 if (TREE_TYPE (op1
) != real_type
)
4318 op1
= cp_convert_and_check (real_type
, op1
);
4322 if (TREE_TYPE (op0
) != real_type
)
4323 op0
= cp_convert_and_check (real_type
, op0
);
4324 if (TREE_TYPE (op1
) != result_type
)
4325 op1
= cp_convert_and_check (result_type
, op1
);
4327 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4328 return error_mark_node
;
4331 op0
= save_expr (op0
);
4332 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4333 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4337 case TRUNC_DIV_EXPR
:
4338 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4342 real
= build2 (resultcode
, real_type
, real
, op1
);
4350 op1
= save_expr (op1
);
4351 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4352 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4356 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4359 real
= build2 (resultcode
, real_type
, op0
, real
);
4362 real
= build2 (resultcode
, real_type
, op0
, real
);
4363 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4369 real
= fold_if_not_in_template (real
);
4370 imag
= fold_if_not_in_template (imag
);
4371 result
= build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4372 result
= fold_if_not_in_template (result
);
4376 /* For certain operations (which identify themselves by shorten != 0)
4377 if both args were extended from the same smaller type,
4378 do the arithmetic in that type and then extend.
4380 shorten !=0 and !=1 indicates a bitwise operation.
4381 For them, this optimization is safe only if
4382 both args are zero-extended or both are sign-extended.
4383 Otherwise, we might change the result.
4384 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4385 but calculated in (unsigned short) it would be (unsigned short)-1. */
4387 if (shorten
&& none_complex
)
4389 final_type
= result_type
;
4390 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4394 /* Comparison operations are shortened too but differently.
4395 They identify themselves by setting short_compare = 1. */
4399 /* Don't write &op0, etc., because that would prevent op0
4400 from being kept in a register.
4401 Instead, make copies of the our local variables and
4402 pass the copies by reference, then copy them back afterward. */
4403 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4404 enum tree_code xresultcode
= resultcode
;
4406 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4408 return cp_convert (boolean_type_node
, val
);
4409 op0
= xop0
, op1
= xop1
;
4411 resultcode
= xresultcode
;
4414 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4415 && warn_sign_compare
4416 && !TREE_NO_WARNING (orig_op0
)
4417 && !TREE_NO_WARNING (orig_op1
)
4418 /* Do not warn until the template is instantiated; we cannot
4419 bound the ranges of the arguments until that point. */
4420 && !processing_template_decl
4421 && (complain
& tf_warning
)
4422 && c_inhibit_evaluation_warnings
== 0)
4424 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4425 result_type
, resultcode
);
4429 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4430 Then the expression will be built.
4431 It will be given type FINAL_TYPE if that is nonzero;
4432 otherwise, it will be given type RESULT_TYPE. */
4435 if (TREE_TYPE (op0
) != result_type
)
4436 op0
= cp_convert_and_check (result_type
, op0
);
4437 if (TREE_TYPE (op1
) != result_type
)
4438 op1
= cp_convert_and_check (result_type
, op1
);
4440 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4441 return error_mark_node
;
4444 if (build_type
== NULL_TREE
)
4445 build_type
= result_type
;
4447 result
= build2 (resultcode
, build_type
, op0
, op1
);
4448 result
= fold_if_not_in_template (result
);
4449 if (final_type
!= 0)
4450 result
= cp_convert (final_type
, result
);
4452 if (TREE_OVERFLOW_P (result
)
4453 && !TREE_OVERFLOW_P (op0
)
4454 && !TREE_OVERFLOW_P (op1
))
4455 overflow_warning (location
, result
);
4460 /* Return a tree for the sum or difference (RESULTCODE says which)
4461 of pointer PTROP and integer INTOP. */
4464 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4466 tree res_type
= TREE_TYPE (ptrop
);
4468 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4469 in certain circumstance (when it's valid to do so). So we need
4470 to make sure it's complete. We don't need to check here, if we
4471 can actually complete it at all, as those checks will be done in
4472 pointer_int_sum() anyway. */
4473 complete_type (TREE_TYPE (res_type
));
4475 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4476 fold_if_not_in_template (intop
));
4479 /* Return a tree for the difference of pointers OP0 and OP1.
4480 The resulting tree has type int. */
4483 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4486 tree restype
= ptrdiff_type_node
;
4487 tree target_type
= TREE_TYPE (ptrtype
);
4489 if (!complete_type_or_else (target_type
, NULL_TREE
))
4490 return error_mark_node
;
4492 if (TREE_CODE (target_type
) == VOID_TYPE
)
4493 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4494 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4495 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4496 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4497 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4499 /* First do the subtraction as integers;
4500 then drop through to build the divide operator. */
4502 op0
= cp_build_binary_op (input_location
,
4504 cp_convert (restype
, op0
),
4505 cp_convert (restype
, op1
),
4506 tf_warning_or_error
);
4508 /* This generates an error if op1 is a pointer to an incomplete type. */
4509 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4510 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4512 op1
= (TYPE_PTROB_P (ptrtype
)
4513 ? size_in_bytes (target_type
)
4514 : integer_one_node
);
4516 /* Do the division. */
4518 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4519 return fold_if_not_in_template (result
);
4522 /* Construct and perhaps optimize a tree representation
4523 for a unary operation. CODE, a tree_code, specifies the operation
4524 and XARG is the operand. */
4527 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4529 tree orig_expr
= xarg
;
4533 if (processing_template_decl
)
4535 if (type_dependent_expression_p (xarg
))
4536 return build_min_nt (code
, xarg
, NULL_TREE
);
4538 xarg
= build_non_dependent_expr (xarg
);
4543 /* [expr.unary.op] says:
4545 The address of an object of incomplete type can be taken.
4547 (And is just the ordinary address operator, not an overloaded
4548 "operator &".) However, if the type is a template
4549 specialization, we must complete the type at this point so that
4550 an overloaded "operator &" will be available if required. */
4551 if (code
== ADDR_EXPR
4552 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4553 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4554 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4555 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4556 /* Don't look for a function. */;
4558 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4559 /*overloaded_p=*/NULL
, complain
);
4560 if (!exp
&& code
== ADDR_EXPR
)
4562 if (is_overloaded_fn (xarg
))
4564 tree fn
= get_first_fn (xarg
);
4565 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4567 error (DECL_CONSTRUCTOR_P (fn
)
4568 ? G_("taking address of constructor %qE")
4569 : G_("taking address of destructor %qE"),
4571 return error_mark_node
;
4575 /* A pointer to member-function can be formed only by saying
4577 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4578 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4580 if (TREE_CODE (xarg
) != OFFSET_REF
4581 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4583 error ("invalid use of %qE to form a pointer-to-member-function",
4585 if (TREE_CODE (xarg
) != OFFSET_REF
)
4586 inform (input_location
, " a qualified-id is required");
4587 return error_mark_node
;
4591 error ("parentheses around %qE cannot be used to form a"
4592 " pointer-to-member-function",
4594 PTRMEM_OK_P (xarg
) = 1;
4598 if (TREE_CODE (xarg
) == OFFSET_REF
)
4600 ptrmem
= PTRMEM_OK_P (xarg
);
4602 if (!ptrmem
&& !flag_ms_extensions
4603 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4605 /* A single non-static member, make sure we don't allow a
4606 pointer-to-member. */
4607 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4608 TREE_OPERAND (xarg
, 0),
4609 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4610 PTRMEM_OK_P (xarg
) = ptrmem
;
4614 exp
= cp_build_addr_expr_strict (xarg
, complain
);
4617 if (processing_template_decl
&& exp
!= error_mark_node
)
4618 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4619 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4620 if (TREE_CODE (exp
) == ADDR_EXPR
)
4621 PTRMEM_OK_P (exp
) = ptrmem
;
4625 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4626 constants, where a null value is represented by an INTEGER_CST of
4630 cp_truthvalue_conversion (tree expr
)
4632 tree type
= TREE_TYPE (expr
);
4633 if (TYPE_PTRMEM_P (type
))
4634 return build_binary_op (EXPR_LOCATION (expr
),
4635 NE_EXPR
, expr
, integer_zero_node
, 1);
4637 return c_common_truthvalue_conversion (input_location
, expr
);
4640 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4643 condition_conversion (tree expr
)
4646 if (processing_template_decl
)
4648 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4649 tf_warning_or_error
, LOOKUP_NORMAL
);
4650 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4654 /* Returns the address of T. This function will fold away
4655 ADDR_EXPR of INDIRECT_REF. */
4658 build_address (tree t
)
4660 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4661 return error_mark_node
;
4662 t
= build_fold_addr_expr (t
);
4663 if (TREE_CODE (t
) != ADDR_EXPR
)
4668 /* Returns the address of T with type TYPE. */
4671 build_typed_address (tree t
, tree type
)
4673 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4674 return error_mark_node
;
4675 t
= build_fold_addr_expr_with_type (t
, type
);
4676 if (TREE_CODE (t
) != ADDR_EXPR
)
4681 /* Return a NOP_EXPR converting EXPR to TYPE. */
4684 build_nop (tree type
, tree expr
)
4686 if (type
== error_mark_node
|| error_operand_p (expr
))
4688 return build1 (NOP_EXPR
, type
, expr
);
4691 /* Take the address of ARG, whatever that means under C++ semantics.
4692 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
4693 and class rvalues as well.
4695 Nothing should call this function directly; instead, callers should use
4696 cp_build_addr_expr or cp_build_addr_expr_strict. */
4699 cp_build_addr_expr_1 (tree arg
, bool strict_lvalue
, tsubst_flags_t complain
)
4704 if (!arg
|| error_operand_p (arg
))
4705 return error_mark_node
;
4707 arg
= mark_lvalue_use (arg
);
4708 argtype
= lvalue_type (arg
);
4710 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
4711 || !IDENTIFIER_OPNAME_P (arg
));
4713 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
4714 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
4716 /* They're trying to take the address of a unique non-static
4717 member function. This is ill-formed (except in MS-land),
4718 but let's try to DTRT.
4719 Note: We only handle unique functions here because we don't
4720 want to complain if there's a static overload; non-unique
4721 cases will be handled by instantiate_type. But we need to
4722 handle this case here to allow casts on the resulting PMF.
4723 We could defer this in non-MS mode, but it's easier to give
4724 a useful error here. */
4726 /* Inside constant member functions, the `this' pointer
4727 contains an extra const qualifier. TYPE_MAIN_VARIANT
4728 is used here to remove this const from the diagnostics
4729 and the created OFFSET_REF. */
4730 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
4731 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
4734 if (! flag_ms_extensions
)
4736 tree name
= DECL_NAME (fn
);
4737 if (!(complain
& tf_error
))
4738 return error_mark_node
;
4739 else if (current_class_type
4740 && TREE_OPERAND (arg
, 0) == current_class_ref
)
4741 /* An expression like &memfn. */
4742 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
4743 " or parenthesized non-static member function to form"
4744 " a pointer to member function. Say %<&%T::%D%>",
4747 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
4748 " function to form a pointer to member function."
4752 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
4755 /* Uninstantiated types are all functions. Taking the
4756 address of a function is a no-op, so just return the
4758 if (type_unknown_p (arg
))
4759 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4761 if (TREE_CODE (arg
) == OFFSET_REF
)
4762 /* We want a pointer to member; bypass all the code for actually taking
4763 the address of something. */
4766 /* Anything not already handled and not a true memory reference
4768 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4769 && TREE_CODE (argtype
) != METHOD_TYPE
)
4771 cp_lvalue_kind kind
= lvalue_kind (arg
);
4772 if (kind
== clk_none
)
4774 if (complain
& tf_error
)
4775 lvalue_error (input_location
, lv_addressof
);
4776 return error_mark_node
;
4778 if (strict_lvalue
&& (kind
& (clk_rvalueref
|clk_class
)))
4780 if (!(complain
& tf_error
))
4781 return error_mark_node
;
4782 if (kind
& clk_class
)
4783 /* Make this a permerror because we used to accept it. */
4784 permerror (input_location
, "taking address of temporary");
4786 error ("taking address of xvalue (rvalue reference)");
4790 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4792 tree type
= build_pointer_type (TREE_TYPE (argtype
));
4793 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4796 else if (pedantic
&& DECL_MAIN_P (arg
))
4799 /* Apparently a lot of autoconf scripts for C++ packages do this,
4800 so only complain if -pedantic. */
4801 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
4802 pedwarn (input_location
, OPT_pedantic
,
4803 "ISO C++ forbids taking address of function %<::main%>");
4804 else if (flag_pedantic_errors
)
4805 return error_mark_node
;
4808 /* Let &* cancel out to simplify resulting code. */
4809 if (TREE_CODE (arg
) == INDIRECT_REF
)
4811 /* We don't need to have `current_class_ptr' wrapped in a
4812 NON_LVALUE_EXPR node. */
4813 if (arg
== current_class_ref
)
4814 return current_class_ptr
;
4816 arg
= TREE_OPERAND (arg
, 0);
4817 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
4819 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
4820 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4823 /* Don't let this be an lvalue. */
4828 /* ??? Cope with user tricks that amount to offsetof. */
4829 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4830 && TREE_CODE (argtype
) != METHOD_TYPE
4831 && argtype
!= unknown_type_node
4832 && (val
= get_base_address (arg
))
4833 && COMPLETE_TYPE_P (TREE_TYPE (val
))
4834 && TREE_CODE (val
) == INDIRECT_REF
4835 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
4837 tree type
= build_pointer_type (argtype
);
4838 tree op0
= fold_convert (type
, TREE_OPERAND (val
, 0));
4839 tree op1
= fold_convert (sizetype
, fold_offsetof (arg
, val
));
4840 return fold_build2 (POINTER_PLUS_EXPR
, type
, op0
, op1
);
4843 /* Handle complex lvalues (when permitted)
4844 by reduction to simpler cases. */
4845 val
= unary_complex_lvalue (ADDR_EXPR
, arg
);
4849 switch (TREE_CODE (arg
))
4853 case FIX_TRUNC_EXPR
:
4854 /* Even if we're not being pedantic, we cannot allow this
4855 extension when we're instantiating in a SFINAE
4857 if (! lvalue_p (arg
) && complain
== tf_none
)
4859 if (complain
& tf_error
)
4860 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4862 return error_mark_node
;
4867 arg
= BASELINK_FUNCTIONS (arg
);
4871 arg
= OVL_CURRENT (arg
);
4876 /* Turn a reference to a non-static data member into a
4877 pointer-to-member. */
4882 gcc_assert (PTRMEM_OK_P (arg
));
4884 t
= TREE_OPERAND (arg
, 1);
4885 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
4887 if (complain
& tf_error
)
4888 error ("cannot create pointer to reference member %qD", t
);
4889 return error_mark_node
;
4892 type
= build_ptrmem_type (context_for_name_lookup (t
),
4894 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
4902 if (argtype
!= error_mark_node
)
4903 argtype
= build_pointer_type (argtype
);
4905 /* In a template, we are processing a non-dependent expression
4906 so we can just form an ADDR_EXPR with the correct type. */
4907 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
4909 val
= build_address (arg
);
4910 if (TREE_CODE (arg
) == OFFSET_REF
)
4911 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
4913 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
4915 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
4917 /* We can only get here with a single static member
4919 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4920 && DECL_STATIC_FUNCTION_P (fn
));
4922 val
= build_address (fn
);
4923 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
4924 /* Do not lose object's side effects. */
4925 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
4926 TREE_OPERAND (arg
, 0), val
);
4928 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
4930 if (complain
& tf_error
)
4931 error ("attempt to take address of bit-field structure member %qD",
4932 TREE_OPERAND (arg
, 1));
4933 return error_mark_node
;
4937 tree object
= TREE_OPERAND (arg
, 0);
4938 tree field
= TREE_OPERAND (arg
, 1);
4939 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4940 (TREE_TYPE (object
), decl_type_context (field
)));
4941 val
= build_address (arg
);
4944 if (TREE_CODE (argtype
) == POINTER_TYPE
4945 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
4947 build_ptrmemfunc_type (argtype
);
4948 val
= build_ptrmemfunc (argtype
, val
, 0,
4950 tf_warning_or_error
);
4956 /* Take the address of ARG if it has one, even if it's an rvalue. */
4959 cp_build_addr_expr (tree arg
, tsubst_flags_t complain
)
4961 return cp_build_addr_expr_1 (arg
, 0, complain
);
4964 /* Take the address of ARG, but only if it's an lvalue. */
4967 cp_build_addr_expr_strict (tree arg
, tsubst_flags_t complain
)
4969 return cp_build_addr_expr_1 (arg
, 1, complain
);
4972 /* C++: Must handle pointers to members.
4974 Perhaps type instantiation should be extended to handle conversion
4975 from aggregates to types we don't yet know we want? (Or are those
4976 cases typically errors which should be reported?)
4978 NOCONVERT nonzero suppresses the default promotions
4979 (such as from short to int). */
4982 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
4983 tsubst_flags_t complain
)
4985 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4988 const char *errstring
= NULL
;
4990 const char *invalid_op_diag
;
4992 if (!arg
|| error_operand_p (arg
))
4993 return error_mark_node
;
4995 if ((invalid_op_diag
4996 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
5001 error (invalid_op_diag
);
5002 return error_mark_node
;
5007 case UNARY_PLUS_EXPR
:
5010 int flags
= WANT_ARITH
| WANT_ENUM
;
5011 /* Unary plus (but not unary minus) is allowed on pointers. */
5012 if (code
== UNARY_PLUS_EXPR
)
5013 flags
|= WANT_POINTER
;
5014 arg
= build_expr_type_conversion (flags
, arg
, true);
5016 errstring
= (code
== NEGATE_EXPR
5017 ? _("wrong type argument to unary minus")
5018 : _("wrong type argument to unary plus"));
5021 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5022 arg
= perform_integral_promotions (arg
);
5024 /* Make sure the result is not an lvalue: a unary plus or minus
5025 expression is always a rvalue. */
5032 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5036 arg
= default_conversion (arg
);
5038 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
5039 | WANT_VECTOR_OR_COMPLEX
,
5041 errstring
= _("wrong type argument to bit-complement");
5042 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5043 arg
= perform_integral_promotions (arg
);
5047 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5048 errstring
= _("wrong type argument to abs");
5049 else if (!noconvert
)
5050 arg
= default_conversion (arg
);
5054 /* Conjugating a real value is a no-op, but allow it anyway. */
5055 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5056 errstring
= _("wrong type argument to conjugation");
5057 else if (!noconvert
)
5058 arg
= default_conversion (arg
);
5061 case TRUTH_NOT_EXPR
:
5062 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
5064 val
= invert_truthvalue_loc (input_location
, arg
);
5065 if (arg
!= error_mark_node
)
5067 errstring
= _("in argument to unary !");
5075 arg
= build_real_imag_expr (input_location
, code
, arg
);
5076 if (arg
== error_mark_node
)
5079 return fold_if_not_in_template (arg
);
5081 case PREINCREMENT_EXPR
:
5082 case POSTINCREMENT_EXPR
:
5083 case PREDECREMENT_EXPR
:
5084 case POSTDECREMENT_EXPR
:
5085 /* Handle complex lvalues (when permitted)
5086 by reduction to simpler cases. */
5088 val
= unary_complex_lvalue (code
, arg
);
5092 arg
= mark_lvalue_use (arg
);
5094 /* Increment or decrement the real part of the value,
5095 and don't change the imaginary part. */
5096 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5100 arg
= stabilize_reference (arg
);
5101 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
5102 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
5103 real
= cp_build_unary_op (code
, real
, 1, complain
);
5104 if (real
== error_mark_node
|| imag
== error_mark_node
)
5105 return error_mark_node
;
5106 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
5110 /* Report invalid types. */
5112 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
5115 if (code
== PREINCREMENT_EXPR
)
5116 errstring
= _("no pre-increment operator for type");
5117 else if (code
== POSTINCREMENT_EXPR
)
5118 errstring
= _("no post-increment operator for type");
5119 else if (code
== PREDECREMENT_EXPR
)
5120 errstring
= _("no pre-decrement operator for type");
5122 errstring
= _("no post-decrement operator for type");
5125 else if (arg
== error_mark_node
)
5126 return error_mark_node
;
5128 /* Report something read-only. */
5130 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
5131 || TREE_READONLY (arg
))
5133 if (complain
& tf_error
)
5134 cxx_readonly_error (arg
, ((code
== PREINCREMENT_EXPR
5135 || code
== POSTINCREMENT_EXPR
)
5136 ? lv_increment
: lv_decrement
));
5138 return error_mark_node
;
5143 tree declared_type
= unlowered_expr_type (arg
);
5145 argtype
= TREE_TYPE (arg
);
5147 /* ARM $5.2.5 last annotation says this should be forbidden. */
5148 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
5150 if (complain
& tf_error
)
5151 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
5152 ? G_("ISO C++ forbids incrementing an enum")
5153 : G_("ISO C++ forbids decrementing an enum"));
5155 return error_mark_node
;
5158 /* Compute the increment. */
5160 if (TREE_CODE (argtype
) == POINTER_TYPE
)
5162 tree type
= complete_type (TREE_TYPE (argtype
));
5164 if (!COMPLETE_OR_VOID_TYPE_P (type
))
5166 if (complain
& tf_error
)
5167 error (((code
== PREINCREMENT_EXPR
5168 || code
== POSTINCREMENT_EXPR
))
5169 ? G_("cannot increment a pointer to incomplete type %qT")
5170 : G_("cannot decrement a pointer to incomplete type %qT"),
5171 TREE_TYPE (argtype
));
5173 return error_mark_node
;
5175 else if ((pedantic
|| warn_pointer_arith
)
5176 && !TYPE_PTROB_P (argtype
))
5178 if (complain
& tf_error
)
5179 permerror (input_location
, (code
== PREINCREMENT_EXPR
5180 || code
== POSTINCREMENT_EXPR
)
5181 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
5182 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
5185 return error_mark_node
;
5188 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
5191 inc
= integer_one_node
;
5193 inc
= cp_convert (argtype
, inc
);
5195 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
5196 need to ask Objective-C to build the increment or decrement
5197 expression for it. */
5198 if (objc_is_property_ref (arg
))
5199 return objc_build_incr_expr_for_property_ref (input_location
, code
,
5202 /* Complain about anything else that is not a true lvalue. */
5203 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
5204 || code
== POSTINCREMENT_EXPR
)
5205 ? lv_increment
: lv_decrement
),
5207 return error_mark_node
;
5209 /* Forbid using -- on `bool'. */
5210 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
5212 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
5214 if (complain
& tf_error
)
5215 error ("invalid use of Boolean expression as operand "
5216 "to %<operator--%>");
5217 return error_mark_node
;
5219 val
= boolean_increment (code
, arg
);
5222 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
5224 TREE_SIDE_EFFECTS (val
) = 1;
5229 /* Note that this operation never does default_conversion
5230 regardless of NOCONVERT. */
5231 return cp_build_addr_expr (arg
, complain
);
5240 argtype
= TREE_TYPE (arg
);
5241 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5244 if (complain
& tf_error
)
5245 error ("%s", errstring
);
5246 return error_mark_node
;
5249 /* Hook for the c-common bits that build a unary op. */
5251 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5252 enum tree_code code
, tree xarg
, int noconvert
)
5254 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5257 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5258 for certain kinds of expressions which are not really lvalues
5259 but which we can accept as lvalues.
5261 If ARG is not a kind of expression we can handle, return
5265 unary_complex_lvalue (enum tree_code code
, tree arg
)
5267 /* Inside a template, making these kinds of adjustments is
5268 pointless; we are only concerned with the type of the
5270 if (processing_template_decl
)
5273 /* Handle (a, b) used as an "lvalue". */
5274 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5276 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5277 tf_warning_or_error
);
5278 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5279 TREE_OPERAND (arg
, 0), real_result
);
5282 /* Handle (a ? b : c) used as an "lvalue". */
5283 if (TREE_CODE (arg
) == COND_EXPR
5284 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5285 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5287 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5288 if (TREE_CODE (arg
) == MODIFY_EXPR
5289 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5290 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5292 tree lvalue
= TREE_OPERAND (arg
, 0);
5293 if (TREE_SIDE_EFFECTS (lvalue
))
5295 lvalue
= stabilize_reference (lvalue
);
5296 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5297 lvalue
, TREE_OPERAND (arg
, 1));
5299 return unary_complex_lvalue
5300 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5303 if (code
!= ADDR_EXPR
)
5306 /* Handle (a = b) used as an "lvalue" for `&'. */
5307 if (TREE_CODE (arg
) == MODIFY_EXPR
5308 || TREE_CODE (arg
) == INIT_EXPR
)
5310 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5311 tf_warning_or_error
);
5312 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5314 TREE_NO_WARNING (arg
) = 1;
5318 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5319 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5320 || TREE_CODE (arg
) == OFFSET_REF
)
5323 /* We permit compiler to make function calls returning
5324 objects of aggregate type look like lvalues. */
5328 if (TREE_CODE (targ
) == SAVE_EXPR
)
5329 targ
= TREE_OPERAND (targ
, 0);
5331 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5333 if (TREE_CODE (arg
) == SAVE_EXPR
)
5336 targ
= build_cplus_new (TREE_TYPE (arg
), arg
, tf_warning_or_error
);
5337 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5340 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5341 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5342 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5345 /* Don't let anything else be handled specially. */
5349 /* Mark EXP saying that we need to be able to take the
5350 address of it; it should not be allocated in a register.
5351 Value is true if successful.
5353 C++: we do not allow `current_class_ptr' to be addressable. */
5356 cxx_mark_addressable (tree exp
)
5361 switch (TREE_CODE (x
))
5368 x
= TREE_OPERAND (x
, 0);
5372 if (x
== current_class_ptr
)
5374 error ("cannot take the address of %<this%>, which is an rvalue expression");
5375 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5381 /* Caller should not be trying to mark initialized
5382 constant fields addressable. */
5383 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5384 || DECL_IN_AGGR_P (x
) == 0
5386 || DECL_EXTERNAL (x
));
5390 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5391 && !DECL_ARTIFICIAL (x
))
5393 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5396 ("address of explicit register variable %qD requested", x
);
5399 else if (extra_warnings
)
5401 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5403 TREE_ADDRESSABLE (x
) = 1;
5408 TREE_ADDRESSABLE (x
) = 1;
5412 TREE_ADDRESSABLE (x
) = 1;
5416 TREE_ADDRESSABLE (x
) = 1;
5417 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5425 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5428 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5429 tsubst_flags_t complain
)
5431 tree orig_ifexp
= ifexp
;
5432 tree orig_op1
= op1
;
5433 tree orig_op2
= op2
;
5436 if (processing_template_decl
)
5438 /* The standard says that the expression is type-dependent if
5439 IFEXP is type-dependent, even though the eventual type of the
5440 expression doesn't dependent on IFEXP. */
5441 if (type_dependent_expression_p (ifexp
)
5442 /* As a GNU extension, the middle operand may be omitted. */
5443 || (op1
&& type_dependent_expression_p (op1
))
5444 || type_dependent_expression_p (op2
))
5445 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5446 ifexp
= build_non_dependent_expr (ifexp
);
5448 op1
= build_non_dependent_expr (op1
);
5449 op2
= build_non_dependent_expr (op2
);
5452 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5453 if (processing_template_decl
&& expr
!= error_mark_node
)
5454 return build_min_non_dep (COND_EXPR
, expr
,
5455 orig_ifexp
, orig_op1
, orig_op2
);
5459 /* Given a list of expressions, return a compound expression
5460 that performs them all and returns the value of the last of them. */
5463 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
,
5464 tsubst_flags_t complain
)
5466 tree expr
= TREE_VALUE (list
);
5468 if (TREE_CHAIN (list
))
5470 if (complain
& tf_error
)
5474 permerror (input_location
, "expression list treated as compound "
5475 "expression in initializer");
5478 permerror (input_location
, "expression list treated as compound "
5479 "expression in mem-initializer");
5482 permerror (input_location
, "expression list treated as compound "
5483 "expression in functional cast");
5489 return error_mark_node
;
5491 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5492 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5499 /* Like build_x_compound_expr_from_list, but using a VEC. */
5502 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5504 if (VEC_empty (tree
, vec
))
5506 else if (VEC_length (tree
, vec
) == 1)
5507 return VEC_index (tree
, vec
, 0);
5515 permerror (input_location
,
5516 "%s expression list treated as compound expression",
5519 expr
= VEC_index (tree
, vec
, 0);
5520 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5521 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5527 /* Handle overloading of the ',' operator when needed. */
5530 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5533 tree orig_op1
= op1
;
5534 tree orig_op2
= op2
;
5536 if (processing_template_decl
)
5538 if (type_dependent_expression_p (op1
)
5539 || type_dependent_expression_p (op2
))
5540 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5541 op1
= build_non_dependent_expr (op1
);
5542 op2
= build_non_dependent_expr (op2
);
5545 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5546 /*overloaded_p=*/NULL
, complain
);
5548 result
= cp_build_compound_expr (op1
, op2
, complain
);
5550 if (processing_template_decl
&& result
!= error_mark_node
)
5551 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5556 /* Like cp_build_compound_expr, but for the c-common bits. */
5559 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5561 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5564 /* Build a compound expression. */
5567 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5569 lhs
= convert_to_void (lhs
, ICV_LEFT_OF_COMMA
, complain
);
5571 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5572 return error_mark_node
;
5574 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5576 /* If the rhs is a TARGET_EXPR, then build the compound
5577 expression inside the target_expr's initializer. This
5578 helps the compiler to eliminate unnecessary temporaries. */
5579 tree init
= TREE_OPERAND (rhs
, 1);
5581 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5582 TREE_OPERAND (rhs
, 1) = init
;
5587 if (type_unknown_p (rhs
))
5589 error ("no context to resolve type of %qE", rhs
);
5590 return error_mark_node
;
5593 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5596 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5597 casts away constness. CAST gives the type of cast. Returns true
5598 if the cast is ill-formed, false if it is well-formed.
5600 ??? This function warns for casting away any qualifier not just
5601 const. We would like to specify exactly what qualifiers are casted
5606 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5607 enum tree_code cast
, tsubst_flags_t complain
)
5609 /* C-style casts are allowed to cast away constness. With
5610 WARN_CAST_QUAL, we still want to issue a warning. */
5611 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5614 if (!casts_away_constness (src_type
, dest_type
))
5620 if (complain
& tf_warning
)
5621 warning (OPT_Wcast_qual
,
5622 "cast from type %qT to type %qT casts away qualifiers",
5623 src_type
, dest_type
);
5626 case STATIC_CAST_EXPR
:
5627 if (complain
& tf_error
)
5628 error ("static_cast from type %qT to type %qT casts away qualifiers",
5629 src_type
, dest_type
);
5632 case REINTERPRET_CAST_EXPR
:
5633 if (complain
& tf_error
)
5634 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5635 src_type
, dest_type
);
5643 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5644 (another pointer-to-member type in the same hierarchy) and return
5645 the converted expression. If ALLOW_INVERSE_P is permitted, a
5646 pointer-to-derived may be converted to pointer-to-base; otherwise,
5647 only the other direction is permitted. If C_CAST_P is true, this
5648 conversion is taking place as part of a C-style cast. */
5651 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5652 bool c_cast_p
, tsubst_flags_t complain
)
5654 if (TYPE_PTRMEM_P (type
))
5658 if (TREE_CODE (expr
) == PTRMEM_CST
)
5659 expr
= cplus_expand_constant (expr
);
5660 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5661 TYPE_PTRMEM_CLASS_TYPE (type
),
5663 c_cast_p
, complain
);
5664 if (delta
== error_mark_node
)
5665 return error_mark_node
;
5667 if (!integer_zerop (delta
))
5669 tree cond
, op1
, op2
;
5671 cond
= cp_build_binary_op (input_location
,
5674 build_int_cst (TREE_TYPE (expr
), -1),
5675 tf_warning_or_error
);
5676 op1
= build_nop (ptrdiff_type_node
, expr
);
5677 op2
= cp_build_binary_op (input_location
,
5678 PLUS_EXPR
, op1
, delta
,
5679 tf_warning_or_error
);
5681 expr
= fold_build3_loc (input_location
,
5682 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5686 return build_nop (type
, expr
);
5689 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5690 allow_inverse_p
, c_cast_p
, complain
);
5693 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5694 this static_cast is being attempted as one of the possible casts
5695 allowed by a C-style cast. (In that case, accessibility of base
5696 classes is not considered, and it is OK to cast away
5697 constness.) Return the result of the cast. *VALID_P is set to
5698 indicate whether or not the cast was valid. */
5701 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5702 bool *valid_p
, tsubst_flags_t complain
)
5707 /* Assume the cast is valid. */
5710 intype
= TREE_TYPE (expr
);
5712 /* Save casted types in the function's used types hash table. */
5713 used_types_insert (type
);
5715 /* [expr.static.cast]
5717 An lvalue of type "cv1 B", where B is a class type, can be cast
5718 to type "reference to cv2 D", where D is a class derived (clause
5719 _class.derived_) from B, if a valid standard conversion from
5720 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5721 same cv-qualification as, or greater cv-qualification than, cv1,
5722 and B is not a virtual base class of D. */
5723 /* We check this case before checking the validity of "TYPE t =
5724 EXPR;" below because for this case:
5727 struct D : public B { D(const B&); };
5729 void f() { static_cast<const D&>(b); }
5731 we want to avoid constructing a new D. The standard is not
5732 completely clear about this issue, but our interpretation is
5733 consistent with other compilers. */
5734 if (TREE_CODE (type
) == REFERENCE_TYPE
5735 && CLASS_TYPE_P (TREE_TYPE (type
))
5736 && CLASS_TYPE_P (intype
)
5737 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5738 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5739 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5740 build_pointer_type (TYPE_MAIN_VARIANT
5741 (TREE_TYPE (type
))))
5743 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5747 /* There is a standard conversion from "D*" to "B*" even if "B"
5748 is ambiguous or inaccessible. If this is really a
5749 static_cast, then we check both for inaccessibility and
5750 ambiguity. However, if this is a static_cast being performed
5751 because the user wrote a C-style cast, then accessibility is
5753 base
= lookup_base (TREE_TYPE (type
), intype
,
5754 c_cast_p
? ba_unique
: ba_check
,
5757 /* Convert from "B*" to "D*". This function will check that "B"
5758 is not a virtual base of "D". */
5759 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5760 base
, /*nonnull=*/false);
5761 /* Convert the pointer to a reference -- but then remember that
5762 there are no expressions with reference type in C++.
5764 We call rvalue so that there's an actual tree code
5765 (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
5766 is a variable with the same type, the conversion would get folded
5767 away, leaving just the variable and causing lvalue_kind to give
5768 the wrong answer. */
5769 return convert_from_reference (rvalue (cp_fold_convert (type
, expr
)));
5772 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5773 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5774 if (TREE_CODE (type
) == REFERENCE_TYPE
5775 && TYPE_REF_IS_RVALUE (type
)
5776 && real_lvalue_p (expr
)
5777 && reference_related_p (TREE_TYPE (type
), intype
)
5778 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5780 expr
= build_typed_address (expr
, type
);
5781 return convert_from_reference (expr
);
5784 /* Resolve overloaded address here rather than once in
5785 implicit_conversion and again in the inverse code below. */
5786 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5788 expr
= instantiate_type (type
, expr
, complain
);
5789 intype
= TREE_TYPE (expr
);
5792 /* [expr.static.cast]
5794 An expression e can be explicitly converted to a type T using a
5795 static_cast of the form static_cast<T>(e) if the declaration T
5796 t(e);" is well-formed, for some invented temporary variable
5798 result
= perform_direct_initialization_if_possible (type
, expr
,
5799 c_cast_p
, complain
);
5802 result
= convert_from_reference (result
);
5804 /* [expr.static.cast]
5806 If T is a reference type, the result is an lvalue; otherwise,
5807 the result is an rvalue. */
5808 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5809 result
= rvalue (result
);
5813 /* [expr.static.cast]
5815 Any expression can be explicitly converted to type cv void. */
5816 if (TREE_CODE (type
) == VOID_TYPE
)
5817 return convert_to_void (expr
, ICV_CAST
, complain
);
5819 /* [expr.static.cast]
5821 The inverse of any standard conversion sequence (clause _conv_),
5822 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5823 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5824 (_conv.bool_) conversions, can be performed explicitly using
5825 static_cast subject to the restriction that the explicit
5826 conversion does not cast away constness (_expr.const.cast_), and
5827 the following additional rules for specific cases: */
5828 /* For reference, the conversions not excluded are: integral
5829 promotions, floating point promotion, integral conversions,
5830 floating point conversions, floating-integral conversions,
5831 pointer conversions, and pointer to member conversions. */
5834 A value of integral _or enumeration_ type can be explicitly
5835 converted to an enumeration type. */
5836 /* The effect of all that is that any conversion between any two
5837 types which are integral, floating, or enumeration types can be
5839 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5840 || SCALAR_FLOAT_TYPE_P (type
))
5841 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5842 || SCALAR_FLOAT_TYPE_P (intype
)))
5843 return ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5845 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5846 && CLASS_TYPE_P (TREE_TYPE (type
))
5847 && CLASS_TYPE_P (TREE_TYPE (intype
))
5848 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5849 (TREE_TYPE (intype
))),
5850 build_pointer_type (TYPE_MAIN_VARIANT
5851 (TREE_TYPE (type
)))))
5856 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
5858 return error_mark_node
;
5859 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
5860 c_cast_p
? ba_unique
: ba_check
,
5862 expr
= build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
5863 return cp_fold_convert(type
, expr
);
5866 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5867 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5874 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
5875 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
5877 if (TYPE_PTRMEM_P (type
))
5879 t1
= (build_ptrmem_type
5881 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
5882 t2
= (build_ptrmem_type
5884 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
5891 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
5894 && check_for_casting_away_constness (intype
, type
,
5897 return error_mark_node
;
5898 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
5899 c_cast_p
, complain
);
5903 /* [expr.static.cast]
5905 An rvalue of type "pointer to cv void" can be explicitly
5906 converted to a pointer to object type. A value of type pointer
5907 to object converted to "pointer to cv void" and back to the
5908 original pointer type will have its original value. */
5909 if (TREE_CODE (intype
) == POINTER_TYPE
5910 && VOID_TYPE_P (TREE_TYPE (intype
))
5911 && TYPE_PTROB_P (type
))
5914 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
5916 return error_mark_node
;
5917 return build_nop (type
, expr
);
5921 return error_mark_node
;
5924 /* Return an expression representing static_cast<TYPE>(EXPR). */
5927 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5932 if (type
== error_mark_node
|| expr
== error_mark_node
)
5933 return error_mark_node
;
5935 if (processing_template_decl
)
5937 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
5938 /* We don't know if it will or will not have side effects. */
5939 TREE_SIDE_EFFECTS (expr
) = 1;
5940 return convert_from_reference (expr
);
5943 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5944 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5945 if (TREE_CODE (type
) != REFERENCE_TYPE
5946 && TREE_CODE (expr
) == NOP_EXPR
5947 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5948 expr
= TREE_OPERAND (expr
, 0);
5950 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
5955 if (complain
& tf_error
)
5956 error ("invalid static_cast from type %qT to type %qT",
5957 TREE_TYPE (expr
), type
);
5958 return error_mark_node
;
5961 /* EXPR is an expression with member function or pointer-to-member
5962 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5963 not permitted by ISO C++, but we accept it in some modes. If we
5964 are not in one of those modes, issue a diagnostic. Return the
5965 converted expression. */
5968 convert_member_func_to_ptr (tree type
, tree expr
)
5973 intype
= TREE_TYPE (expr
);
5974 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
5975 || TREE_CODE (intype
) == METHOD_TYPE
);
5977 if (pedantic
|| warn_pmf2ptr
)
5978 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
5979 "converting from %qT to %qT", intype
, type
);
5981 if (TREE_CODE (intype
) == METHOD_TYPE
)
5982 expr
= build_addr_func (expr
);
5983 else if (TREE_CODE (expr
) == PTRMEM_CST
)
5984 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
5987 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
5988 decl
= build_address (decl
);
5989 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
5992 return build_nop (type
, expr
);
5995 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
5996 If C_CAST_P is true, this reinterpret cast is being done as part of
5997 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
5998 indicate whether or not reinterpret_cast was valid. */
6001 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6002 bool *valid_p
, tsubst_flags_t complain
)
6006 /* Assume the cast is invalid. */
6010 if (type
== error_mark_node
|| error_operand_p (expr
))
6011 return error_mark_node
;
6013 intype
= TREE_TYPE (expr
);
6015 /* Save casted types in the function's used types hash table. */
6016 used_types_insert (type
);
6018 /* [expr.reinterpret.cast]
6019 An lvalue expression of type T1 can be cast to the type
6020 "reference to T2" if an expression of type "pointer to T1" can be
6021 explicitly converted to the type "pointer to T2" using a
6022 reinterpret_cast. */
6023 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6025 if (! real_lvalue_p (expr
))
6027 if (complain
& tf_error
)
6028 error ("invalid cast of an rvalue expression of type "
6031 return error_mark_node
;
6034 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6035 "B" are related class types; the reinterpret_cast does not
6036 adjust the pointer. */
6037 if (TYPE_PTR_P (intype
)
6038 && (complain
& tf_warning
)
6039 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
6040 COMPARE_BASE
| COMPARE_DERIVED
)))
6041 warning (0, "casting %qT to %qT does not dereference pointer",
6044 expr
= cp_build_addr_expr (expr
, complain
);
6046 if (warn_strict_aliasing
> 2)
6047 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
6049 if (expr
!= error_mark_node
)
6050 expr
= build_reinterpret_cast_1
6051 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
6053 if (expr
!= error_mark_node
)
6054 /* cp_build_indirect_ref isn't right for rvalue refs. */
6055 expr
= convert_from_reference (fold_convert (type
, expr
));
6059 /* As a G++ extension, we consider conversions from member
6060 functions, and pointers to member functions to
6061 pointer-to-function and pointer-to-void types. If
6062 -Wno-pmf-conversions has not been specified,
6063 convert_member_func_to_ptr will issue an error message. */
6064 if ((TYPE_PTRMEMFUNC_P (intype
)
6065 || TREE_CODE (intype
) == METHOD_TYPE
)
6066 && TYPE_PTR_P (type
)
6067 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6068 || VOID_TYPE_P (TREE_TYPE (type
))))
6069 return convert_member_func_to_ptr (type
, expr
);
6071 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6072 array-to-pointer, and function-to-pointer conversions are
6074 expr
= decay_conversion (expr
);
6076 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6077 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6078 if (TREE_CODE (expr
) == NOP_EXPR
6079 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6080 expr
= TREE_OPERAND (expr
, 0);
6082 if (error_operand_p (expr
))
6083 return error_mark_node
;
6085 intype
= TREE_TYPE (expr
);
6087 /* [expr.reinterpret.cast]
6088 A pointer can be converted to any integral type large enough to
6089 hold it. ... A value of type std::nullptr_t can be converted to
6090 an integral type; the conversion has the same meaning and
6091 validity as a conversion of (void*)0 to the integral type. */
6092 if (CP_INTEGRAL_TYPE_P (type
)
6093 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
6095 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
6097 if (complain
& tf_error
)
6098 permerror (input_location
, "cast from %qT to %qT loses precision",
6101 return error_mark_node
;
6103 if (NULLPTR_TYPE_P (intype
))
6104 return build_int_cst (type
, 0);
6106 /* [expr.reinterpret.cast]
6107 A value of integral or enumeration type can be explicitly
6108 converted to a pointer. */
6109 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6112 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6113 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6114 return fold_if_not_in_template (build_nop (type
, expr
));
6115 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6116 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6121 && check_for_casting_away_constness (intype
, type
,
6122 REINTERPRET_CAST_EXPR
,
6124 return error_mark_node
;
6125 /* Warn about possible alignment problems. */
6126 if (STRICT_ALIGNMENT
&& warn_cast_align
6127 && (complain
& tf_warning
)
6128 && !VOID_TYPE_P (type
)
6129 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6130 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6131 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6132 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6133 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6134 "increases required alignment of target type", intype
, type
);
6136 /* We need to strip nops here, because the front end likes to
6137 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6139 if (warn_strict_aliasing
<= 2)
6140 strict_aliasing_warning (intype
, type
, sexpr
);
6142 return fold_if_not_in_template (build_nop (type
, expr
));
6144 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6145 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6147 if (pedantic
&& (complain
& tf_warning
))
6148 /* Only issue a warning, as we have always supported this
6149 where possible, and it is necessary in some cases. DR 195
6150 addresses this issue, but as of 2004/10/26 is still in
6152 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6153 return fold_if_not_in_template (build_nop (type
, expr
));
6155 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6156 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6157 else if (TREE_CODE (intype
) == VECTOR_TYPE
6158 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6159 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6164 if (complain
& tf_error
)
6165 error ("invalid cast from type %qT to type %qT", intype
, type
);
6166 return error_mark_node
;
6169 return cp_convert (type
, expr
);
6173 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6175 if (type
== error_mark_node
|| expr
== error_mark_node
)
6176 return error_mark_node
;
6178 if (processing_template_decl
)
6180 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6182 if (!TREE_SIDE_EFFECTS (t
)
6183 && type_dependent_expression_p (expr
))
6184 /* There might turn out to be side effects inside expr. */
6185 TREE_SIDE_EFFECTS (t
) = 1;
6186 return convert_from_reference (t
);
6189 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6190 /*valid_p=*/NULL
, complain
);
6193 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6194 return an appropriate expression. Otherwise, return
6195 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6196 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6197 performing a C-style cast, its value upon return will indicate
6198 whether or not the conversion succeeded. */
6201 build_const_cast_1 (tree dst_type
, tree expr
, tsubst_flags_t complain
,
6205 tree reference_type
;
6207 /* Callers are responsible for handling error_mark_node as a
6208 destination type. */
6209 gcc_assert (dst_type
!= error_mark_node
);
6210 /* In a template, callers should be building syntactic
6211 representations of casts, not using this machinery. */
6212 gcc_assert (!processing_template_decl
);
6214 /* Assume the conversion is invalid. */
6218 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6220 if (complain
& tf_error
)
6221 error ("invalid use of const_cast with type %qT, "
6222 "which is not a pointer, "
6223 "reference, nor a pointer-to-data-member type", dst_type
);
6224 return error_mark_node
;
6227 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6229 if (complain
& tf_error
)
6230 error ("invalid use of const_cast with type %qT, which is a pointer "
6231 "or reference to a function type", dst_type
);
6232 return error_mark_node
;
6235 /* Save casted types in the function's used types hash table. */
6236 used_types_insert (dst_type
);
6238 src_type
= TREE_TYPE (expr
);
6239 /* Expressions do not really have reference types. */
6240 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6241 src_type
= TREE_TYPE (src_type
);
6243 /* [expr.const.cast]
6245 An lvalue of type T1 can be explicitly converted to an lvalue of
6246 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6247 types) if a pointer to T1 can be explicitly converted to the type
6248 pointer to T2 using a const_cast. */
6249 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6251 reference_type
= dst_type
;
6252 if (! real_lvalue_p (expr
))
6254 if (complain
& tf_error
)
6255 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6256 src_type
, dst_type
);
6257 return error_mark_node
;
6259 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6260 src_type
= build_pointer_type (src_type
);
6264 reference_type
= NULL_TREE
;
6265 /* If the destination type is not a reference type, the
6266 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6267 conversions are performed. */
6268 src_type
= type_decays_to (src_type
);
6269 if (src_type
== error_mark_node
)
6270 return error_mark_node
;
6273 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6274 && comp_ptr_ttypes_const (dst_type
, src_type
))
6279 /* This cast is actually a C-style cast. Issue a warning if
6280 the user is making a potentially unsafe cast. */
6281 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
,
6286 expr
= cp_build_addr_expr (expr
, complain
);
6287 expr
= build_nop (reference_type
, expr
);
6288 return convert_from_reference (expr
);
6292 expr
= decay_conversion (expr
);
6293 /* build_c_cast puts on a NOP_EXPR to make the result not an
6294 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6295 non-lvalue context. */
6296 if (TREE_CODE (expr
) == NOP_EXPR
6297 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6298 expr
= TREE_OPERAND (expr
, 0);
6299 return build_nop (dst_type
, expr
);
6303 if (complain
& tf_error
)
6304 error ("invalid const_cast from type %qT to type %qT",
6305 src_type
, dst_type
);
6306 return error_mark_node
;
6310 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6312 if (type
== error_mark_node
|| error_operand_p (expr
))
6313 return error_mark_node
;
6315 if (processing_template_decl
)
6317 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6319 if (!TREE_SIDE_EFFECTS (t
)
6320 && type_dependent_expression_p (expr
))
6321 /* There might turn out to be side effects inside expr. */
6322 TREE_SIDE_EFFECTS (t
) = 1;
6323 return convert_from_reference (t
);
6326 return build_const_cast_1 (type
, expr
, complain
,
6330 /* Like cp_build_c_cast, but for the c-common bits. */
6333 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6335 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6338 /* Build an expression representing an explicit C-style cast to type
6339 TYPE of expression EXPR. */
6342 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6348 if (type
== error_mark_node
|| error_operand_p (expr
))
6349 return error_mark_node
;
6351 if (processing_template_decl
)
6353 tree t
= build_min (CAST_EXPR
, type
,
6354 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6355 /* We don't know if it will or will not have side effects. */
6356 TREE_SIDE_EFFECTS (t
) = 1;
6357 return convert_from_reference (t
);
6360 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6361 'Class') should always be retained, because this information aids
6362 in method lookup. */
6363 if (objc_is_object_ptr (type
)
6364 && objc_is_object_ptr (TREE_TYPE (expr
)))
6365 return build_nop (type
, expr
);
6367 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6368 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6369 if (TREE_CODE (type
) != REFERENCE_TYPE
6370 && TREE_CODE (value
) == NOP_EXPR
6371 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6372 value
= TREE_OPERAND (value
, 0);
6374 if (TREE_CODE (type
) == ARRAY_TYPE
)
6376 /* Allow casting from T1* to T2[] because Cfront allows it.
6377 NIHCL uses it. It is not valid ISO C++ however. */
6378 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6380 if (complain
& tf_error
)
6381 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6383 return error_mark_node
;
6384 type
= build_pointer_type (TREE_TYPE (type
));
6388 if (complain
& tf_error
)
6389 error ("ISO C++ forbids casting to an array type %qT", type
);
6390 return error_mark_node
;
6394 if (TREE_CODE (type
) == FUNCTION_TYPE
6395 || TREE_CODE (type
) == METHOD_TYPE
)
6397 if (complain
& tf_error
)
6398 error ("invalid cast to function type %qT", type
);
6399 return error_mark_node
;
6402 if (TREE_CODE (type
) == POINTER_TYPE
6403 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
6404 /* Casting to an integer of smaller size is an error detected elsewhere. */
6405 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
6406 /* Don't warn about converting any constant. */
6407 && !TREE_CONSTANT (value
))
6408 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
6409 "cast to pointer from integer of different size");
6411 /* A C-style cast can be a const_cast. */
6412 result
= build_const_cast_1 (type
, value
, complain
& tf_warning
,
6417 /* Or a static cast. */
6418 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6419 &valid_p
, complain
);
6420 /* Or a reinterpret_cast. */
6422 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6423 &valid_p
, complain
);
6424 /* The static_cast or reinterpret_cast may be followed by a
6427 /* A valid cast may result in errors if, for example, a
6428 conversion to am ambiguous base class is required. */
6429 && !error_operand_p (result
))
6433 /* Non-class rvalues always have cv-unqualified type. */
6434 if (!CLASS_TYPE_P (type
))
6435 type
= TYPE_MAIN_VARIANT (type
);
6436 result_type
= TREE_TYPE (result
);
6437 if (!CLASS_TYPE_P (result_type
))
6438 result_type
= TYPE_MAIN_VARIANT (result_type
);
6439 /* If the type of RESULT does not match TYPE, perform a
6440 const_cast to make it match. If the static_cast or
6441 reinterpret_cast succeeded, we will differ by at most
6442 cv-qualification, so the follow-on const_cast is guaranteed
6444 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6446 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6447 gcc_assert (valid_p
);
6452 return error_mark_node
;
6455 /* For use from the C common bits. */
6457 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6458 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6459 enum tree_code modifycode
,
6460 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6461 tree rhs_origtype ATTRIBUTE_UNUSED
)
6463 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6466 /* Build an assignment expression of lvalue LHS from value RHS.
6467 MODIFYCODE is the code for a binary operator that we use
6468 to combine the old value of LHS with RHS to get the new value.
6469 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6471 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6474 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6475 tsubst_flags_t complain
)
6479 tree lhstype
= TREE_TYPE (lhs
);
6480 tree olhstype
= lhstype
;
6481 bool plain_assign
= (modifycode
== NOP_EXPR
);
6483 /* Avoid duplicate error messages from operands that had errors. */
6484 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6485 return error_mark_node
;
6487 /* Handle control structure constructs used as "lvalues". */
6488 switch (TREE_CODE (lhs
))
6490 /* Handle --foo = 5; as these are valid constructs in C++. */
6491 case PREDECREMENT_EXPR
:
6492 case PREINCREMENT_EXPR
:
6493 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6494 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6495 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6496 TREE_OPERAND (lhs
, 1));
6497 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6498 modifycode
, rhs
, complain
);
6499 if (newrhs
== error_mark_node
)
6500 return error_mark_node
;
6501 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6503 /* Handle (a, b) used as an "lvalue". */
6505 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6506 modifycode
, rhs
, complain
);
6507 if (newrhs
== error_mark_node
)
6508 return error_mark_node
;
6509 return build2 (COMPOUND_EXPR
, lhstype
,
6510 TREE_OPERAND (lhs
, 0), newrhs
);
6513 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6514 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6515 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6516 TREE_OPERAND (lhs
, 1));
6517 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6519 if (newrhs
== error_mark_node
)
6520 return error_mark_node
;
6521 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6525 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6526 when neither operand has side-effects. */
6527 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6528 return error_mark_node
;
6530 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6531 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6533 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6534 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6536 TREE_OPERAND (lhs
, 0),
6537 TREE_OPERAND (lhs
, 1)),
6538 TREE_OPERAND (lhs
, 0),
6539 TREE_OPERAND (lhs
, 1));
6542 /* Handle (a ? b : c) used as an "lvalue". */
6545 /* Produce (a ? (b = rhs) : (c = rhs))
6546 except that the RHS goes through a save-expr
6547 so the code to compute it is only emitted once. */
6549 tree preeval
= NULL_TREE
;
6551 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6553 if (complain
& tf_error
)
6554 error ("void value not ignored as it ought to be");
6555 return error_mark_node
;
6558 rhs
= stabilize_expr (rhs
, &preeval
);
6560 /* Check this here to avoid odd errors when trying to convert
6561 a throw to the type of the COND_EXPR. */
6562 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6563 return error_mark_node
;
6565 cond
= build_conditional_expr
6566 (TREE_OPERAND (lhs
, 0),
6567 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6568 modifycode
, rhs
, complain
),
6569 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6570 modifycode
, rhs
, complain
),
6573 if (cond
== error_mark_node
)
6575 /* Make sure the code to compute the rhs comes out
6576 before the split. */
6578 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6586 if (modifycode
== INIT_EXPR
)
6588 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6589 /* Do the default thing. */;
6590 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6592 /* Compound literal. */
6593 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6594 /* Call convert to generate an error; see PR 11063. */
6595 rhs
= convert (lhstype
, rhs
);
6596 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6597 TREE_SIDE_EFFECTS (result
) = 1;
6600 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6601 /* Do the default thing. */;
6604 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6605 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6606 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6608 release_tree_vector (rhs_vec
);
6609 if (result
== NULL_TREE
)
6610 return error_mark_node
;
6616 lhs
= require_complete_type_sfinae (lhs
, complain
);
6617 if (lhs
== error_mark_node
)
6618 return error_mark_node
;
6620 if (modifycode
== NOP_EXPR
)
6622 if (c_dialect_objc ())
6624 result
= objc_maybe_build_modify_expr (lhs
, rhs
);
6629 /* `operator=' is not an inheritable operator. */
6630 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6631 /* Do the default thing. */;
6634 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6635 lhs
, rhs
, make_node (NOP_EXPR
),
6636 /*overloaded_p=*/NULL
,
6638 if (result
== NULL_TREE
)
6639 return error_mark_node
;
6646 /* A binary op has been requested. Combine the old LHS
6647 value with the RHS producing the value we should actually
6648 store into the LHS. */
6649 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6650 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6651 || MAYBE_CLASS_TYPE_P (lhstype
)));
6653 lhs
= stabilize_reference (lhs
);
6654 newrhs
= cp_build_binary_op (input_location
,
6655 modifycode
, lhs
, rhs
,
6657 if (newrhs
== error_mark_node
)
6659 if (complain
& tf_error
)
6660 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6661 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6662 return error_mark_node
;
6665 /* Now it looks like a plain assignment. */
6666 modifycode
= NOP_EXPR
;
6667 if (c_dialect_objc ())
6669 result
= objc_maybe_build_modify_expr (lhs
, newrhs
);
6674 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6675 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6678 /* The left-hand side must be an lvalue. */
6679 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6680 return error_mark_node
;
6682 /* Warn about modifying something that is `const'. Don't warn if
6683 this is initialization. */
6684 if (modifycode
!= INIT_EXPR
6685 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6686 /* Functions are not modifiable, even though they are
6688 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6689 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6690 /* If it's an aggregate and any field is const, then it is
6691 effectively const. */
6692 || (CLASS_TYPE_P (lhstype
)
6693 && C_TYPE_FIELDS_READONLY (lhstype
))))
6695 if (complain
& tf_error
)
6696 cxx_readonly_error (lhs
, lv_assign
);
6698 return error_mark_node
;
6701 /* If storing into a structure or union member, it may have been given a
6702 lowered bitfield type. We need to convert to the declared type first,
6703 so retrieve it now. */
6705 olhstype
= unlowered_expr_type (lhs
);
6707 /* Convert new value to destination type. */
6709 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6713 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6715 if (modifycode
!= INIT_EXPR
)
6717 if (complain
& tf_error
)
6718 error ("assigning to an array from an initializer list");
6719 return error_mark_node
;
6721 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6722 return error_mark_node
;
6723 newrhs
= digest_init (lhstype
, newrhs
, complain
);
6726 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6727 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6729 if (complain
& tf_error
)
6730 error ("incompatible types in assignment of %qT to %qT",
6731 TREE_TYPE (rhs
), lhstype
);
6732 return error_mark_node
;
6735 /* Allow array assignment in compiler-generated code. */
6736 else if (!current_function_decl
6737 || !DECL_ARTIFICIAL (current_function_decl
))
6739 /* This routine is used for both initialization and assignment.
6740 Make sure the diagnostic message differentiates the context. */
6741 if (complain
& tf_error
)
6743 if (modifycode
== INIT_EXPR
)
6744 error ("array used as initializer");
6746 error ("invalid array assignment");
6748 return error_mark_node
;
6751 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6752 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6753 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6754 /*explicit_value_init_p=*/false,
6755 from_array
, complain
);
6758 if (modifycode
== INIT_EXPR
)
6759 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6760 LOOKUP_ONLYCONVERTING. */
6761 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6762 ICR_INIT
, NULL_TREE
, 0,
6765 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
6766 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6768 if (!same_type_p (lhstype
, olhstype
))
6769 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6771 if (modifycode
!= INIT_EXPR
)
6773 if (TREE_CODE (newrhs
) == CALL_EXPR
6774 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6775 newrhs
= build_cplus_new (lhstype
, newrhs
, complain
);
6777 /* Can't initialize directly from a TARGET_EXPR, since that would
6778 cause the lhs to be constructed twice, and possibly result in
6779 accidental self-initialization. So we force the TARGET_EXPR to be
6780 expanded without a target. */
6781 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6782 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6783 TREE_OPERAND (newrhs
, 0));
6786 if (newrhs
== error_mark_node
)
6787 return error_mark_node
;
6789 if (c_dialect_objc () && flag_objc_gc
)
6791 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6797 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6798 lhstype
, lhs
, newrhs
);
6800 TREE_SIDE_EFFECTS (result
) = 1;
6802 TREE_NO_WARNING (result
) = 1;
6808 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6809 tsubst_flags_t complain
)
6811 if (processing_template_decl
)
6812 return build_min_nt (MODOP_EXPR
, lhs
,
6813 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6815 if (modifycode
!= NOP_EXPR
)
6817 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6818 make_node (modifycode
),
6819 /*overloaded_p=*/NULL
,
6823 TREE_NO_WARNING (rval
) = 1;
6827 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6830 /* Helper function for get_delta_difference which assumes FROM is a base
6831 class of TO. Returns a delta for the conversion of pointer-to-member
6832 of FROM to pointer-to-member of TO. If the conversion is invalid and
6833 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
6834 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6835 If C_CAST_P is true, this conversion is taking place as part of a
6839 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
,
6840 tsubst_flags_t complain
)
6844 base_access access
= c_cast_p
? ba_unique
: ba_check
;
6846 /* Note: ba_quiet does not distinguish between access control and
6848 if (!(complain
& tf_error
))
6851 binfo
= lookup_base (to
, from
, access
, &kind
);
6853 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6855 if (!(complain
& tf_error
))
6856 return error_mark_node
;
6858 error (" in pointer to member function conversion");
6859 return size_zero_node
;
6863 if (kind
!= bk_via_virtual
)
6864 return BINFO_OFFSET (binfo
);
6866 /* FROM is a virtual base class of TO. Issue an error or warning
6867 depending on whether or not this is a reinterpret cast. */
6869 if (!(complain
& tf_error
))
6870 return error_mark_node
;
6872 error ("pointer to member conversion via virtual base %qT",
6873 BINFO_TYPE (binfo_from_vbase (binfo
)));
6875 return size_zero_node
;
6882 /* Get difference in deltas for different pointer to member function
6883 types. If the conversion is invalid and tf_error is not set in
6884 COMPLAIN, returns error_mark_node, otherwise returns an integer
6885 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
6886 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
6887 conversions as well. If C_CAST_P is true this conversion is taking
6888 place as part of a C-style cast.
6890 Note that the naming of FROM and TO is kind of backwards; the return
6891 value is what we add to a TO in order to get a FROM. They are named
6892 this way because we call this function to find out how to convert from
6893 a pointer to member of FROM to a pointer to member of TO. */
6896 get_delta_difference (tree from
, tree to
,
6897 bool allow_inverse_p
,
6898 bool c_cast_p
, tsubst_flags_t complain
)
6902 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
6903 /* Pointer to member of incomplete class is permitted*/
6904 result
= size_zero_node
;
6906 result
= get_delta_difference_1 (from
, to
, c_cast_p
, complain
);
6908 if (result
== error_mark_node
)
6909 return error_mark_node
;
6913 if (!allow_inverse_p
)
6915 if (!(complain
& tf_error
))
6916 return error_mark_node
;
6918 error_not_base_type (from
, to
);
6919 error (" in pointer to member conversion");
6920 result
= size_zero_node
;
6924 result
= get_delta_difference_1 (to
, from
, c_cast_p
, complain
);
6926 if (result
== error_mark_node
)
6927 return error_mark_node
;
6930 result
= size_diffop_loc (input_location
,
6931 size_zero_node
, result
);
6934 if (!(complain
& tf_error
))
6935 return error_mark_node
;
6937 error_not_base_type (from
, to
);
6938 error (" in pointer to member conversion");
6939 result
= size_zero_node
;
6944 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
6948 /* Return a constructor for the pointer-to-member-function TYPE using
6949 the other components as specified. */
6952 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
6957 VEC(constructor_elt
, gc
) *v
;
6959 /* Pull the FIELD_DECLs out of the type. */
6960 pfn_field
= TYPE_FIELDS (type
);
6961 delta_field
= DECL_CHAIN (pfn_field
);
6963 /* Make sure DELTA has the type we want. */
6964 delta
= convert_and_check (delta_type_node
, delta
);
6966 /* Convert to the correct target type if necessary. */
6967 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
6969 /* Finish creating the initializer. */
6970 v
= VEC_alloc(constructor_elt
, gc
, 2);
6971 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
6972 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
6973 u
= build_constructor (type
, v
);
6974 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
6975 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
6976 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
6978 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
6983 /* Build a constructor for a pointer to member function. It can be
6984 used to initialize global variables, local variable, or used
6985 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6988 If FORCE is nonzero, then force this conversion, even if
6989 we would rather not do it. Usually set when using an explicit
6990 cast. A C-style cast is being processed iff C_CAST_P is true.
6992 Return error_mark_node, if something goes wrong. */
6995 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
,
6996 tsubst_flags_t complain
)
7002 if (error_operand_p (pfn
))
7003 return error_mark_node
;
7005 pfn_type
= TREE_TYPE (pfn
);
7006 to_type
= build_ptrmemfunc_type (type
);
7008 /* Handle multiple conversions of pointer to member functions. */
7009 if (TYPE_PTRMEMFUNC_P (pfn_type
))
7011 tree delta
= NULL_TREE
;
7012 tree npfn
= NULL_TREE
;
7016 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
7017 error ("invalid conversion to type %qT from type %qT",
7020 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
7021 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
7023 c_cast_p
, complain
);
7024 if (n
== error_mark_node
)
7025 return error_mark_node
;
7027 /* We don't have to do any conversion to convert a
7028 pointer-to-member to its own type. But, we don't want to
7029 just return a PTRMEM_CST if there's an explicit cast; that
7030 cast should make the expression an invalid template argument. */
7031 if (TREE_CODE (pfn
) != PTRMEM_CST
)
7033 if (same_type_p (to_type
, pfn_type
))
7035 else if (integer_zerop (n
))
7036 return build_reinterpret_cast (to_type
, pfn
,
7037 tf_warning_or_error
);
7040 if (TREE_SIDE_EFFECTS (pfn
))
7041 pfn
= save_expr (pfn
);
7043 /* Obtain the function pointer and the current DELTA. */
7044 if (TREE_CODE (pfn
) == PTRMEM_CST
)
7045 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
7048 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
7049 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
7052 /* Just adjust the DELTA field. */
7053 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7054 (TREE_TYPE (delta
), ptrdiff_type_node
));
7055 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
7056 n
= cp_build_binary_op (input_location
,
7057 LSHIFT_EXPR
, n
, integer_one_node
,
7058 tf_warning_or_error
);
7059 delta
= cp_build_binary_op (input_location
,
7060 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
7061 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
7064 /* Handle null pointer to member function conversions. */
7065 if (null_ptr_cst_p (pfn
))
7067 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
7068 return build_ptrmemfunc1 (to_type
,
7073 if (type_unknown_p (pfn
))
7074 return instantiate_type (type
, pfn
, tf_warning_or_error
);
7076 fn
= TREE_OPERAND (pfn
, 0);
7077 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7078 /* In a template, we will have preserved the
7080 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
7081 return make_ptrmem_cst (to_type
, fn
);
7084 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7087 ??? There is no consistency as to the types returned for the above
7088 values. Some code acts as if it were a sizetype and some as if it were
7089 integer_type_node. */
7092 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
7094 tree type
= TREE_TYPE (cst
);
7095 tree fn
= PTRMEM_CST_MEMBER (cst
);
7096 tree ptr_class
, fn_class
;
7098 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7100 /* The class that the function belongs to. */
7101 fn_class
= DECL_CONTEXT (fn
);
7103 /* The class that we're creating a pointer to member of. */
7104 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
7106 /* First, calculate the adjustment to the function's class. */
7107 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
7108 /*c_cast_p=*/0, tf_warning_or_error
);
7110 if (!DECL_VIRTUAL_P (fn
))
7111 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
7114 /* If we're dealing with a virtual function, we have to adjust 'this'
7115 again, to point to the base which provides the vtable entry for
7116 fn; the call will do the opposite adjustment. */
7117 tree orig_class
= DECL_CONTEXT (fn
);
7118 tree binfo
= binfo_or_else (orig_class
, fn_class
);
7119 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7120 *delta
, BINFO_OFFSET (binfo
));
7121 *delta
= fold_if_not_in_template (*delta
);
7123 /* We set PFN to the vtable offset at which the function can be
7124 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7125 case delta is shifted left, and then incremented). */
7126 *pfn
= DECL_VINDEX (fn
);
7127 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
7128 TYPE_SIZE_UNIT (vtable_entry_type
));
7129 *pfn
= fold_if_not_in_template (*pfn
);
7131 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
7133 case ptrmemfunc_vbit_in_pfn
:
7134 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
7136 *pfn
= fold_if_not_in_template (*pfn
);
7139 case ptrmemfunc_vbit_in_delta
:
7140 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
7141 *delta
, integer_one_node
);
7142 *delta
= fold_if_not_in_template (*delta
);
7143 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7144 *delta
, integer_one_node
);
7145 *delta
= fold_if_not_in_template (*delta
);
7152 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
7153 *pfn
= fold_if_not_in_template (*pfn
);
7157 /* Return an expression for PFN from the pointer-to-member function
7161 pfn_from_ptrmemfunc (tree t
)
7163 if (TREE_CODE (t
) == PTRMEM_CST
)
7168 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7173 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
7176 /* Return an expression for DELTA from the pointer-to-member function
7180 delta_from_ptrmemfunc (tree t
)
7182 if (TREE_CODE (t
) == PTRMEM_CST
)
7187 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7192 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7195 /* Convert value RHS to type TYPE as preparation for an assignment to
7196 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
7197 implicit conversion is. If FNDECL is non-NULL, we are doing the
7198 conversion in order to pass the PARMNUMth argument of FNDECL.
7199 If FNDECL is NULL, we are doing the conversion in function pointer
7200 argument passing, conversion in initialization, etc. */
7203 convert_for_assignment (tree type
, tree rhs
,
7204 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7205 tsubst_flags_t complain
, int flags
)
7208 enum tree_code coder
;
7210 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7211 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7212 rhs
= TREE_OPERAND (rhs
, 0);
7214 rhstype
= TREE_TYPE (rhs
);
7215 coder
= TREE_CODE (rhstype
);
7217 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7218 && vector_types_convertible_p (type
, rhstype
, true))
7220 rhs
= mark_rvalue_use (rhs
);
7221 return convert (type
, rhs
);
7224 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7225 return error_mark_node
;
7226 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7227 return error_mark_node
;
7229 /* The RHS of an assignment cannot have void type. */
7230 if (coder
== VOID_TYPE
)
7232 if (complain
& tf_error
)
7233 error ("void value not ignored as it ought to be");
7234 return error_mark_node
;
7237 /* Simplify the RHS if possible. */
7238 if (TREE_CODE (rhs
) == CONST_DECL
)
7239 rhs
= DECL_INITIAL (rhs
);
7241 if (c_dialect_objc ())
7245 tree rname
= fndecl
;
7256 selector
= objc_message_selector ();
7258 if (selector
&& parmno
> 1)
7265 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7267 rhs
= mark_rvalue_use (rhs
);
7268 return convert (type
, rhs
);
7274 The expression is implicitly converted (clause _conv_) to the
7275 cv-unqualified type of the left operand.
7277 We allow bad conversions here because by the time we get to this point
7278 we are committed to doing the conversion. If we end up doing a bad
7279 conversion, convert_like will complain. */
7280 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7282 /* When -Wno-pmf-conversions is use, we just silently allow
7283 conversions from pointers-to-members to plain pointers. If
7284 the conversion doesn't work, cp_convert will complain. */
7286 && TYPE_PTR_P (type
)
7287 && TYPE_PTRMEMFUNC_P (rhstype
))
7288 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7291 if (complain
& tf_error
)
7293 /* If the right-hand side has unknown type, then it is an
7294 overloaded function. Call instantiate_type to get error
7296 if (rhstype
== unknown_type_node
)
7297 instantiate_type (type
, rhs
, tf_warning_or_error
);
7299 error ("cannot convert %qT to %qT for argument %qP to %qD",
7300 rhstype
, type
, parmnum
, fndecl
);
7304 case ICR_DEFAULT_ARGUMENT
:
7305 error ("cannot convert %qT to %qT in default argument",
7309 error ("cannot convert %qT to %qT in argument passing",
7312 case ICR_CONVERTING
:
7313 error ("cannot convert %qT to %qT",
7317 error ("cannot convert %qT to %qT in initialization",
7321 error ("cannot convert %qT to %qT in return",
7325 error ("cannot convert %qT to %qT in assignment",
7332 return error_mark_node
;
7335 if (warn_missing_format_attribute
)
7337 const enum tree_code codel
= TREE_CODE (type
);
7338 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7340 && check_missing_format_attribute (type
, rhstype
)
7341 && (complain
& tf_warning
))
7345 case ICR_DEFAULT_ARGUMENT
:
7347 warning (OPT_Wmissing_format_attribute
,
7348 "parameter %qP of %qD might be a candidate "
7349 "for a format attribute", parmnum
, fndecl
);
7351 warning (OPT_Wmissing_format_attribute
,
7352 "parameter might be a candidate "
7353 "for a format attribute");
7355 case ICR_CONVERTING
:
7356 warning (OPT_Wmissing_format_attribute
,
7357 "target of conversion might be a candidate "
7358 "for a format attribute");
7361 warning (OPT_Wmissing_format_attribute
,
7362 "target of initialization might be a candidate "
7363 "for a format attribute");
7366 warning (OPT_Wmissing_format_attribute
,
7367 "return type might be a candidate "
7368 "for a format attribute");
7371 warning (OPT_Wmissing_format_attribute
,
7372 "left-hand side of assignment might be a candidate "
7373 "for a format attribute");
7380 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7382 if (warn_parentheses
7383 && TREE_CODE (type
) == BOOLEAN_TYPE
7384 && TREE_CODE (rhs
) == MODIFY_EXPR
7385 && !TREE_NO_WARNING (rhs
)
7386 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7387 && (complain
& tf_warning
))
7389 location_t loc
= EXPR_LOC_OR_HERE (rhs
);
7391 warning_at (loc
, OPT_Wparentheses
,
7392 "suggest parentheses around assignment used as truth value");
7393 TREE_NO_WARNING (rhs
) = 1;
7396 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7400 /* Convert RHS to be of type TYPE.
7401 If EXP is nonzero, it is the target of the initialization.
7402 ERRTYPE indicates what kind of error the implicit conversion is.
7404 Two major differences between the behavior of
7405 `convert_for_assignment' and `convert_for_initialization'
7406 are that references are bashed in the former, while
7407 copied in the latter, and aggregates are assigned in
7408 the former (operator=) while initialized in the
7411 If using constructor make sure no conversion operator exists, if one does
7412 exist, an ambiguity exists.
7414 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7417 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7418 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7419 tsubst_flags_t complain
)
7421 enum tree_code codel
= TREE_CODE (type
);
7423 enum tree_code coder
;
7425 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7426 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7427 if (TREE_CODE (rhs
) == NOP_EXPR
7428 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7429 && codel
!= REFERENCE_TYPE
)
7430 rhs
= TREE_OPERAND (rhs
, 0);
7432 if (type
== error_mark_node
7433 || rhs
== error_mark_node
7434 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7435 return error_mark_node
;
7437 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7438 && TREE_CODE (type
) != ARRAY_TYPE
7439 && (TREE_CODE (type
) != REFERENCE_TYPE
7440 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7441 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7442 && (TREE_CODE (type
) != REFERENCE_TYPE
7443 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7444 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7445 rhs
= decay_conversion (rhs
);
7447 rhstype
= TREE_TYPE (rhs
);
7448 coder
= TREE_CODE (rhstype
);
7450 if (coder
== ERROR_MARK
)
7451 return error_mark_node
;
7453 /* We accept references to incomplete types, so we can
7454 return here before checking if RHS is of complete type. */
7456 if (codel
== REFERENCE_TYPE
)
7458 /* This should eventually happen in convert_arguments. */
7459 int savew
= 0, savee
= 0;
7462 savew
= warningcount
, savee
= errorcount
;
7463 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7464 /*cleanup=*/NULL
, complain
);
7467 if (warningcount
> savew
)
7468 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7469 else if (errorcount
> savee
)
7470 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7476 exp
= require_complete_type_sfinae (exp
, complain
);
7477 if (exp
== error_mark_node
)
7478 return error_mark_node
;
7480 rhstype
= non_reference (rhstype
);
7482 type
= complete_type (type
);
7484 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7485 /* Don't try to do copy-initialization if we already have
7486 direct-initialization. */
7489 if (MAYBE_CLASS_TYPE_P (type
))
7490 return perform_implicit_conversion_flags (type
, rhs
, complain
, flags
);
7492 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7496 /* If RETVAL is the address of, or a reference to, a local variable or
7497 temporary give an appropriate warning. */
7500 maybe_warn_about_returning_address_of_local (tree retval
)
7502 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7503 tree whats_returned
= retval
;
7507 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7508 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7509 else if (CONVERT_EXPR_P (whats_returned
)
7510 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7511 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7516 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7518 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7520 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7522 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7523 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7525 warning (0, "returning reference to temporary");
7528 if (TREE_CODE (whats_returned
) == VAR_DECL
7529 && DECL_NAME (whats_returned
)
7530 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7532 warning (0, "reference to non-lvalue returned");
7537 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7538 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7539 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7541 if (DECL_P (whats_returned
)
7542 && DECL_NAME (whats_returned
)
7543 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7544 && !(TREE_STATIC (whats_returned
)
7545 || TREE_PUBLIC (whats_returned
)))
7547 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7548 warning (0, "reference to local variable %q+D returned",
7551 warning (0, "address of local variable %q+D returned",
7557 /* Check that returning RETVAL from the current function is valid.
7558 Return an expression explicitly showing all conversions required to
7559 change RETVAL into the function return type, and to assign it to
7560 the DECL_RESULT for the function. Set *NO_WARNING to true if
7561 code reaches end of non-void function warning shouldn't be issued
7562 on this RETURN_EXPR. */
7565 check_return_expr (tree retval
, bool *no_warning
)
7568 /* The type actually returned by the function, after any
7571 int fn_returns_value_p
;
7572 bool named_return_value_okay_p
;
7574 *no_warning
= false;
7576 /* A `volatile' function is one that isn't supposed to return, ever.
7577 (This is a G++ extension, used to get better code for functions
7578 that call the `volatile' function.) */
7579 if (TREE_THIS_VOLATILE (current_function_decl
))
7580 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7582 /* Check for various simple errors. */
7583 if (DECL_DESTRUCTOR_P (current_function_decl
))
7586 error ("returning a value from a destructor");
7589 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7591 if (in_function_try_handler
)
7592 /* If a return statement appears in a handler of the
7593 function-try-block of a constructor, the program is ill-formed. */
7594 error ("cannot return from a handler of a function-try-block of a constructor");
7596 /* You can't return a value from a constructor. */
7597 error ("returning a value from a constructor");
7601 /* As an extension, deduce lambda return type from a return statement
7602 anywhere in the body. */
7603 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7605 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7606 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7608 tree type
= lambda_return_type (retval
);
7609 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7611 if (VOID_TYPE_P (type
))
7613 else if (oldtype
== NULL_TREE
)
7615 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7616 "can only be deduced when the return statement is "
7617 "the only statement in the function body");
7618 apply_lambda_return_type (lambda
, type
);
7620 else if (!same_type_p (type
, oldtype
))
7621 error ("inconsistent types %qT and %qT deduced for "
7622 "lambda return type", type
, oldtype
);
7626 if (processing_template_decl
)
7628 current_function_returns_value
= 1;
7629 if (check_for_bare_parameter_packs (retval
))
7630 retval
= error_mark_node
;
7634 /* When no explicit return-value is given in a function with a named
7635 return value, the named return value is used. */
7636 result
= DECL_RESULT (current_function_decl
);
7637 valtype
= TREE_TYPE (result
);
7638 gcc_assert (valtype
!= NULL_TREE
);
7639 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7640 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7643 /* Check for a return statement with no return value in a function
7644 that's supposed to return a value. */
7645 if (!retval
&& fn_returns_value_p
)
7647 permerror (input_location
, "return-statement with no value, in function returning %qT",
7649 /* Clear this, so finish_function won't say that we reach the
7650 end of a non-void function (which we don't, we gave a
7652 current_function_returns_null
= 0;
7653 /* And signal caller that TREE_NO_WARNING should be set on the
7654 RETURN_EXPR to avoid control reaches end of non-void function
7655 warnings in tree-cfg.c. */
7658 /* Check for a return statement with a value in a function that
7659 isn't supposed to return a value. */
7660 else if (retval
&& !fn_returns_value_p
)
7662 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7663 /* You can return a `void' value from a function of `void'
7664 type. In that case, we have to evaluate the expression for
7665 its side-effects. */
7666 finish_expr_stmt (retval
);
7668 permerror (input_location
, "return-statement with a value, in function "
7669 "returning 'void'");
7670 current_function_returns_null
= 1;
7672 /* There's really no value to return, after all. */
7676 /* Remember that this function can sometimes return without a
7678 current_function_returns_null
= 1;
7680 /* Remember that this function did return a value. */
7681 current_function_returns_value
= 1;
7683 /* Check for erroneous operands -- but after giving ourselves a
7684 chance to provide an error about returning a value from a void
7686 if (error_operand_p (retval
))
7688 current_function_return_value
= error_mark_node
;
7689 return error_mark_node
;
7692 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7693 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7694 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7695 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7697 && retval
&& null_ptr_cst_p (retval
))
7698 warning (0, "%<operator new%> must not return NULL unless it is "
7699 "declared %<throw()%> (or -fcheck-new is in effect)");
7701 /* Effective C++ rule 15. See also start_function. */
7703 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7707 /* The function return type must be a reference to the current
7709 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7710 && same_type_ignoring_top_level_qualifiers_p
7711 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7713 /* Returning '*this' is obviously OK. */
7714 if (retval
== current_class_ref
)
7716 /* If we are calling a function whose return type is the same of
7717 the current class reference, it is ok. */
7718 else if (TREE_CODE (retval
) == INDIRECT_REF
7719 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7724 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7727 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7729 [...] For a function with a class return type, if the expression
7730 in the return statement is the name of a local object, and the cv-
7731 unqualified type of the local object is the same as the function
7732 return type, an implementation is permitted to omit creating the tem-
7733 porary object to hold the function return value [...]
7735 So, if this is a value-returning function that always returns the same
7736 local variable, remember it.
7738 It might be nice to be more flexible, and choose the first suitable
7739 variable even if the function sometimes returns something else, but
7740 then we run the risk of clobbering the variable we chose if the other
7741 returned expression uses the chosen variable somehow. And people expect
7742 this restriction, anyway. (jason 2000-11-19)
7744 See finish_function and finalize_nrv for the rest of this optimization. */
7746 named_return_value_okay_p
=
7747 (retval
!= NULL_TREE
7748 /* Must be a local, automatic variable. */
7749 && TREE_CODE (retval
) == VAR_DECL
7750 && DECL_CONTEXT (retval
) == current_function_decl
7751 && ! TREE_STATIC (retval
)
7752 && ! DECL_ANON_UNION_VAR_P (retval
)
7753 && (DECL_ALIGN (retval
)
7754 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7755 /* The cv-unqualified type of the returned value must be the
7756 same as the cv-unqualified return type of the
7758 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7760 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7761 /* And the returned value must be non-volatile. */
7762 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7764 if (fn_returns_value_p
&& flag_elide_constructors
)
7766 if (named_return_value_okay_p
7767 && (current_function_return_value
== NULL_TREE
7768 || current_function_return_value
== retval
))
7769 current_function_return_value
= retval
;
7771 current_function_return_value
= error_mark_node
;
7774 /* We don't need to do any conversions when there's nothing being
7779 /* Do any required conversions. */
7780 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7781 /* No conversions are required. */
7785 /* The type the function is declared to return. */
7786 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7787 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7789 /* The functype's return type will have been set to void, if it
7790 was an incomplete type. Just treat this as 'return;' */
7791 if (VOID_TYPE_P (functype
))
7792 return error_mark_node
;
7794 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7795 treated as an rvalue for the purposes of overload resolution to
7796 favor move constructors over copy constructors.
7798 Note that these conditions are similar to, but not as strict as,
7799 the conditions for the named return value optimization. */
7800 if ((cxx_dialect
!= cxx98
)
7801 && (TREE_CODE (retval
) == VAR_DECL
7802 || TREE_CODE (retval
) == PARM_DECL
)
7803 && DECL_CONTEXT (retval
) == current_function_decl
7804 && !TREE_STATIC (retval
)
7805 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7807 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7808 /* This is only interesting for class type. */
7809 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7810 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7812 /* First convert the value to the function's return type, then
7813 to the type of return value's location to handle the
7814 case that functype is smaller than the valtype. */
7815 retval
= convert_for_initialization
7816 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
7817 tf_warning_or_error
);
7818 retval
= convert (valtype
, retval
);
7820 /* If the conversion failed, treat this just like `return;'. */
7821 if (retval
== error_mark_node
)
7823 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7824 else if (! cfun
->returns_struct
7825 && TREE_CODE (retval
) == TARGET_EXPR
7826 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7827 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7828 TREE_OPERAND (retval
, 0));
7830 maybe_warn_about_returning_address_of_local (retval
);
7833 /* Actually copy the value returned into the appropriate location. */
7834 if (retval
&& retval
!= result
)
7835 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7841 /* Returns nonzero if the pointer-type FROM can be converted to the
7842 pointer-type TO via a qualification conversion. If CONSTP is -1,
7843 then we return nonzero if the pointers are similar, and the
7844 cv-qualification signature of FROM is a proper subset of that of TO.
7846 If CONSTP is positive, then all outer pointers have been
7850 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7852 bool to_more_cv_qualified
= false;
7853 bool is_opaque_pointer
= false;
7855 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7857 if (TREE_CODE (to
) != TREE_CODE (from
))
7860 if (TREE_CODE (from
) == OFFSET_TYPE
7861 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7862 TYPE_OFFSET_BASETYPE (to
)))
7865 /* Const and volatile mean something different for function types,
7866 so the usual checks are not appropriate. */
7867 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7869 if (!at_least_as_qualified_p (to
, from
))
7872 if (!at_least_as_qualified_p (from
, to
))
7876 to_more_cv_qualified
= true;
7880 constp
&= TYPE_READONLY (to
);
7883 if (TREE_CODE (to
) == VECTOR_TYPE
)
7884 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7886 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
7887 return ((constp
>= 0 || to_more_cv_qualified
)
7888 && (is_opaque_pointer
7889 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
7893 /* When comparing, say, char ** to char const **, this function takes
7894 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7895 types to this function. */
7898 comp_ptr_ttypes (tree to
, tree from
)
7900 return comp_ptr_ttypes_real (to
, from
, 1);
7903 /* Returns true iff FNTYPE is a non-class type that involves
7904 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7905 if a parameter type is ill-formed. */
7908 error_type_p (const_tree type
)
7912 switch (TREE_CODE (type
))
7918 case REFERENCE_TYPE
:
7920 return error_type_p (TREE_TYPE (type
));
7924 if (error_type_p (TREE_TYPE (type
)))
7926 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7927 if (error_type_p (TREE_VALUE (t
)))
7932 if (TYPE_PTRMEMFUNC_P (type
))
7933 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
7941 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7942 type or inheritance-related types, regardless of cv-quals. */
7945 ptr_reasonably_similar (const_tree to
, const_tree from
)
7947 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7949 /* Any target type is similar enough to void. */
7950 if (TREE_CODE (to
) == VOID_TYPE
)
7951 return !error_type_p (from
);
7952 if (TREE_CODE (from
) == VOID_TYPE
)
7953 return !error_type_p (to
);
7955 if (TREE_CODE (to
) != TREE_CODE (from
))
7958 if (TREE_CODE (from
) == OFFSET_TYPE
7959 && comptypes (TYPE_OFFSET_BASETYPE (to
),
7960 TYPE_OFFSET_BASETYPE (from
),
7961 COMPARE_BASE
| COMPARE_DERIVED
))
7964 if (TREE_CODE (to
) == VECTOR_TYPE
7965 && vector_types_convertible_p (to
, from
, false))
7968 if (TREE_CODE (to
) == INTEGER_TYPE
7969 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
7972 if (TREE_CODE (to
) == FUNCTION_TYPE
)
7973 return !error_type_p (to
) && !error_type_p (from
);
7975 if (TREE_CODE (to
) != POINTER_TYPE
)
7977 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
7978 COMPARE_BASE
| COMPARE_DERIVED
);
7982 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
7983 pointer-to-member types) are the same, ignoring cv-qualification at
7987 comp_ptr_ttypes_const (tree to
, tree from
)
7989 bool is_opaque_pointer
= false;
7991 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7993 if (TREE_CODE (to
) != TREE_CODE (from
))
7996 if (TREE_CODE (from
) == OFFSET_TYPE
7997 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
7998 TYPE_OFFSET_BASETYPE (to
)))
8001 if (TREE_CODE (to
) == VECTOR_TYPE
)
8002 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
8004 if (TREE_CODE (to
) != POINTER_TYPE
)
8005 return (is_opaque_pointer
8006 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
8010 /* Returns the type qualifiers for this type, including the qualifiers on the
8011 elements for an array type. */
8014 cp_type_quals (const_tree type
)
8017 /* This CONST_CAST is okay because strip_array_types returns its
8018 argument unmodified and we assign it to a const_tree. */
8019 type
= strip_array_types (CONST_CAST_TREE (type
));
8020 if (type
== error_mark_node
8021 /* Quals on a FUNCTION_TYPE are memfn quals. */
8022 || TREE_CODE (type
) == FUNCTION_TYPE
)
8023 return TYPE_UNQUALIFIED
;
8024 quals
= TYPE_QUALS (type
);
8025 /* METHOD and REFERENCE_TYPEs should never have quals. */
8026 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
8027 && TREE_CODE (type
) != REFERENCE_TYPE
)
8028 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
8029 == TYPE_UNQUALIFIED
));
8033 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
8037 type_memfn_quals (const_tree type
)
8039 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8040 return TYPE_QUALS (type
);
8041 else if (TREE_CODE (type
) == METHOD_TYPE
)
8042 return cp_type_quals (class_of_this_parm (type
));
8047 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
8051 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
)
8053 /* Could handle METHOD_TYPE here if necessary. */
8054 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8055 if (TYPE_QUALS (type
) == memfn_quals
)
8057 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
8059 return build_qualified_type (type
, memfn_quals
);
8062 /* Returns nonzero if TYPE is const or volatile. */
8065 cv_qualified_p (const_tree type
)
8067 int quals
= cp_type_quals (type
);
8068 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
8071 /* Returns nonzero if the TYPE contains a mutable member. */
8074 cp_has_mutable_p (const_tree type
)
8076 /* This CONST_CAST is okay because strip_array_types returns its
8077 argument unmodified and we assign it to a const_tree. */
8078 type
= strip_array_types (CONST_CAST_TREE(type
));
8080 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
8083 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
8084 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
8085 approximation. In particular, consider:
8088 struct S { int i; };
8089 const S s = { f(); }
8091 Here, we will make "s" as TREE_READONLY (because it is declared
8092 "const") -- only to reverse ourselves upon seeing that the
8093 initializer is non-constant. */
8096 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
8098 tree type
= TREE_TYPE (decl
);
8100 if (type
== error_mark_node
)
8103 if (TREE_CODE (decl
) == TYPE_DECL
)
8106 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
8107 && type_quals
!= TYPE_UNQUALIFIED
));
8109 /* Avoid setting TREE_READONLY incorrectly. */
8110 if (/* If the object has a constructor, the constructor may modify
8112 TYPE_NEEDS_CONSTRUCTING (type
)
8113 /* If the type isn't complete, we don't know yet if it will need
8115 || !COMPLETE_TYPE_P (type
)
8116 /* If the type has a mutable component, that component might be
8118 || TYPE_HAS_MUTABLE_P (type
))
8119 type_quals
&= ~TYPE_QUAL_CONST
;
8121 c_apply_type_quals_to_decl (type_quals
, decl
);
8124 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8125 exemplar types such that casting T1 to T2 is casting away constness
8126 if and only if there is no implicit conversion from T1 to T2. */
8129 casts_away_constness_r (tree
*t1
, tree
*t2
)
8134 /* [expr.const.cast]
8136 For multi-level pointer to members and multi-level mixed pointers
8137 and pointers to members (conv.qual), the "member" aspect of a
8138 pointer to member level is ignored when determining if a const
8139 cv-qualifier has been cast away. */
8140 /* [expr.const.cast]
8142 For two pointer types:
8144 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8145 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8148 casting from X1 to X2 casts away constness if, for a non-pointer
8149 type T there does not exist an implicit conversion (clause
8152 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8156 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8157 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
8158 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
8160 *t1
= cp_build_qualified_type (void_type_node
,
8161 cp_type_quals (*t1
));
8162 *t2
= cp_build_qualified_type (void_type_node
,
8163 cp_type_quals (*t2
));
8167 quals1
= cp_type_quals (*t1
);
8168 quals2
= cp_type_quals (*t2
);
8170 if (TYPE_PTRMEM_P (*t1
))
8171 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
8173 *t1
= TREE_TYPE (*t1
);
8174 if (TYPE_PTRMEM_P (*t2
))
8175 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
8177 *t2
= TREE_TYPE (*t2
);
8179 casts_away_constness_r (t1
, t2
);
8180 *t1
= build_pointer_type (*t1
);
8181 *t2
= build_pointer_type (*t2
);
8182 *t1
= cp_build_qualified_type (*t1
, quals1
);
8183 *t2
= cp_build_qualified_type (*t2
, quals2
);
8186 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8189 ??? This function returns non-zero if casting away qualifiers not
8190 just const. We would like to return to the caller exactly which
8191 qualifiers are casted away to give more accurate diagnostics.
8195 casts_away_constness (tree t1
, tree t2
)
8197 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
8199 /* [expr.const.cast]
8201 Casting from an lvalue of type T1 to an lvalue of type T2
8202 using a reference cast casts away constness if a cast from an
8203 rvalue of type "pointer to T1" to the type "pointer to T2"
8204 casts away constness. */
8205 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
8206 return casts_away_constness (build_pointer_type (t1
),
8207 build_pointer_type (TREE_TYPE (t2
)));
8210 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
8211 /* [expr.const.cast]
8213 Casting from an rvalue of type "pointer to data member of X
8214 of type T1" to the type "pointer to data member of Y of type
8215 T2" casts away constness if a cast from an rvalue of type
8216 "pointer to T1" to the type "pointer to T2" casts away
8218 return casts_away_constness
8219 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
8220 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
8222 /* Casting away constness is only something that makes sense for
8223 pointer or reference types. */
8224 if (TREE_CODE (t1
) != POINTER_TYPE
8225 || TREE_CODE (t2
) != POINTER_TYPE
)
8228 /* Top-level qualifiers don't matter. */
8229 t1
= TYPE_MAIN_VARIANT (t1
);
8230 t2
= TYPE_MAIN_VARIANT (t2
);
8231 casts_away_constness_r (&t1
, &t2
);
8232 if (!can_convert (t2
, t1
))
8238 /* If T is a REFERENCE_TYPE return the type to which T refers.
8239 Otherwise, return T itself. */
8242 non_reference (tree t
)
8244 if (TREE_CODE (t
) == REFERENCE_TYPE
)
8250 /* Return nonzero if REF is an lvalue valid for this language;
8251 otherwise, print an error message and return zero. USE says
8252 how the lvalue is being used and so selects the error message. */
8255 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
8257 cp_lvalue_kind kind
= lvalue_kind (ref
);
8259 if (kind
== clk_none
)
8261 if (complain
& tf_error
)
8262 lvalue_error (input_location
, use
);
8265 else if (kind
& (clk_rvalueref
|clk_class
))
8267 if (!(complain
& tf_error
))
8269 if (kind
& clk_class
)
8270 /* Make this a permerror because we used to accept it. */
8271 permerror (input_location
, "using temporary as lvalue");
8273 error ("using xvalue (rvalue reference) as lvalue");