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
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"
44 static tree
pfn_from_ptrmemfunc (tree
);
45 static tree
delta_from_ptrmemfunc (tree
);
46 static tree
convert_for_assignment (tree
, tree
, impl_conv_rhs
, tree
, int,
48 static tree
cp_pointer_int_sum (enum tree_code
, tree
, tree
);
49 static tree
rationalize_conditional_expr (enum tree_code
, tree
,
51 static int comp_ptr_ttypes_real (tree
, tree
, int);
52 static bool comp_except_types (tree
, tree
, bool);
53 static bool comp_array_types (const_tree
, const_tree
, bool);
54 static tree
pointer_diff (tree
, tree
, tree
);
55 static tree
get_delta_difference (tree
, tree
, bool, bool, tsubst_flags_t
);
56 static void casts_away_constness_r (tree
*, tree
*);
57 static bool casts_away_constness (tree
, tree
);
58 static void maybe_warn_about_returning_address_of_local (tree
);
59 static tree
lookup_destructor (tree
, tree
, tree
);
60 static void warn_args_num (location_t
, tree
, bool);
61 static int convert_arguments (tree
, VEC(tree
,gc
) **, tree
, int,
64 /* Do `exp = require_complete_type (exp);' to make sure exp
65 does not have an incomplete type. (That includes void types.)
66 Returns error_mark_node if the VALUE does not have
67 complete type when this function returns. */
70 require_complete_type_sfinae (tree value
, tsubst_flags_t complain
)
74 if (processing_template_decl
|| value
== error_mark_node
)
77 if (TREE_CODE (value
) == OVERLOAD
)
78 type
= unknown_type_node
;
80 type
= TREE_TYPE (value
);
82 if (type
== error_mark_node
)
83 return error_mark_node
;
85 /* First, detect a valid value with a complete type. */
86 if (COMPLETE_TYPE_P (type
))
89 if (complete_type_or_maybe_complain (type
, value
, complain
))
92 return error_mark_node
;
96 require_complete_type (tree value
)
98 return require_complete_type_sfinae (value
, tf_warning_or_error
);
101 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
102 a template instantiation, do the instantiation. Returns TYPE,
103 whether or not it could be completed, unless something goes
104 horribly wrong, in which case the error_mark_node is returned. */
107 complete_type (tree type
)
109 if (type
== NULL_TREE
)
110 /* Rather than crash, we return something sure to cause an error
112 return error_mark_node
;
114 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
116 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
118 tree t
= complete_type (TREE_TYPE (type
));
119 unsigned int needs_constructing
, has_nontrivial_dtor
;
120 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
123 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
125 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
126 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
128 TYPE_NEEDS_CONSTRUCTING (t
) = needs_constructing
;
129 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = has_nontrivial_dtor
;
132 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
133 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
138 /* Like complete_type, but issue an error if the TYPE cannot be completed.
139 VALUE is used for informative diagnostics.
140 Returns NULL_TREE if the type cannot be made complete. */
143 complete_type_or_maybe_complain (tree type
, tree value
, tsubst_flags_t complain
)
145 type
= complete_type (type
);
146 if (type
== error_mark_node
)
147 /* We already issued an error. */
149 else if (!COMPLETE_TYPE_P (type
))
151 if (complain
& tf_error
)
152 cxx_incomplete_type_diagnostic (value
, type
, DK_ERROR
);
160 complete_type_or_else (tree type
, tree value
)
162 return complete_type_or_maybe_complain (type
, value
, tf_warning_or_error
);
165 /* Return truthvalue of whether type of EXP is instantiated. */
168 type_unknown_p (const_tree exp
)
170 return (TREE_CODE (exp
) == TREE_LIST
171 || TREE_TYPE (exp
) == unknown_type_node
);
175 /* Return the common type of two parameter lists.
176 We assume that comptypes has already been done and returned 1;
177 if that isn't so, this may crash.
179 As an optimization, free the space we allocate if the parameter
180 lists are already common. */
183 commonparms (tree p1
, tree p2
)
185 tree oldargs
= p1
, newargs
, n
;
189 len
= list_length (p1
);
190 newargs
= tree_last (p1
);
192 if (newargs
== void_list_node
)
201 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
206 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
208 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
210 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
213 else if (! TREE_PURPOSE (p1
))
215 if (TREE_PURPOSE (p2
))
217 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
223 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
225 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
227 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
230 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
233 TREE_VALUE (n
) = TREE_VALUE (p1
);
241 /* Given a type, perhaps copied for a typedef,
242 find the "original" version of it. */
244 original_type (tree t
)
246 int quals
= cp_type_quals (t
);
247 while (t
!= error_mark_node
248 && TYPE_NAME (t
) != NULL_TREE
)
250 tree x
= TYPE_NAME (t
);
251 if (TREE_CODE (x
) != TYPE_DECL
)
253 x
= DECL_ORIGINAL_TYPE (x
);
258 return cp_build_qualified_type (t
, quals
);
261 /* Return the common type for two arithmetic types T1 and T2 under the
262 usual arithmetic conversions. The default conversions have already
263 been applied, and enumerated types converted to their compatible
267 cp_common_type (tree t1
, tree t2
)
269 enum tree_code code1
= TREE_CODE (t1
);
270 enum tree_code code2
= TREE_CODE (t2
);
274 /* In what follows, we slightly generalize the rules given in [expr] so
275 as to deal with `long long' and `complex'. First, merge the
277 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
279 if (SCOPED_ENUM_P (t1
) || SCOPED_ENUM_P (t2
))
281 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
282 return build_type_attribute_variant (t1
, attributes
);
287 /* FIXME: Attributes. */
288 gcc_assert (ARITHMETIC_TYPE_P (t1
)
289 || TREE_CODE (t1
) == VECTOR_TYPE
290 || UNSCOPED_ENUM_P (t1
));
291 gcc_assert (ARITHMETIC_TYPE_P (t2
)
292 || TREE_CODE (t2
) == VECTOR_TYPE
293 || UNSCOPED_ENUM_P (t2
));
295 /* If one type is complex, form the common type of the non-complex
296 components, then make that complex. Use T1 or T2 if it is the
298 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
300 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
301 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
303 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
305 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
306 return build_type_attribute_variant (t1
, attributes
);
307 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
308 return build_type_attribute_variant (t2
, attributes
);
310 return build_type_attribute_variant (build_complex_type (subtype
),
314 if (code1
== VECTOR_TYPE
)
316 /* When we get here we should have two vectors of the same size.
317 Just prefer the unsigned one if present. */
318 if (TYPE_UNSIGNED (t1
))
319 return build_type_attribute_variant (t1
, attributes
);
321 return build_type_attribute_variant (t2
, attributes
);
324 /* If only one is real, use it as the result. */
325 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
326 return build_type_attribute_variant (t1
, attributes
);
327 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
328 return build_type_attribute_variant (t2
, attributes
);
330 /* Both real or both integers; use the one with greater precision. */
331 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
332 return build_type_attribute_variant (t1
, attributes
);
333 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
334 return build_type_attribute_variant (t2
, attributes
);
336 /* The types are the same; no need to do anything fancy. */
337 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
338 return build_type_attribute_variant (t1
, attributes
);
340 if (code1
!= REAL_TYPE
)
342 /* If one is unsigned long long, then convert the other to unsigned
344 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
345 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
346 return build_type_attribute_variant (long_long_unsigned_type_node
,
348 /* If one is a long long, and the other is an unsigned long, and
349 long long can represent all the values of an unsigned long, then
350 convert to a long long. Otherwise, convert to an unsigned long
351 long. Otherwise, if either operand is long long, convert the
354 Since we're here, we know the TYPE_PRECISION is the same;
355 therefore converting to long long cannot represent all the values
356 of an unsigned long, so we choose unsigned long long in that
358 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
359 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
361 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
362 ? long_long_unsigned_type_node
363 : long_long_integer_type_node
);
364 return build_type_attribute_variant (t
, attributes
);
366 if (int128_integer_type_node
!= NULL_TREE
367 && (same_type_p (TYPE_MAIN_VARIANT (t1
),
368 int128_integer_type_node
)
369 || same_type_p (TYPE_MAIN_VARIANT (t2
),
370 int128_integer_type_node
)))
372 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
373 ? int128_unsigned_type_node
374 : int128_integer_type_node
);
375 return build_type_attribute_variant (t
, attributes
);
378 /* Go through the same procedure, but for longs. */
379 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
380 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
381 return build_type_attribute_variant (long_unsigned_type_node
,
383 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
384 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
386 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
387 ? long_unsigned_type_node
: long_integer_type_node
);
388 return build_type_attribute_variant (t
, attributes
);
390 /* Otherwise prefer the unsigned one. */
391 if (TYPE_UNSIGNED (t1
))
392 return build_type_attribute_variant (t1
, attributes
);
394 return build_type_attribute_variant (t2
, attributes
);
398 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
399 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
400 return build_type_attribute_variant (long_double_type_node
,
402 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
403 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
404 return build_type_attribute_variant (double_type_node
,
406 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
407 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
408 return build_type_attribute_variant (float_type_node
,
411 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
412 the standard C++ floating-point types. Logic earlier in this
413 function has already eliminated the possibility that
414 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
415 compelling reason to choose one or the other. */
416 return build_type_attribute_variant (t1
, attributes
);
420 /* T1 and T2 are arithmetic or enumeration types. Return the type
421 that will result from the "usual arithmetic conversions" on T1 and
422 T2 as described in [expr]. */
425 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
427 gcc_assert (ARITHMETIC_TYPE_P (t1
)
428 || TREE_CODE (t1
) == VECTOR_TYPE
429 || UNSCOPED_ENUM_P (t1
));
430 gcc_assert (ARITHMETIC_TYPE_P (t2
)
431 || TREE_CODE (t2
) == VECTOR_TYPE
432 || UNSCOPED_ENUM_P (t2
));
434 /* Perform the integral promotions. We do not promote real types here. */
435 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1
)
436 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2
))
438 t1
= type_promotes_to (t1
);
439 t2
= type_promotes_to (t2
);
442 return cp_common_type (t1
, t2
);
445 /* Subroutine of composite_pointer_type to implement the recursive
446 case. See that function for documentation of the parameters. */
449 composite_pointer_type_r (tree t1
, tree t2
,
450 composite_pointer_operation operation
,
451 tsubst_flags_t complain
)
458 /* Determine the types pointed to by T1 and T2. */
459 if (TREE_CODE (t1
) == POINTER_TYPE
)
461 pointee1
= TREE_TYPE (t1
);
462 pointee2
= TREE_TYPE (t2
);
466 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
467 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
472 Otherwise, the composite pointer type is a pointer type
473 similar (_conv.qual_) to the type of one of the operands,
474 with a cv-qualification signature (_conv.qual_) that is the
475 union of the cv-qualification signatures of the operand
477 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
478 result_type
= pointee1
;
479 else if ((TREE_CODE (pointee1
) == POINTER_TYPE
480 && TREE_CODE (pointee2
) == POINTER_TYPE
)
481 || (TYPE_PTR_TO_MEMBER_P (pointee1
)
482 && TYPE_PTR_TO_MEMBER_P (pointee2
)))
483 result_type
= composite_pointer_type_r (pointee1
, pointee2
, operation
,
487 if (complain
& tf_error
)
492 permerror (input_location
, "comparison between "
493 "distinct pointer types %qT and %qT lacks a cast",
497 permerror (input_location
, "conversion between "
498 "distinct pointer types %qT and %qT lacks a cast",
501 case CPO_CONDITIONAL_EXPR
:
502 permerror (input_location
, "conditional expression between "
503 "distinct pointer types %qT and %qT lacks a cast",
510 result_type
= void_type_node
;
512 result_type
= cp_build_qualified_type (result_type
,
513 (cp_type_quals (pointee1
)
514 | cp_type_quals (pointee2
)));
515 /* If the original types were pointers to members, so is the
517 if (TYPE_PTR_TO_MEMBER_P (t1
))
519 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
520 TYPE_PTRMEM_CLASS_TYPE (t2
))
521 && (complain
& tf_error
))
526 permerror (input_location
, "comparison between "
527 "distinct pointer types %qT and %qT lacks a cast",
531 permerror (input_location
, "conversion between "
532 "distinct pointer types %qT and %qT lacks a cast",
535 case CPO_CONDITIONAL_EXPR
:
536 permerror (input_location
, "conditional expression between "
537 "distinct pointer types %qT and %qT lacks a cast",
544 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
548 result_type
= build_pointer_type (result_type
);
550 /* Merge the attributes. */
551 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
552 return build_type_attribute_variant (result_type
, attributes
);
555 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
556 ARG1 and ARG2 are the values with those types. The OPERATION is to
557 describe the operation between the pointer types,
558 in case an error occurs.
560 This routine also implements the computation of a common type for
561 pointers-to-members as per [expr.eq]. */
564 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
565 composite_pointer_operation operation
,
566 tsubst_flags_t complain
)
573 If one operand is a null pointer constant, the composite pointer
574 type is the type of the other operand. */
575 if (null_ptr_cst_p (arg1
))
577 if (null_ptr_cst_p (arg2
))
584 If one of the operands has type "pointer to cv1 void*", then
585 the other has type "pointer to cv2T", and the composite pointer
586 type is "pointer to cv12 void", where cv12 is the union of cv1
589 If either type is a pointer to void, make sure it is T1. */
590 if (TREE_CODE (t2
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t2
)))
598 /* Now, if T1 is a pointer to void, merge the qualifiers. */
599 if (TREE_CODE (t1
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t1
)))
604 if (TYPE_PTRFN_P (t2
) && (complain
& tf_error
))
609 pedwarn (input_location
, OPT_pedantic
,
610 "ISO C++ forbids comparison between "
611 "pointer of type %<void *%> and pointer-to-function");
614 pedwarn (input_location
, OPT_pedantic
,
615 "ISO C++ forbids conversion between "
616 "pointer of type %<void *%> and pointer-to-function");
618 case CPO_CONDITIONAL_EXPR
:
619 pedwarn (input_location
, OPT_pedantic
,
620 "ISO C++ forbids conditional expression between "
621 "pointer of type %<void *%> and pointer-to-function");
628 = cp_build_qualified_type (void_type_node
,
629 (cp_type_quals (TREE_TYPE (t1
))
630 | cp_type_quals (TREE_TYPE (t2
))));
631 result_type
= build_pointer_type (result_type
);
632 /* Merge the attributes. */
633 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
634 return build_type_attribute_variant (result_type
, attributes
);
637 if (c_dialect_objc () && TREE_CODE (t1
) == POINTER_TYPE
638 && TREE_CODE (t2
) == POINTER_TYPE
)
640 if (objc_have_common_type (t1
, t2
, -3, NULL_TREE
))
641 return objc_common_type (t1
, t2
);
644 /* [expr.eq] permits the application of a pointer conversion to
645 bring the pointers to a common type. */
646 if (TREE_CODE (t1
) == POINTER_TYPE
&& TREE_CODE (t2
) == POINTER_TYPE
647 && CLASS_TYPE_P (TREE_TYPE (t1
))
648 && CLASS_TYPE_P (TREE_TYPE (t2
))
649 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
652 class1
= TREE_TYPE (t1
);
653 class2
= TREE_TYPE (t2
);
655 if (DERIVED_FROM_P (class1
, class2
))
656 t2
= (build_pointer_type
657 (cp_build_qualified_type (class1
, cp_type_quals (class2
))));
658 else if (DERIVED_FROM_P (class2
, class1
))
659 t1
= (build_pointer_type
660 (cp_build_qualified_type (class2
, cp_type_quals (class1
))));
663 if (complain
& tf_error
)
667 error ("comparison between distinct "
668 "pointer types %qT and %qT lacks a cast", t1
, t2
);
671 error ("conversion between distinct "
672 "pointer types %qT and %qT lacks a cast", t1
, t2
);
674 case CPO_CONDITIONAL_EXPR
:
675 error ("conditional expression between distinct "
676 "pointer types %qT and %qT lacks a cast", t1
, t2
);
681 return error_mark_node
;
684 /* [expr.eq] permits the application of a pointer-to-member
685 conversion to change the class type of one of the types. */
686 else if (TYPE_PTR_TO_MEMBER_P (t1
)
687 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
688 TYPE_PTRMEM_CLASS_TYPE (t2
)))
690 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
691 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
693 if (DERIVED_FROM_P (class1
, class2
))
694 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
695 else if (DERIVED_FROM_P (class2
, class1
))
696 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
699 if (complain
& tf_error
)
703 error ("comparison between distinct "
704 "pointer-to-member types %qT and %qT lacks a cast",
708 error ("conversion between distinct "
709 "pointer-to-member types %qT and %qT lacks a cast",
712 case CPO_CONDITIONAL_EXPR
:
713 error ("conditional expression between distinct "
714 "pointer-to-member types %qT and %qT lacks a cast",
720 return error_mark_node
;
724 return composite_pointer_type_r (t1
, t2
, operation
, complain
);
727 /* Return the merged type of two types.
728 We assume that comptypes has already been done and returned 1;
729 if that isn't so, this may crash.
731 This just combines attributes and default arguments; any other
732 differences would cause the two types to compare unalike. */
735 merge_types (tree t1
, tree t2
)
737 enum tree_code code1
;
738 enum tree_code code2
;
741 /* Save time if the two types are the same. */
744 if (original_type (t1
) == original_type (t2
))
747 /* If one type is nonsense, use the other. */
748 if (t1
== error_mark_node
)
750 if (t2
== error_mark_node
)
753 /* Merge the attributes. */
754 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
756 if (TYPE_PTRMEMFUNC_P (t1
))
757 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
758 if (TYPE_PTRMEMFUNC_P (t2
))
759 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
761 code1
= TREE_CODE (t1
);
762 code2
= TREE_CODE (t2
);
765 gcc_assert (code1
== TYPENAME_TYPE
|| code2
== TYPENAME_TYPE
);
766 if (code1
== TYPENAME_TYPE
)
768 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
769 code1
= TREE_CODE (t1
);
773 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
774 code2
= TREE_CODE (t2
);
782 /* For two pointers, do this recursively on the target type. */
784 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
785 int quals
= cp_type_quals (t1
);
787 if (code1
== POINTER_TYPE
)
788 t1
= build_pointer_type (target
);
790 t1
= cp_build_reference_type (target
, TYPE_REF_IS_RVALUE (t1
));
791 t1
= build_type_attribute_variant (t1
, attributes
);
792 t1
= cp_build_qualified_type (t1
, quals
);
794 if (TREE_CODE (target
) == METHOD_TYPE
)
795 t1
= build_ptrmemfunc_type (t1
);
804 quals
= cp_type_quals (t1
);
805 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
806 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
807 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
809 t1
= cp_build_qualified_type (t1
, quals
);
815 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
816 /* Save space: see if the result is identical to one of the args. */
817 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
818 return build_type_attribute_variant (t1
, attributes
);
819 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
820 return build_type_attribute_variant (t2
, attributes
);
821 /* Merge the element types, and have a size if either arg has one. */
822 t1
= build_cplus_array_type
823 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
828 /* Function types: prefer the one that specified arg types.
829 If both do, merge the arg types. Also merge the return types. */
831 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
832 tree p1
= TYPE_ARG_TYPES (t1
);
833 tree p2
= TYPE_ARG_TYPES (t2
);
837 /* Save space: see if the result is identical to one of the args. */
838 if (valtype
== TREE_TYPE (t1
) && ! p2
)
839 return cp_build_type_attribute_variant (t1
, attributes
);
840 if (valtype
== TREE_TYPE (t2
) && ! p1
)
841 return cp_build_type_attribute_variant (t2
, attributes
);
843 /* Simple way if one arg fails to specify argument types. */
844 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
846 else if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
849 parms
= commonparms (p1
, p2
);
851 rval
= build_function_type (valtype
, parms
);
852 gcc_assert (type_memfn_quals (t1
) == type_memfn_quals (t2
));
853 rval
= apply_memfn_quals (rval
, type_memfn_quals (t1
));
854 raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
855 TYPE_RAISES_EXCEPTIONS (t2
));
856 t1
= build_exception_variant (rval
, raises
);
862 /* Get this value the long way, since TYPE_METHOD_BASETYPE
863 is just the main variant of this. */
864 tree basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2
)));
865 tree raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
866 TYPE_RAISES_EXCEPTIONS (t2
));
869 /* If this was a member function type, get back to the
870 original type of type member function (i.e., without
871 the class instance variable up front. */
872 t1
= build_function_type (TREE_TYPE (t1
),
873 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
874 t2
= build_function_type (TREE_TYPE (t2
),
875 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
876 t3
= merge_types (t1
, t2
);
877 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
878 TYPE_ARG_TYPES (t3
));
879 t1
= build_exception_variant (t3
, raises
);
884 /* There is no need to merge attributes into a TYPENAME_TYPE.
885 When the type is instantiated it will have whatever
886 attributes result from the instantiation. */
892 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
894 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
897 return cp_build_type_attribute_variant (t1
, attributes
);
900 /* Return the ARRAY_TYPE type without its domain. */
903 strip_array_domain (tree type
)
906 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
907 if (TYPE_DOMAIN (type
) == NULL_TREE
)
909 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
910 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
913 /* Wrapper around cp_common_type that is used by c-common.c and other
914 front end optimizations that remove promotions.
916 Return the common type for two arithmetic types T1 and T2 under the
917 usual arithmetic conversions. The default conversions have already
918 been applied, and enumerated types converted to their compatible
922 common_type (tree t1
, tree t2
)
924 /* If one type is nonsense, use the other */
925 if (t1
== error_mark_node
)
927 if (t2
== error_mark_node
)
930 return cp_common_type (t1
, t2
);
933 /* Return the common type of two pointer types T1 and T2. This is the
934 type for the result of most arithmetic operations if the operands
935 have the given two types.
937 We assume that comp_target_types has already been done and returned
938 nonzero; if that isn't so, this may crash. */
941 common_pointer_type (tree t1
, tree t2
)
943 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
944 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
945 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
947 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
948 CPO_CONVERSION
, tf_warning_or_error
);
951 /* Compare two exception specifier types for exactness or subsetness, if
952 allowed. Returns false for mismatch, true for match (same, or
955 [except.spec] "If a class X ... objects of class X or any class publicly
956 and unambiguously derived from X. Similarly, if a pointer type Y * ...
957 exceptions of type Y * or that are pointers to any type publicly and
958 unambiguously derived from Y. Otherwise a function only allows exceptions
959 that have the same type ..."
960 This does not mention cv qualifiers and is different to what throw
961 [except.throw] and catch [except.catch] will do. They will ignore the
962 top level cv qualifiers, and allow qualifiers in the pointer to class
965 We implement the letter of the standard. */
968 comp_except_types (tree a
, tree b
, bool exact
)
970 if (same_type_p (a
, b
))
974 if (cp_type_quals (a
) || cp_type_quals (b
))
977 if (TREE_CODE (a
) == POINTER_TYPE
978 && TREE_CODE (b
) == POINTER_TYPE
)
982 if (cp_type_quals (a
) || cp_type_quals (b
))
986 if (TREE_CODE (a
) != RECORD_TYPE
987 || TREE_CODE (b
) != RECORD_TYPE
)
990 if (PUBLICLY_UNIQUELY_DERIVED_P (a
, b
))
996 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
997 If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
998 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
999 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
1000 are unordered, but we've already filtered out duplicates. Most lists will
1001 be in order, we should try to make use of that. */
1004 comp_except_specs (const_tree t1
, const_tree t2
, int exact
)
1013 /* First handle noexcept. */
1014 if (exact
< ce_exact
)
1016 /* noexcept(false) is compatible with any throwing dynamic-exc-spec
1017 and stricter than any spec. */
1018 if (t1
== noexcept_false_spec
)
1019 return !nothrow_spec_p (t2
) || exact
== ce_derived
;
1020 /* Even a derived noexcept(false) is compatible with a throwing
1022 if (t2
== noexcept_false_spec
)
1023 return !nothrow_spec_p (t1
);
1025 /* Otherwise, if we aren't looking for an exact match, noexcept is
1026 equivalent to throw(). */
1027 if (t1
== noexcept_true_spec
)
1028 t1
= empty_except_spec
;
1029 if (t2
== noexcept_true_spec
)
1030 t2
= empty_except_spec
;
1033 /* If any noexcept is left, it is only comparable to itself;
1034 either we're looking for an exact match or we're redeclaring a
1035 template with dependent noexcept. */
1036 if ((t1
&& TREE_PURPOSE (t1
))
1037 || (t2
&& TREE_PURPOSE (t2
)))
1039 && cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)));
1041 if (t1
== NULL_TREE
) /* T1 is ... */
1042 return t2
== NULL_TREE
|| exact
== ce_derived
;
1043 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1044 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1045 if (t2
== NULL_TREE
) /* T2 is ... */
1047 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1048 return exact
== ce_derived
;
1050 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1051 Count how many we find, to determine exactness. For exact matching and
1052 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1054 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1056 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1058 tree a
= TREE_VALUE (probe
);
1059 tree b
= TREE_VALUE (t2
);
1061 if (comp_except_types (a
, b
, exact
))
1063 if (probe
== base
&& exact
> ce_derived
)
1064 base
= TREE_CHAIN (probe
);
1069 if (probe
== NULL_TREE
)
1072 return exact
== ce_derived
|| base
== NULL_TREE
|| length
== list_length (t1
);
1075 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1076 [] can match [size]. */
1079 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1088 /* The type of the array elements must be the same. */
1089 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1092 d1
= TYPE_DOMAIN (t1
);
1093 d2
= TYPE_DOMAIN (t2
);
1098 /* If one of the arrays is dimensionless, and the other has a
1099 dimension, they are of different types. However, it is valid to
1107 declarations for an array object can specify
1108 array types that differ by the presence or absence of a major
1109 array bound (_dcl.array_). */
1111 return allow_redeclaration
;
1113 /* Check that the dimensions are the same. */
1115 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1117 max1
= TYPE_MAX_VALUE (d1
);
1118 max2
= TYPE_MAX_VALUE (d2
);
1119 if (processing_template_decl
&& !abi_version_at_least (2)
1120 && !value_dependent_expression_p (max1
)
1121 && !value_dependent_expression_p (max2
))
1123 /* With abi-1 we do not fold non-dependent array bounds, (and
1124 consequently mangle them incorrectly). We must therefore
1125 fold them here, to verify the domains have the same
1131 if (!cp_tree_equal (max1
, max2
))
1137 /* Compare the relative position of T1 and T2 into their respective
1138 template parameter list.
1139 T1 and T2 must be template parameter types.
1140 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1143 comp_template_parms_position (tree t1
, tree t2
)
1145 tree index1
, index2
;
1146 gcc_assert (t1
&& t2
1147 && TREE_CODE (t1
) == TREE_CODE (t2
)
1148 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1149 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1150 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1152 index1
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t1
));
1153 index2
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t2
));
1155 /* If T1 and T2 belong to template parm lists of different size,
1156 let's assume they are different. */
1157 if (TEMPLATE_PARM_NUM_SIBLINGS (index1
)
1158 != TEMPLATE_PARM_NUM_SIBLINGS (index2
))
1161 /* Then compare their relative position. */
1162 if (TEMPLATE_PARM_IDX (index1
) != TEMPLATE_PARM_IDX (index2
)
1163 || TEMPLATE_PARM_LEVEL (index1
) != TEMPLATE_PARM_LEVEL (index2
)
1164 || (TEMPLATE_PARM_PARAMETER_PACK (index1
)
1165 != TEMPLATE_PARM_PARAMETER_PACK (index2
)))
1171 /* Subroutine in comptypes. */
1174 structural_comptypes (tree t1
, tree t2
, int strict
)
1179 /* Suppress errors caused by previously reported errors. */
1180 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1183 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1185 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1186 current instantiation. */
1187 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1188 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1190 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1191 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1193 if (TYPE_PTRMEMFUNC_P (t1
))
1194 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1195 if (TYPE_PTRMEMFUNC_P (t2
))
1196 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1198 /* Different classes of types can't be compatible. */
1199 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1202 /* Qualifiers must match. For array types, we will check when we
1203 recur on the array element types. */
1204 if (TREE_CODE (t1
) != ARRAY_TYPE
1205 && cp_type_quals (t1
) != cp_type_quals (t2
))
1207 if (TREE_CODE (t1
) == FUNCTION_TYPE
1208 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1210 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1213 /* Allow for two different type nodes which have essentially the same
1214 definition. Note that we already checked for equality of the type
1215 qualifiers (just above). */
1217 if (TREE_CODE (t1
) != ARRAY_TYPE
1218 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1222 /* Compare the types. Break out if they could be the same. */
1223 switch (TREE_CODE (t1
))
1227 /* All void and bool types are the same. */
1231 case FIXED_POINT_TYPE
:
1233 /* With these nodes, we can't determine type equivalence by
1234 looking at what is stored in the nodes themselves, because
1235 two nodes might have different TYPE_MAIN_VARIANTs but still
1236 represent the same type. For example, wchar_t and int could
1237 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1238 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1239 and are distinct types. On the other hand, int and the
1242 typedef int INT __attribute((may_alias));
1244 have identical properties, different TYPE_MAIN_VARIANTs, but
1245 represent the same type. The canonical type system keeps
1246 track of equivalence in this case, so we fall back on it. */
1247 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1249 case TEMPLATE_TEMPLATE_PARM
:
1250 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1251 if (!comp_template_parms_position (t1
, t2
))
1253 if (!comp_template_parms
1254 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1255 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1257 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1259 /* Don't check inheritance. */
1260 strict
= COMPARE_STRICT
;
1265 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1266 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1267 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1268 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1271 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1273 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1279 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1280 strict
& ~COMPARE_REDECLARATION
))
1282 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1286 case REFERENCE_TYPE
:
1287 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1289 /* fall through to checks for pointer types */
1292 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1293 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
)
1294 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1300 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1302 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1307 /* Target types must match incl. qualifiers. */
1308 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1312 case TEMPLATE_TYPE_PARM
:
1313 /* If T1 and T2 don't have the same relative position in their
1314 template parameters set, they can't be equal. */
1315 if (!comp_template_parms_position (t1
, t2
))
1320 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1321 TYPENAME_TYPE_FULLNAME (t2
)))
1323 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1327 case UNBOUND_CLASS_TEMPLATE
:
1328 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1330 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1335 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1340 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1341 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1345 case TYPE_PACK_EXPANSION
:
1346 return same_type_p (PACK_EXPANSION_PATTERN (t1
),
1347 PACK_EXPANSION_PATTERN (t2
));
1350 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1351 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1352 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1353 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1354 || (DECLTYPE_FOR_LAMBDA_RETURN (t1
)
1355 != DECLTYPE_FOR_LAMBDA_RETURN (t2
))
1356 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1357 DECLTYPE_TYPE_EXPR (t2
)))
1365 /* If we get here, we know that from a target independent POV the
1366 types are the same. Make sure the target attributes are also
1368 return targetm
.comp_type_attributes (t1
, t2
);
1371 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1372 is a bitwise-or of the COMPARE_* flags. */
1375 comptypes (tree t1
, tree t2
, int strict
)
1377 if (strict
== COMPARE_STRICT
)
1382 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1385 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1386 /* At least one of the types requires structural equality, so
1387 perform a deep check. */
1388 return structural_comptypes (t1
, t2
, strict
);
1390 #ifdef ENABLE_CHECKING
1391 if (USE_CANONICAL_TYPES
)
1393 bool result
= structural_comptypes (t1
, t2
, strict
);
1395 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1396 /* The two types are structurally equivalent, but their
1397 canonical types were different. This is a failure of the
1398 canonical type propagation code.*/
1400 ("canonical types differ for identical types %T and %T",
1402 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1403 /* Two types are structurally different, but the canonical
1404 types are the same. This means we were over-eager in
1405 assigning canonical types. */
1407 ("same canonical type node for different types %T and %T",
1413 if (USE_CANONICAL_TYPES
)
1414 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1417 return structural_comptypes (t1
, t2
, strict
);
1419 else if (strict
== COMPARE_STRUCTURAL
)
1420 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1422 return structural_comptypes (t1
, t2
, strict
);
1425 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1426 top-level qualifiers. */
1429 same_type_ignoring_top_level_qualifiers_p (tree type1
, tree type2
)
1431 if (type1
== error_mark_node
|| type2
== error_mark_node
)
1434 return same_type_p (TYPE_MAIN_VARIANT (type1
), TYPE_MAIN_VARIANT (type2
));
1437 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1440 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1442 int q1
= cp_type_quals (type1
);
1443 int q2
= cp_type_quals (type2
);
1445 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1446 return (q1
& q2
) == q2
;
1449 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1450 more cv-qualified that TYPE1, and 0 otherwise. */
1453 comp_cv_qualification (const_tree type1
, const_tree type2
)
1455 int q1
= cp_type_quals (type1
);
1456 int q2
= cp_type_quals (type2
);
1461 if ((q1
& q2
) == q2
)
1463 else if ((q1
& q2
) == q1
)
1469 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1470 subset of the cv-qualification signature of TYPE2, and the types
1471 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1474 comp_cv_qual_signature (tree type1
, tree type2
)
1476 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1478 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1484 /* Subroutines of `comptypes'. */
1486 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1487 equivalent in the sense that functions with those parameter types
1488 can have equivalent types. The two lists must be equivalent,
1489 element by element. */
1492 compparms (const_tree parms1
, const_tree parms2
)
1496 /* An unspecified parmlist matches any specified parmlist
1497 whose argument types don't need default promotions. */
1499 for (t1
= parms1
, t2
= parms2
;
1501 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1503 /* If one parmlist is shorter than the other,
1504 they fail to match. */
1507 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1514 /* Process a sizeof or alignof expression where the operand is a
1518 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1523 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1524 if (type
== error_mark_node
)
1525 return error_mark_node
;
1527 type
= non_reference (type
);
1528 if (TREE_CODE (type
) == METHOD_TYPE
)
1531 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
1532 "invalid application of %qs to a member function",
1533 operator_name_info
[(int) op
].name
);
1534 value
= size_one_node
;
1537 dependent_p
= dependent_type_p (type
);
1539 complete_type (type
);
1541 /* VLA types will have a non-constant size. In the body of an
1542 uninstantiated template, we don't need to try to compute the
1543 value, because the sizeof expression is not an integral
1544 constant expression in that case. And, if we do try to
1545 compute the value, we'll likely end up with SAVE_EXPRs, which
1546 the template substitution machinery does not expect to see. */
1547 || (processing_template_decl
1548 && COMPLETE_TYPE_P (type
)
1549 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1551 value
= build_min (op
, size_type_node
, type
);
1552 TREE_READONLY (value
) = 1;
1556 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1561 /* Return the size of the type, without producing any warnings for
1562 types whose size cannot be taken. This routine should be used only
1563 in some other routine that has already produced a diagnostic about
1564 using the size of such a type. */
1566 cxx_sizeof_nowarn (tree type
)
1568 if (TREE_CODE (type
) == FUNCTION_TYPE
1569 || TREE_CODE (type
) == VOID_TYPE
1570 || TREE_CODE (type
) == ERROR_MARK
)
1571 return size_one_node
;
1572 else if (!COMPLETE_TYPE_P (type
))
1573 return size_zero_node
;
1575 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1578 /* Process a sizeof expression where the operand is an expression. */
1581 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1583 if (e
== error_mark_node
)
1584 return error_mark_node
;
1586 if (processing_template_decl
)
1588 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1589 TREE_SIDE_EFFECTS (e
) = 0;
1590 TREE_READONLY (e
) = 1;
1595 /* To get the size of a static data member declared as an array of
1596 unknown bound, we need to instantiate it. */
1597 if (TREE_CODE (e
) == VAR_DECL
1598 && VAR_HAD_UNKNOWN_BOUND (e
)
1599 && DECL_TEMPLATE_INSTANTIATION (e
))
1600 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1602 e
= mark_type_use (e
);
1604 if (TREE_CODE (e
) == COMPONENT_REF
1605 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1606 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1608 if (complain
& tf_error
)
1609 error ("invalid application of %<sizeof%> to a bit-field");
1611 return error_mark_node
;
1614 else if (is_overloaded_fn (e
))
1616 if (complain
& tf_error
)
1617 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1620 return error_mark_node
;
1623 else if (type_unknown_p (e
))
1625 if (complain
& tf_error
)
1626 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1628 return error_mark_node
;
1634 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1637 /* Implement the __alignof keyword: Return the minimum required
1638 alignment of E, measured in bytes. For VAR_DECL's and
1639 FIELD_DECL's return DECL_ALIGN (which can be set from an
1640 "aligned" __attribute__ specification). */
1643 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1647 if (e
== error_mark_node
)
1648 return error_mark_node
;
1650 if (processing_template_decl
)
1652 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1653 TREE_SIDE_EFFECTS (e
) = 0;
1654 TREE_READONLY (e
) = 1;
1659 e
= mark_type_use (e
);
1661 if (TREE_CODE (e
) == VAR_DECL
)
1662 t
= size_int (DECL_ALIGN_UNIT (e
));
1663 else if (TREE_CODE (e
) == COMPONENT_REF
1664 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1665 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1667 if (complain
& tf_error
)
1668 error ("invalid application of %<__alignof%> to a bit-field");
1670 return error_mark_node
;
1673 else if (TREE_CODE (e
) == COMPONENT_REF
1674 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1675 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1676 else if (is_overloaded_fn (e
))
1678 if (complain
& tf_error
)
1679 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1682 return error_mark_node
;
1683 if (TREE_CODE (e
) == FUNCTION_DECL
)
1684 t
= size_int (DECL_ALIGN_UNIT (e
));
1688 else if (type_unknown_p (e
))
1690 if (complain
& tf_error
)
1691 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1693 return error_mark_node
;
1697 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1698 complain
& tf_error
);
1700 return fold_convert (size_type_node
, t
);
1703 /* Process a sizeof or alignof expression E with code OP where the operand
1704 is an expression. */
1707 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1709 if (op
== SIZEOF_EXPR
)
1710 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1712 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1715 /* EXPR is being used in a context that is not a function call.
1720 The expression can be used only as the left-hand operand of a
1721 member function call.
1723 [expr.mptr.operator]
1725 If the result of .* or ->* is a function, then that result can be
1726 used only as the operand for the function call operator ().
1728 by issuing an error message if appropriate. Returns true iff EXPR
1729 violates these rules. */
1732 invalid_nonstatic_memfn_p (const_tree expr
, tsubst_flags_t complain
)
1734 if (expr
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1736 if (complain
& tf_error
)
1737 error ("invalid use of non-static member function");
1743 /* If EXP is a reference to a bitfield, and the type of EXP does not
1744 match the declared type of the bitfield, return the declared type
1745 of the bitfield. Otherwise, return NULL_TREE. */
1748 is_bitfield_expr_with_lowered_type (const_tree exp
)
1750 switch (TREE_CODE (exp
))
1753 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1754 ? TREE_OPERAND (exp
, 1)
1755 : TREE_OPERAND (exp
, 0)))
1757 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1760 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1764 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1770 field
= TREE_OPERAND (exp
, 1);
1771 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1773 if (same_type_ignoring_top_level_qualifiers_p
1774 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1776 return DECL_BIT_FIELD_TYPE (field
);
1780 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1781 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1782 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1790 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1791 bitfield with a lowered type, the type of EXP is returned, rather
1795 unlowered_expr_type (const_tree exp
)
1799 type
= is_bitfield_expr_with_lowered_type (exp
);
1801 type
= TREE_TYPE (exp
);
1806 /* Perform the conversions in [expr] that apply when an lvalue appears
1807 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1808 function-to-pointer conversions. In addition, manifest constants
1809 are replaced by their values, and bitfield references are converted
1810 to their declared types. Note that this function does not perform the
1811 lvalue-to-rvalue conversion for class types. If you need that conversion
1812 to for class types, then you probably need to use force_rvalue.
1814 Although the returned value is being used as an rvalue, this
1815 function does not wrap the returned expression in a
1816 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1817 that the return value is no longer an lvalue. */
1820 decay_conversion (tree exp
)
1823 enum tree_code code
;
1825 type
= TREE_TYPE (exp
);
1826 if (type
== error_mark_node
)
1827 return error_mark_node
;
1829 exp
= mark_rvalue_use (exp
);
1831 exp
= resolve_nondeduced_context (exp
);
1832 if (type_unknown_p (exp
))
1834 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1835 return error_mark_node
;
1838 /* FIXME remove? at least need to remember that this isn't really a
1839 constant expression if EXP isn't decl_constant_var_p, like with
1840 C_MAYBE_CONST_EXPR. */
1841 exp
= decl_constant_value (exp
);
1842 if (error_operand_p (exp
))
1843 return error_mark_node
;
1845 if (NULLPTR_TYPE_P (type
))
1846 return nullptr_node
;
1848 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1849 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1850 code
= TREE_CODE (type
);
1851 if (code
== VOID_TYPE
)
1853 error ("void value not ignored as it ought to be");
1854 return error_mark_node
;
1856 if (invalid_nonstatic_memfn_p (exp
, tf_warning_or_error
))
1857 return error_mark_node
;
1858 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1859 return cp_build_addr_expr (exp
, tf_warning_or_error
);
1860 if (code
== ARRAY_TYPE
)
1865 if (TREE_CODE (exp
) == INDIRECT_REF
)
1866 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1867 TREE_OPERAND (exp
, 0));
1869 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1871 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1872 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1873 TREE_OPERAND (exp
, 0), op1
);
1877 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1879 error ("invalid use of non-lvalue array");
1880 return error_mark_node
;
1883 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1885 if (TREE_CODE (exp
) == VAR_DECL
)
1887 if (!cxx_mark_addressable (exp
))
1888 return error_mark_node
;
1889 adr
= build_nop (ptrtype
, build_address (exp
));
1892 /* This way is better for a COMPONENT_REF since it can
1893 simplify the offset for a component. */
1894 adr
= cp_build_addr_expr (exp
, tf_warning_or_error
);
1895 return cp_convert (ptrtype
, adr
);
1898 /* If a bitfield is used in a context where integral promotion
1899 applies, then the caller is expected to have used
1900 default_conversion. That function promotes bitfields correctly
1901 before calling this function. At this point, if we have a
1902 bitfield referenced, we may assume that is not subject to
1903 promotion, and that, therefore, the type of the resulting rvalue
1904 is the declared type of the bitfield. */
1905 exp
= convert_bitfield_to_declared_type (exp
);
1907 /* We do not call rvalue() here because we do not want to wrap EXP
1908 in a NON_LVALUE_EXPR. */
1912 Non-class rvalues always have cv-unqualified types. */
1913 type
= TREE_TYPE (exp
);
1914 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
1915 exp
= build_nop (cv_unqualified (type
), exp
);
1920 /* Perform preparatory conversions, as part of the "usual arithmetic
1921 conversions". In particular, as per [expr]:
1923 Whenever an lvalue expression appears as an operand of an
1924 operator that expects the rvalue for that operand, the
1925 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1926 standard conversions are applied to convert the expression to an
1929 In addition, we perform integral promotions here, as those are
1930 applied to both operands to a binary operator before determining
1931 what additional conversions should apply. */
1934 default_conversion (tree exp
)
1936 /* Check for target-specific promotions. */
1937 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
1939 exp
= cp_convert (promoted_type
, exp
);
1940 /* Perform the integral promotions first so that bitfield
1941 expressions (which may promote to "int", even if the bitfield is
1942 declared "unsigned") are promoted correctly. */
1943 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
1944 exp
= perform_integral_promotions (exp
);
1945 /* Perform the other conversions. */
1946 exp
= decay_conversion (exp
);
1951 /* EXPR is an expression with an integral or enumeration type.
1952 Perform the integral promotions in [conv.prom], and return the
1956 perform_integral_promotions (tree expr
)
1961 expr
= mark_rvalue_use (expr
);
1965 If the bitfield has an enumerated type, it is treated as any
1966 other value of that type for promotion purposes. */
1967 type
= is_bitfield_expr_with_lowered_type (expr
);
1968 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
1969 type
= TREE_TYPE (expr
);
1970 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
1971 promoted_type
= type_promotes_to (type
);
1972 if (type
!= promoted_type
)
1973 expr
= cp_convert (promoted_type
, expr
);
1977 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1978 decay_conversion to one. */
1981 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
1985 if (TREE_CODE (totype
) != POINTER_TYPE
)
1988 t
= TREE_TYPE (totype
);
1989 if (!same_type_p (t
, char_type_node
)
1990 && !same_type_p (t
, char16_type_node
)
1991 && !same_type_p (t
, char32_type_node
)
1992 && !same_type_p (t
, wchar_type_node
))
1995 if (TREE_CODE (exp
) == STRING_CST
)
1997 /* Make sure that we don't try to convert between char and wide chars. */
1998 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
2003 /* Is this a string constant which has decayed to 'const char *'? */
2004 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
2005 if (!same_type_p (TREE_TYPE (exp
), t
))
2008 if (TREE_CODE (exp
) != ADDR_EXPR
2009 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2013 /* This warning is not very useful, as it complains about printf. */
2015 warning (OPT_Wwrite_strings
,
2016 "deprecated conversion from string constant to %qT",
2022 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2023 can, for example, use as an lvalue. This code used to be in
2024 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2025 expressions, where we're dealing with aggregates. But now it's again only
2026 called from unary_complex_lvalue. The case (in particular) that led to
2027 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2031 rationalize_conditional_expr (enum tree_code code
, tree t
,
2032 tsubst_flags_t complain
)
2034 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2035 the first operand is always the one to be used if both operands
2036 are equal, so we know what conditional expression this used to be. */
2037 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2039 tree op0
= TREE_OPERAND (t
, 0);
2040 tree op1
= TREE_OPERAND (t
, 1);
2042 /* The following code is incorrect if either operand side-effects. */
2043 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2044 && !TREE_SIDE_EFFECTS (op1
));
2046 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
2047 ? LE_EXPR
: GE_EXPR
),
2048 op0
, TREE_CODE (op0
),
2049 op1
, TREE_CODE (op1
),
2050 /*overloaded_p=*/NULL
,
2052 cp_build_unary_op (code
, op0
, 0, complain
),
2053 cp_build_unary_op (code
, op1
, 0, complain
),
2058 build_conditional_expr (TREE_OPERAND (t
, 0),
2059 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2061 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2066 /* Given the TYPE of an anonymous union field inside T, return the
2067 FIELD_DECL for the field. If not found return NULL_TREE. Because
2068 anonymous unions can nest, we must also search all anonymous unions
2069 that are directly reachable. */
2072 lookup_anon_field (tree t
, tree type
)
2076 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2078 if (TREE_STATIC (field
))
2080 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2083 /* If we find it directly, return the field. */
2084 if (DECL_NAME (field
) == NULL_TREE
2085 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2090 /* Otherwise, it could be nested, search harder. */
2091 if (DECL_NAME (field
) == NULL_TREE
2092 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2094 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2102 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2103 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2104 non-NULL, it indicates the path to the base used to name MEMBER.
2105 If PRESERVE_REFERENCE is true, the expression returned will have
2106 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2107 returned will have the type referred to by the reference.
2109 This function does not perform access control; that is either done
2110 earlier by the parser when the name of MEMBER is resolved to MEMBER
2111 itself, or later when overload resolution selects one of the
2112 functions indicated by MEMBER. */
2115 build_class_member_access_expr (tree object
, tree member
,
2116 tree access_path
, bool preserve_reference
,
2117 tsubst_flags_t complain
)
2121 tree result
= NULL_TREE
;
2123 if (error_operand_p (object
) || error_operand_p (member
))
2124 return error_mark_node
;
2126 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2130 The type of the first expression shall be "class object" (of a
2132 object_type
= TREE_TYPE (object
);
2133 if (!currently_open_class (object_type
)
2134 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2135 return error_mark_node
;
2136 if (!CLASS_TYPE_P (object_type
))
2138 if (complain
& tf_error
)
2139 error ("request for member %qD in %qE, which is of non-class type %qT",
2140 member
, object
, object_type
);
2141 return error_mark_node
;
2144 /* The standard does not seem to actually say that MEMBER must be a
2145 member of OBJECT_TYPE. However, that is clearly what is
2147 if (DECL_P (member
))
2149 member_scope
= DECL_CLASS_CONTEXT (member
);
2151 if (TREE_DEPRECATED (member
))
2152 warn_deprecated_use (member
, NULL_TREE
);
2155 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2156 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2157 presently be the anonymous union. Go outwards until we find a
2158 type related to OBJECT_TYPE. */
2159 while (ANON_AGGR_TYPE_P (member_scope
)
2160 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2162 member_scope
= TYPE_CONTEXT (member_scope
);
2163 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2165 if (complain
& tf_error
)
2167 if (TREE_CODE (member
) == FIELD_DECL
)
2168 error ("invalid use of nonstatic data member %qE", member
);
2170 error ("%qD is not a member of %qT", member
, object_type
);
2172 return error_mark_node
;
2175 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2176 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2177 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2179 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2181 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2184 /* In [expr.ref], there is an explicit list of the valid choices for
2185 MEMBER. We check for each of those cases here. */
2186 if (TREE_CODE (member
) == VAR_DECL
)
2188 /* A static data member. */
2190 mark_exp_read (object
);
2191 /* If OBJECT has side-effects, they are supposed to occur. */
2192 if (TREE_SIDE_EFFECTS (object
))
2193 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2195 else if (TREE_CODE (member
) == FIELD_DECL
)
2197 /* A non-static data member. */
2202 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
2203 && integer_zerop (TREE_OPERAND (object
, 0)));
2205 /* Convert OBJECT to the type of MEMBER. */
2206 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2207 TYPE_MAIN_VARIANT (member_scope
)))
2212 binfo
= lookup_base (access_path
? access_path
: object_type
,
2213 member_scope
, ba_unique
, &kind
);
2214 if (binfo
== error_mark_node
)
2215 return error_mark_node
;
2217 /* It is invalid to try to get to a virtual base of a
2218 NULL object. The most common cause is invalid use of
2220 if (null_object_p
&& kind
== bk_via_virtual
)
2222 if (complain
& tf_error
)
2224 error ("invalid access to non-static data member %qD of "
2227 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2229 return error_mark_node
;
2232 /* Convert to the base. */
2233 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2235 /* If we found the base successfully then we should be able
2236 to convert to it successfully. */
2237 gcc_assert (object
!= error_mark_node
);
2240 /* Complain about other invalid uses of offsetof, even though they will
2241 give the right answer. Note that we complain whether or not they
2242 actually used the offsetof macro, since there's no way to know at this
2243 point. So we just give a warning, instead of a pedwarn. */
2244 /* Do not produce this warning for base class field references, because
2245 we know for a fact that didn't come from offsetof. This does occur
2246 in various testsuite cases where a null object is passed where a
2247 vtable access is required. */
2248 if (null_object_p
&& warn_invalid_offsetof
2249 && CLASSTYPE_NON_STD_LAYOUT (object_type
)
2250 && !DECL_FIELD_IS_BASE (member
)
2251 && cp_unevaluated_operand
== 0
2252 && (complain
& tf_warning
))
2254 warning (OPT_Winvalid_offsetof
,
2255 "invalid access to non-static data member %qD "
2256 " of NULL object", member
);
2257 warning (OPT_Winvalid_offsetof
,
2258 "(perhaps the %<offsetof%> macro was used incorrectly)");
2261 /* If MEMBER is from an anonymous aggregate, we have converted
2262 OBJECT so that it refers to the class containing the
2263 anonymous union. Generate a reference to the anonymous union
2264 itself, and recur to find MEMBER. */
2265 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2266 /* When this code is called from build_field_call, the
2267 object already has the type of the anonymous union.
2268 That is because the COMPONENT_REF was already
2269 constructed, and was then disassembled before calling
2270 build_field_call. After the function-call code is
2271 cleaned up, this waste can be eliminated. */
2272 && (!same_type_ignoring_top_level_qualifiers_p
2273 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2275 tree anonymous_union
;
2277 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2278 DECL_CONTEXT (member
));
2279 object
= build_class_member_access_expr (object
,
2281 /*access_path=*/NULL_TREE
,
2286 /* Compute the type of the field, as described in [expr.ref]. */
2287 type_quals
= TYPE_UNQUALIFIED
;
2288 member_type
= TREE_TYPE (member
);
2289 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2291 type_quals
= (cp_type_quals (member_type
)
2292 | cp_type_quals (object_type
));
2294 /* A field is const (volatile) if the enclosing object, or the
2295 field itself, is const (volatile). But, a mutable field is
2296 not const, even within a const object. */
2297 if (DECL_MUTABLE_P (member
))
2298 type_quals
&= ~TYPE_QUAL_CONST
;
2299 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2302 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
2304 result
= fold_if_not_in_template (result
);
2306 /* Mark the expression const or volatile, as appropriate. Even
2307 though we've dealt with the type above, we still have to mark the
2308 expression itself. */
2309 if (type_quals
& TYPE_QUAL_CONST
)
2310 TREE_READONLY (result
) = 1;
2311 if (type_quals
& TYPE_QUAL_VOLATILE
)
2312 TREE_THIS_VOLATILE (result
) = 1;
2314 else if (BASELINK_P (member
))
2316 /* The member is a (possibly overloaded) member function. */
2320 /* If the MEMBER is exactly one static member function, then we
2321 know the type of the expression. Otherwise, we must wait
2322 until overload resolution has been performed. */
2323 functions
= BASELINK_FUNCTIONS (member
);
2324 if (TREE_CODE (functions
) == FUNCTION_DECL
2325 && DECL_STATIC_FUNCTION_P (functions
))
2326 type
= TREE_TYPE (functions
);
2328 type
= unknown_type_node
;
2329 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2330 base. That will happen when the function is called. */
2331 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2333 else if (TREE_CODE (member
) == CONST_DECL
)
2335 /* The member is an enumerator. */
2337 /* If OBJECT has side-effects, they are supposed to occur. */
2338 if (TREE_SIDE_EFFECTS (object
))
2339 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2344 if (complain
& tf_error
)
2345 error ("invalid use of %qD", member
);
2346 return error_mark_node
;
2349 if (!preserve_reference
)
2352 If E2 is declared to have type "reference to T", then ... the
2353 type of E1.E2 is T. */
2354 result
= convert_from_reference (result
);
2359 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2360 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2363 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2365 tree object_type
= TREE_TYPE (object
);
2366 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2369 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2371 error ("qualified type %qT does not match destructor name ~%qT",
2373 return error_mark_node
;
2375 if (TREE_CODE (dtor_type
) == IDENTIFIER_NODE
)
2377 /* In a template, names we can't find a match for are still accepted
2378 destructor names, and we check them here. */
2379 if (check_dtor_name (object_type
, dtor_type
))
2380 dtor_type
= object_type
;
2383 error ("object type %qT does not match destructor name ~%qT",
2384 object_type
, dtor_type
);
2385 return error_mark_node
;
2389 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2391 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2392 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2393 return error_mark_node
;
2395 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2396 /*protect=*/1, /*want_type=*/false);
2397 expr
= (adjust_result_of_qualified_name_lookup
2398 (expr
, dtor_type
, object_type
));
2402 /* An expression of the form "A::template B" has been resolved to
2403 DECL. Issue a diagnostic if B is not a template or template
2407 check_template_keyword (tree decl
)
2409 /* The standard says:
2413 If a name prefixed by the keyword template is not a member
2414 template, the program is ill-formed.
2416 DR 228 removed the restriction that the template be a member
2419 DR 96, if accepted would add the further restriction that explicit
2420 template arguments must be provided if the template keyword is
2421 used, but, as of 2005-10-16, that DR is still in "drafting". If
2422 this DR is accepted, then the semantic checks here can be
2423 simplified, as the entity named must in fact be a template
2424 specialization, rather than, as at present, a set of overloaded
2425 functions containing at least one template function. */
2426 if (TREE_CODE (decl
) != TEMPLATE_DECL
2427 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2429 if (!is_overloaded_fn (decl
))
2430 permerror (input_location
, "%qD is not a template", decl
);
2435 if (BASELINK_P (fns
))
2436 fns
= BASELINK_FUNCTIONS (fns
);
2439 tree fn
= OVL_CURRENT (fns
);
2440 if (TREE_CODE (fn
) == TEMPLATE_DECL
2441 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2443 if (TREE_CODE (fn
) == FUNCTION_DECL
2444 && DECL_USE_TEMPLATE (fn
)
2445 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2447 fns
= OVL_NEXT (fns
);
2450 permerror (input_location
, "%qD is not a template", decl
);
2455 /* This function is called by the parser to process a class member
2456 access expression of the form OBJECT.NAME. NAME is a node used by
2457 the parser to represent a name; it is not yet a DECL. It may,
2458 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2459 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2460 there is no reason to do the lookup twice, so the parser keeps the
2461 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2462 be a template via the use of the "A::template B" syntax. */
2465 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2466 tsubst_flags_t complain
)
2471 tree access_path
= NULL_TREE
;
2472 tree orig_object
= object
;
2473 tree orig_name
= name
;
2475 if (object
== error_mark_node
|| name
== error_mark_node
)
2476 return error_mark_node
;
2478 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2479 if (!objc_is_public (object
, name
))
2480 return error_mark_node
;
2482 object_type
= TREE_TYPE (object
);
2484 if (processing_template_decl
)
2486 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2487 dependent_type_p (object_type
)
2488 /* If NAME is just an IDENTIFIER_NODE, then the expression
2490 || TREE_CODE (object
) == IDENTIFIER_NODE
2491 /* If NAME is "f<args>", where either 'f' or 'args' is
2492 dependent, then the expression is dependent. */
2493 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2494 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2495 TREE_OPERAND (name
, 1)))
2496 /* If NAME is "T::X" where "T" is dependent, then the
2497 expression is dependent. */
2498 || (TREE_CODE (name
) == SCOPE_REF
2499 && TYPE_P (TREE_OPERAND (name
, 0))
2500 && dependent_type_p (TREE_OPERAND (name
, 0))))
2501 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2502 object
= build_non_dependent_expr (object
);
2504 else if (c_dialect_objc ()
2505 && TREE_CODE (name
) == IDENTIFIER_NODE
2506 && (expr
= objc_maybe_build_component_ref (object
, name
)))
2511 The type of the first expression shall be "class object" (of a
2513 if (!currently_open_class (object_type
)
2514 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2515 return error_mark_node
;
2516 if (!CLASS_TYPE_P (object_type
))
2518 if (complain
& tf_error
)
2519 error ("request for member %qD in %qE, which is of non-class type %qT",
2520 name
, object
, object_type
);
2521 return error_mark_node
;
2524 if (BASELINK_P (name
))
2525 /* A member function that has already been looked up. */
2529 bool is_template_id
= false;
2530 tree template_args
= NULL_TREE
;
2533 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2535 is_template_id
= true;
2536 template_args
= TREE_OPERAND (name
, 1);
2537 name
= TREE_OPERAND (name
, 0);
2539 if (TREE_CODE (name
) == OVERLOAD
)
2540 name
= DECL_NAME (get_first_fn (name
));
2541 else if (DECL_P (name
))
2542 name
= DECL_NAME (name
);
2545 if (TREE_CODE (name
) == SCOPE_REF
)
2547 /* A qualified name. The qualifying class or namespace `S'
2548 has already been looked up; it is either a TYPE or a
2550 scope
= TREE_OPERAND (name
, 0);
2551 name
= TREE_OPERAND (name
, 1);
2553 /* If SCOPE is a namespace, then the qualified name does not
2554 name a member of OBJECT_TYPE. */
2555 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2557 if (complain
& tf_error
)
2558 error ("%<%D::%D%> is not a member of %qT",
2559 scope
, name
, object_type
);
2560 return error_mark_node
;
2563 gcc_assert (CLASS_TYPE_P (scope
));
2564 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2565 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2567 if (constructor_name_p (name
, scope
))
2569 if (complain
& tf_error
)
2570 error ("cannot call constructor %<%T::%D%> directly",
2572 return error_mark_node
;
2575 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2576 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2577 if (access_path
== error_mark_node
)
2578 return error_mark_node
;
2581 if (complain
& tf_error
)
2582 error ("%qT is not a base of %qT", scope
, object_type
);
2583 return error_mark_node
;
2589 access_path
= object_type
;
2592 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2593 member
= lookup_destructor (object
, scope
, name
);
2596 /* Look up the member. */
2597 member
= lookup_member (access_path
, name
, /*protect=*/1,
2598 /*want_type=*/false);
2599 if (member
== NULL_TREE
)
2601 if (complain
& tf_error
)
2602 error ("%qD has no member named %qE", object_type
, name
);
2603 return error_mark_node
;
2605 if (member
== error_mark_node
)
2606 return error_mark_node
;
2611 tree templ
= member
;
2613 if (BASELINK_P (templ
))
2614 templ
= lookup_template_function (templ
, template_args
);
2617 if (complain
& tf_error
)
2618 error ("%qD is not a member template function", name
);
2619 return error_mark_node
;
2624 if (TREE_DEPRECATED (member
))
2625 warn_deprecated_use (member
, NULL_TREE
);
2628 check_template_keyword (member
);
2630 expr
= build_class_member_access_expr (object
, member
, access_path
,
2631 /*preserve_reference=*/false,
2633 if (processing_template_decl
&& expr
!= error_mark_node
)
2635 if (BASELINK_P (member
))
2637 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2638 BASELINK_QUALIFIED_P (member
) = 1;
2641 return build_min_non_dep (COMPONENT_REF
, expr
,
2642 orig_object
, orig_name
,
2649 /* Return an expression for the MEMBER_NAME field in the internal
2650 representation of PTRMEM, a pointer-to-member function. (Each
2651 pointer-to-member function type gets its own RECORD_TYPE so it is
2652 more convenient to access the fields by name than by FIELD_DECL.)
2653 This routine converts the NAME to a FIELD_DECL and then creates the
2654 node for the complete expression. */
2657 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2663 /* This code is a stripped down version of
2664 build_class_member_access_expr. It does not work to use that
2665 routine directly because it expects the object to be of class
2667 ptrmem_type
= TREE_TYPE (ptrmem
);
2668 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2669 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2670 /*want_type=*/false);
2671 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2672 cp_type_quals (ptrmem_type
));
2673 return fold_build3_loc (input_location
,
2674 COMPONENT_REF
, member_type
,
2675 ptrmem
, member
, NULL_TREE
);
2678 /* Given an expression PTR for a pointer, return an expression
2679 for the value pointed to.
2680 ERRORSTRING is the name of the operator to appear in error messages.
2682 This function may need to overload OPERATOR_FNNAME.
2683 Must also handle REFERENCE_TYPEs for C++. */
2686 build_x_indirect_ref (tree expr
, ref_operator errorstring
,
2687 tsubst_flags_t complain
)
2689 tree orig_expr
= expr
;
2692 if (processing_template_decl
)
2694 /* Retain the type if we know the operand is a pointer so that
2695 describable_type doesn't make auto deduction break. */
2696 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2697 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2698 if (type_dependent_expression_p (expr
))
2699 return build_min_nt (INDIRECT_REF
, expr
);
2700 expr
= build_non_dependent_expr (expr
);
2703 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2704 NULL_TREE
, /*overloaded_p=*/NULL
, complain
);
2706 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2708 if (processing_template_decl
&& rval
!= error_mark_node
)
2709 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2714 /* Helper function called from c-common. */
2716 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2717 tree ptr
, ref_operator errorstring
)
2719 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2723 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2724 tsubst_flags_t complain
)
2728 if (ptr
== error_mark_node
)
2729 return error_mark_node
;
2731 if (ptr
== current_class_ptr
)
2732 return current_class_ref
;
2734 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2735 ? ptr
: decay_conversion (ptr
));
2736 type
= TREE_TYPE (pointer
);
2738 if (POINTER_TYPE_P (type
))
2742 If the type of the expression is "pointer to T," the type
2743 of the result is "T." */
2744 tree t
= TREE_TYPE (type
);
2746 if (CONVERT_EXPR_P (ptr
)
2747 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2749 /* If a warning is issued, mark it to avoid duplicates from
2750 the backend. This only needs to be done at
2751 warn_strict_aliasing > 2. */
2752 if (warn_strict_aliasing
> 2)
2753 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2754 type
, TREE_OPERAND (ptr
, 0)))
2755 TREE_NO_WARNING (ptr
) = 1;
2758 if (VOID_TYPE_P (t
))
2760 /* A pointer to incomplete type (other than cv void) can be
2761 dereferenced [expr.unary.op]/1 */
2762 if (complain
& tf_error
)
2763 error ("%qT is not a pointer-to-object type", type
);
2764 return error_mark_node
;
2766 else if (TREE_CODE (pointer
) == ADDR_EXPR
2767 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2768 /* The POINTER was something like `&x'. We simplify `*&x' to
2770 return TREE_OPERAND (pointer
, 0);
2773 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2775 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2776 so that we get the proper error message if the result is used
2777 to assign to. Also, &* is supposed to be a no-op. */
2778 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2779 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2780 TREE_SIDE_EFFECTS (ref
)
2781 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2785 else if (!(complain
& tf_error
))
2786 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2788 /* `pointer' won't be an error_mark_node if we were given a
2789 pointer to member, so it's cool to check for this here. */
2790 else if (TYPE_PTR_TO_MEMBER_P (type
))
2791 switch (errorstring
)
2793 case RO_ARRAY_INDEXING
:
2794 error ("invalid use of array indexing on pointer to member");
2797 error ("invalid use of unary %<*%> on pointer to member");
2799 case RO_IMPLICIT_CONVERSION
:
2800 error ("invalid use of implicit conversion on pointer to member");
2805 else if (pointer
!= error_mark_node
)
2806 switch (errorstring
)
2809 error ("invalid type argument");
2811 case RO_ARRAY_INDEXING
:
2812 error ("invalid type argument of array indexing");
2815 error ("invalid type argument of unary %<*%>");
2817 case RO_IMPLICIT_CONVERSION
:
2818 error ("invalid type argument of implicit conversion");
2823 return error_mark_node
;
2826 /* This handles expressions of the form "a[i]", which denotes
2829 This is logically equivalent in C to *(a+i), but we may do it differently.
2830 If A is a variable or a member, we generate a primitive ARRAY_REF.
2831 This avoids forcing the array out of registers, and can work on
2832 arrays that are not lvalues (for example, members of structures returned
2835 If INDEX is of some user-defined type, it must be converted to
2836 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2837 will inherit the type of the array, which will be some pointer type.
2839 LOC is the location to use in building the array reference. */
2842 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
2843 tsubst_flags_t complain
)
2849 if (complain
& tf_error
)
2850 error_at (loc
, "subscript missing in array reference");
2851 return error_mark_node
;
2854 if (TREE_TYPE (array
) == error_mark_node
2855 || TREE_TYPE (idx
) == error_mark_node
)
2856 return error_mark_node
;
2858 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2860 switch (TREE_CODE (array
))
2864 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2866 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2867 TREE_OPERAND (array
, 0), value
);
2868 SET_EXPR_LOCATION (ret
, loc
);
2873 ret
= build_conditional_expr
2874 (TREE_OPERAND (array
, 0),
2875 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2877 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
2879 tf_warning_or_error
);
2880 protected_set_expr_location (ret
, loc
);
2887 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2891 warn_array_subscript_with_type_char (idx
);
2893 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2895 if (complain
& tf_error
)
2896 error_at (loc
, "array subscript is not an integer");
2897 return error_mark_node
;
2900 /* Apply integral promotions *after* noticing character types.
2901 (It is unclear why we do these promotions -- the standard
2902 does not say that we should. In fact, the natural thing would
2903 seem to be to convert IDX to ptrdiff_t; we're performing
2904 pointer arithmetic.) */
2905 idx
= perform_integral_promotions (idx
);
2907 /* An array that is indexed by a non-constant
2908 cannot be stored in a register; we must be able to do
2909 address arithmetic on its address.
2910 Likewise an array of elements of variable size. */
2911 if (TREE_CODE (idx
) != INTEGER_CST
2912 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2913 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2916 if (!cxx_mark_addressable (array
))
2917 return error_mark_node
;
2920 /* An array that is indexed by a constant value which is not within
2921 the array bounds cannot be stored in a register either; because we
2922 would get a crash in store_bit_field/extract_bit_field when trying
2923 to access a non-existent part of the register. */
2924 if (TREE_CODE (idx
) == INTEGER_CST
2925 && TYPE_DOMAIN (TREE_TYPE (array
))
2926 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
2928 if (!cxx_mark_addressable (array
))
2929 return error_mark_node
;
2932 if (!lvalue_p (array
) && (complain
& tf_error
))
2933 pedwarn (loc
, OPT_pedantic
,
2934 "ISO C++ forbids subscripting non-lvalue array");
2936 /* Note in C++ it is valid to subscript a `register' array, since
2937 it is valid to take the address of something with that
2938 storage specification. */
2942 while (TREE_CODE (foo
) == COMPONENT_REF
)
2943 foo
= TREE_OPERAND (foo
, 0);
2944 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
)
2945 && (complain
& tf_warning
))
2946 warning_at (loc
, OPT_Wextra
,
2947 "subscripting array declared %<register%>");
2950 type
= TREE_TYPE (TREE_TYPE (array
));
2951 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
2952 /* Array ref is const/volatile if the array elements are
2953 or if the array is.. */
2954 TREE_READONLY (rval
)
2955 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
2956 TREE_SIDE_EFFECTS (rval
)
2957 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
2958 TREE_THIS_VOLATILE (rval
)
2959 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
2960 ret
= require_complete_type_sfinae (fold_if_not_in_template (rval
),
2962 protected_set_expr_location (ret
, loc
);
2967 tree ar
= default_conversion (array
);
2968 tree ind
= default_conversion (idx
);
2970 /* Put the integer in IND to simplify error checking. */
2971 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
2978 if (ar
== error_mark_node
)
2981 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
2983 if (complain
& tf_error
)
2984 error_at (loc
, "subscripted value is neither array nor pointer");
2985 return error_mark_node
;
2987 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
2989 if (complain
& tf_error
)
2990 error_at (loc
, "array subscript is not an integer");
2991 return error_mark_node
;
2994 warn_array_subscript_with_type_char (idx
);
2996 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
3001 protected_set_expr_location (ret
, loc
);
3006 /* Entry point for Obj-C++. */
3009 build_array_ref (location_t loc
, tree array
, tree idx
)
3011 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
3014 /* Resolve a pointer to member function. INSTANCE is the object
3015 instance to use, if the member points to a virtual member.
3017 This used to avoid checking for virtual functions if basetype
3018 has no virtual functions, according to an earlier ANSI draft.
3019 With the final ISO C++ rules, such an optimization is
3020 incorrect: A pointer to a derived member can be static_cast
3021 to pointer-to-base-member, as long as the dynamic object
3022 later has the right member. */
3025 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
3027 if (TREE_CODE (function
) == OFFSET_REF
)
3028 function
= TREE_OPERAND (function
, 1);
3030 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3032 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
3033 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3035 tree instance_ptr
= *instance_ptrptr
;
3036 tree instance_save_expr
= 0;
3037 if (instance_ptr
== error_mark_node
)
3039 if (TREE_CODE (function
) == PTRMEM_CST
)
3041 /* Extracting the function address from a pmf is only
3042 allowed with -Wno-pmf-conversions. It only works for
3044 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
3045 e1
= convert (fntype
, e1
);
3050 error ("object missing in use of %qE", function
);
3051 return error_mark_node
;
3055 if (TREE_SIDE_EFFECTS (instance_ptr
))
3056 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3058 if (TREE_SIDE_EFFECTS (function
))
3059 function
= save_expr (function
);
3061 /* Start by extracting all the information from the PMF itself. */
3062 e3
= pfn_from_ptrmemfunc (function
);
3063 delta
= delta_from_ptrmemfunc (function
);
3064 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3065 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3067 case ptrmemfunc_vbit_in_pfn
:
3068 e1
= cp_build_binary_op (input_location
,
3069 BIT_AND_EXPR
, idx
, integer_one_node
,
3070 tf_warning_or_error
);
3071 idx
= cp_build_binary_op (input_location
,
3072 MINUS_EXPR
, idx
, integer_one_node
,
3073 tf_warning_or_error
);
3076 case ptrmemfunc_vbit_in_delta
:
3077 e1
= cp_build_binary_op (input_location
,
3078 BIT_AND_EXPR
, delta
, integer_one_node
,
3079 tf_warning_or_error
);
3080 delta
= cp_build_binary_op (input_location
,
3081 RSHIFT_EXPR
, delta
, integer_one_node
,
3082 tf_warning_or_error
);
3089 /* Convert down to the right base before using the instance. A
3090 special case is that in a pointer to member of class C, C may
3091 be incomplete. In that case, the function will of course be
3092 a member of C, and no conversion is required. In fact,
3093 lookup_base will fail in that case, because incomplete
3094 classes do not have BINFOs. */
3095 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3096 if (!same_type_ignoring_top_level_qualifiers_p
3097 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3099 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3100 basetype
, ba_check
, NULL
);
3101 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3103 if (instance_ptr
== error_mark_node
)
3104 return error_mark_node
;
3106 /* ...and then the delta in the PMF. */
3107 instance_ptr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (instance_ptr
),
3108 instance_ptr
, fold_convert (sizetype
, delta
));
3110 /* Hand back the adjusted 'this' argument to our caller. */
3111 *instance_ptrptr
= instance_ptr
;
3113 /* Next extract the vtable pointer from the object. */
3114 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3116 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, tf_warning_or_error
);
3117 /* If the object is not dynamic the access invokes undefined
3118 behavior. As it is not executed in this case silence the
3119 spurious warnings it may provoke. */
3120 TREE_NO_WARNING (vtbl
) = 1;
3122 /* Finally, extract the function pointer from the vtable. */
3123 e2
= fold_build2_loc (input_location
,
3124 POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
,
3125 fold_convert (sizetype
, idx
));
3126 e2
= cp_build_indirect_ref (e2
, RO_NULL
, tf_warning_or_error
);
3127 TREE_CONSTANT (e2
) = 1;
3129 /* When using function descriptors, the address of the
3130 vtable entry is treated as a function pointer. */
3131 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3132 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3133 cp_build_addr_expr (e2
, tf_warning_or_error
));
3135 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3136 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
3138 /* Make sure this doesn't get evaluated first inside one of the
3139 branches of the COND_EXPR. */
3140 if (instance_save_expr
)
3141 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3142 instance_save_expr
, e1
);
3149 /* Used by the C-common bits. */
3151 build_function_call (location_t loc ATTRIBUTE_UNUSED
,
3152 tree function
, tree params
)
3154 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3157 /* Used by the C-common bits. */
3159 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED
,
3160 tree function
, VEC(tree
,gc
) *params
,
3161 VEC(tree
,gc
) *origtypes ATTRIBUTE_UNUSED
)
3163 VEC(tree
,gc
) *orig_params
= params
;
3164 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3165 tf_warning_or_error
);
3167 /* cp_build_function_call_vec can reallocate PARAMS by adding
3168 default arguments. That should never happen here. Verify
3170 gcc_assert (params
== orig_params
);
3175 /* Build a function call using a tree list of arguments. */
3178 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3183 vec
= make_tree_vector ();
3184 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3185 VEC_safe_push (tree
, gc
, vec
, TREE_VALUE (params
));
3186 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3187 release_tree_vector (vec
);
3191 /* Build a function call using varargs. */
3194 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3200 vec
= make_tree_vector ();
3201 va_start (args
, complain
);
3202 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3203 VEC_safe_push (tree
, gc
, vec
, t
);
3205 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3206 release_tree_vector (vec
);
3210 /* Build a function call using a vector of arguments. PARAMS may be
3211 NULL if there are no parameters. This changes the contents of
3215 cp_build_function_call_vec (tree function
, VEC(tree
,gc
) **params
,
3216 tsubst_flags_t complain
)
3218 tree fntype
, fndecl
;
3220 tree original
= function
;
3224 VEC(tree
,gc
) *allocated
= NULL
;
3227 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3228 expressions, like those used for ObjC messenger dispatches. */
3229 if (params
!= NULL
&& !VEC_empty (tree
, *params
))
3230 function
= objc_rewrite_function_call (function
,
3231 VEC_index (tree
, *params
, 0));
3233 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3234 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3235 if (TREE_CODE (function
) == NOP_EXPR
3236 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3237 function
= TREE_OPERAND (function
, 0);
3239 if (TREE_CODE (function
) == FUNCTION_DECL
)
3241 mark_used (function
);
3244 /* Convert anything with function type to a pointer-to-function. */
3245 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
3246 pedwarn (input_location
, OPT_pedantic
,
3247 "ISO C++ forbids calling %<::main%> from within program");
3249 function
= build_addr_func (function
);
3255 function
= build_addr_func (function
);
3258 if (function
== error_mark_node
)
3259 return error_mark_node
;
3261 fntype
= TREE_TYPE (function
);
3263 if (TYPE_PTRMEMFUNC_P (fntype
))
3265 if (complain
& tf_error
)
3266 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3267 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3268 original
, original
);
3269 return error_mark_node
;
3272 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
3273 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3275 if (!((TREE_CODE (fntype
) == POINTER_TYPE
3276 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
3278 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3280 if (complain
& tf_error
)
3281 error ("%qE cannot be used as a function", original
);
3282 return error_mark_node
;
3285 /* fntype now gets the type of function pointed to. */
3286 fntype
= TREE_TYPE (fntype
);
3287 parm_types
= TYPE_ARG_TYPES (fntype
);
3291 allocated
= make_tree_vector ();
3292 params
= &allocated
;
3295 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3298 return error_mark_node
;
3300 argarray
= VEC_address (tree
, *params
);
3302 /* Check for errors in format strings and inappropriately
3304 check_function_arguments (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
,
3307 ret
= build_cxx_call (function
, nargs
, argarray
);
3309 if (allocated
!= NULL
)
3310 release_tree_vector (allocated
);
3315 /* Subroutine of convert_arguments.
3316 Warn about wrong number of args are genereted. */
3319 warn_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3323 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3325 if (DECL_NAME (fndecl
) == NULL_TREE
3326 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3329 ? G_("too many arguments to constructor %q#D")
3330 : G_("too few arguments to constructor %q#D"),
3335 ? G_("too many arguments to member function %q#D")
3336 : G_("too few arguments to member function %q#D"),
3342 ? G_("too many arguments to function %q#D")
3343 : G_("too few arguments to function %q#D"),
3345 inform (DECL_SOURCE_LOCATION (fndecl
),
3350 if (c_dialect_objc () && objc_message_selector ())
3353 ? G_("too many arguments to method %q#D")
3354 : G_("too few arguments to method %q#D"),
3355 objc_message_selector ());
3357 error_at (loc
, too_many_p
? G_("too many arguments to function")
3358 : G_("too few arguments to function"));
3362 /* Convert the actual parameter expressions in the list VALUES to the
3363 types in the list TYPELIST. The converted expressions are stored
3364 back in the VALUES vector.
3365 If parmdecls is exhausted, or when an element has NULL as its type,
3366 perform the default conversions.
3368 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3370 This is also where warnings about wrong number of args are generated.
3372 Returns the actual number of arguments processed (which might be less
3373 than the length of the vector), or -1 on error.
3375 In C++, unspecified trailing parameters can be filled in with their
3376 default arguments, if such were specified. Do so here. */
3379 convert_arguments (tree typelist
, VEC(tree
,gc
) **values
, tree fndecl
,
3380 int flags
, tsubst_flags_t complain
)
3385 /* Argument passing is always copy-initialization. */
3386 flags
|= LOOKUP_ONLYCONVERTING
;
3388 for (i
= 0, typetail
= typelist
;
3389 i
< VEC_length (tree
, *values
);
3392 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3393 tree val
= VEC_index (tree
, *values
, i
);
3395 if (val
== error_mark_node
|| type
== error_mark_node
)
3398 if (type
== void_type_node
)
3400 if (complain
& tf_error
)
3402 warn_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3409 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3410 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3411 if (TREE_CODE (val
) == NOP_EXPR
3412 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3413 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3414 val
= TREE_OPERAND (val
, 0);
3416 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3418 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3419 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3420 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3421 val
= decay_conversion (val
);
3424 if (val
== error_mark_node
)
3429 /* Formal parm type is specified by a function prototype. */
3432 if (!COMPLETE_TYPE_P (complete_type (type
)))
3434 if (complain
& tf_error
)
3437 error ("parameter %P of %qD has incomplete type %qT",
3440 error ("parameter %P has incomplete type %qT", i
, type
);
3442 parmval
= error_mark_node
;
3446 parmval
= convert_for_initialization
3447 (NULL_TREE
, type
, val
, flags
,
3448 ICR_ARGPASS
, fndecl
, i
, complain
);
3449 parmval
= convert_for_arg_passing (type
, parmval
);
3452 if (parmval
== error_mark_node
)
3455 VEC_replace (tree
, *values
, i
, parmval
);
3459 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3460 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3461 /* Don't do ellipsis conversion for __built_in_constant_p
3462 as this will result in spurious errors for non-trivial
3464 val
= require_complete_type_sfinae (val
, complain
);
3466 val
= convert_arg_to_ellipsis (val
);
3468 VEC_replace (tree
, *values
, i
, val
);
3472 typetail
= TREE_CHAIN (typetail
);
3475 if (typetail
!= 0 && typetail
!= void_list_node
)
3477 /* See if there are default arguments that can be used. Because
3478 we hold default arguments in the FUNCTION_TYPE (which is so
3479 wrong), we can see default parameters here from deduced
3480 contexts (and via typeof) for indirect function calls.
3481 Fortunately we know whether we have a function decl to
3482 provide default arguments in a language conformant
3484 if (fndecl
&& TREE_PURPOSE (typetail
)
3485 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3487 for (; typetail
!= void_list_node
; ++i
)
3490 = convert_default_arg (TREE_VALUE (typetail
),
3491 TREE_PURPOSE (typetail
),
3494 if (parmval
== error_mark_node
)
3497 VEC_safe_push (tree
, gc
, *values
, parmval
);
3498 typetail
= TREE_CHAIN (typetail
);
3499 /* ends with `...'. */
3500 if (typetail
== NULL_TREE
)
3506 if (complain
& tf_error
)
3507 warn_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3515 /* Build a binary-operation expression, after performing default
3516 conversions on the operands. CODE is the kind of expression to
3517 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3518 are the tree codes which correspond to ARG1 and ARG2 when issuing
3519 warnings about possibly misplaced parentheses. They may differ
3520 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3521 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3522 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3523 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3524 ARG2_CODE as ERROR_MARK. */
3527 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3528 tree arg2
, enum tree_code arg2_code
, bool *overloaded_p
,
3529 tsubst_flags_t complain
)
3538 if (processing_template_decl
)
3540 if (type_dependent_expression_p (arg1
)
3541 || type_dependent_expression_p (arg2
))
3542 return build_min_nt (code
, arg1
, arg2
);
3543 arg1
= build_non_dependent_expr (arg1
);
3544 arg2
= build_non_dependent_expr (arg2
);
3547 if (code
== DOTSTAR_EXPR
)
3548 expr
= build_m_component_ref (arg1
, arg2
);
3550 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3551 overloaded_p
, complain
);
3553 /* Check for cases such as x+y<<z which users are likely to
3554 misinterpret. But don't warn about obj << x + y, since that is a
3555 common idiom for I/O. */
3556 if (warn_parentheses
3557 && (complain
& tf_warning
)
3558 && !processing_template_decl
3559 && !error_operand_p (arg1
)
3560 && !error_operand_p (arg2
)
3561 && (code
!= LSHIFT_EXPR
3562 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3563 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3565 if (processing_template_decl
&& expr
!= error_mark_node
)
3566 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3571 /* Build and return an ARRAY_REF expression. */
3574 build_x_array_ref (tree arg1
, tree arg2
, tsubst_flags_t complain
)
3576 tree orig_arg1
= arg1
;
3577 tree orig_arg2
= arg2
;
3580 if (processing_template_decl
)
3582 if (type_dependent_expression_p (arg1
)
3583 || type_dependent_expression_p (arg2
))
3584 return build_min_nt (ARRAY_REF
, arg1
, arg2
,
3585 NULL_TREE
, NULL_TREE
);
3586 arg1
= build_non_dependent_expr (arg1
);
3587 arg2
= build_non_dependent_expr (arg2
);
3590 expr
= build_new_op (ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3591 /*overloaded_p=*/NULL
, complain
);
3593 if (processing_template_decl
&& expr
!= error_mark_node
)
3594 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3595 NULL_TREE
, NULL_TREE
);
3599 /* For the c-common bits. */
3601 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3602 int convert_p ATTRIBUTE_UNUSED
)
3604 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3608 /* Build a binary-operation expression without default conversions.
3609 CODE is the kind of expression to build.
3610 LOCATION is the location_t of the operator in the source code.
3611 This function differs from `build' in several ways:
3612 the data type of the result is computed and recorded in it,
3613 warnings are generated if arg data types are invalid,
3614 special handling for addition and subtraction of pointers is known,
3615 and some optimization is done (operations on narrow ints
3616 are done in the narrower type when that gives the same result).
3617 Constant folding is also done before the result is returned.
3619 Note that the operands will never have enumeral types
3620 because either they have just had the default conversions performed
3621 or they have both just been converted to some other type in which
3622 the arithmetic is to be done.
3624 C++: must do special pointer arithmetic when implementing
3625 multiple inheritance, and deal with pointer to member functions. */
3628 cp_build_binary_op (location_t location
,
3629 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3630 tsubst_flags_t complain
)
3633 enum tree_code code0
, code1
;
3635 const char *invalid_op_diag
;
3637 /* Expression code to give to the expression when it is built.
3638 Normally this is CODE, which is what the caller asked for,
3639 but in some special cases we change it. */
3640 enum tree_code resultcode
= code
;
3642 /* Data type in which the computation is to be performed.
3643 In the simplest cases this is the common type of the arguments. */
3644 tree result_type
= NULL
;
3646 /* Nonzero means operands have already been type-converted
3647 in whatever way is necessary.
3648 Zero means they need to be converted to RESULT_TYPE. */
3651 /* Nonzero means create the expression with this type, rather than
3653 tree build_type
= 0;
3655 /* Nonzero means after finally constructing the expression
3656 convert it to this type. */
3657 tree final_type
= 0;
3661 /* Nonzero if this is an operation like MIN or MAX which can
3662 safely be computed in short if both args are promoted shorts.
3663 Also implies COMMON.
3664 -1 indicates a bitwise operation; this makes a difference
3665 in the exact conditions for when it is safe to do the operation
3666 in a narrower mode. */
3669 /* Nonzero if this is a comparison operation;
3670 if both args are promoted shorts, compare the original shorts.
3671 Also implies COMMON. */
3672 int short_compare
= 0;
3674 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3677 /* True if both operands have arithmetic type. */
3678 bool arithmetic_types_p
;
3680 /* Apply default conversions. */
3684 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3685 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3686 || code
== TRUTH_XOR_EXPR
)
3688 if (!really_overloaded_fn (op0
))
3689 op0
= decay_conversion (op0
);
3690 if (!really_overloaded_fn (op1
))
3691 op1
= decay_conversion (op1
);
3695 if (!really_overloaded_fn (op0
))
3696 op0
= default_conversion (op0
);
3697 if (!really_overloaded_fn (op1
))
3698 op1
= default_conversion (op1
);
3701 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3702 STRIP_TYPE_NOPS (op0
);
3703 STRIP_TYPE_NOPS (op1
);
3705 /* DTRT if one side is an overloaded function, but complain about it. */
3706 if (type_unknown_p (op0
))
3708 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3709 if (t
!= error_mark_node
)
3711 if (complain
& tf_error
)
3712 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3717 if (type_unknown_p (op1
))
3719 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3720 if (t
!= error_mark_node
)
3722 if (complain
& tf_error
)
3723 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3729 type0
= TREE_TYPE (op0
);
3730 type1
= TREE_TYPE (op1
);
3732 /* The expression codes of the data types of the arguments tell us
3733 whether the arguments are integers, floating, pointers, etc. */
3734 code0
= TREE_CODE (type0
);
3735 code1
= TREE_CODE (type1
);
3737 /* If an error was already reported for one of the arguments,
3738 avoid reporting another error. */
3739 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3740 return error_mark_node
;
3742 if ((invalid_op_diag
3743 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3745 error (invalid_op_diag
);
3746 return error_mark_node
;
3749 /* Issue warnings about peculiar, but valid, uses of NULL. */
3750 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3751 /* It's reasonable to use pointer values as operands of &&
3752 and ||, so NULL is no exception. */
3753 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3754 && ( /* Both are NULL (or 0) and the operation was not a
3755 comparison or a pointer subtraction. */
3756 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3757 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
3758 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3759 || (!null_ptr_cst_p (orig_op0
)
3760 && !TYPE_PTR_P (type0
) && !TYPE_PTR_TO_MEMBER_P (type0
))
3761 || (!null_ptr_cst_p (orig_op1
)
3762 && !TYPE_PTR_P (type1
) && !TYPE_PTR_TO_MEMBER_P (type1
)))
3763 && (complain
& tf_warning
))
3764 /* Some sort of arithmetic operation involving NULL was
3766 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3771 /* Subtraction of two similar pointers.
3772 We must subtract them as integers, then divide by object size. */
3773 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3774 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3776 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3777 /* In all other cases except pointer - int, the usual arithmetic
3779 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3784 /* The pointer - int case is just like pointer + int; fall
3787 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3788 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3792 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3793 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3794 if (processing_template_decl
)
3796 result_type
= TREE_TYPE (ptr_operand
);
3799 return cp_pointer_int_sum (code
,
3810 case TRUNC_DIV_EXPR
:
3812 case FLOOR_DIV_EXPR
:
3813 case ROUND_DIV_EXPR
:
3814 case EXACT_DIV_EXPR
:
3815 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3816 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3817 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3818 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3820 enum tree_code tcode0
= code0
, tcode1
= code1
;
3822 warn_for_div_by_zero (location
, op1
);
3824 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3825 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3826 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3827 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3829 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3830 resultcode
= RDIV_EXPR
;
3832 /* When dividing two signed integers, we have to promote to int.
3833 unless we divide by a constant != -1. Note that default
3834 conversion will have been performed on the operands at this
3835 point, so we have to dig out the original type to find out if
3837 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3838 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3839 || (TREE_CODE (op1
) == INTEGER_CST
3840 && ! integer_all_onesp (op1
)));
3849 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3850 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3851 && !VECTOR_FLOAT_TYPE_P (type0
)
3852 && !VECTOR_FLOAT_TYPE_P (type1
)))
3856 case TRUNC_MOD_EXPR
:
3857 case FLOOR_MOD_EXPR
:
3858 warn_for_div_by_zero (location
, op1
);
3860 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3861 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
3862 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
3864 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3866 /* Although it would be tempting to shorten always here, that loses
3867 on some targets, since the modulo instruction is undefined if the
3868 quotient can't be represented in the computation mode. We shorten
3869 only if unsigned or if dividing by something we know != -1. */
3870 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3871 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3872 || (TREE_CODE (op1
) == INTEGER_CST
3873 && ! integer_all_onesp (op1
)));
3878 case TRUTH_ANDIF_EXPR
:
3879 case TRUTH_ORIF_EXPR
:
3880 case TRUTH_AND_EXPR
:
3882 result_type
= boolean_type_node
;
3885 /* Shift operations: result has same type as first operand;
3886 always convert second operand to int.
3887 Also set SHORT_SHIFT if shifting rightward. */
3890 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3892 result_type
= type0
;
3893 if (TREE_CODE (op1
) == INTEGER_CST
)
3895 if (tree_int_cst_lt (op1
, integer_zero_node
))
3897 if ((complain
& tf_warning
)
3898 && c_inhibit_evaluation_warnings
== 0)
3899 warning (0, "right shift count is negative");
3903 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3904 && (complain
& tf_warning
)
3905 && c_inhibit_evaluation_warnings
== 0)
3906 warning (0, "right shift count >= width of type");
3909 /* Convert the shift-count to an integer, regardless of
3910 size of value being shifted. */
3911 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3912 op1
= cp_convert (integer_type_node
, op1
);
3913 /* Avoid converting op1 to result_type later. */
3919 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3921 result_type
= type0
;
3922 if (TREE_CODE (op1
) == INTEGER_CST
)
3924 if (tree_int_cst_lt (op1
, integer_zero_node
))
3926 if ((complain
& tf_warning
)
3927 && c_inhibit_evaluation_warnings
== 0)
3928 warning (0, "left shift count is negative");
3930 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3932 if ((complain
& tf_warning
)
3933 && c_inhibit_evaluation_warnings
== 0)
3934 warning (0, "left shift count >= width of type");
3937 /* Convert the shift-count to an integer, regardless of
3938 size of value being shifted. */
3939 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3940 op1
= cp_convert (integer_type_node
, op1
);
3941 /* Avoid converting op1 to result_type later. */
3948 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3950 result_type
= type0
;
3951 if (TREE_CODE (op1
) == INTEGER_CST
)
3953 if (tree_int_cst_lt (op1
, integer_zero_node
))
3955 if (complain
& tf_warning
)
3956 warning (0, (code
== LROTATE_EXPR
)
3957 ? G_("left rotate count is negative")
3958 : G_("right rotate count is negative"));
3960 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3962 if (complain
& tf_warning
)
3963 warning (0, (code
== LROTATE_EXPR
)
3964 ? G_("left rotate count >= width of type")
3965 : G_("right rotate count >= width of type"));
3968 /* Convert the shift-count to an integer, regardless of
3969 size of value being shifted. */
3970 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3971 op1
= cp_convert (integer_type_node
, op1
);
3977 if ((complain
& tf_warning
)
3978 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
3979 warning (OPT_Wfloat_equal
,
3980 "comparing floating point with == or != is unsafe");
3981 if ((complain
& tf_warning
)
3982 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
3983 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
3984 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
3986 build_type
= boolean_type_node
;
3987 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3988 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
3989 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3990 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
3992 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3993 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
3994 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3995 CPO_COMPARISON
, complain
);
3996 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
3997 && null_ptr_cst_p (op1
))
3999 if (TREE_CODE (op0
) == ADDR_EXPR
4000 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
4002 if (complain
& tf_warning
)
4003 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4004 TREE_OPERAND (op0
, 0));
4006 result_type
= type0
;
4008 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
4009 && null_ptr_cst_p (op0
))
4011 if (TREE_CODE (op1
) == ADDR_EXPR
4012 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
4014 if (complain
& tf_warning
)
4015 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4016 TREE_OPERAND (op1
, 0));
4018 result_type
= type1
;
4020 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4021 /* One of the operands must be of nullptr_t type. */
4022 result_type
= TREE_TYPE (nullptr_node
);
4023 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4025 result_type
= type0
;
4026 if (complain
& tf_error
)
4027 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4029 return error_mark_node
;
4031 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4033 result_type
= type1
;
4034 if (complain
& tf_error
)
4035 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4037 return error_mark_node
;
4039 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
4041 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4042 == ptrmemfunc_vbit_in_delta
)
4044 tree pfn0
= pfn_from_ptrmemfunc (op0
);
4045 tree delta0
= delta_from_ptrmemfunc (op0
);
4046 tree e1
= cp_build_binary_op (location
,
4049 build_zero_cst (TREE_TYPE (pfn0
)),
4051 tree e2
= cp_build_binary_op (location
,
4056 e2
= cp_build_binary_op (location
,
4057 EQ_EXPR
, e2
, integer_zero_node
,
4059 op0
= cp_build_binary_op (location
,
4060 TRUTH_ANDIF_EXPR
, e1
, e2
,
4062 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
4066 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4067 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
4069 result_type
= TREE_TYPE (op0
);
4071 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4072 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4073 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4076 /* E will be the final comparison. */
4078 /* E1 and E2 are for scratch. */
4086 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4087 CPO_COMPARISON
, complain
);
4089 if (!same_type_p (TREE_TYPE (op0
), type
))
4090 op0
= cp_convert_and_check (type
, op0
);
4091 if (!same_type_p (TREE_TYPE (op1
), type
))
4092 op1
= cp_convert_and_check (type
, op1
);
4094 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4095 return error_mark_node
;
4097 if (TREE_SIDE_EFFECTS (op0
))
4098 op0
= save_expr (op0
);
4099 if (TREE_SIDE_EFFECTS (op1
))
4100 op1
= save_expr (op1
);
4102 pfn0
= pfn_from_ptrmemfunc (op0
);
4103 pfn1
= pfn_from_ptrmemfunc (op1
);
4104 delta0
= delta_from_ptrmemfunc (op0
);
4105 delta1
= delta_from_ptrmemfunc (op1
);
4106 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4107 == ptrmemfunc_vbit_in_delta
)
4112 && ((op0.delta == op1.delta)
4113 || (!op0.pfn && op0.delta & 1 == 0
4114 && op1.delta & 1 == 0))
4116 The reason for the `!op0.pfn' bit is that a NULL
4117 pointer-to-member is any member with a zero PFN and
4118 LSB of the DELTA field is 0. */
4120 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4124 e1
= cp_build_binary_op (location
,
4125 EQ_EXPR
, e1
, integer_zero_node
,
4127 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4131 e2
= cp_build_binary_op (location
,
4132 EQ_EXPR
, e2
, integer_zero_node
,
4134 e1
= cp_build_binary_op (location
,
4135 TRUTH_ANDIF_EXPR
, e2
, e1
,
4137 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4139 build_zero_cst (TREE_TYPE (pfn0
)),
4141 e2
= cp_build_binary_op (location
,
4142 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4143 e1
= cp_build_binary_op (location
,
4144 EQ_EXPR
, delta0
, delta1
, complain
);
4145 e1
= cp_build_binary_op (location
,
4146 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4153 && (!op0.pfn || op0.delta == op1.delta))
4155 The reason for the `!op0.pfn' bit is that a NULL
4156 pointer-to-member is any member with a zero PFN; the
4157 DELTA field is unspecified. */
4159 e1
= cp_build_binary_op (location
,
4160 EQ_EXPR
, delta0
, delta1
, complain
);
4161 e2
= cp_build_binary_op (location
,
4164 build_zero_cst (TREE_TYPE (pfn0
)),
4166 e1
= cp_build_binary_op (location
,
4167 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4169 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4170 e
= cp_build_binary_op (location
,
4171 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4172 if (code
== EQ_EXPR
)
4174 return cp_build_binary_op (location
,
4175 EQ_EXPR
, e
, integer_zero_node
, complain
);
4179 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4180 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4182 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4183 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4191 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4192 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4194 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4195 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4196 CPO_COMPARISON
, complain
);
4203 if (TREE_CODE (orig_op0
) == STRING_CST
4204 || TREE_CODE (orig_op1
) == STRING_CST
)
4206 if (complain
& tf_warning
)
4207 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4210 build_type
= boolean_type_node
;
4211 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4212 || code0
== ENUMERAL_TYPE
)
4213 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4214 || code1
== ENUMERAL_TYPE
))
4216 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4217 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4218 CPO_COMPARISON
, complain
);
4219 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4220 result_type
= type0
;
4221 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4222 result_type
= type1
;
4223 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4224 /* One of the operands must be of nullptr_t type. */
4225 result_type
= TREE_TYPE (nullptr_node
);
4226 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4228 result_type
= type0
;
4229 if (complain
& tf_error
)
4230 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4232 return error_mark_node
;
4234 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4236 result_type
= type1
;
4237 if (complain
& tf_error
)
4238 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4240 return error_mark_node
;
4244 case UNORDERED_EXPR
:
4251 build_type
= integer_type_node
;
4252 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4254 if (complain
& tf_error
)
4255 error ("unordered comparison on non-floating point argument");
4256 return error_mark_node
;
4265 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4266 || code0
== ENUMERAL_TYPE
)
4267 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4268 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4269 arithmetic_types_p
= 1;
4272 arithmetic_types_p
= 0;
4273 /* Vector arithmetic is only allowed when both sides are vectors. */
4274 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4276 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4277 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4280 binary_op_error (location
, code
, type0
, type1
);
4281 return error_mark_node
;
4283 arithmetic_types_p
= 1;
4286 /* Determine the RESULT_TYPE, if it is not already known. */
4288 && arithmetic_types_p
4289 && (shorten
|| common
|| short_compare
))
4291 result_type
= cp_common_type (type0
, type1
);
4292 do_warn_double_promotion (result_type
, type0
, type1
,
4293 "implicit conversion from %qT to %qT "
4294 "to match other operand of binary "
4301 if (complain
& tf_error
)
4302 error ("invalid operands of types %qT and %qT to binary %qO",
4303 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4304 return error_mark_node
;
4307 /* If we're in a template, the only thing we need to know is the
4309 if (processing_template_decl
)
4311 /* Since the middle-end checks the type when doing a build2, we
4312 need to build the tree in pieces. This built tree will never
4313 get out of the front-end as we replace it when instantiating
4315 tree tmp
= build2 (resultcode
,
4316 build_type
? build_type
: result_type
,
4318 TREE_OPERAND (tmp
, 0) = op0
;
4322 if (arithmetic_types_p
)
4324 bool first_complex
= (code0
== COMPLEX_TYPE
);
4325 bool second_complex
= (code1
== COMPLEX_TYPE
);
4326 int none_complex
= (!first_complex
&& !second_complex
);
4328 /* Adapted from patch for c/24581. */
4329 if (first_complex
!= second_complex
4330 && (code
== PLUS_EXPR
4331 || code
== MINUS_EXPR
4332 || code
== MULT_EXPR
4333 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4334 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4335 && flag_signed_zeros
)
4337 /* An operation on mixed real/complex operands must be
4338 handled specially, but the language-independent code can
4339 more easily optimize the plain complex arithmetic if
4340 -fno-signed-zeros. */
4341 tree real_type
= TREE_TYPE (result_type
);
4345 if (TREE_TYPE (op0
) != result_type
)
4346 op0
= cp_convert_and_check (result_type
, op0
);
4347 if (TREE_TYPE (op1
) != real_type
)
4348 op1
= cp_convert_and_check (real_type
, op1
);
4352 if (TREE_TYPE (op0
) != real_type
)
4353 op0
= cp_convert_and_check (real_type
, op0
);
4354 if (TREE_TYPE (op1
) != result_type
)
4355 op1
= cp_convert_and_check (result_type
, op1
);
4357 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4358 return error_mark_node
;
4361 op0
= save_expr (op0
);
4362 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4363 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4367 case TRUNC_DIV_EXPR
:
4368 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4372 real
= build2 (resultcode
, real_type
, real
, op1
);
4380 op1
= save_expr (op1
);
4381 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4382 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4386 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4389 real
= build2 (resultcode
, real_type
, op0
, real
);
4392 real
= build2 (resultcode
, real_type
, op0
, real
);
4393 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4399 return build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4402 /* For certain operations (which identify themselves by shorten != 0)
4403 if both args were extended from the same smaller type,
4404 do the arithmetic in that type and then extend.
4406 shorten !=0 and !=1 indicates a bitwise operation.
4407 For them, this optimization is safe only if
4408 both args are zero-extended or both are sign-extended.
4409 Otherwise, we might change the result.
4410 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4411 but calculated in (unsigned short) it would be (unsigned short)-1. */
4413 if (shorten
&& none_complex
)
4415 final_type
= result_type
;
4416 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4420 /* Comparison operations are shortened too but differently.
4421 They identify themselves by setting short_compare = 1. */
4425 /* Don't write &op0, etc., because that would prevent op0
4426 from being kept in a register.
4427 Instead, make copies of the our local variables and
4428 pass the copies by reference, then copy them back afterward. */
4429 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4430 enum tree_code xresultcode
= resultcode
;
4432 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4434 return cp_convert (boolean_type_node
, val
);
4435 op0
= xop0
, op1
= xop1
;
4437 resultcode
= xresultcode
;
4440 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4441 && warn_sign_compare
4442 && !TREE_NO_WARNING (orig_op0
)
4443 && !TREE_NO_WARNING (orig_op1
)
4444 /* Do not warn until the template is instantiated; we cannot
4445 bound the ranges of the arguments until that point. */
4446 && !processing_template_decl
4447 && (complain
& tf_warning
)
4448 && c_inhibit_evaluation_warnings
== 0)
4450 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4451 result_type
, resultcode
);
4455 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4456 Then the expression will be built.
4457 It will be given type FINAL_TYPE if that is nonzero;
4458 otherwise, it will be given type RESULT_TYPE. */
4461 if (TREE_TYPE (op0
) != result_type
)
4462 op0
= cp_convert_and_check (result_type
, op0
);
4463 if (TREE_TYPE (op1
) != result_type
)
4464 op1
= cp_convert_and_check (result_type
, op1
);
4466 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4467 return error_mark_node
;
4470 if (build_type
== NULL_TREE
)
4471 build_type
= result_type
;
4473 result
= build2 (resultcode
, build_type
, op0
, op1
);
4474 result
= fold_if_not_in_template (result
);
4475 if (final_type
!= 0)
4476 result
= cp_convert (final_type
, result
);
4478 if (TREE_OVERFLOW_P (result
)
4479 && !TREE_OVERFLOW_P (op0
)
4480 && !TREE_OVERFLOW_P (op1
))
4481 overflow_warning (location
, result
);
4486 /* Return a tree for the sum or difference (RESULTCODE says which)
4487 of pointer PTROP and integer INTOP. */
4490 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4492 tree res_type
= TREE_TYPE (ptrop
);
4494 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4495 in certain circumstance (when it's valid to do so). So we need
4496 to make sure it's complete. We don't need to check here, if we
4497 can actually complete it at all, as those checks will be done in
4498 pointer_int_sum() anyway. */
4499 complete_type (TREE_TYPE (res_type
));
4501 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4502 fold_if_not_in_template (intop
));
4505 /* Return a tree for the difference of pointers OP0 and OP1.
4506 The resulting tree has type int. */
4509 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4512 tree restype
= ptrdiff_type_node
;
4513 tree target_type
= TREE_TYPE (ptrtype
);
4515 if (!complete_type_or_else (target_type
, NULL_TREE
))
4516 return error_mark_node
;
4518 if (TREE_CODE (target_type
) == VOID_TYPE
)
4519 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4520 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4521 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4522 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4523 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4525 /* First do the subtraction as integers;
4526 then drop through to build the divide operator. */
4528 op0
= cp_build_binary_op (input_location
,
4530 cp_convert (restype
, op0
),
4531 cp_convert (restype
, op1
),
4532 tf_warning_or_error
);
4534 /* This generates an error if op1 is a pointer to an incomplete type. */
4535 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4536 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4538 op1
= (TYPE_PTROB_P (ptrtype
)
4539 ? size_in_bytes (target_type
)
4540 : integer_one_node
);
4542 /* Do the division. */
4544 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4545 return fold_if_not_in_template (result
);
4548 /* Construct and perhaps optimize a tree representation
4549 for a unary operation. CODE, a tree_code, specifies the operation
4550 and XARG is the operand. */
4553 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4555 tree orig_expr
= xarg
;
4559 if (processing_template_decl
)
4561 if (type_dependent_expression_p (xarg
))
4562 return build_min_nt (code
, xarg
, NULL_TREE
);
4564 xarg
= build_non_dependent_expr (xarg
);
4569 /* [expr.unary.op] says:
4571 The address of an object of incomplete type can be taken.
4573 (And is just the ordinary address operator, not an overloaded
4574 "operator &".) However, if the type is a template
4575 specialization, we must complete the type at this point so that
4576 an overloaded "operator &" will be available if required. */
4577 if (code
== ADDR_EXPR
4578 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4579 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4580 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4581 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4582 /* Don't look for a function. */;
4584 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4585 /*overloaded_p=*/NULL
, complain
);
4586 if (!exp
&& code
== ADDR_EXPR
)
4588 if (is_overloaded_fn (xarg
))
4590 tree fn
= get_first_fn (xarg
);
4591 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4593 error (DECL_CONSTRUCTOR_P (fn
)
4594 ? G_("taking address of constructor %qE")
4595 : G_("taking address of destructor %qE"),
4597 return error_mark_node
;
4601 /* A pointer to member-function can be formed only by saying
4603 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4604 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4606 if (TREE_CODE (xarg
) != OFFSET_REF
4607 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4609 error ("invalid use of %qE to form a pointer-to-member-function",
4611 if (TREE_CODE (xarg
) != OFFSET_REF
)
4612 inform (input_location
, " a qualified-id is required");
4613 return error_mark_node
;
4617 error ("parentheses around %qE cannot be used to form a"
4618 " pointer-to-member-function",
4620 PTRMEM_OK_P (xarg
) = 1;
4624 if (TREE_CODE (xarg
) == OFFSET_REF
)
4626 ptrmem
= PTRMEM_OK_P (xarg
);
4628 if (!ptrmem
&& !flag_ms_extensions
4629 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4631 /* A single non-static member, make sure we don't allow a
4632 pointer-to-member. */
4633 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4634 TREE_OPERAND (xarg
, 0),
4635 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4636 PTRMEM_OK_P (xarg
) = ptrmem
;
4640 exp
= cp_build_addr_expr_strict (xarg
, complain
);
4643 if (processing_template_decl
&& exp
!= error_mark_node
)
4644 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4645 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4646 if (TREE_CODE (exp
) == ADDR_EXPR
)
4647 PTRMEM_OK_P (exp
) = ptrmem
;
4651 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4652 constants, where a null value is represented by an INTEGER_CST of
4656 cp_truthvalue_conversion (tree expr
)
4658 tree type
= TREE_TYPE (expr
);
4659 if (TYPE_PTRMEM_P (type
))
4660 return build_binary_op (EXPR_LOCATION (expr
),
4661 NE_EXPR
, expr
, integer_zero_node
, 1);
4663 return c_common_truthvalue_conversion (input_location
, expr
);
4666 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4669 condition_conversion (tree expr
)
4672 if (processing_template_decl
)
4674 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4675 tf_warning_or_error
, LOOKUP_NORMAL
);
4676 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4680 /* Returns the address of T. This function will fold away
4681 ADDR_EXPR of INDIRECT_REF. */
4684 build_address (tree t
)
4686 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4687 return error_mark_node
;
4688 t
= build_fold_addr_expr (t
);
4689 if (TREE_CODE (t
) != ADDR_EXPR
)
4694 /* Returns the address of T with type TYPE. */
4697 build_typed_address (tree t
, tree type
)
4699 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4700 return error_mark_node
;
4701 t
= build_fold_addr_expr_with_type (t
, type
);
4702 if (TREE_CODE (t
) != ADDR_EXPR
)
4707 /* Return a NOP_EXPR converting EXPR to TYPE. */
4710 build_nop (tree type
, tree expr
)
4712 if (type
== error_mark_node
|| error_operand_p (expr
))
4714 return build1 (NOP_EXPR
, type
, expr
);
4717 /* Take the address of ARG, whatever that means under C++ semantics.
4718 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
4719 and class rvalues as well.
4721 Nothing should call this function directly; instead, callers should use
4722 cp_build_addr_expr or cp_build_addr_expr_strict. */
4725 cp_build_addr_expr_1 (tree arg
, bool strict_lvalue
, tsubst_flags_t complain
)
4730 if (!arg
|| error_operand_p (arg
))
4731 return error_mark_node
;
4733 arg
= mark_lvalue_use (arg
);
4734 argtype
= lvalue_type (arg
);
4736 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
4737 || !IDENTIFIER_OPNAME_P (arg
));
4739 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
4740 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
4742 /* They're trying to take the address of a unique non-static
4743 member function. This is ill-formed (except in MS-land),
4744 but let's try to DTRT.
4745 Note: We only handle unique functions here because we don't
4746 want to complain if there's a static overload; non-unique
4747 cases will be handled by instantiate_type. But we need to
4748 handle this case here to allow casts on the resulting PMF.
4749 We could defer this in non-MS mode, but it's easier to give
4750 a useful error here. */
4752 /* Inside constant member functions, the `this' pointer
4753 contains an extra const qualifier. TYPE_MAIN_VARIANT
4754 is used here to remove this const from the diagnostics
4755 and the created OFFSET_REF. */
4756 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
4757 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
4760 if (! flag_ms_extensions
)
4762 tree name
= DECL_NAME (fn
);
4763 if (!(complain
& tf_error
))
4764 return error_mark_node
;
4765 else if (current_class_type
4766 && TREE_OPERAND (arg
, 0) == current_class_ref
)
4767 /* An expression like &memfn. */
4768 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
4769 " or parenthesized non-static member function to form"
4770 " a pointer to member function. Say %<&%T::%D%>",
4773 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
4774 " function to form a pointer to member function."
4778 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
4781 /* Uninstantiated types are all functions. Taking the
4782 address of a function is a no-op, so just return the
4784 if (type_unknown_p (arg
))
4785 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4787 if (TREE_CODE (arg
) == OFFSET_REF
)
4788 /* We want a pointer to member; bypass all the code for actually taking
4789 the address of something. */
4792 /* Anything not already handled and not a true memory reference
4794 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4795 && TREE_CODE (argtype
) != METHOD_TYPE
)
4797 cp_lvalue_kind kind
= lvalue_kind (arg
);
4798 if (kind
== clk_none
)
4800 if (complain
& tf_error
)
4801 lvalue_error (lv_addressof
);
4802 return error_mark_node
;
4804 if (strict_lvalue
&& (kind
& (clk_rvalueref
|clk_class
)))
4806 if (!(complain
& tf_error
))
4807 return error_mark_node
;
4808 if (kind
& clk_class
)
4809 /* Make this a permerror because we used to accept it. */
4810 permerror (input_location
, "taking address of temporary");
4812 error ("taking address of xvalue (rvalue reference)");
4816 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4818 tree type
= build_pointer_type (TREE_TYPE (argtype
));
4819 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4822 else if (pedantic
&& DECL_MAIN_P (arg
))
4825 /* Apparently a lot of autoconf scripts for C++ packages do this,
4826 so only complain if -pedantic. */
4827 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
4828 pedwarn (input_location
, OPT_pedantic
,
4829 "ISO C++ forbids taking address of function %<::main%>");
4830 else if (flag_pedantic_errors
)
4831 return error_mark_node
;
4834 /* Let &* cancel out to simplify resulting code. */
4835 if (TREE_CODE (arg
) == INDIRECT_REF
)
4837 /* We don't need to have `current_class_ptr' wrapped in a
4838 NON_LVALUE_EXPR node. */
4839 if (arg
== current_class_ref
)
4840 return current_class_ptr
;
4842 arg
= TREE_OPERAND (arg
, 0);
4843 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
4845 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
4846 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4849 /* Don't let this be an lvalue. */
4854 /* ??? Cope with user tricks that amount to offsetof. */
4855 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4856 && TREE_CODE (argtype
) != METHOD_TYPE
4857 && argtype
!= unknown_type_node
4858 && (val
= get_base_address (arg
))
4859 && COMPLETE_TYPE_P (TREE_TYPE (val
))
4860 && TREE_CODE (val
) == INDIRECT_REF
4861 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
4863 tree type
= build_pointer_type (argtype
);
4864 tree op0
= fold_convert (type
, TREE_OPERAND (val
, 0));
4865 tree op1
= fold_convert (sizetype
, fold_offsetof (arg
, val
));
4866 return fold_build2 (POINTER_PLUS_EXPR
, type
, op0
, op1
);
4869 /* Handle complex lvalues (when permitted)
4870 by reduction to simpler cases. */
4871 val
= unary_complex_lvalue (ADDR_EXPR
, arg
);
4875 switch (TREE_CODE (arg
))
4879 case FIX_TRUNC_EXPR
:
4880 /* Even if we're not being pedantic, we cannot allow this
4881 extension when we're instantiating in a SFINAE
4883 if (! lvalue_p (arg
) && complain
== tf_none
)
4885 if (complain
& tf_error
)
4886 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4888 return error_mark_node
;
4893 arg
= BASELINK_FUNCTIONS (arg
);
4897 arg
= OVL_CURRENT (arg
);
4902 /* Turn a reference to a non-static data member into a
4903 pointer-to-member. */
4908 gcc_assert (PTRMEM_OK_P (arg
));
4910 t
= TREE_OPERAND (arg
, 1);
4911 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
4913 if (complain
& tf_error
)
4914 error ("cannot create pointer to reference member %qD", t
);
4915 return error_mark_node
;
4918 type
= build_ptrmem_type (context_for_name_lookup (t
),
4920 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
4928 if (argtype
!= error_mark_node
)
4929 argtype
= build_pointer_type (argtype
);
4931 /* In a template, we are processing a non-dependent expression
4932 so we can just form an ADDR_EXPR with the correct type. */
4933 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
4935 val
= build_address (arg
);
4936 if (TREE_CODE (arg
) == OFFSET_REF
)
4937 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
4939 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
4941 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
4943 /* We can only get here with a single static member
4945 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4946 && DECL_STATIC_FUNCTION_P (fn
));
4948 val
= build_address (fn
);
4949 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
4950 /* Do not lose object's side effects. */
4951 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
4952 TREE_OPERAND (arg
, 0), val
);
4954 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
4956 if (complain
& tf_error
)
4957 error ("attempt to take address of bit-field structure member %qD",
4958 TREE_OPERAND (arg
, 1));
4959 return error_mark_node
;
4963 tree object
= TREE_OPERAND (arg
, 0);
4964 tree field
= TREE_OPERAND (arg
, 1);
4965 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4966 (TREE_TYPE (object
), decl_type_context (field
)));
4967 val
= build_address (arg
);
4970 if (TREE_CODE (argtype
) == POINTER_TYPE
4971 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
4973 build_ptrmemfunc_type (argtype
);
4974 val
= build_ptrmemfunc (argtype
, val
, 0,
4976 tf_warning_or_error
);
4982 /* Take the address of ARG if it has one, even if it's an rvalue. */
4985 cp_build_addr_expr (tree arg
, tsubst_flags_t complain
)
4987 return cp_build_addr_expr_1 (arg
, 0, complain
);
4990 /* Take the address of ARG, but only if it's an lvalue. */
4993 cp_build_addr_expr_strict (tree arg
, tsubst_flags_t complain
)
4995 return cp_build_addr_expr_1 (arg
, 1, complain
);
4998 /* C++: Must handle pointers to members.
5000 Perhaps type instantiation should be extended to handle conversion
5001 from aggregates to types we don't yet know we want? (Or are those
5002 cases typically errors which should be reported?)
5004 NOCONVERT nonzero suppresses the default promotions
5005 (such as from short to int). */
5008 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
5009 tsubst_flags_t complain
)
5011 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
5014 const char *errstring
= NULL
;
5016 const char *invalid_op_diag
;
5018 if (!arg
|| error_operand_p (arg
))
5019 return error_mark_node
;
5021 if ((invalid_op_diag
5022 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
5027 error (invalid_op_diag
);
5028 return error_mark_node
;
5033 case UNARY_PLUS_EXPR
:
5036 int flags
= WANT_ARITH
| WANT_ENUM
;
5037 /* Unary plus (but not unary minus) is allowed on pointers. */
5038 if (code
== UNARY_PLUS_EXPR
)
5039 flags
|= WANT_POINTER
;
5040 arg
= build_expr_type_conversion (flags
, arg
, true);
5042 errstring
= (code
== NEGATE_EXPR
5043 ? _("wrong type argument to unary minus")
5044 : _("wrong type argument to unary plus"));
5047 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5048 arg
= perform_integral_promotions (arg
);
5050 /* Make sure the result is not an lvalue: a unary plus or minus
5051 expression is always a rvalue. */
5058 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5062 arg
= default_conversion (arg
);
5064 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
5065 | WANT_VECTOR_OR_COMPLEX
,
5067 errstring
= _("wrong type argument to bit-complement");
5068 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5069 arg
= perform_integral_promotions (arg
);
5073 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5074 errstring
= _("wrong type argument to abs");
5075 else if (!noconvert
)
5076 arg
= default_conversion (arg
);
5080 /* Conjugating a real value is a no-op, but allow it anyway. */
5081 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5082 errstring
= _("wrong type argument to conjugation");
5083 else if (!noconvert
)
5084 arg
= default_conversion (arg
);
5087 case TRUTH_NOT_EXPR
:
5088 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
5090 val
= invert_truthvalue_loc (input_location
, arg
);
5091 if (arg
!= error_mark_node
)
5093 errstring
= _("in argument to unary !");
5101 arg
= build_real_imag_expr (input_location
, code
, arg
);
5102 if (arg
== error_mark_node
)
5105 return fold_if_not_in_template (arg
);
5107 case PREINCREMENT_EXPR
:
5108 case POSTINCREMENT_EXPR
:
5109 case PREDECREMENT_EXPR
:
5110 case POSTDECREMENT_EXPR
:
5111 /* Handle complex lvalues (when permitted)
5112 by reduction to simpler cases. */
5114 val
= unary_complex_lvalue (code
, arg
);
5118 arg
= mark_lvalue_use (arg
);
5120 /* Increment or decrement the real part of the value,
5121 and don't change the imaginary part. */
5122 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5126 arg
= stabilize_reference (arg
);
5127 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
5128 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
5129 real
= cp_build_unary_op (code
, real
, 1, complain
);
5130 if (real
== error_mark_node
|| imag
== error_mark_node
)
5131 return error_mark_node
;
5132 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
5136 /* Report invalid types. */
5138 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
5141 if (code
== PREINCREMENT_EXPR
)
5142 errstring
= _("no pre-increment operator for type");
5143 else if (code
== POSTINCREMENT_EXPR
)
5144 errstring
= _("no post-increment operator for type");
5145 else if (code
== PREDECREMENT_EXPR
)
5146 errstring
= _("no pre-decrement operator for type");
5148 errstring
= _("no post-decrement operator for type");
5151 else if (arg
== error_mark_node
)
5152 return error_mark_node
;
5154 /* Report something read-only. */
5156 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
5157 || TREE_READONLY (arg
))
5159 if (complain
& tf_error
)
5160 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
5161 || code
== POSTINCREMENT_EXPR
)
5162 ? REK_INCREMENT
: REK_DECREMENT
));
5164 return error_mark_node
;
5169 tree declared_type
= unlowered_expr_type (arg
);
5171 argtype
= TREE_TYPE (arg
);
5173 /* ARM $5.2.5 last annotation says this should be forbidden. */
5174 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
5176 if (complain
& tf_error
)
5177 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
5178 ? G_("ISO C++ forbids incrementing an enum")
5179 : G_("ISO C++ forbids decrementing an enum"));
5181 return error_mark_node
;
5184 /* Compute the increment. */
5186 if (TREE_CODE (argtype
) == POINTER_TYPE
)
5188 tree type
= complete_type (TREE_TYPE (argtype
));
5190 if (!COMPLETE_OR_VOID_TYPE_P (type
))
5192 if (complain
& tf_error
)
5193 error (((code
== PREINCREMENT_EXPR
5194 || code
== POSTINCREMENT_EXPR
))
5195 ? G_("cannot increment a pointer to incomplete type %qT")
5196 : G_("cannot decrement a pointer to incomplete type %qT"),
5197 TREE_TYPE (argtype
));
5199 return error_mark_node
;
5201 else if ((pedantic
|| warn_pointer_arith
)
5202 && !TYPE_PTROB_P (argtype
))
5204 if (complain
& tf_error
)
5205 permerror (input_location
, (code
== PREINCREMENT_EXPR
5206 || code
== POSTINCREMENT_EXPR
)
5207 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
5208 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
5211 return error_mark_node
;
5214 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
5217 inc
= integer_one_node
;
5219 inc
= cp_convert (argtype
, inc
);
5221 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
5222 need to ask Objective-C to build the increment or decrement
5223 expression for it. */
5224 if (objc_is_property_ref (arg
))
5225 return objc_build_incr_expr_for_property_ref (input_location
, code
,
5228 /* Complain about anything else that is not a true lvalue. */
5229 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
5230 || code
== POSTINCREMENT_EXPR
)
5231 ? lv_increment
: lv_decrement
),
5233 return error_mark_node
;
5235 /* Forbid using -- on `bool'. */
5236 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
5238 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
5240 if (complain
& tf_error
)
5241 error ("invalid use of Boolean expression as operand "
5242 "to %<operator--%>");
5243 return error_mark_node
;
5245 val
= boolean_increment (code
, arg
);
5248 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
5250 TREE_SIDE_EFFECTS (val
) = 1;
5255 /* Note that this operation never does default_conversion
5256 regardless of NOCONVERT. */
5257 return cp_build_addr_expr (arg
, complain
);
5266 argtype
= TREE_TYPE (arg
);
5267 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5270 if (complain
& tf_error
)
5271 error ("%s", errstring
);
5272 return error_mark_node
;
5275 /* Hook for the c-common bits that build a unary op. */
5277 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5278 enum tree_code code
, tree xarg
, int noconvert
)
5280 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5283 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5284 for certain kinds of expressions which are not really lvalues
5285 but which we can accept as lvalues.
5287 If ARG is not a kind of expression we can handle, return
5291 unary_complex_lvalue (enum tree_code code
, tree arg
)
5293 /* Inside a template, making these kinds of adjustments is
5294 pointless; we are only concerned with the type of the
5296 if (processing_template_decl
)
5299 /* Handle (a, b) used as an "lvalue". */
5300 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5302 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5303 tf_warning_or_error
);
5304 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5305 TREE_OPERAND (arg
, 0), real_result
);
5308 /* Handle (a ? b : c) used as an "lvalue". */
5309 if (TREE_CODE (arg
) == COND_EXPR
5310 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5311 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5313 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5314 if (TREE_CODE (arg
) == MODIFY_EXPR
5315 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5316 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5318 tree lvalue
= TREE_OPERAND (arg
, 0);
5319 if (TREE_SIDE_EFFECTS (lvalue
))
5321 lvalue
= stabilize_reference (lvalue
);
5322 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5323 lvalue
, TREE_OPERAND (arg
, 1));
5325 return unary_complex_lvalue
5326 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5329 if (code
!= ADDR_EXPR
)
5332 /* Handle (a = b) used as an "lvalue" for `&'. */
5333 if (TREE_CODE (arg
) == MODIFY_EXPR
5334 || TREE_CODE (arg
) == INIT_EXPR
)
5336 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5337 tf_warning_or_error
);
5338 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5340 TREE_NO_WARNING (arg
) = 1;
5344 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5345 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5346 || TREE_CODE (arg
) == OFFSET_REF
)
5349 /* We permit compiler to make function calls returning
5350 objects of aggregate type look like lvalues. */
5354 if (TREE_CODE (targ
) == SAVE_EXPR
)
5355 targ
= TREE_OPERAND (targ
, 0);
5357 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5359 if (TREE_CODE (arg
) == SAVE_EXPR
)
5362 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
5363 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5366 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5367 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5368 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5371 /* Don't let anything else be handled specially. */
5375 /* Mark EXP saying that we need to be able to take the
5376 address of it; it should not be allocated in a register.
5377 Value is true if successful.
5379 C++: we do not allow `current_class_ptr' to be addressable. */
5382 cxx_mark_addressable (tree exp
)
5387 switch (TREE_CODE (x
))
5394 x
= TREE_OPERAND (x
, 0);
5398 if (x
== current_class_ptr
)
5400 error ("cannot take the address of %<this%>, which is an rvalue expression");
5401 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5407 /* Caller should not be trying to mark initialized
5408 constant fields addressable. */
5409 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5410 || DECL_IN_AGGR_P (x
) == 0
5412 || DECL_EXTERNAL (x
));
5417 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5418 && !DECL_ARTIFICIAL (x
))
5420 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5423 ("address of explicit register variable %qD requested", x
);
5426 else if (extra_warnings
)
5428 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5430 TREE_ADDRESSABLE (x
) = 1;
5434 TREE_ADDRESSABLE (x
) = 1;
5438 TREE_ADDRESSABLE (x
) = 1;
5442 TREE_ADDRESSABLE (x
) = 1;
5443 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5451 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5454 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5455 tsubst_flags_t complain
)
5457 tree orig_ifexp
= ifexp
;
5458 tree orig_op1
= op1
;
5459 tree orig_op2
= op2
;
5462 if (processing_template_decl
)
5464 /* The standard says that the expression is type-dependent if
5465 IFEXP is type-dependent, even though the eventual type of the
5466 expression doesn't dependent on IFEXP. */
5467 if (type_dependent_expression_p (ifexp
)
5468 /* As a GNU extension, the middle operand may be omitted. */
5469 || (op1
&& type_dependent_expression_p (op1
))
5470 || type_dependent_expression_p (op2
))
5471 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5472 ifexp
= build_non_dependent_expr (ifexp
);
5474 op1
= build_non_dependent_expr (op1
);
5475 op2
= build_non_dependent_expr (op2
);
5478 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5479 if (processing_template_decl
&& expr
!= error_mark_node
)
5480 return build_min_non_dep (COND_EXPR
, expr
,
5481 orig_ifexp
, orig_op1
, orig_op2
);
5485 /* Given a list of expressions, return a compound expression
5486 that performs them all and returns the value of the last of them. */
5489 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
,
5490 tsubst_flags_t complain
)
5492 tree expr
= TREE_VALUE (list
);
5494 if (TREE_CHAIN (list
))
5496 if (complain
& tf_error
)
5500 permerror (input_location
, "expression list treated as compound "
5501 "expression in initializer");
5504 permerror (input_location
, "expression list treated as compound "
5505 "expression in mem-initializer");
5508 permerror (input_location
, "expression list treated as compound "
5509 "expression in functional cast");
5515 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5516 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5523 /* Like build_x_compound_expr_from_list, but using a VEC. */
5526 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5528 if (VEC_empty (tree
, vec
))
5530 else if (VEC_length (tree
, vec
) == 1)
5531 return VEC_index (tree
, vec
, 0);
5539 permerror (input_location
,
5540 "%s expression list treated as compound expression",
5543 expr
= VEC_index (tree
, vec
, 0);
5544 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5545 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5551 /* Handle overloading of the ',' operator when needed. */
5554 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5557 tree orig_op1
= op1
;
5558 tree orig_op2
= op2
;
5560 if (processing_template_decl
)
5562 if (type_dependent_expression_p (op1
)
5563 || type_dependent_expression_p (op2
))
5564 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5565 op1
= build_non_dependent_expr (op1
);
5566 op2
= build_non_dependent_expr (op2
);
5569 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5570 /*overloaded_p=*/NULL
, complain
);
5572 result
= cp_build_compound_expr (op1
, op2
, complain
);
5574 if (processing_template_decl
&& result
!= error_mark_node
)
5575 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5580 /* Like cp_build_compound_expr, but for the c-common bits. */
5583 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5585 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5588 /* Build a compound expression. */
5591 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5593 lhs
= convert_to_void (lhs
, ICV_LEFT_OF_COMMA
, complain
);
5595 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5596 return error_mark_node
;
5598 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5600 /* If the rhs is a TARGET_EXPR, then build the compound
5601 expression inside the target_expr's initializer. This
5602 helps the compiler to eliminate unnecessary temporaries. */
5603 tree init
= TREE_OPERAND (rhs
, 1);
5605 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5606 TREE_OPERAND (rhs
, 1) = init
;
5611 if (type_unknown_p (rhs
))
5613 error ("no context to resolve type of %qE", rhs
);
5614 return error_mark_node
;
5617 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5620 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5621 casts away constness. CAST gives the type of cast.
5623 ??? This function warns for casting away any qualifier not just
5624 const. We would like to specify exactly what qualifiers are casted
5629 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5630 enum tree_code cast
)
5632 /* C-style casts are allowed to cast away constness. With
5633 WARN_CAST_QUAL, we still want to issue a warning. */
5634 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5637 if (!casts_away_constness (src_type
, dest_type
))
5643 warning (OPT_Wcast_qual
,
5644 "cast from type %qT to type %qT casts away qualifiers",
5645 src_type
, dest_type
);
5648 case STATIC_CAST_EXPR
:
5649 error ("static_cast from type %qT to type %qT casts away qualifiers",
5650 src_type
, dest_type
);
5653 case REINTERPRET_CAST_EXPR
:
5654 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5655 src_type
, dest_type
);
5662 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5663 (another pointer-to-member type in the same hierarchy) and return
5664 the converted expression. If ALLOW_INVERSE_P is permitted, a
5665 pointer-to-derived may be converted to pointer-to-base; otherwise,
5666 only the other direction is permitted. If C_CAST_P is true, this
5667 conversion is taking place as part of a C-style cast. */
5670 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5671 bool c_cast_p
, tsubst_flags_t complain
)
5673 if (TYPE_PTRMEM_P (type
))
5677 if (TREE_CODE (expr
) == PTRMEM_CST
)
5678 expr
= cplus_expand_constant (expr
);
5679 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5680 TYPE_PTRMEM_CLASS_TYPE (type
),
5682 c_cast_p
, complain
);
5683 if (delta
== error_mark_node
)
5684 return error_mark_node
;
5686 if (!integer_zerop (delta
))
5688 tree cond
, op1
, op2
;
5690 cond
= cp_build_binary_op (input_location
,
5693 build_int_cst (TREE_TYPE (expr
), -1),
5694 tf_warning_or_error
);
5695 op1
= build_nop (ptrdiff_type_node
, expr
);
5696 op2
= cp_build_binary_op (input_location
,
5697 PLUS_EXPR
, op1
, delta
,
5698 tf_warning_or_error
);
5700 expr
= fold_build3_loc (input_location
,
5701 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5705 return build_nop (type
, expr
);
5708 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5709 allow_inverse_p
, c_cast_p
, complain
);
5712 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5713 this static_cast is being attempted as one of the possible casts
5714 allowed by a C-style cast. (In that case, accessibility of base
5715 classes is not considered, and it is OK to cast away
5716 constness.) Return the result of the cast. *VALID_P is set to
5717 indicate whether or not the cast was valid. */
5720 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5721 bool *valid_p
, tsubst_flags_t complain
)
5726 /* Assume the cast is valid. */
5729 intype
= TREE_TYPE (expr
);
5731 /* Save casted types in the function's used types hash table. */
5732 used_types_insert (type
);
5734 /* [expr.static.cast]
5736 An lvalue of type "cv1 B", where B is a class type, can be cast
5737 to type "reference to cv2 D", where D is a class derived (clause
5738 _class.derived_) from B, if a valid standard conversion from
5739 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5740 same cv-qualification as, or greater cv-qualification than, cv1,
5741 and B is not a virtual base class of D. */
5742 /* We check this case before checking the validity of "TYPE t =
5743 EXPR;" below because for this case:
5746 struct D : public B { D(const B&); };
5748 void f() { static_cast<const D&>(b); }
5750 we want to avoid constructing a new D. The standard is not
5751 completely clear about this issue, but our interpretation is
5752 consistent with other compilers. */
5753 if (TREE_CODE (type
) == REFERENCE_TYPE
5754 && CLASS_TYPE_P (TREE_TYPE (type
))
5755 && CLASS_TYPE_P (intype
)
5756 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5757 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5758 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5759 build_pointer_type (TYPE_MAIN_VARIANT
5760 (TREE_TYPE (type
))))
5762 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5766 /* There is a standard conversion from "D*" to "B*" even if "B"
5767 is ambiguous or inaccessible. If this is really a
5768 static_cast, then we check both for inaccessibility and
5769 ambiguity. However, if this is a static_cast being performed
5770 because the user wrote a C-style cast, then accessibility is
5772 base
= lookup_base (TREE_TYPE (type
), intype
,
5773 c_cast_p
? ba_unique
: ba_check
,
5776 /* Convert from "B*" to "D*". This function will check that "B"
5777 is not a virtual base of "D". */
5778 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5779 base
, /*nonnull=*/false);
5780 /* Convert the pointer to a reference -- but then remember that
5781 there are no expressions with reference type in C++.
5783 We call rvalue so that there's an actual tree code
5784 (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
5785 is a variable with the same type, the conversion would get folded
5786 away, leaving just the variable and causing lvalue_kind to give
5787 the wrong answer. */
5788 return convert_from_reference (rvalue (cp_fold_convert (type
, expr
)));
5791 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5792 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5793 if (TREE_CODE (type
) == REFERENCE_TYPE
5794 && TYPE_REF_IS_RVALUE (type
)
5795 && real_lvalue_p (expr
)
5796 && reference_related_p (TREE_TYPE (type
), intype
)
5797 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5799 expr
= build_typed_address (expr
, type
);
5800 return convert_from_reference (expr
);
5803 /* Resolve overloaded address here rather than once in
5804 implicit_conversion and again in the inverse code below. */
5805 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5807 expr
= instantiate_type (type
, expr
, complain
);
5808 intype
= TREE_TYPE (expr
);
5811 /* [expr.static.cast]
5813 An expression e can be explicitly converted to a type T using a
5814 static_cast of the form static_cast<T>(e) if the declaration T
5815 t(e);" is well-formed, for some invented temporary variable
5817 result
= perform_direct_initialization_if_possible (type
, expr
,
5818 c_cast_p
, complain
);
5821 result
= convert_from_reference (result
);
5823 /* [expr.static.cast]
5825 If T is a reference type, the result is an lvalue; otherwise,
5826 the result is an rvalue. */
5827 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5828 result
= rvalue (result
);
5832 /* [expr.static.cast]
5834 Any expression can be explicitly converted to type cv void. */
5835 if (TREE_CODE (type
) == VOID_TYPE
)
5836 return convert_to_void (expr
, ICV_CAST
, complain
);
5838 /* [expr.static.cast]
5840 The inverse of any standard conversion sequence (clause _conv_),
5841 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5842 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5843 (_conv.bool_) conversions, can be performed explicitly using
5844 static_cast subject to the restriction that the explicit
5845 conversion does not cast away constness (_expr.const.cast_), and
5846 the following additional rules for specific cases: */
5847 /* For reference, the conversions not excluded are: integral
5848 promotions, floating point promotion, integral conversions,
5849 floating point conversions, floating-integral conversions,
5850 pointer conversions, and pointer to member conversions. */
5853 A value of integral _or enumeration_ type can be explicitly
5854 converted to an enumeration type. */
5855 /* The effect of all that is that any conversion between any two
5856 types which are integral, floating, or enumeration types can be
5858 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5859 || SCALAR_FLOAT_TYPE_P (type
))
5860 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5861 || SCALAR_FLOAT_TYPE_P (intype
)))
5862 return ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5864 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5865 && CLASS_TYPE_P (TREE_TYPE (type
))
5866 && CLASS_TYPE_P (TREE_TYPE (intype
))
5867 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5868 (TREE_TYPE (intype
))),
5869 build_pointer_type (TYPE_MAIN_VARIANT
5870 (TREE_TYPE (type
)))))
5875 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5876 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
5877 c_cast_p
? ba_unique
: ba_check
,
5879 expr
= build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
5880 return cp_fold_convert(type
, expr
);
5883 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5884 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5891 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
5892 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
5894 if (TYPE_PTRMEM_P (type
))
5896 t1
= (build_ptrmem_type
5898 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
5899 t2
= (build_ptrmem_type
5901 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
5908 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
5911 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5912 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
5913 c_cast_p
, tf_warning_or_error
);
5917 /* [expr.static.cast]
5919 An rvalue of type "pointer to cv void" can be explicitly
5920 converted to a pointer to object type. A value of type pointer
5921 to object converted to "pointer to cv void" and back to the
5922 original pointer type will have its original value. */
5923 if (TREE_CODE (intype
) == POINTER_TYPE
5924 && VOID_TYPE_P (TREE_TYPE (intype
))
5925 && TYPE_PTROB_P (type
))
5928 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5929 return build_nop (type
, expr
);
5933 return error_mark_node
;
5936 /* Return an expression representing static_cast<TYPE>(EXPR). */
5939 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5944 if (type
== error_mark_node
|| expr
== error_mark_node
)
5945 return error_mark_node
;
5947 if (processing_template_decl
)
5949 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
5950 /* We don't know if it will or will not have side effects. */
5951 TREE_SIDE_EFFECTS (expr
) = 1;
5952 return convert_from_reference (expr
);
5955 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5956 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5957 if (TREE_CODE (type
) != REFERENCE_TYPE
5958 && TREE_CODE (expr
) == NOP_EXPR
5959 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5960 expr
= TREE_OPERAND (expr
, 0);
5962 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
5967 if (complain
& tf_error
)
5968 error ("invalid static_cast from type %qT to type %qT",
5969 TREE_TYPE (expr
), type
);
5970 return error_mark_node
;
5973 /* EXPR is an expression with member function or pointer-to-member
5974 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5975 not permitted by ISO C++, but we accept it in some modes. If we
5976 are not in one of those modes, issue a diagnostic. Return the
5977 converted expression. */
5980 convert_member_func_to_ptr (tree type
, tree expr
)
5985 intype
= TREE_TYPE (expr
);
5986 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
5987 || TREE_CODE (intype
) == METHOD_TYPE
);
5989 if (pedantic
|| warn_pmf2ptr
)
5990 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
5991 "converting from %qT to %qT", intype
, type
);
5993 if (TREE_CODE (intype
) == METHOD_TYPE
)
5994 expr
= build_addr_func (expr
);
5995 else if (TREE_CODE (expr
) == PTRMEM_CST
)
5996 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
5999 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
6000 decl
= build_address (decl
);
6001 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
6004 return build_nop (type
, expr
);
6007 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
6008 If C_CAST_P is true, this reinterpret cast is being done as part of
6009 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
6010 indicate whether or not reinterpret_cast was valid. */
6013 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6014 bool *valid_p
, tsubst_flags_t complain
)
6018 /* Assume the cast is invalid. */
6022 if (type
== error_mark_node
|| error_operand_p (expr
))
6023 return error_mark_node
;
6025 intype
= TREE_TYPE (expr
);
6027 /* Save casted types in the function's used types hash table. */
6028 used_types_insert (type
);
6030 /* [expr.reinterpret.cast]
6031 An lvalue expression of type T1 can be cast to the type
6032 "reference to T2" if an expression of type "pointer to T1" can be
6033 explicitly converted to the type "pointer to T2" using a
6034 reinterpret_cast. */
6035 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6037 if (! real_lvalue_p (expr
))
6039 if (complain
& tf_error
)
6040 error ("invalid cast of an rvalue expression of type "
6043 return error_mark_node
;
6046 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6047 "B" are related class types; the reinterpret_cast does not
6048 adjust the pointer. */
6049 if (TYPE_PTR_P (intype
)
6050 && (complain
& tf_warning
)
6051 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
6052 COMPARE_BASE
| COMPARE_DERIVED
)))
6053 warning (0, "casting %qT to %qT does not dereference pointer",
6056 expr
= cp_build_addr_expr (expr
, complain
);
6058 if (warn_strict_aliasing
> 2)
6059 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
6061 if (expr
!= error_mark_node
)
6062 expr
= build_reinterpret_cast_1
6063 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
6065 if (expr
!= error_mark_node
)
6066 /* cp_build_indirect_ref isn't right for rvalue refs. */
6067 expr
= convert_from_reference (fold_convert (type
, expr
));
6071 /* As a G++ extension, we consider conversions from member
6072 functions, and pointers to member functions to
6073 pointer-to-function and pointer-to-void types. If
6074 -Wno-pmf-conversions has not been specified,
6075 convert_member_func_to_ptr will issue an error message. */
6076 if ((TYPE_PTRMEMFUNC_P (intype
)
6077 || TREE_CODE (intype
) == METHOD_TYPE
)
6078 && TYPE_PTR_P (type
)
6079 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6080 || VOID_TYPE_P (TREE_TYPE (type
))))
6081 return convert_member_func_to_ptr (type
, expr
);
6083 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6084 array-to-pointer, and function-to-pointer conversions are
6086 expr
= decay_conversion (expr
);
6088 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6089 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6090 if (TREE_CODE (expr
) == NOP_EXPR
6091 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6092 expr
= TREE_OPERAND (expr
, 0);
6094 if (error_operand_p (expr
))
6095 return error_mark_node
;
6097 intype
= TREE_TYPE (expr
);
6099 /* [expr.reinterpret.cast]
6100 A pointer can be converted to any integral type large enough to
6101 hold it. ... A value of type std::nullptr_t can be converted to
6102 an integral type; the conversion has the same meaning and
6103 validity as a conversion of (void*)0 to the integral type. */
6104 if (CP_INTEGRAL_TYPE_P (type
)
6105 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
6107 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
6109 if (complain
& tf_error
)
6110 permerror (input_location
, "cast from %qT to %qT loses precision",
6113 return error_mark_node
;
6115 if (NULLPTR_TYPE_P (intype
))
6116 return build_int_cst (type
, 0);
6118 /* [expr.reinterpret.cast]
6119 A value of integral or enumeration type can be explicitly
6120 converted to a pointer. */
6121 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6124 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6125 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6126 return fold_if_not_in_template (build_nop (type
, expr
));
6127 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6128 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6133 check_for_casting_away_constness (intype
, type
, REINTERPRET_CAST_EXPR
);
6134 /* Warn about possible alignment problems. */
6135 if (STRICT_ALIGNMENT
&& warn_cast_align
6136 && (complain
& tf_warning
)
6137 && !VOID_TYPE_P (type
)
6138 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6139 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6140 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6141 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6142 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6143 "increases required alignment of target type", intype
, type
);
6145 /* We need to strip nops here, because the front end likes to
6146 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6148 if (warn_strict_aliasing
<= 2)
6149 strict_aliasing_warning (intype
, type
, sexpr
);
6151 return fold_if_not_in_template (build_nop (type
, expr
));
6153 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6154 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6156 if (pedantic
&& (complain
& tf_warning
))
6157 /* Only issue a warning, as we have always supported this
6158 where possible, and it is necessary in some cases. DR 195
6159 addresses this issue, but as of 2004/10/26 is still in
6161 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6162 return fold_if_not_in_template (build_nop (type
, expr
));
6164 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6165 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6166 else if (TREE_CODE (intype
) == VECTOR_TYPE
6167 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6168 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6173 if (complain
& tf_error
)
6174 error ("invalid cast from type %qT to type %qT", intype
, type
);
6175 return error_mark_node
;
6178 return cp_convert (type
, expr
);
6182 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6184 if (type
== error_mark_node
|| expr
== error_mark_node
)
6185 return error_mark_node
;
6187 if (processing_template_decl
)
6189 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6191 if (!TREE_SIDE_EFFECTS (t
)
6192 && type_dependent_expression_p (expr
))
6193 /* There might turn out to be side effects inside expr. */
6194 TREE_SIDE_EFFECTS (t
) = 1;
6195 return convert_from_reference (t
);
6198 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6199 /*valid_p=*/NULL
, complain
);
6202 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6203 return an appropriate expression. Otherwise, return
6204 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6205 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6206 performing a C-style cast, its value upon return will indicate
6207 whether or not the conversion succeeded. */
6210 build_const_cast_1 (tree dst_type
, tree expr
, bool complain
,
6214 tree reference_type
;
6216 /* Callers are responsible for handling error_mark_node as a
6217 destination type. */
6218 gcc_assert (dst_type
!= error_mark_node
);
6219 /* In a template, callers should be building syntactic
6220 representations of casts, not using this machinery. */
6221 gcc_assert (!processing_template_decl
);
6223 /* Assume the conversion is invalid. */
6227 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6230 error ("invalid use of const_cast with type %qT, "
6231 "which is not a pointer, "
6232 "reference, nor a pointer-to-data-member type", dst_type
);
6233 return error_mark_node
;
6236 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6239 error ("invalid use of const_cast with type %qT, which is a pointer "
6240 "or reference to a function type", dst_type
);
6241 return error_mark_node
;
6244 /* Save casted types in the function's used types hash table. */
6245 used_types_insert (dst_type
);
6247 src_type
= TREE_TYPE (expr
);
6248 /* Expressions do not really have reference types. */
6249 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6250 src_type
= TREE_TYPE (src_type
);
6252 /* [expr.const.cast]
6254 An lvalue of type T1 can be explicitly converted to an lvalue of
6255 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6256 types) if a pointer to T1 can be explicitly converted to the type
6257 pointer to T2 using a const_cast. */
6258 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6260 reference_type
= dst_type
;
6261 if (! real_lvalue_p (expr
))
6264 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6265 src_type
, dst_type
);
6266 return error_mark_node
;
6268 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6269 src_type
= build_pointer_type (src_type
);
6273 reference_type
= NULL_TREE
;
6274 /* If the destination type is not a reference type, the
6275 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6276 conversions are performed. */
6277 src_type
= type_decays_to (src_type
);
6278 if (src_type
== error_mark_node
)
6279 return error_mark_node
;
6282 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6283 && comp_ptr_ttypes_const (dst_type
, src_type
))
6288 /* This cast is actually a C-style cast. Issue a warning if
6289 the user is making a potentially unsafe cast. */
6290 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
);
6294 expr
= cp_build_addr_expr (expr
,
6295 complain
? tf_warning_or_error
: tf_none
);
6296 expr
= build_nop (reference_type
, expr
);
6297 return convert_from_reference (expr
);
6301 expr
= decay_conversion (expr
);
6302 /* build_c_cast puts on a NOP_EXPR to make the result not an
6303 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6304 non-lvalue context. */
6305 if (TREE_CODE (expr
) == NOP_EXPR
6306 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6307 expr
= TREE_OPERAND (expr
, 0);
6308 return build_nop (dst_type
, expr
);
6313 error ("invalid const_cast from type %qT to type %qT",
6314 src_type
, dst_type
);
6315 return error_mark_node
;
6319 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6321 if (type
== error_mark_node
|| error_operand_p (expr
))
6322 return error_mark_node
;
6324 if (processing_template_decl
)
6326 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6328 if (!TREE_SIDE_EFFECTS (t
)
6329 && type_dependent_expression_p (expr
))
6330 /* There might turn out to be side effects inside expr. */
6331 TREE_SIDE_EFFECTS (t
) = 1;
6332 return convert_from_reference (t
);
6335 return build_const_cast_1 (type
, expr
, complain
& tf_error
,
6339 /* Like cp_build_c_cast, but for the c-common bits. */
6342 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6344 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6347 /* Build an expression representing an explicit C-style cast to type
6348 TYPE of expression EXPR. */
6351 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6357 if (type
== error_mark_node
|| error_operand_p (expr
))
6358 return error_mark_node
;
6360 if (processing_template_decl
)
6362 tree t
= build_min (CAST_EXPR
, type
,
6363 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6364 /* We don't know if it will or will not have side effects. */
6365 TREE_SIDE_EFFECTS (t
) = 1;
6366 return convert_from_reference (t
);
6369 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6370 'Class') should always be retained, because this information aids
6371 in method lookup. */
6372 if (objc_is_object_ptr (type
)
6373 && objc_is_object_ptr (TREE_TYPE (expr
)))
6374 return build_nop (type
, expr
);
6376 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6377 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6378 if (TREE_CODE (type
) != REFERENCE_TYPE
6379 && TREE_CODE (value
) == NOP_EXPR
6380 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6381 value
= TREE_OPERAND (value
, 0);
6383 if (TREE_CODE (type
) == ARRAY_TYPE
)
6385 /* Allow casting from T1* to T2[] because Cfront allows it.
6386 NIHCL uses it. It is not valid ISO C++ however. */
6387 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6389 if (complain
& tf_error
)
6390 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6392 return error_mark_node
;
6393 type
= build_pointer_type (TREE_TYPE (type
));
6397 if (complain
& tf_error
)
6398 error ("ISO C++ forbids casting to an array type %qT", type
);
6399 return error_mark_node
;
6403 if (TREE_CODE (type
) == FUNCTION_TYPE
6404 || TREE_CODE (type
) == METHOD_TYPE
)
6406 if (complain
& tf_error
)
6407 error ("invalid cast to function type %qT", type
);
6408 return error_mark_node
;
6411 if (TREE_CODE (type
) == POINTER_TYPE
6412 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
6413 /* Casting to an integer of smaller size is an error detected elsewhere. */
6414 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
6415 /* Don't warn about converting any constant. */
6416 && !TREE_CONSTANT (value
))
6417 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
6418 "cast to pointer from integer of different size");
6420 /* A C-style cast can be a const_cast. */
6421 result
= build_const_cast_1 (type
, value
, /*complain=*/false,
6426 /* Or a static cast. */
6427 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6428 &valid_p
, complain
);
6429 /* Or a reinterpret_cast. */
6431 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6432 &valid_p
, complain
);
6433 /* The static_cast or reinterpret_cast may be followed by a
6436 /* A valid cast may result in errors if, for example, a
6437 conversion to am ambiguous base class is required. */
6438 && !error_operand_p (result
))
6442 /* Non-class rvalues always have cv-unqualified type. */
6443 if (!CLASS_TYPE_P (type
))
6444 type
= TYPE_MAIN_VARIANT (type
);
6445 result_type
= TREE_TYPE (result
);
6446 if (!CLASS_TYPE_P (result_type
))
6447 result_type
= TYPE_MAIN_VARIANT (result_type
);
6448 /* If the type of RESULT does not match TYPE, perform a
6449 const_cast to make it match. If the static_cast or
6450 reinterpret_cast succeeded, we will differ by at most
6451 cv-qualification, so the follow-on const_cast is guaranteed
6453 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6455 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6456 gcc_assert (valid_p
);
6461 return error_mark_node
;
6464 /* For use from the C common bits. */
6466 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6467 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6468 enum tree_code modifycode
,
6469 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6470 tree rhs_origtype ATTRIBUTE_UNUSED
)
6472 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6475 /* Build an assignment expression of lvalue LHS from value RHS.
6476 MODIFYCODE is the code for a binary operator that we use
6477 to combine the old value of LHS with RHS to get the new value.
6478 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6480 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6483 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6484 tsubst_flags_t complain
)
6488 tree lhstype
= TREE_TYPE (lhs
);
6489 tree olhstype
= lhstype
;
6490 bool plain_assign
= (modifycode
== NOP_EXPR
);
6492 /* Avoid duplicate error messages from operands that had errors. */
6493 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6494 return error_mark_node
;
6496 /* Handle control structure constructs used as "lvalues". */
6497 switch (TREE_CODE (lhs
))
6499 /* Handle --foo = 5; as these are valid constructs in C++. */
6500 case PREDECREMENT_EXPR
:
6501 case PREINCREMENT_EXPR
:
6502 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6503 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6504 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6505 TREE_OPERAND (lhs
, 1));
6506 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6507 modifycode
, rhs
, complain
);
6508 if (newrhs
== error_mark_node
)
6509 return error_mark_node
;
6510 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6512 /* Handle (a, b) used as an "lvalue". */
6514 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6515 modifycode
, rhs
, complain
);
6516 if (newrhs
== error_mark_node
)
6517 return error_mark_node
;
6518 return build2 (COMPOUND_EXPR
, lhstype
,
6519 TREE_OPERAND (lhs
, 0), newrhs
);
6522 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6523 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6524 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6525 TREE_OPERAND (lhs
, 1));
6526 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6528 if (newrhs
== error_mark_node
)
6529 return error_mark_node
;
6530 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6534 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6535 when neither operand has side-effects. */
6536 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6537 return error_mark_node
;
6539 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6540 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6542 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6543 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6545 TREE_OPERAND (lhs
, 0),
6546 TREE_OPERAND (lhs
, 1)),
6547 TREE_OPERAND (lhs
, 0),
6548 TREE_OPERAND (lhs
, 1));
6551 /* Handle (a ? b : c) used as an "lvalue". */
6554 /* Produce (a ? (b = rhs) : (c = rhs))
6555 except that the RHS goes through a save-expr
6556 so the code to compute it is only emitted once. */
6558 tree preeval
= NULL_TREE
;
6560 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6562 if (complain
& tf_error
)
6563 error ("void value not ignored as it ought to be");
6564 return error_mark_node
;
6567 rhs
= stabilize_expr (rhs
, &preeval
);
6569 /* Check this here to avoid odd errors when trying to convert
6570 a throw to the type of the COND_EXPR. */
6571 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6572 return error_mark_node
;
6574 cond
= build_conditional_expr
6575 (TREE_OPERAND (lhs
, 0),
6576 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6577 modifycode
, rhs
, complain
),
6578 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6579 modifycode
, rhs
, complain
),
6582 if (cond
== error_mark_node
)
6584 /* Make sure the code to compute the rhs comes out
6585 before the split. */
6587 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6595 if (modifycode
== INIT_EXPR
)
6597 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6598 /* Do the default thing. */;
6599 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6601 /* Compound literal. */
6602 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6603 /* Call convert to generate an error; see PR 11063. */
6604 rhs
= convert (lhstype
, rhs
);
6605 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6606 TREE_SIDE_EFFECTS (result
) = 1;
6609 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6610 /* Do the default thing. */;
6613 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6614 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6615 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6617 release_tree_vector (rhs_vec
);
6618 if (result
== NULL_TREE
)
6619 return error_mark_node
;
6625 lhs
= require_complete_type_sfinae (lhs
, complain
);
6626 if (lhs
== error_mark_node
)
6627 return error_mark_node
;
6629 if (modifycode
== NOP_EXPR
)
6631 if (c_dialect_objc ())
6633 result
= objc_maybe_build_modify_expr (lhs
, rhs
);
6638 /* `operator=' is not an inheritable operator. */
6639 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6640 /* Do the default thing. */;
6643 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6644 lhs
, rhs
, make_node (NOP_EXPR
),
6645 /*overloaded_p=*/NULL
,
6647 if (result
== NULL_TREE
)
6648 return error_mark_node
;
6655 /* A binary op has been requested. Combine the old LHS
6656 value with the RHS producing the value we should actually
6657 store into the LHS. */
6658 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6659 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6660 || MAYBE_CLASS_TYPE_P (lhstype
)));
6662 lhs
= stabilize_reference (lhs
);
6663 newrhs
= cp_build_binary_op (input_location
,
6664 modifycode
, lhs
, rhs
,
6666 if (newrhs
== error_mark_node
)
6668 if (complain
& tf_error
)
6669 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6670 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6671 return error_mark_node
;
6674 /* Now it looks like a plain assignment. */
6675 modifycode
= NOP_EXPR
;
6676 if (c_dialect_objc ())
6678 result
= objc_maybe_build_modify_expr (lhs
, newrhs
);
6683 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6684 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6687 /* The left-hand side must be an lvalue. */
6688 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6689 return error_mark_node
;
6691 /* Warn about modifying something that is `const'. Don't warn if
6692 this is initialization. */
6693 if (modifycode
!= INIT_EXPR
6694 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6695 /* Functions are not modifiable, even though they are
6697 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6698 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6699 /* If it's an aggregate and any field is const, then it is
6700 effectively const. */
6701 || (CLASS_TYPE_P (lhstype
)
6702 && C_TYPE_FIELDS_READONLY (lhstype
))))
6704 if (complain
& tf_error
)
6705 readonly_error (lhs
, REK_ASSIGNMENT
);
6707 return error_mark_node
;
6710 /* If storing into a structure or union member, it may have been given a
6711 lowered bitfield type. We need to convert to the declared type first,
6712 so retrieve it now. */
6714 olhstype
= unlowered_expr_type (lhs
);
6716 /* Convert new value to destination type. */
6718 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6722 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6724 if (modifycode
!= INIT_EXPR
)
6726 if (complain
& tf_error
)
6727 error ("assigning to an array from an initializer list");
6728 return error_mark_node
;
6730 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6731 return error_mark_node
;
6732 newrhs
= digest_init (lhstype
, newrhs
);
6735 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6736 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6738 if (complain
& tf_error
)
6739 error ("incompatible types in assignment of %qT to %qT",
6740 TREE_TYPE (rhs
), lhstype
);
6741 return error_mark_node
;
6744 /* Allow array assignment in compiler-generated code. */
6745 else if (!current_function_decl
6746 || !DECL_ARTIFICIAL (current_function_decl
))
6748 /* This routine is used for both initialization and assignment.
6749 Make sure the diagnostic message differentiates the context. */
6750 if (complain
& tf_error
)
6752 if (modifycode
== INIT_EXPR
)
6753 error ("array used as initializer");
6755 error ("invalid array assignment");
6757 return error_mark_node
;
6760 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6761 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6762 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6763 /*explicit_value_init_p=*/false,
6764 from_array
, complain
);
6767 if (modifycode
== INIT_EXPR
)
6768 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6769 LOOKUP_ONLYCONVERTING. */
6770 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6771 ICR_INIT
, NULL_TREE
, 0,
6774 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
6775 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6777 if (!same_type_p (lhstype
, olhstype
))
6778 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6780 if (modifycode
!= INIT_EXPR
)
6782 if (TREE_CODE (newrhs
) == CALL_EXPR
6783 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6784 newrhs
= build_cplus_new (lhstype
, newrhs
);
6786 /* Can't initialize directly from a TARGET_EXPR, since that would
6787 cause the lhs to be constructed twice, and possibly result in
6788 accidental self-initialization. So we force the TARGET_EXPR to be
6789 expanded without a target. */
6790 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6791 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6792 TREE_OPERAND (newrhs
, 0));
6795 if (newrhs
== error_mark_node
)
6796 return error_mark_node
;
6798 if (c_dialect_objc () && flag_objc_gc
)
6800 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6806 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6807 lhstype
, lhs
, newrhs
);
6809 TREE_SIDE_EFFECTS (result
) = 1;
6811 TREE_NO_WARNING (result
) = 1;
6817 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6818 tsubst_flags_t complain
)
6820 if (processing_template_decl
)
6821 return build_min_nt (MODOP_EXPR
, lhs
,
6822 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6824 if (modifycode
!= NOP_EXPR
)
6826 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6827 make_node (modifycode
),
6828 /*overloaded_p=*/NULL
,
6832 TREE_NO_WARNING (rval
) = 1;
6836 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6839 /* Helper function for get_delta_difference which assumes FROM is a base
6840 class of TO. Returns a delta for the conversion of pointer-to-member
6841 of FROM to pointer-to-member of TO. If the conversion is invalid and
6842 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
6843 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6844 If C_CAST_P is true, this conversion is taking place as part of a
6848 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
,
6849 tsubst_flags_t complain
)
6853 base_access access
= c_cast_p
? ba_unique
: ba_check
;
6855 /* Note: ba_quiet does not distinguish between access control and
6857 if (!(complain
& tf_error
))
6860 binfo
= lookup_base (to
, from
, access
, &kind
);
6862 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6864 if (!(complain
& tf_error
))
6865 return error_mark_node
;
6867 error (" in pointer to member function conversion");
6868 return size_zero_node
;
6872 if (kind
!= bk_via_virtual
)
6873 return BINFO_OFFSET (binfo
);
6875 /* FROM is a virtual base class of TO. Issue an error or warning
6876 depending on whether or not this is a reinterpret cast. */
6878 if (!(complain
& tf_error
))
6879 return error_mark_node
;
6881 error ("pointer to member conversion via virtual base %qT",
6882 BINFO_TYPE (binfo_from_vbase (binfo
)));
6884 return size_zero_node
;
6891 /* Get difference in deltas for different pointer to member function
6892 types. If the conversion is invalid and tf_error is not set in
6893 COMPLAIN, returns error_mark_node, otherwise returns an integer
6894 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
6895 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
6896 conversions as well. If C_CAST_P is true this conversion is taking
6897 place as part of a C-style cast.
6899 Note that the naming of FROM and TO is kind of backwards; the return
6900 value is what we add to a TO in order to get a FROM. They are named
6901 this way because we call this function to find out how to convert from
6902 a pointer to member of FROM to a pointer to member of TO. */
6905 get_delta_difference (tree from
, tree to
,
6906 bool allow_inverse_p
,
6907 bool c_cast_p
, tsubst_flags_t complain
)
6911 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
6912 /* Pointer to member of incomplete class is permitted*/
6913 result
= size_zero_node
;
6915 result
= get_delta_difference_1 (from
, to
, c_cast_p
, complain
);
6917 if (result
== error_mark_node
)
6918 return error_mark_node
;
6922 if (!allow_inverse_p
)
6924 if (!(complain
& tf_error
))
6925 return error_mark_node
;
6927 error_not_base_type (from
, to
);
6928 error (" in pointer to member conversion");
6929 result
= size_zero_node
;
6933 result
= get_delta_difference_1 (to
, from
, c_cast_p
, complain
);
6935 if (result
== error_mark_node
)
6936 return error_mark_node
;
6939 result
= size_diffop_loc (input_location
,
6940 size_zero_node
, result
);
6943 if (!(complain
& tf_error
))
6944 return error_mark_node
;
6946 error_not_base_type (from
, to
);
6947 error (" in pointer to member conversion");
6948 result
= size_zero_node
;
6953 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
6957 /* Return a constructor for the pointer-to-member-function TYPE using
6958 the other components as specified. */
6961 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
6966 VEC(constructor_elt
, gc
) *v
;
6968 /* Pull the FIELD_DECLs out of the type. */
6969 pfn_field
= TYPE_FIELDS (type
);
6970 delta_field
= DECL_CHAIN (pfn_field
);
6972 /* Make sure DELTA has the type we want. */
6973 delta
= convert_and_check (delta_type_node
, delta
);
6975 /* Convert to the correct target type if necessary. */
6976 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
6978 /* Finish creating the initializer. */
6979 v
= VEC_alloc(constructor_elt
, gc
, 2);
6980 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
6981 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
6982 u
= build_constructor (type
, v
);
6983 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
6984 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
6985 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
6987 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
6992 /* Build a constructor for a pointer to member function. It can be
6993 used to initialize global variables, local variable, or used
6994 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6997 If FORCE is nonzero, then force this conversion, even if
6998 we would rather not do it. Usually set when using an explicit
6999 cast. A C-style cast is being processed iff C_CAST_P is true.
7001 Return error_mark_node, if something goes wrong. */
7004 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
,
7005 tsubst_flags_t complain
)
7011 if (error_operand_p (pfn
))
7012 return error_mark_node
;
7014 pfn_type
= TREE_TYPE (pfn
);
7015 to_type
= build_ptrmemfunc_type (type
);
7017 /* Handle multiple conversions of pointer to member functions. */
7018 if (TYPE_PTRMEMFUNC_P (pfn_type
))
7020 tree delta
= NULL_TREE
;
7021 tree npfn
= NULL_TREE
;
7025 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
7026 error ("invalid conversion to type %qT from type %qT",
7029 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
7030 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
7032 c_cast_p
, complain
);
7033 if (n
== error_mark_node
)
7034 return error_mark_node
;
7036 /* We don't have to do any conversion to convert a
7037 pointer-to-member to its own type. But, we don't want to
7038 just return a PTRMEM_CST if there's an explicit cast; that
7039 cast should make the expression an invalid template argument. */
7040 if (TREE_CODE (pfn
) != PTRMEM_CST
)
7042 if (same_type_p (to_type
, pfn_type
))
7044 else if (integer_zerop (n
))
7045 return build_reinterpret_cast (to_type
, pfn
,
7046 tf_warning_or_error
);
7049 if (TREE_SIDE_EFFECTS (pfn
))
7050 pfn
= save_expr (pfn
);
7052 /* Obtain the function pointer and the current DELTA. */
7053 if (TREE_CODE (pfn
) == PTRMEM_CST
)
7054 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
7057 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
7058 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
7061 /* Just adjust the DELTA field. */
7062 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7063 (TREE_TYPE (delta
), ptrdiff_type_node
));
7064 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
7065 n
= cp_build_binary_op (input_location
,
7066 LSHIFT_EXPR
, n
, integer_one_node
,
7067 tf_warning_or_error
);
7068 delta
= cp_build_binary_op (input_location
,
7069 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
7070 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
7073 /* Handle null pointer to member function conversions. */
7074 if (null_ptr_cst_p (pfn
))
7076 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
7077 return build_ptrmemfunc1 (to_type
,
7082 if (type_unknown_p (pfn
))
7083 return instantiate_type (type
, pfn
, tf_warning_or_error
);
7085 fn
= TREE_OPERAND (pfn
, 0);
7086 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7087 /* In a template, we will have preserved the
7089 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
7090 return make_ptrmem_cst (to_type
, fn
);
7093 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7096 ??? There is no consistency as to the types returned for the above
7097 values. Some code acts as if it were a sizetype and some as if it were
7098 integer_type_node. */
7101 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
7103 tree type
= TREE_TYPE (cst
);
7104 tree fn
= PTRMEM_CST_MEMBER (cst
);
7105 tree ptr_class
, fn_class
;
7107 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7109 /* The class that the function belongs to. */
7110 fn_class
= DECL_CONTEXT (fn
);
7112 /* The class that we're creating a pointer to member of. */
7113 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
7115 /* First, calculate the adjustment to the function's class. */
7116 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
7117 /*c_cast_p=*/0, tf_warning_or_error
);
7119 if (!DECL_VIRTUAL_P (fn
))
7120 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
7123 /* If we're dealing with a virtual function, we have to adjust 'this'
7124 again, to point to the base which provides the vtable entry for
7125 fn; the call will do the opposite adjustment. */
7126 tree orig_class
= DECL_CONTEXT (fn
);
7127 tree binfo
= binfo_or_else (orig_class
, fn_class
);
7128 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7129 *delta
, BINFO_OFFSET (binfo
));
7130 *delta
= fold_if_not_in_template (*delta
);
7132 /* We set PFN to the vtable offset at which the function can be
7133 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7134 case delta is shifted left, and then incremented). */
7135 *pfn
= DECL_VINDEX (fn
);
7136 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
7137 TYPE_SIZE_UNIT (vtable_entry_type
));
7138 *pfn
= fold_if_not_in_template (*pfn
);
7140 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
7142 case ptrmemfunc_vbit_in_pfn
:
7143 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
7145 *pfn
= fold_if_not_in_template (*pfn
);
7148 case ptrmemfunc_vbit_in_delta
:
7149 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
7150 *delta
, integer_one_node
);
7151 *delta
= fold_if_not_in_template (*delta
);
7152 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7153 *delta
, integer_one_node
);
7154 *delta
= fold_if_not_in_template (*delta
);
7161 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
7162 *pfn
= fold_if_not_in_template (*pfn
);
7166 /* Return an expression for PFN from the pointer-to-member function
7170 pfn_from_ptrmemfunc (tree t
)
7172 if (TREE_CODE (t
) == PTRMEM_CST
)
7177 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7182 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
7185 /* Return an expression for DELTA from the pointer-to-member function
7189 delta_from_ptrmemfunc (tree t
)
7191 if (TREE_CODE (t
) == PTRMEM_CST
)
7196 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7201 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7204 /* Convert value RHS to type TYPE as preparation for an assignment to
7205 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
7206 implicit conversion is. If FNDECL is non-NULL, we are doing the
7207 conversion in order to pass the PARMNUMth argument of FNDECL.
7208 If FNDECL is NULL, we are doing the conversion in function pointer
7209 argument passing, conversion in initialization, etc. */
7212 convert_for_assignment (tree type
, tree rhs
,
7213 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7214 tsubst_flags_t complain
, int flags
)
7217 enum tree_code coder
;
7219 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7220 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7221 rhs
= TREE_OPERAND (rhs
, 0);
7223 rhstype
= TREE_TYPE (rhs
);
7224 coder
= TREE_CODE (rhstype
);
7226 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7227 && vector_types_convertible_p (type
, rhstype
, true))
7229 rhs
= mark_rvalue_use (rhs
);
7230 return convert (type
, rhs
);
7233 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7234 return error_mark_node
;
7235 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7236 return error_mark_node
;
7238 /* The RHS of an assignment cannot have void type. */
7239 if (coder
== VOID_TYPE
)
7241 if (complain
& tf_error
)
7242 error ("void value not ignored as it ought to be");
7243 return error_mark_node
;
7246 /* Simplify the RHS if possible. */
7247 if (TREE_CODE (rhs
) == CONST_DECL
)
7248 rhs
= DECL_INITIAL (rhs
);
7250 if (c_dialect_objc ())
7254 tree rname
= fndecl
;
7265 selector
= objc_message_selector ();
7267 if (selector
&& parmno
> 1)
7274 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7276 rhs
= mark_rvalue_use (rhs
);
7277 return convert (type
, rhs
);
7283 The expression is implicitly converted (clause _conv_) to the
7284 cv-unqualified type of the left operand.
7286 We allow bad conversions here because by the time we get to this point
7287 we are committed to doing the conversion. If we end up doing a bad
7288 conversion, convert_like will complain. */
7289 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7291 /* When -Wno-pmf-conversions is use, we just silently allow
7292 conversions from pointers-to-members to plain pointers. If
7293 the conversion doesn't work, cp_convert will complain. */
7295 && TYPE_PTR_P (type
)
7296 && TYPE_PTRMEMFUNC_P (rhstype
))
7297 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7300 if (complain
& tf_error
)
7302 /* If the right-hand side has unknown type, then it is an
7303 overloaded function. Call instantiate_type to get error
7305 if (rhstype
== unknown_type_node
)
7306 instantiate_type (type
, rhs
, tf_warning_or_error
);
7308 error ("cannot convert %qT to %qT for argument %qP to %qD",
7309 rhstype
, type
, parmnum
, fndecl
);
7313 case ICR_DEFAULT_ARGUMENT
:
7314 error ("cannot convert %qT to %qT in default argument",
7318 error ("cannot convert %qT to %qT in argument passing",
7321 case ICR_CONVERTING
:
7322 error ("cannot convert %qT to %qT",
7326 error ("cannot convert %qT to %qT in initialization",
7330 error ("cannot convert %qT to %qT in return",
7334 error ("cannot convert %qT to %qT in assignment",
7341 return error_mark_node
;
7344 if (warn_missing_format_attribute
)
7346 const enum tree_code codel
= TREE_CODE (type
);
7347 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7349 && check_missing_format_attribute (type
, rhstype
)
7350 && (complain
& tf_warning
))
7354 case ICR_DEFAULT_ARGUMENT
:
7356 warning (OPT_Wmissing_format_attribute
,
7357 "parameter %qP of %qD might be a candidate "
7358 "for a format attribute", parmnum
, fndecl
);
7360 warning (OPT_Wmissing_format_attribute
,
7361 "parameter might be a candidate "
7362 "for a format attribute");
7364 case ICR_CONVERTING
:
7365 warning (OPT_Wmissing_format_attribute
,
7366 "target of conversion might be might be a candidate "
7367 "for a format attribute");
7370 warning (OPT_Wmissing_format_attribute
,
7371 "target of initialization might be a candidate "
7372 "for a format attribute");
7375 warning (OPT_Wmissing_format_attribute
,
7376 "return type might be a candidate "
7377 "for a format attribute");
7380 warning (OPT_Wmissing_format_attribute
,
7381 "left-hand side of assignment might be a candidate "
7382 "for a format attribute");
7389 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7391 if (warn_parentheses
7392 && TREE_CODE (type
) == BOOLEAN_TYPE
7393 && TREE_CODE (rhs
) == MODIFY_EXPR
7394 && !TREE_NO_WARNING (rhs
)
7395 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7396 && (complain
& tf_warning
))
7398 location_t loc
= EXPR_LOC_OR_HERE (rhs
);
7400 warning_at (loc
, OPT_Wparentheses
,
7401 "suggest parentheses around assignment used as truth value");
7402 TREE_NO_WARNING (rhs
) = 1;
7405 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7409 /* Convert RHS to be of type TYPE.
7410 If EXP is nonzero, it is the target of the initialization.
7411 ERRTYPE indicates what kind of error the implicit conversion is.
7413 Two major differences between the behavior of
7414 `convert_for_assignment' and `convert_for_initialization'
7415 are that references are bashed in the former, while
7416 copied in the latter, and aggregates are assigned in
7417 the former (operator=) while initialized in the
7420 If using constructor make sure no conversion operator exists, if one does
7421 exist, an ambiguity exists.
7423 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7426 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7427 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7428 tsubst_flags_t complain
)
7430 enum tree_code codel
= TREE_CODE (type
);
7432 enum tree_code coder
;
7434 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7435 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7436 if (TREE_CODE (rhs
) == NOP_EXPR
7437 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7438 && codel
!= REFERENCE_TYPE
)
7439 rhs
= TREE_OPERAND (rhs
, 0);
7441 if (type
== error_mark_node
7442 || rhs
== error_mark_node
7443 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7444 return error_mark_node
;
7446 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7447 && TREE_CODE (type
) != ARRAY_TYPE
7448 && (TREE_CODE (type
) != REFERENCE_TYPE
7449 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7450 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7451 && (TREE_CODE (type
) != REFERENCE_TYPE
7452 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7453 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7454 rhs
= decay_conversion (rhs
);
7456 rhstype
= TREE_TYPE (rhs
);
7457 coder
= TREE_CODE (rhstype
);
7459 if (coder
== ERROR_MARK
)
7460 return error_mark_node
;
7462 /* We accept references to incomplete types, so we can
7463 return here before checking if RHS is of complete type. */
7465 if (codel
== REFERENCE_TYPE
)
7467 /* This should eventually happen in convert_arguments. */
7468 int savew
= 0, savee
= 0;
7471 savew
= warningcount
, savee
= errorcount
;
7472 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7473 /*cleanup=*/NULL
, complain
);
7476 if (warningcount
> savew
)
7477 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7478 else if (errorcount
> savee
)
7479 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7485 exp
= require_complete_type_sfinae (exp
, complain
);
7486 if (exp
== error_mark_node
)
7487 return error_mark_node
;
7489 rhstype
= non_reference (rhstype
);
7491 type
= complete_type (type
);
7493 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7494 /* Don't try to do copy-initialization if we already have
7495 direct-initialization. */
7498 if (MAYBE_CLASS_TYPE_P (type
))
7499 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
7501 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7505 /* If RETVAL is the address of, or a reference to, a local variable or
7506 temporary give an appropriate warning. */
7509 maybe_warn_about_returning_address_of_local (tree retval
)
7511 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7512 tree whats_returned
= retval
;
7516 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7517 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7518 else if (CONVERT_EXPR_P (whats_returned
)
7519 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7520 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7525 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7527 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7529 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7531 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7532 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7534 warning (0, "returning reference to temporary");
7537 if (TREE_CODE (whats_returned
) == VAR_DECL
7538 && DECL_NAME (whats_returned
)
7539 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7541 warning (0, "reference to non-lvalue returned");
7546 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7547 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7548 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7550 if (DECL_P (whats_returned
)
7551 && DECL_NAME (whats_returned
)
7552 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7553 && !(TREE_STATIC (whats_returned
)
7554 || TREE_PUBLIC (whats_returned
)))
7556 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7557 warning (0, "reference to local variable %q+D returned",
7560 warning (0, "address of local variable %q+D returned",
7566 /* Check that returning RETVAL from the current function is valid.
7567 Return an expression explicitly showing all conversions required to
7568 change RETVAL into the function return type, and to assign it to
7569 the DECL_RESULT for the function. Set *NO_WARNING to true if
7570 code reaches end of non-void function warning shouldn't be issued
7571 on this RETURN_EXPR. */
7574 check_return_expr (tree retval
, bool *no_warning
)
7577 /* The type actually returned by the function, after any
7580 int fn_returns_value_p
;
7581 bool named_return_value_okay_p
;
7583 *no_warning
= false;
7585 /* A `volatile' function is one that isn't supposed to return, ever.
7586 (This is a G++ extension, used to get better code for functions
7587 that call the `volatile' function.) */
7588 if (TREE_THIS_VOLATILE (current_function_decl
))
7589 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7591 /* Check for various simple errors. */
7592 if (DECL_DESTRUCTOR_P (current_function_decl
))
7595 error ("returning a value from a destructor");
7598 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7600 if (in_function_try_handler
)
7601 /* If a return statement appears in a handler of the
7602 function-try-block of a constructor, the program is ill-formed. */
7603 error ("cannot return from a handler of a function-try-block of a constructor");
7605 /* You can't return a value from a constructor. */
7606 error ("returning a value from a constructor");
7610 /* As an extension, deduce lambda return type from a return statement
7611 anywhere in the body. */
7612 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7614 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7615 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7617 tree type
= lambda_return_type (retval
);
7618 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7620 if (VOID_TYPE_P (type
))
7622 else if (oldtype
== NULL_TREE
)
7624 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7625 "can only be deduced when the return statement is "
7626 "the only statement in the function body");
7627 apply_lambda_return_type (lambda
, type
);
7629 else if (!same_type_p (type
, oldtype
))
7630 error ("inconsistent types %qT and %qT deduced for "
7631 "lambda return type", type
, oldtype
);
7635 if (processing_template_decl
)
7637 current_function_returns_value
= 1;
7638 if (check_for_bare_parameter_packs (retval
))
7639 retval
= error_mark_node
;
7643 /* When no explicit return-value is given in a function with a named
7644 return value, the named return value is used. */
7645 result
= DECL_RESULT (current_function_decl
);
7646 valtype
= TREE_TYPE (result
);
7647 gcc_assert (valtype
!= NULL_TREE
);
7648 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7649 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7652 /* Check for a return statement with no return value in a function
7653 that's supposed to return a value. */
7654 if (!retval
&& fn_returns_value_p
)
7656 permerror (input_location
, "return-statement with no value, in function returning %qT",
7658 /* Clear this, so finish_function won't say that we reach the
7659 end of a non-void function (which we don't, we gave a
7661 current_function_returns_null
= 0;
7662 /* And signal caller that TREE_NO_WARNING should be set on the
7663 RETURN_EXPR to avoid control reaches end of non-void function
7664 warnings in tree-cfg.c. */
7667 /* Check for a return statement with a value in a function that
7668 isn't supposed to return a value. */
7669 else if (retval
&& !fn_returns_value_p
)
7671 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7672 /* You can return a `void' value from a function of `void'
7673 type. In that case, we have to evaluate the expression for
7674 its side-effects. */
7675 finish_expr_stmt (retval
);
7677 permerror (input_location
, "return-statement with a value, in function "
7678 "returning 'void'");
7679 current_function_returns_null
= 1;
7681 /* There's really no value to return, after all. */
7685 /* Remember that this function can sometimes return without a
7687 current_function_returns_null
= 1;
7689 /* Remember that this function did return a value. */
7690 current_function_returns_value
= 1;
7692 /* Check for erroneous operands -- but after giving ourselves a
7693 chance to provide an error about returning a value from a void
7695 if (error_operand_p (retval
))
7697 current_function_return_value
= error_mark_node
;
7698 return error_mark_node
;
7701 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7702 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7703 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7704 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7706 && retval
&& null_ptr_cst_p (retval
))
7707 warning (0, "%<operator new%> must not return NULL unless it is "
7708 "declared %<throw()%> (or -fcheck-new is in effect)");
7710 /* Effective C++ rule 15. See also start_function. */
7712 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7716 /* The function return type must be a reference to the current
7718 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7719 && same_type_ignoring_top_level_qualifiers_p
7720 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7722 /* Returning '*this' is obviously OK. */
7723 if (retval
== current_class_ref
)
7725 /* If we are calling a function whose return type is the same of
7726 the current class reference, it is ok. */
7727 else if (TREE_CODE (retval
) == INDIRECT_REF
7728 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7733 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7736 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7738 [...] For a function with a class return type, if the expression
7739 in the return statement is the name of a local object, and the cv-
7740 unqualified type of the local object is the same as the function
7741 return type, an implementation is permitted to omit creating the tem-
7742 porary object to hold the function return value [...]
7744 So, if this is a value-returning function that always returns the same
7745 local variable, remember it.
7747 It might be nice to be more flexible, and choose the first suitable
7748 variable even if the function sometimes returns something else, but
7749 then we run the risk of clobbering the variable we chose if the other
7750 returned expression uses the chosen variable somehow. And people expect
7751 this restriction, anyway. (jason 2000-11-19)
7753 See finish_function and finalize_nrv for the rest of this optimization. */
7755 named_return_value_okay_p
=
7756 (retval
!= NULL_TREE
7757 /* Must be a local, automatic variable. */
7758 && TREE_CODE (retval
) == VAR_DECL
7759 && DECL_CONTEXT (retval
) == current_function_decl
7760 && ! TREE_STATIC (retval
)
7761 && ! DECL_ANON_UNION_VAR_P (retval
)
7762 && (DECL_ALIGN (retval
)
7763 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7764 /* The cv-unqualified type of the returned value must be the
7765 same as the cv-unqualified return type of the
7767 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7769 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7770 /* And the returned value must be non-volatile. */
7771 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7773 if (fn_returns_value_p
&& flag_elide_constructors
)
7775 if (named_return_value_okay_p
7776 && (current_function_return_value
== NULL_TREE
7777 || current_function_return_value
== retval
))
7778 current_function_return_value
= retval
;
7780 current_function_return_value
= error_mark_node
;
7783 /* We don't need to do any conversions when there's nothing being
7788 /* Do any required conversions. */
7789 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7790 /* No conversions are required. */
7794 /* The type the function is declared to return. */
7795 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7796 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7798 /* The functype's return type will have been set to void, if it
7799 was an incomplete type. Just treat this as 'return;' */
7800 if (VOID_TYPE_P (functype
))
7801 return error_mark_node
;
7803 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7804 treated as an rvalue for the purposes of overload resolution to
7805 favor move constructors over copy constructors. */
7806 if ((cxx_dialect
!= cxx98
)
7807 && named_return_value_okay_p
7808 /* The variable must not have the `volatile' qualifier. */
7809 && !CP_TYPE_VOLATILE_P (TREE_TYPE (retval
))
7810 /* The return type must be a class type. */
7811 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7812 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7814 /* First convert the value to the function's return type, then
7815 to the type of return value's location to handle the
7816 case that functype is smaller than the valtype. */
7817 retval
= convert_for_initialization
7818 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
7819 tf_warning_or_error
);
7820 retval
= convert (valtype
, retval
);
7822 /* If the conversion failed, treat this just like `return;'. */
7823 if (retval
== error_mark_node
)
7825 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7826 else if (! cfun
->returns_struct
7827 && TREE_CODE (retval
) == TARGET_EXPR
7828 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7829 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7830 TREE_OPERAND (retval
, 0));
7832 maybe_warn_about_returning_address_of_local (retval
);
7835 /* Actually copy the value returned into the appropriate location. */
7836 if (retval
&& retval
!= result
)
7837 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7843 /* Returns nonzero if the pointer-type FROM can be converted to the
7844 pointer-type TO via a qualification conversion. If CONSTP is -1,
7845 then we return nonzero if the pointers are similar, and the
7846 cv-qualification signature of FROM is a proper subset of that of TO.
7848 If CONSTP is positive, then all outer pointers have been
7852 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7854 bool to_more_cv_qualified
= false;
7855 bool is_opaque_pointer
= false;
7857 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7859 if (TREE_CODE (to
) != TREE_CODE (from
))
7862 if (TREE_CODE (from
) == OFFSET_TYPE
7863 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7864 TYPE_OFFSET_BASETYPE (to
)))
7867 /* Const and volatile mean something different for function types,
7868 so the usual checks are not appropriate. */
7869 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7871 if (!at_least_as_qualified_p (to
, from
))
7874 if (!at_least_as_qualified_p (from
, to
))
7878 to_more_cv_qualified
= true;
7882 constp
&= TYPE_READONLY (to
);
7885 if (TREE_CODE (to
) == VECTOR_TYPE
)
7886 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7888 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
7889 return ((constp
>= 0 || to_more_cv_qualified
)
7890 && (is_opaque_pointer
7891 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
7895 /* When comparing, say, char ** to char const **, this function takes
7896 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7897 types to this function. */
7900 comp_ptr_ttypes (tree to
, tree from
)
7902 return comp_ptr_ttypes_real (to
, from
, 1);
7905 /* Returns true iff FNTYPE is a non-class type that involves
7906 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7907 if a parameter type is ill-formed. */
7910 error_type_p (const_tree type
)
7914 switch (TREE_CODE (type
))
7920 case REFERENCE_TYPE
:
7922 return error_type_p (TREE_TYPE (type
));
7926 if (error_type_p (TREE_TYPE (type
)))
7928 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7929 if (error_type_p (TREE_VALUE (t
)))
7934 if (TYPE_PTRMEMFUNC_P (type
))
7935 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
7943 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7944 type or inheritance-related types, regardless of cv-quals. */
7947 ptr_reasonably_similar (const_tree to
, const_tree from
)
7949 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7951 /* Any target type is similar enough to void. */
7952 if (TREE_CODE (to
) == VOID_TYPE
)
7953 return !error_type_p (from
);
7954 if (TREE_CODE (from
) == VOID_TYPE
)
7955 return !error_type_p (to
);
7957 if (TREE_CODE (to
) != TREE_CODE (from
))
7960 if (TREE_CODE (from
) == OFFSET_TYPE
7961 && comptypes (TYPE_OFFSET_BASETYPE (to
),
7962 TYPE_OFFSET_BASETYPE (from
),
7963 COMPARE_BASE
| COMPARE_DERIVED
))
7966 if (TREE_CODE (to
) == VECTOR_TYPE
7967 && vector_types_convertible_p (to
, from
, false))
7970 if (TREE_CODE (to
) == INTEGER_TYPE
7971 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
7974 if (TREE_CODE (to
) == FUNCTION_TYPE
)
7975 return !error_type_p (to
) && !error_type_p (from
);
7977 if (TREE_CODE (to
) != POINTER_TYPE
)
7979 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
7980 COMPARE_BASE
| COMPARE_DERIVED
);
7984 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
7985 pointer-to-member types) are the same, ignoring cv-qualification at
7989 comp_ptr_ttypes_const (tree to
, tree from
)
7991 bool is_opaque_pointer
= false;
7993 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7995 if (TREE_CODE (to
) != TREE_CODE (from
))
7998 if (TREE_CODE (from
) == OFFSET_TYPE
7999 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
8000 TYPE_OFFSET_BASETYPE (to
)))
8003 if (TREE_CODE (to
) == VECTOR_TYPE
)
8004 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
8006 if (TREE_CODE (to
) != POINTER_TYPE
)
8007 return (is_opaque_pointer
8008 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
8012 /* Returns the type qualifiers for this type, including the qualifiers on the
8013 elements for an array type. */
8016 cp_type_quals (const_tree type
)
8019 /* This CONST_CAST is okay because strip_array_types returns its
8020 argument unmodified and we assign it to a const_tree. */
8021 type
= strip_array_types (CONST_CAST_TREE (type
));
8022 if (type
== error_mark_node
8023 /* Quals on a FUNCTION_TYPE are memfn quals. */
8024 || TREE_CODE (type
) == FUNCTION_TYPE
)
8025 return TYPE_UNQUALIFIED
;
8026 quals
= TYPE_QUALS (type
);
8027 /* METHOD and REFERENCE_TYPEs should never have quals. */
8028 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
8029 && TREE_CODE (type
) != REFERENCE_TYPE
)
8030 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
8031 == TYPE_UNQUALIFIED
));
8035 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
8039 type_memfn_quals (const_tree type
)
8041 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8042 return TYPE_QUALS (type
);
8043 else if (TREE_CODE (type
) == METHOD_TYPE
)
8044 return cp_type_quals (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))));
8049 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
8053 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
)
8055 /* Could handle METHOD_TYPE here if necessary. */
8056 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8057 if (TYPE_QUALS (type
) == memfn_quals
)
8059 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
8061 return build_qualified_type (type
, memfn_quals
);
8064 /* Returns nonzero if TYPE is const or volatile. */
8067 cv_qualified_p (const_tree type
)
8069 int quals
= cp_type_quals (type
);
8070 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
8073 /* Returns nonzero if the TYPE contains a mutable member. */
8076 cp_has_mutable_p (const_tree type
)
8078 /* This CONST_CAST is okay because strip_array_types returns its
8079 argument unmodified and we assign it to a const_tree. */
8080 type
= strip_array_types (CONST_CAST_TREE(type
));
8082 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
8085 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
8086 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
8087 approximation. In particular, consider:
8090 struct S { int i; };
8091 const S s = { f(); }
8093 Here, we will make "s" as TREE_READONLY (because it is declared
8094 "const") -- only to reverse ourselves upon seeing that the
8095 initializer is non-constant. */
8098 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
8100 tree type
= TREE_TYPE (decl
);
8102 if (type
== error_mark_node
)
8105 if (TREE_CODE (decl
) == TYPE_DECL
)
8108 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
8109 && type_quals
!= TYPE_UNQUALIFIED
));
8111 /* Avoid setting TREE_READONLY incorrectly. */
8112 if (/* If the object has a constructor, the constructor may modify
8114 TYPE_NEEDS_CONSTRUCTING (type
)
8115 /* If the type isn't complete, we don't know yet if it will need
8117 || !COMPLETE_TYPE_P (type
)
8118 /* If the type has a mutable component, that component might be
8120 || TYPE_HAS_MUTABLE_P (type
))
8121 type_quals
&= ~TYPE_QUAL_CONST
;
8123 c_apply_type_quals_to_decl (type_quals
, decl
);
8126 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8127 exemplar types such that casting T1 to T2 is casting away constness
8128 if and only if there is no implicit conversion from T1 to T2. */
8131 casts_away_constness_r (tree
*t1
, tree
*t2
)
8136 /* [expr.const.cast]
8138 For multi-level pointer to members and multi-level mixed pointers
8139 and pointers to members (conv.qual), the "member" aspect of a
8140 pointer to member level is ignored when determining if a const
8141 cv-qualifier has been cast away. */
8142 /* [expr.const.cast]
8144 For two pointer types:
8146 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8147 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8150 casting from X1 to X2 casts away constness if, for a non-pointer
8151 type T there does not exist an implicit conversion (clause
8154 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8158 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8159 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
8160 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
8162 *t1
= cp_build_qualified_type (void_type_node
,
8163 cp_type_quals (*t1
));
8164 *t2
= cp_build_qualified_type (void_type_node
,
8165 cp_type_quals (*t2
));
8169 quals1
= cp_type_quals (*t1
);
8170 quals2
= cp_type_quals (*t2
);
8172 if (TYPE_PTRMEM_P (*t1
))
8173 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
8175 *t1
= TREE_TYPE (*t1
);
8176 if (TYPE_PTRMEM_P (*t2
))
8177 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
8179 *t2
= TREE_TYPE (*t2
);
8181 casts_away_constness_r (t1
, t2
);
8182 *t1
= build_pointer_type (*t1
);
8183 *t2
= build_pointer_type (*t2
);
8184 *t1
= cp_build_qualified_type (*t1
, quals1
);
8185 *t2
= cp_build_qualified_type (*t2
, quals2
);
8188 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8191 ??? This function returns non-zero if casting away qualifiers not
8192 just const. We would like to return to the caller exactly which
8193 qualifiers are casted away to give more accurate diagnostics.
8197 casts_away_constness (tree t1
, tree t2
)
8199 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
8201 /* [expr.const.cast]
8203 Casting from an lvalue of type T1 to an lvalue of type T2
8204 using a reference cast casts away constness if a cast from an
8205 rvalue of type "pointer to T1" to the type "pointer to T2"
8206 casts away constness. */
8207 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
8208 return casts_away_constness (build_pointer_type (t1
),
8209 build_pointer_type (TREE_TYPE (t2
)));
8212 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
8213 /* [expr.const.cast]
8215 Casting from an rvalue of type "pointer to data member of X
8216 of type T1" to the type "pointer to data member of Y of type
8217 T2" casts away constness if a cast from an rvalue of type
8218 "pointer to T1" to the type "pointer to T2" casts away
8220 return casts_away_constness
8221 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
8222 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
8224 /* Casting away constness is only something that makes sense for
8225 pointer or reference types. */
8226 if (TREE_CODE (t1
) != POINTER_TYPE
8227 || TREE_CODE (t2
) != POINTER_TYPE
)
8230 /* Top-level qualifiers don't matter. */
8231 t1
= TYPE_MAIN_VARIANT (t1
);
8232 t2
= TYPE_MAIN_VARIANT (t2
);
8233 casts_away_constness_r (&t1
, &t2
);
8234 if (!can_convert (t2
, t1
))
8240 /* If T is a REFERENCE_TYPE return the type to which T refers.
8241 Otherwise, return T itself. */
8244 non_reference (tree t
)
8246 if (TREE_CODE (t
) == REFERENCE_TYPE
)
8252 /* Return nonzero if REF is an lvalue valid for this language;
8253 otherwise, print an error message and return zero. USE says
8254 how the lvalue is being used and so selects the error message. */
8257 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
8259 cp_lvalue_kind kind
= lvalue_kind (ref
);
8261 if (kind
== clk_none
)
8263 if (complain
& tf_error
)
8267 else if (kind
& (clk_rvalueref
|clk_class
))
8269 if (!(complain
& tf_error
))
8271 if (kind
& clk_class
)
8272 /* Make this a permerror because we used to accept it. */
8273 permerror (input_location
, "using temporary as lvalue");
8275 error ("using xvalue (rvalue reference) as lvalue");