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
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"
41 #include "diagnostic.h"
48 static tree
pfn_from_ptrmemfunc (tree
);
49 static tree
delta_from_ptrmemfunc (tree
);
50 static tree
convert_for_assignment (tree
, tree
, const char *, tree
, int,
52 static tree
cp_pointer_int_sum (enum tree_code
, tree
, tree
);
53 static tree
rationalize_conditional_expr (enum tree_code
, tree
,
55 static int comp_ptr_ttypes_real (tree
, tree
, int);
56 static bool comp_except_types (tree
, tree
, bool);
57 static bool comp_array_types (const_tree
, const_tree
, bool);
58 static tree
pointer_diff (tree
, tree
, tree
);
59 static tree
get_delta_difference (tree
, tree
, bool, bool);
60 static void casts_away_constness_r (tree
*, tree
*);
61 static bool casts_away_constness (tree
, tree
);
62 static void maybe_warn_about_returning_address_of_local (tree
);
63 static tree
lookup_destructor (tree
, tree
, tree
);
64 static int convert_arguments (tree
, VEC(tree
,gc
) **, tree
, int,
67 /* Do `exp = require_complete_type (exp);' to make sure exp
68 does not have an incomplete type. (That includes void types.)
69 Returns the error_mark_node if the VALUE does not have
70 complete type when this function returns. */
73 require_complete_type (tree value
)
77 if (processing_template_decl
|| value
== error_mark_node
)
80 if (TREE_CODE (value
) == OVERLOAD
)
81 type
= unknown_type_node
;
83 type
= TREE_TYPE (value
);
85 if (type
== error_mark_node
)
86 return error_mark_node
;
88 /* First, detect a valid value with a complete type. */
89 if (COMPLETE_TYPE_P (type
))
92 if (complete_type_or_else (type
, value
))
95 return error_mark_node
;
98 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
99 a template instantiation, do the instantiation. Returns TYPE,
100 whether or not it could be completed, unless something goes
101 horribly wrong, in which case the error_mark_node is returned. */
104 complete_type (tree type
)
106 if (type
== NULL_TREE
)
107 /* Rather than crash, we return something sure to cause an error
109 return error_mark_node
;
111 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
113 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
115 tree t
= complete_type (TREE_TYPE (type
));
116 unsigned int needs_constructing
, has_nontrivial_dtor
;
117 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
120 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
122 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
123 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
125 TYPE_NEEDS_CONSTRUCTING (t
) = needs_constructing
;
126 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = has_nontrivial_dtor
;
129 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
130 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
135 /* Like complete_type, but issue an error if the TYPE cannot be completed.
136 VALUE is used for informative diagnostics.
137 Returns NULL_TREE if the type cannot be made complete. */
140 complete_type_or_else (tree type
, tree value
)
142 type
= complete_type (type
);
143 if (type
== error_mark_node
)
144 /* We already issued an error. */
146 else if (!COMPLETE_TYPE_P (type
))
148 cxx_incomplete_type_diagnostic (value
, type
, DK_ERROR
);
155 /* Return truthvalue of whether type of EXP is instantiated. */
158 type_unknown_p (const_tree exp
)
160 return (TREE_CODE (exp
) == TREE_LIST
161 || TREE_TYPE (exp
) == unknown_type_node
);
165 /* Return the common type of two parameter lists.
166 We assume that comptypes has already been done and returned 1;
167 if that isn't so, this may crash.
169 As an optimization, free the space we allocate if the parameter
170 lists are already common. */
173 commonparms (tree p1
, tree p2
)
175 tree oldargs
= p1
, newargs
, n
;
179 len
= list_length (p1
);
180 newargs
= tree_last (p1
);
182 if (newargs
== void_list_node
)
191 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
196 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
198 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
200 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
203 else if (! TREE_PURPOSE (p1
))
205 if (TREE_PURPOSE (p2
))
207 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
213 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
215 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
217 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
220 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
223 TREE_VALUE (n
) = TREE_VALUE (p1
);
231 /* Given a type, perhaps copied for a typedef,
232 find the "original" version of it. */
234 original_type (tree t
)
236 int quals
= cp_type_quals (t
);
237 while (t
!= error_mark_node
238 && TYPE_NAME (t
) != NULL_TREE
)
240 tree x
= TYPE_NAME (t
);
241 if (TREE_CODE (x
) != TYPE_DECL
)
243 x
= DECL_ORIGINAL_TYPE (x
);
248 return cp_build_qualified_type (t
, quals
);
251 /* Return the common type for two arithmetic types T1 and T2 under the
252 usual arithmetic conversions. The default conversions have already
253 been applied, and enumerated types converted to their compatible
257 cp_common_type (tree t1
, tree t2
)
259 enum tree_code code1
= TREE_CODE (t1
);
260 enum tree_code code2
= TREE_CODE (t2
);
263 /* In what follows, we slightly generalize the rules given in [expr] so
264 as to deal with `long long' and `complex'. First, merge the
266 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
268 if (SCOPED_ENUM_P (t1
) || SCOPED_ENUM_P (t2
))
270 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
271 return build_type_attribute_variant (t1
, attributes
);
276 /* FIXME: Attributes. */
277 gcc_assert (ARITHMETIC_TYPE_P (t1
)
278 || TREE_CODE (t1
) == VECTOR_TYPE
279 || UNSCOPED_ENUM_P (t1
));
280 gcc_assert (ARITHMETIC_TYPE_P (t2
)
281 || TREE_CODE (t2
) == VECTOR_TYPE
282 || UNSCOPED_ENUM_P (t2
));
284 /* If one type is complex, form the common type of the non-complex
285 components, then make that complex. Use T1 or T2 if it is the
287 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
289 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
290 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
292 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
294 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
295 return build_type_attribute_variant (t1
, attributes
);
296 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
297 return build_type_attribute_variant (t2
, attributes
);
299 return build_type_attribute_variant (build_complex_type (subtype
),
303 if (code1
== VECTOR_TYPE
)
305 /* When we get here we should have two vectors of the same size.
306 Just prefer the unsigned one if present. */
307 if (TYPE_UNSIGNED (t1
))
308 return build_type_attribute_variant (t1
, attributes
);
310 return build_type_attribute_variant (t2
, attributes
);
313 /* If only one is real, use it as the result. */
314 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
315 return build_type_attribute_variant (t1
, attributes
);
316 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
317 return build_type_attribute_variant (t2
, attributes
);
319 /* Both real or both integers; use the one with greater precision. */
320 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
321 return build_type_attribute_variant (t1
, attributes
);
322 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
323 return build_type_attribute_variant (t2
, attributes
);
325 /* The types are the same; no need to do anything fancy. */
326 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
327 return build_type_attribute_variant (t1
, attributes
);
329 if (code1
!= REAL_TYPE
)
331 /* If one is unsigned long long, then convert the other to unsigned
333 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
334 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
335 return build_type_attribute_variant (long_long_unsigned_type_node
,
337 /* If one is a long long, and the other is an unsigned long, and
338 long long can represent all the values of an unsigned long, then
339 convert to a long long. Otherwise, convert to an unsigned long
340 long. Otherwise, if either operand is long long, convert the
343 Since we're here, we know the TYPE_PRECISION is the same;
344 therefore converting to long long cannot represent all the values
345 of an unsigned long, so we choose unsigned long long in that
347 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
348 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
350 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
351 ? long_long_unsigned_type_node
352 : long_long_integer_type_node
);
353 return build_type_attribute_variant (t
, attributes
);
356 /* Go through the same procedure, but for longs. */
357 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
358 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
359 return build_type_attribute_variant (long_unsigned_type_node
,
361 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
362 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
364 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
365 ? long_unsigned_type_node
: long_integer_type_node
);
366 return build_type_attribute_variant (t
, attributes
);
368 /* Otherwise prefer the unsigned one. */
369 if (TYPE_UNSIGNED (t1
))
370 return build_type_attribute_variant (t1
, attributes
);
372 return build_type_attribute_variant (t2
, attributes
);
376 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
377 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
378 return build_type_attribute_variant (long_double_type_node
,
380 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
381 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
382 return build_type_attribute_variant (double_type_node
,
384 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
385 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
386 return build_type_attribute_variant (float_type_node
,
389 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
390 the standard C++ floating-point types. Logic earlier in this
391 function has already eliminated the possibility that
392 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
393 compelling reason to choose one or the other. */
394 return build_type_attribute_variant (t1
, attributes
);
398 /* T1 and T2 are arithmetic or enumeration types. Return the type
399 that will result from the "usual arithmetic conversions" on T1 and
400 T2 as described in [expr]. */
403 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
405 gcc_assert (ARITHMETIC_TYPE_P (t1
)
406 || TREE_CODE (t1
) == VECTOR_TYPE
407 || UNSCOPED_ENUM_P (t1
));
408 gcc_assert (ARITHMETIC_TYPE_P (t2
)
409 || TREE_CODE (t2
) == VECTOR_TYPE
410 || UNSCOPED_ENUM_P (t2
));
412 /* Perform the integral promotions. We do not promote real types here. */
413 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1
)
414 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2
))
416 t1
= type_promotes_to (t1
);
417 t2
= type_promotes_to (t2
);
420 return cp_common_type (t1
, t2
);
423 /* Subroutine of composite_pointer_type to implement the recursive
424 case. See that function for documentation of the parameters. */
427 composite_pointer_type_r (tree t1
, tree t2
,
428 composite_pointer_operation operation
,
429 tsubst_flags_t complain
)
436 /* Determine the types pointed to by T1 and T2. */
437 if (TREE_CODE (t1
) == POINTER_TYPE
)
439 pointee1
= TREE_TYPE (t1
);
440 pointee2
= TREE_TYPE (t2
);
444 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
445 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
450 Otherwise, the composite pointer type is a pointer type
451 similar (_conv.qual_) to the type of one of the operands,
452 with a cv-qualification signature (_conv.qual_) that is the
453 union of the cv-qualification signatures of the operand
455 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
456 result_type
= pointee1
;
457 else if ((TREE_CODE (pointee1
) == POINTER_TYPE
458 && TREE_CODE (pointee2
) == POINTER_TYPE
)
459 || (TYPE_PTR_TO_MEMBER_P (pointee1
)
460 && TYPE_PTR_TO_MEMBER_P (pointee2
)))
461 result_type
= composite_pointer_type_r (pointee1
, pointee2
, operation
,
465 if (complain
& tf_error
)
470 permerror (input_location
, "comparison between "
471 "distinct pointer types %qT and %qT lacks a cast",
475 permerror (input_location
, "conversion between "
476 "distinct pointer types %qT and %qT lacks a cast",
479 case CPO_CONDITIONAL_EXPR
:
480 permerror (input_location
, "conditional expression between "
481 "distinct pointer types %qT and %qT lacks a cast",
488 result_type
= void_type_node
;
490 result_type
= cp_build_qualified_type (result_type
,
491 (cp_type_quals (pointee1
)
492 | cp_type_quals (pointee2
)));
493 /* If the original types were pointers to members, so is the
495 if (TYPE_PTR_TO_MEMBER_P (t1
))
497 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
498 TYPE_PTRMEM_CLASS_TYPE (t2
))
499 && (complain
& tf_error
))
504 permerror (input_location
, "comparison between "
505 "distinct pointer types %qT and %qT lacks a cast",
509 permerror (input_location
, "conversion between "
510 "distinct pointer types %qT and %qT lacks a cast",
513 case CPO_CONDITIONAL_EXPR
:
514 permerror (input_location
, "conditional expression between "
515 "distinct pointer types %qT and %qT lacks a cast",
522 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
526 result_type
= build_pointer_type (result_type
);
528 /* Merge the attributes. */
529 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
530 return build_type_attribute_variant (result_type
, attributes
);
533 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
534 ARG1 and ARG2 are the values with those types. The OPERATION is to
535 describe the operation between the pointer types,
536 in case an error occurs.
538 This routine also implements the computation of a common type for
539 pointers-to-members as per [expr.eq]. */
542 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
543 composite_pointer_operation operation
,
544 tsubst_flags_t complain
)
551 If one operand is a null pointer constant, the composite pointer
552 type is the type of the other operand. */
553 if (null_ptr_cst_p (arg1
))
555 if (null_ptr_cst_p (arg2
))
562 If one of the operands has type "pointer to cv1 void*", then
563 the other has type "pointer to cv2T", and the composite pointer
564 type is "pointer to cv12 void", where cv12 is the union of cv1
567 If either type is a pointer to void, make sure it is T1. */
568 if (TREE_CODE (t2
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t2
)))
576 /* Now, if T1 is a pointer to void, merge the qualifiers. */
577 if (TREE_CODE (t1
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t1
)))
582 if (TYPE_PTRFN_P (t2
) && (complain
& tf_error
))
587 pedwarn (input_location
, OPT_pedantic
,
588 "ISO C++ forbids comparison between "
589 "pointer of type %<void *%> and pointer-to-function");
592 pedwarn (input_location
, OPT_pedantic
,
593 "ISO C++ forbids conversion between "
594 "pointer of type %<void *%> and pointer-to-function");
596 case CPO_CONDITIONAL_EXPR
:
597 pedwarn (input_location
, OPT_pedantic
,
598 "ISO C++ forbids conditional expression between "
599 "pointer of type %<void *%> and pointer-to-function");
606 = cp_build_qualified_type (void_type_node
,
607 (cp_type_quals (TREE_TYPE (t1
))
608 | cp_type_quals (TREE_TYPE (t2
))));
609 result_type
= build_pointer_type (result_type
);
610 /* Merge the attributes. */
611 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
612 return build_type_attribute_variant (result_type
, attributes
);
615 if (c_dialect_objc () && TREE_CODE (t1
) == POINTER_TYPE
616 && TREE_CODE (t2
) == POINTER_TYPE
)
618 if (objc_compare_types (t1
, t2
, -3, NULL_TREE
))
622 /* [expr.eq] permits the application of a pointer conversion to
623 bring the pointers to a common type. */
624 if (TREE_CODE (t1
) == POINTER_TYPE
&& TREE_CODE (t2
) == POINTER_TYPE
625 && CLASS_TYPE_P (TREE_TYPE (t1
))
626 && CLASS_TYPE_P (TREE_TYPE (t2
))
627 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
630 class1
= TREE_TYPE (t1
);
631 class2
= TREE_TYPE (t2
);
633 if (DERIVED_FROM_P (class1
, class2
))
634 t2
= (build_pointer_type
635 (cp_build_qualified_type (class1
, TYPE_QUALS (class2
))));
636 else if (DERIVED_FROM_P (class2
, class1
))
637 t1
= (build_pointer_type
638 (cp_build_qualified_type (class2
, TYPE_QUALS (class1
))));
641 if (complain
& tf_error
)
645 error ("comparison between distinct "
646 "pointer types %qT and %qT lacks a cast", t1
, t2
);
649 error ("conversion between distinct "
650 "pointer types %qT and %qT lacks a cast", t1
, t2
);
652 case CPO_CONDITIONAL_EXPR
:
653 error ("conditional expression between distinct "
654 "pointer types %qT and %qT lacks a cast", t1
, t2
);
659 return error_mark_node
;
662 /* [expr.eq] permits the application of a pointer-to-member
663 conversion to change the class type of one of the types. */
664 else if (TYPE_PTR_TO_MEMBER_P (t1
)
665 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
666 TYPE_PTRMEM_CLASS_TYPE (t2
)))
668 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
669 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
671 if (DERIVED_FROM_P (class1
, class2
))
672 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
673 else if (DERIVED_FROM_P (class2
, class1
))
674 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
677 if (complain
& tf_error
)
681 error ("comparison between distinct "
682 "pointer-to-member types %qT and %qT lacks a cast",
686 error ("conversion between distinct "
687 "pointer-to-member types %qT and %qT lacks a cast",
690 case CPO_CONDITIONAL_EXPR
:
691 error ("conditional expression between distinct "
692 "pointer-to-member types %qT and %qT lacks a cast",
698 return error_mark_node
;
702 return composite_pointer_type_r (t1
, t2
, operation
, complain
);
705 /* Return the merged type of two types.
706 We assume that comptypes has already been done and returned 1;
707 if that isn't so, this may crash.
709 This just combines attributes and default arguments; any other
710 differences would cause the two types to compare unalike. */
713 merge_types (tree t1
, tree t2
)
715 enum tree_code code1
;
716 enum tree_code code2
;
719 /* Save time if the two types are the same. */
722 if (original_type (t1
) == original_type (t2
))
725 /* If one type is nonsense, use the other. */
726 if (t1
== error_mark_node
)
728 if (t2
== error_mark_node
)
731 /* Merge the attributes. */
732 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
734 if (TYPE_PTRMEMFUNC_P (t1
))
735 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
736 if (TYPE_PTRMEMFUNC_P (t2
))
737 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
739 code1
= TREE_CODE (t1
);
740 code2
= TREE_CODE (t2
);
743 gcc_assert (code1
== TYPENAME_TYPE
|| code2
== TYPENAME_TYPE
);
744 if (code1
== TYPENAME_TYPE
)
746 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
747 code1
= TREE_CODE (t1
);
751 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
752 code2
= TREE_CODE (t2
);
760 /* For two pointers, do this recursively on the target type. */
762 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
763 int quals
= cp_type_quals (t1
);
765 if (code1
== POINTER_TYPE
)
766 t1
= build_pointer_type (target
);
768 t1
= cp_build_reference_type (target
, TYPE_REF_IS_RVALUE (t1
));
769 t1
= build_type_attribute_variant (t1
, attributes
);
770 t1
= cp_build_qualified_type (t1
, quals
);
772 if (TREE_CODE (target
) == METHOD_TYPE
)
773 t1
= build_ptrmemfunc_type (t1
);
782 quals
= cp_type_quals (t1
);
783 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
784 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
785 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
787 t1
= cp_build_qualified_type (t1
, quals
);
793 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
794 /* Save space: see if the result is identical to one of the args. */
795 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
796 return build_type_attribute_variant (t1
, attributes
);
797 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
798 return build_type_attribute_variant (t2
, attributes
);
799 /* Merge the element types, and have a size if either arg has one. */
800 t1
= build_cplus_array_type
801 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
806 /* Function types: prefer the one that specified arg types.
807 If both do, merge the arg types. Also merge the return types. */
809 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
810 tree p1
= TYPE_ARG_TYPES (t1
);
811 tree p2
= TYPE_ARG_TYPES (t2
);
814 /* Save space: see if the result is identical to one of the args. */
815 if (valtype
== TREE_TYPE (t1
) && ! p2
)
816 return cp_build_type_attribute_variant (t1
, attributes
);
817 if (valtype
== TREE_TYPE (t2
) && ! p1
)
818 return cp_build_type_attribute_variant (t2
, attributes
);
820 /* Simple way if one arg fails to specify argument types. */
821 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
823 rval
= build_function_type (valtype
, p2
);
824 if ((raises
= TYPE_RAISES_EXCEPTIONS (t2
)))
825 rval
= build_exception_variant (rval
, raises
);
826 return cp_build_type_attribute_variant (rval
, attributes
);
828 raises
= TYPE_RAISES_EXCEPTIONS (t1
);
829 if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
831 rval
= build_function_type (valtype
, p1
);
833 rval
= build_exception_variant (rval
, raises
);
834 return cp_build_type_attribute_variant (rval
, attributes
);
837 rval
= build_function_type (valtype
, commonparms (p1
, p2
));
838 t1
= build_exception_variant (rval
, raises
);
844 /* Get this value the long way, since TYPE_METHOD_BASETYPE
845 is just the main variant of this. */
846 tree basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2
)));
847 tree raises
= TYPE_RAISES_EXCEPTIONS (t1
);
850 /* If this was a member function type, get back to the
851 original type of type member function (i.e., without
852 the class instance variable up front. */
853 t1
= build_function_type (TREE_TYPE (t1
),
854 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
855 t2
= build_function_type (TREE_TYPE (t2
),
856 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
857 t3
= merge_types (t1
, t2
);
858 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
859 TYPE_ARG_TYPES (t3
));
860 t1
= build_exception_variant (t3
, raises
);
865 /* There is no need to merge attributes into a TYPENAME_TYPE.
866 When the type is instantiated it will have whatever
867 attributes result from the instantiation. */
873 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
875 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
878 return cp_build_type_attribute_variant (t1
, attributes
);
881 /* Wrapper around cp_common_type that is used by c-common.c and other
882 front end optimizations that remove promotions.
884 Return the common type for two arithmetic types T1 and T2 under the
885 usual arithmetic conversions. The default conversions have already
886 been applied, and enumerated types converted to their compatible
890 common_type (tree t1
, tree t2
)
892 /* If one type is nonsense, use the other */
893 if (t1
== error_mark_node
)
895 if (t2
== error_mark_node
)
898 return cp_common_type (t1
, t2
);
901 /* Return the common type of two pointer types T1 and T2. This is the
902 type for the result of most arithmetic operations if the operands
903 have the given two types.
905 We assume that comp_target_types has already been done and returned
906 nonzero; if that isn't so, this may crash. */
909 common_pointer_type (tree t1
, tree t2
)
911 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
912 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
913 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
915 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
916 CPO_CONVERSION
, tf_warning_or_error
);
919 /* Compare two exception specifier types for exactness or subsetness, if
920 allowed. Returns false for mismatch, true for match (same, or
923 [except.spec] "If a class X ... objects of class X or any class publicly
924 and unambiguously derived from X. Similarly, if a pointer type Y * ...
925 exceptions of type Y * or that are pointers to any type publicly and
926 unambiguously derived from Y. Otherwise a function only allows exceptions
927 that have the same type ..."
928 This does not mention cv qualifiers and is different to what throw
929 [except.throw] and catch [except.catch] will do. They will ignore the
930 top level cv qualifiers, and allow qualifiers in the pointer to class
933 We implement the letter of the standard. */
936 comp_except_types (tree a
, tree b
, bool exact
)
938 if (same_type_p (a
, b
))
942 if (cp_type_quals (a
) || cp_type_quals (b
))
945 if (TREE_CODE (a
) == POINTER_TYPE
946 && TREE_CODE (b
) == POINTER_TYPE
)
950 if (cp_type_quals (a
) || cp_type_quals (b
))
954 if (TREE_CODE (a
) != RECORD_TYPE
955 || TREE_CODE (b
) != RECORD_TYPE
)
958 if (PUBLICLY_UNIQUELY_DERIVED_P (a
, b
))
964 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
965 If EXACT is false, T2 can be stricter than T1 (according to 15.4/7),
966 otherwise it must be exact. Exception lists are unordered, but
967 we've already filtered out duplicates. Most lists will be in order,
968 we should try to make use of that. */
971 comp_except_specs (const_tree t1
, const_tree t2
, bool exact
)
980 if (t1
== NULL_TREE
) /* T1 is ... */
981 return t2
== NULL_TREE
|| !exact
;
982 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
983 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
984 if (t2
== NULL_TREE
) /* T2 is ... */
986 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
989 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
990 Count how many we find, to determine exactness. For exact matching and
991 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
993 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
995 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
997 tree a
= TREE_VALUE (probe
);
998 tree b
= TREE_VALUE (t2
);
1000 if (comp_except_types (a
, b
, exact
))
1002 if (probe
== base
&& exact
)
1003 base
= TREE_CHAIN (probe
);
1008 if (probe
== NULL_TREE
)
1011 return !exact
|| base
== NULL_TREE
|| length
== list_length (t1
);
1014 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1015 [] can match [size]. */
1018 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1027 /* The type of the array elements must be the same. */
1028 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1031 d1
= TYPE_DOMAIN (t1
);
1032 d2
= TYPE_DOMAIN (t2
);
1037 /* If one of the arrays is dimensionless, and the other has a
1038 dimension, they are of different types. However, it is valid to
1046 declarations for an array object can specify
1047 array types that differ by the presence or absence of a major
1048 array bound (_dcl.array_). */
1050 return allow_redeclaration
;
1052 /* Check that the dimensions are the same. */
1054 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1056 max1
= TYPE_MAX_VALUE (d1
);
1057 max2
= TYPE_MAX_VALUE (d2
);
1058 if (processing_template_decl
&& !abi_version_at_least (2)
1059 && !value_dependent_expression_p (max1
)
1060 && !value_dependent_expression_p (max2
))
1062 /* With abi-1 we do not fold non-dependent array bounds, (and
1063 consequently mangle them incorrectly). We must therefore
1064 fold them here, to verify the domains have the same
1070 if (!cp_tree_equal (max1
, max2
))
1076 /* Compare the relative position of T1 and T2 into their respective
1077 template parameter list.
1078 T1 and T2 must be template parameter types.
1079 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1082 comp_template_parms_position (tree t1
, tree t2
)
1084 gcc_assert (t1
&& t2
1085 && TREE_CODE (t1
) == TREE_CODE (t2
)
1086 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1087 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1088 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1090 if (TEMPLATE_TYPE_IDX (t1
) != TEMPLATE_TYPE_IDX (t2
)
1091 || TEMPLATE_TYPE_LEVEL (t1
) != TEMPLATE_TYPE_LEVEL (t2
)
1092 || (TEMPLATE_TYPE_PARAMETER_PACK (t1
)
1093 != TEMPLATE_TYPE_PARAMETER_PACK (t2
)))
1099 /* Subroutine of incompatible_dependent_types_p.
1100 Return the template parameter of the dependent type T.
1101 If T is a typedef, return the template parameters of
1102 the _decl_ of the typedef. T must be a dependent type. */
1105 get_template_parms_of_dependent_type (tree t
)
1107 tree tinfo
= NULL_TREE
, tparms
= NULL_TREE
;
1109 /* First, try the obvious case of getting the
1110 template info from T itself. */
1111 if ((tinfo
= get_template_info (t
)))
1113 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
1114 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (t
);
1115 else if (typedef_variant_p (t
)
1116 && !NAMESPACE_SCOPE_P (TYPE_NAME (t
)))
1117 tinfo
= get_template_info (DECL_CONTEXT (TYPE_NAME (t
)));
1118 /* If T is a TYPENAME_TYPE which context is a template type
1119 parameter, get the template parameters from that context. */
1120 else if (TYPE_CONTEXT (t
)
1121 && TREE_CODE (TYPE_CONTEXT (t
)) == TEMPLATE_TYPE_PARM
)
1122 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (TYPE_CONTEXT (t
));
1123 else if (TYPE_CONTEXT (t
)
1124 && !NAMESPACE_SCOPE_P (t
))
1125 tinfo
= get_template_info (TYPE_CONTEXT (t
));
1128 tparms
= DECL_TEMPLATE_PARMS (TI_TEMPLATE (tinfo
));
1133 /* Subroutine of structural_comptypes.
1134 Compare the dependent types T1 and T2.
1135 Return TRUE if we are sure they can't be equal, FALSE otherwise.
1136 The whole point of this function is to support cases where either T1 or
1137 T2 is a typedef. In those cases, we need to compare the template parameters
1138 of the _decl_ of the typedef. If those don't match then we know T1
1139 and T2 cannot be equal. */
1142 incompatible_dependent_types_p (tree t1
, tree t2
)
1144 tree tparms1
= NULL_TREE
, tparms2
= NULL_TREE
;
1146 if (!uses_template_parms (t1
) || !uses_template_parms (t2
))
1149 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
)
1151 /* If T1 and T2 don't have the same relative position in their
1152 template parameters set, they can't be equal. */
1153 if (!comp_template_parms_position (t1
, t2
))
1157 /* Either T1 or T2 must be a typedef. */
1158 if (!typedef_variant_p (t1
) && !typedef_variant_p (t2
))
1161 /* So if we reach this point, it means either T1 or T2 is a typedef variant.
1162 Let's compare their template parameters. */
1164 tparms1
= get_template_parms_of_dependent_type (t1
);
1165 tparms2
= get_template_parms_of_dependent_type (t2
);
1167 /* If T2 is a template type parm and if we could not get the template
1168 parms it belongs to, that means we have not finished parsing the
1169 full set of template parameters of the template declaration it
1170 belongs to yet. If we could get the template parms T1 belongs to,
1171 that mostly means T1 and T2 belongs to templates that are
1172 different and incompatible. */
1173 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
1174 && (tparms1
== NULL_TREE
|| tparms2
== NULL_TREE
)
1175 && tparms1
!= tparms2
)
1178 if (tparms1
== NULL_TREE
1179 || tparms2
== NULL_TREE
1180 || tparms1
== tparms2
)
1183 /* And now compare the mighty template parms! */
1184 return !comp_template_parms (tparms1
, tparms2
);
1187 /* Subroutine in comptypes. */
1190 structural_comptypes (tree t1
, tree t2
, int strict
)
1195 /* Suppress errors caused by previously reported errors. */
1196 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1199 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1201 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1202 current instantiation. */
1203 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1204 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1206 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1207 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1209 if (TYPE_PTRMEMFUNC_P (t1
))
1210 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1211 if (TYPE_PTRMEMFUNC_P (t2
))
1212 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1214 /* Different classes of types can't be compatible. */
1215 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1218 /* Qualifiers must match. For array types, we will check when we
1219 recur on the array element types. */
1220 if (TREE_CODE (t1
) != ARRAY_TYPE
1221 && TYPE_QUALS (t1
) != TYPE_QUALS (t2
))
1223 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1226 /* Allow for two different type nodes which have essentially the same
1227 definition. Note that we already checked for equality of the type
1228 qualifiers (just above). */
1230 if (TREE_CODE (t1
) != ARRAY_TYPE
1231 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1234 /* If T1 and T2 are dependent typedefs then check upfront that
1235 the template parameters of their typedef DECLs match before
1236 going down checking their subtypes. */
1237 if (incompatible_dependent_types_p (t1
, t2
))
1240 /* Compare the types. Break out if they could be the same. */
1241 switch (TREE_CODE (t1
))
1245 /* All void and bool types are the same. */
1249 case FIXED_POINT_TYPE
:
1251 /* With these nodes, we can't determine type equivalence by
1252 looking at what is stored in the nodes themselves, because
1253 two nodes might have different TYPE_MAIN_VARIANTs but still
1254 represent the same type. For example, wchar_t and int could
1255 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1256 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1257 and are distinct types. On the other hand, int and the
1260 typedef int INT __attribute((may_alias));
1262 have identical properties, different TYPE_MAIN_VARIANTs, but
1263 represent the same type. The canonical type system keeps
1264 track of equivalence in this case, so we fall back on it. */
1265 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1267 case TEMPLATE_TEMPLATE_PARM
:
1268 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1269 if (!comp_template_parms_position (t1
, t2
))
1271 if (!comp_template_parms
1272 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1273 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1275 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1277 /* Don't check inheritance. */
1278 strict
= COMPARE_STRICT
;
1283 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1284 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1285 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1286 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1289 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1291 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1297 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1298 strict
& ~COMPARE_REDECLARATION
))
1300 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1304 case REFERENCE_TYPE
:
1305 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1307 /* fall through to checks for pointer types */
1310 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1311 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
)
1312 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1318 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1320 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1325 /* Target types must match incl. qualifiers. */
1326 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1330 case TEMPLATE_TYPE_PARM
:
1331 /* If incompatible_dependent_types_p called earlier didn't decide
1332 T1 and T2 were different, they might be equal. */
1336 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1337 TYPENAME_TYPE_FULLNAME (t2
)))
1339 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1343 case UNBOUND_CLASS_TEMPLATE
:
1344 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1346 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1351 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1356 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1357 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1361 case TYPE_PACK_EXPANSION
:
1362 return same_type_p (PACK_EXPANSION_PATTERN (t1
),
1363 PACK_EXPANSION_PATTERN (t2
));
1366 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1367 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1368 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1369 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1370 || (DECLTYPE_FOR_LAMBDA_RETURN (t1
)
1371 != DECLTYPE_FOR_LAMBDA_RETURN (t2
))
1372 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1373 DECLTYPE_TYPE_EXPR (t2
)))
1381 /* If we get here, we know that from a target independent POV the
1382 types are the same. Make sure the target attributes are also
1384 return targetm
.comp_type_attributes (t1
, t2
);
1387 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1388 is a bitwise-or of the COMPARE_* flags. */
1391 comptypes (tree t1
, tree t2
, int strict
)
1393 if (strict
== COMPARE_STRICT
)
1398 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1401 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1402 /* At least one of the types requires structural equality, so
1403 perform a deep check. */
1404 return structural_comptypes (t1
, t2
, strict
);
1406 #ifdef ENABLE_CHECKING
1407 if (USE_CANONICAL_TYPES
)
1409 bool result
= structural_comptypes (t1
, t2
, strict
);
1411 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1412 /* The two types are structurally equivalent, but their
1413 canonical types were different. This is a failure of the
1414 canonical type propagation code.*/
1416 ("canonical types differ for identical types %T and %T",
1418 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1419 /* Two types are structurally different, but the canonical
1420 types are the same. This means we were over-eager in
1421 assigning canonical types. */
1423 ("same canonical type node for different types %T and %T",
1429 if (USE_CANONICAL_TYPES
)
1430 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1433 return structural_comptypes (t1
, t2
, strict
);
1435 else if (strict
== COMPARE_STRUCTURAL
)
1436 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1438 return structural_comptypes (t1
, t2
, strict
);
1441 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1444 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1446 int q1
= cp_type_quals (type1
);
1447 int q2
= cp_type_quals (type2
);
1449 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1450 return (q1
& q2
) == q2
;
1453 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1454 more cv-qualified that TYPE1, and 0 otherwise. */
1457 comp_cv_qualification (const_tree type1
, const_tree type2
)
1459 int q1
= cp_type_quals (type1
);
1460 int q2
= cp_type_quals (type2
);
1465 if ((q1
& q2
) == q2
)
1467 else if ((q1
& q2
) == q1
)
1473 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1474 subset of the cv-qualification signature of TYPE2, and the types
1475 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1478 comp_cv_qual_signature (tree type1
, tree type2
)
1480 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1482 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1488 /* Subroutines of `comptypes'. */
1490 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1491 equivalent in the sense that functions with those parameter types
1492 can have equivalent types. The two lists must be equivalent,
1493 element by element. */
1496 compparms (const_tree parms1
, const_tree parms2
)
1500 /* An unspecified parmlist matches any specified parmlist
1501 whose argument types don't need default promotions. */
1503 for (t1
= parms1
, t2
= parms2
;
1505 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1507 /* If one parmlist is shorter than the other,
1508 they fail to match. */
1511 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1518 /* Process a sizeof or alignof expression where the operand is a
1522 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1527 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1528 if (type
== error_mark_node
)
1529 return error_mark_node
;
1531 type
= non_reference (type
);
1532 if (TREE_CODE (type
) == METHOD_TYPE
)
1535 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
1536 "invalid application of %qs to a member function",
1537 operator_name_info
[(int) op
].name
);
1538 value
= size_one_node
;
1541 dependent_p
= dependent_type_p (type
);
1543 complete_type (type
);
1545 /* VLA types will have a non-constant size. In the body of an
1546 uninstantiated template, we don't need to try to compute the
1547 value, because the sizeof expression is not an integral
1548 constant expression in that case. And, if we do try to
1549 compute the value, we'll likely end up with SAVE_EXPRs, which
1550 the template substitution machinery does not expect to see. */
1551 || (processing_template_decl
1552 && COMPLETE_TYPE_P (type
)
1553 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1555 value
= build_min (op
, size_type_node
, type
);
1556 TREE_READONLY (value
) = 1;
1560 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1565 /* Return the size of the type, without producing any warnings for
1566 types whose size cannot be taken. This routine should be used only
1567 in some other routine that has already produced a diagnostic about
1568 using the size of such a type. */
1570 cxx_sizeof_nowarn (tree type
)
1572 if (TREE_CODE (type
) == FUNCTION_TYPE
1573 || TREE_CODE (type
) == VOID_TYPE
1574 || TREE_CODE (type
) == ERROR_MARK
)
1575 return size_one_node
;
1576 else if (!COMPLETE_TYPE_P (type
))
1577 return size_zero_node
;
1579 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1582 /* Process a sizeof expression where the operand is an expression. */
1585 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1587 if (e
== error_mark_node
)
1588 return error_mark_node
;
1590 if (processing_template_decl
)
1592 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1593 TREE_SIDE_EFFECTS (e
) = 0;
1594 TREE_READONLY (e
) = 1;
1599 if (TREE_CODE (e
) == COMPONENT_REF
1600 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1601 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1603 if (complain
& tf_error
)
1604 error ("invalid application of %<sizeof%> to a bit-field");
1606 return error_mark_node
;
1609 else if (is_overloaded_fn (e
))
1611 if (complain
& tf_error
)
1612 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1615 return error_mark_node
;
1618 else if (type_unknown_p (e
))
1620 if (complain
& tf_error
)
1621 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1623 return error_mark_node
;
1629 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1632 /* Implement the __alignof keyword: Return the minimum required
1633 alignment of E, measured in bytes. For VAR_DECL's and
1634 FIELD_DECL's return DECL_ALIGN (which can be set from an
1635 "aligned" __attribute__ specification). */
1638 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1642 if (e
== error_mark_node
)
1643 return error_mark_node
;
1645 if (processing_template_decl
)
1647 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1648 TREE_SIDE_EFFECTS (e
) = 0;
1649 TREE_READONLY (e
) = 1;
1654 if (TREE_CODE (e
) == VAR_DECL
)
1655 t
= size_int (DECL_ALIGN_UNIT (e
));
1656 else if (TREE_CODE (e
) == COMPONENT_REF
1657 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1658 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1660 if (complain
& tf_error
)
1661 error ("invalid application of %<__alignof%> to a bit-field");
1663 return error_mark_node
;
1666 else if (TREE_CODE (e
) == COMPONENT_REF
1667 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1668 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1669 else if (is_overloaded_fn (e
))
1671 if (complain
& tf_error
)
1672 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1675 return error_mark_node
;
1676 if (TREE_CODE (e
) == FUNCTION_DECL
)
1677 t
= size_int (DECL_ALIGN_UNIT (e
));
1681 else if (type_unknown_p (e
))
1683 if (complain
& tf_error
)
1684 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1686 return error_mark_node
;
1690 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1691 complain
& tf_error
);
1693 return fold_convert (size_type_node
, t
);
1696 /* Process a sizeof or alignof expression E with code OP where the operand
1697 is an expression. */
1700 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1702 if (op
== SIZEOF_EXPR
)
1703 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1705 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1708 /* EXPR is being used in a context that is not a function call.
1713 The expression can be used only as the left-hand operand of a
1714 member function call.
1716 [expr.mptr.operator]
1718 If the result of .* or ->* is a function, then that result can be
1719 used only as the operand for the function call operator ().
1721 by issuing an error message if appropriate. Returns true iff EXPR
1722 violates these rules. */
1725 invalid_nonstatic_memfn_p (const_tree expr
, tsubst_flags_t complain
)
1727 if (expr
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1729 if (complain
& tf_error
)
1730 error ("invalid use of non-static member function");
1736 /* If EXP is a reference to a bitfield, and the type of EXP does not
1737 match the declared type of the bitfield, return the declared type
1738 of the bitfield. Otherwise, return NULL_TREE. */
1741 is_bitfield_expr_with_lowered_type (const_tree exp
)
1743 switch (TREE_CODE (exp
))
1746 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1747 ? TREE_OPERAND (exp
, 1)
1748 : TREE_OPERAND (exp
, 0)))
1750 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1753 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1757 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1763 field
= TREE_OPERAND (exp
, 1);
1764 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1766 if (same_type_ignoring_top_level_qualifiers_p
1767 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1769 return DECL_BIT_FIELD_TYPE (field
);
1773 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1774 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1775 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1783 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1784 bitfield with a lowered type, the type of EXP is returned, rather
1788 unlowered_expr_type (const_tree exp
)
1792 type
= is_bitfield_expr_with_lowered_type (exp
);
1794 type
= TREE_TYPE (exp
);
1799 /* Perform the conversions in [expr] that apply when an lvalue appears
1800 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1801 function-to-pointer conversions. In addition, manifest constants
1802 are replaced by their values, and bitfield references are converted
1803 to their declared types.
1805 Although the returned value is being used as an rvalue, this
1806 function does not wrap the returned expression in a
1807 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1808 that the return value is no longer an lvalue. */
1811 decay_conversion (tree exp
)
1814 enum tree_code code
;
1816 type
= TREE_TYPE (exp
);
1817 if (type
== error_mark_node
)
1818 return error_mark_node
;
1820 exp
= resolve_nondeduced_context (exp
);
1821 if (type_unknown_p (exp
))
1823 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1824 return error_mark_node
;
1827 exp
= decl_constant_value (exp
);
1828 if (error_operand_p (exp
))
1829 return error_mark_node
;
1831 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1832 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1833 code
= TREE_CODE (type
);
1834 if (code
== VOID_TYPE
)
1836 error ("void value not ignored as it ought to be");
1837 return error_mark_node
;
1839 if (invalid_nonstatic_memfn_p (exp
, tf_warning_or_error
))
1840 return error_mark_node
;
1841 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1842 return cp_build_unary_op (ADDR_EXPR
, exp
, 0, tf_warning_or_error
);
1843 if (code
== ARRAY_TYPE
)
1848 if (TREE_CODE (exp
) == INDIRECT_REF
)
1849 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1850 TREE_OPERAND (exp
, 0));
1852 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1854 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1855 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1856 TREE_OPERAND (exp
, 0), op1
);
1860 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1862 error ("invalid use of non-lvalue array");
1863 return error_mark_node
;
1866 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1868 if (TREE_CODE (exp
) == VAR_DECL
)
1870 if (!cxx_mark_addressable (exp
))
1871 return error_mark_node
;
1872 adr
= build_nop (ptrtype
, build_address (exp
));
1875 /* This way is better for a COMPONENT_REF since it can
1876 simplify the offset for a component. */
1877 adr
= cp_build_unary_op (ADDR_EXPR
, exp
, 1, tf_warning_or_error
);
1878 return cp_convert (ptrtype
, adr
);
1881 /* If a bitfield is used in a context where integral promotion
1882 applies, then the caller is expected to have used
1883 default_conversion. That function promotes bitfields correctly
1884 before calling this function. At this point, if we have a
1885 bitfield referenced, we may assume that is not subject to
1886 promotion, and that, therefore, the type of the resulting rvalue
1887 is the declared type of the bitfield. */
1888 exp
= convert_bitfield_to_declared_type (exp
);
1890 /* We do not call rvalue() here because we do not want to wrap EXP
1891 in a NON_LVALUE_EXPR. */
1895 Non-class rvalues always have cv-unqualified types. */
1896 type
= TREE_TYPE (exp
);
1897 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
1898 exp
= build_nop (cv_unqualified (type
), exp
);
1903 /* Perform preparatory conversions, as part of the "usual arithmetic
1904 conversions". In particular, as per [expr]:
1906 Whenever an lvalue expression appears as an operand of an
1907 operator that expects the rvalue for that operand, the
1908 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1909 standard conversions are applied to convert the expression to an
1912 In addition, we perform integral promotions here, as those are
1913 applied to both operands to a binary operator before determining
1914 what additional conversions should apply. */
1917 default_conversion (tree exp
)
1919 /* Check for target-specific promotions. */
1920 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
1922 exp
= cp_convert (promoted_type
, exp
);
1923 /* Perform the integral promotions first so that bitfield
1924 expressions (which may promote to "int", even if the bitfield is
1925 declared "unsigned") are promoted correctly. */
1926 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
1927 exp
= perform_integral_promotions (exp
);
1928 /* Perform the other conversions. */
1929 exp
= decay_conversion (exp
);
1934 /* EXPR is an expression with an integral or enumeration type.
1935 Perform the integral promotions in [conv.prom], and return the
1939 perform_integral_promotions (tree expr
)
1946 If the bitfield has an enumerated type, it is treated as any
1947 other value of that type for promotion purposes. */
1948 type
= is_bitfield_expr_with_lowered_type (expr
);
1949 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
1950 type
= TREE_TYPE (expr
);
1951 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
1952 promoted_type
= type_promotes_to (type
);
1953 if (type
!= promoted_type
)
1954 expr
= cp_convert (promoted_type
, expr
);
1958 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1959 decay_conversion to one. */
1962 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
1966 if (TREE_CODE (totype
) != POINTER_TYPE
)
1969 t
= TREE_TYPE (totype
);
1970 if (!same_type_p (t
, char_type_node
)
1971 && !same_type_p (t
, char16_type_node
)
1972 && !same_type_p (t
, char32_type_node
)
1973 && !same_type_p (t
, wchar_type_node
))
1976 if (TREE_CODE (exp
) == STRING_CST
)
1978 /* Make sure that we don't try to convert between char and wide chars. */
1979 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
1984 /* Is this a string constant which has decayed to 'const char *'? */
1985 t
= build_pointer_type (build_qualified_type (t
, TYPE_QUAL_CONST
));
1986 if (!same_type_p (TREE_TYPE (exp
), t
))
1989 if (TREE_CODE (exp
) != ADDR_EXPR
1990 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
1994 /* This warning is not very useful, as it complains about printf. */
1996 warning (OPT_Wwrite_strings
,
1997 "deprecated conversion from string constant to %qT",
2003 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2004 can, for example, use as an lvalue. This code used to be in
2005 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2006 expressions, where we're dealing with aggregates. But now it's again only
2007 called from unary_complex_lvalue. The case (in particular) that led to
2008 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2012 rationalize_conditional_expr (enum tree_code code
, tree t
,
2013 tsubst_flags_t complain
)
2015 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2016 the first operand is always the one to be used if both operands
2017 are equal, so we know what conditional expression this used to be. */
2018 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2020 tree op0
= TREE_OPERAND (t
, 0);
2021 tree op1
= TREE_OPERAND (t
, 1);
2023 /* The following code is incorrect if either operand side-effects. */
2024 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2025 && !TREE_SIDE_EFFECTS (op1
));
2027 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
2028 ? LE_EXPR
: GE_EXPR
),
2029 op0
, TREE_CODE (op0
),
2030 op1
, TREE_CODE (op1
),
2031 /*overloaded_p=*/NULL
,
2033 cp_build_unary_op (code
, op0
, 0, complain
),
2034 cp_build_unary_op (code
, op1
, 0, complain
),
2039 build_conditional_expr (TREE_OPERAND (t
, 0),
2040 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2042 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2047 /* Given the TYPE of an anonymous union field inside T, return the
2048 FIELD_DECL for the field. If not found return NULL_TREE. Because
2049 anonymous unions can nest, we must also search all anonymous unions
2050 that are directly reachable. */
2053 lookup_anon_field (tree t
, tree type
)
2057 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
2059 if (TREE_STATIC (field
))
2061 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2064 /* If we find it directly, return the field. */
2065 if (DECL_NAME (field
) == NULL_TREE
2066 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2071 /* Otherwise, it could be nested, search harder. */
2072 if (DECL_NAME (field
) == NULL_TREE
2073 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2075 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2083 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2084 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2085 non-NULL, it indicates the path to the base used to name MEMBER.
2086 If PRESERVE_REFERENCE is true, the expression returned will have
2087 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2088 returned will have the type referred to by the reference.
2090 This function does not perform access control; that is either done
2091 earlier by the parser when the name of MEMBER is resolved to MEMBER
2092 itself, or later when overload resolution selects one of the
2093 functions indicated by MEMBER. */
2096 build_class_member_access_expr (tree object
, tree member
,
2097 tree access_path
, bool preserve_reference
,
2098 tsubst_flags_t complain
)
2102 tree result
= NULL_TREE
;
2104 if (error_operand_p (object
) || error_operand_p (member
))
2105 return error_mark_node
;
2107 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2111 The type of the first expression shall be "class object" (of a
2113 object_type
= TREE_TYPE (object
);
2114 if (!currently_open_class (object_type
)
2115 && !complete_type_or_else (object_type
, object
))
2116 return error_mark_node
;
2117 if (!CLASS_TYPE_P (object_type
))
2119 if (complain
& tf_error
)
2120 error ("request for member %qD in %qE, which is of non-class type %qT",
2121 member
, object
, object_type
);
2122 return error_mark_node
;
2125 /* The standard does not seem to actually say that MEMBER must be a
2126 member of OBJECT_TYPE. However, that is clearly what is
2128 if (DECL_P (member
))
2130 member_scope
= DECL_CLASS_CONTEXT (member
);
2132 if (TREE_DEPRECATED (member
))
2133 warn_deprecated_use (member
, NULL_TREE
);
2136 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2137 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2138 presently be the anonymous union. Go outwards until we find a
2139 type related to OBJECT_TYPE. */
2140 while (ANON_AGGR_TYPE_P (member_scope
)
2141 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2143 member_scope
= TYPE_CONTEXT (member_scope
);
2144 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2146 if (complain
& tf_error
)
2148 if (TREE_CODE (member
) == FIELD_DECL
)
2149 error ("invalid use of nonstatic data member %qE", member
);
2151 error ("%qD is not a member of %qT", member
, object_type
);
2153 return error_mark_node
;
2156 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2157 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2158 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2160 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2162 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2165 /* In [expr.ref], there is an explicit list of the valid choices for
2166 MEMBER. We check for each of those cases here. */
2167 if (TREE_CODE (member
) == VAR_DECL
)
2169 /* A static data member. */
2171 /* If OBJECT has side-effects, they are supposed to occur. */
2172 if (TREE_SIDE_EFFECTS (object
))
2173 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2175 else if (TREE_CODE (member
) == FIELD_DECL
)
2177 /* A non-static data member. */
2182 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
2183 && integer_zerop (TREE_OPERAND (object
, 0)));
2185 /* Convert OBJECT to the type of MEMBER. */
2186 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2187 TYPE_MAIN_VARIANT (member_scope
)))
2192 binfo
= lookup_base (access_path
? access_path
: object_type
,
2193 member_scope
, ba_unique
, &kind
);
2194 if (binfo
== error_mark_node
)
2195 return error_mark_node
;
2197 /* It is invalid to try to get to a virtual base of a
2198 NULL object. The most common cause is invalid use of
2200 if (null_object_p
&& kind
== bk_via_virtual
)
2202 if (complain
& tf_error
)
2204 error ("invalid access to non-static data member %qD of "
2207 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2209 return error_mark_node
;
2212 /* Convert to the base. */
2213 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2215 /* If we found the base successfully then we should be able
2216 to convert to it successfully. */
2217 gcc_assert (object
!= error_mark_node
);
2220 /* Complain about other invalid uses of offsetof, even though they will
2221 give the right answer. Note that we complain whether or not they
2222 actually used the offsetof macro, since there's no way to know at this
2223 point. So we just give a warning, instead of a pedwarn. */
2224 /* Do not produce this warning for base class field references, because
2225 we know for a fact that didn't come from offsetof. This does occur
2226 in various testsuite cases where a null object is passed where a
2227 vtable access is required. */
2228 if (null_object_p
&& warn_invalid_offsetof
2229 && CLASSTYPE_NON_STD_LAYOUT (object_type
)
2230 && !DECL_FIELD_IS_BASE (member
)
2231 && cp_unevaluated_operand
== 0
2232 && (complain
& tf_warning
))
2234 warning (OPT_Winvalid_offsetof
,
2235 "invalid access to non-static data member %qD "
2236 " of NULL object", member
);
2237 warning (OPT_Winvalid_offsetof
,
2238 "(perhaps the %<offsetof%> macro was used incorrectly)");
2241 /* If MEMBER is from an anonymous aggregate, we have converted
2242 OBJECT so that it refers to the class containing the
2243 anonymous union. Generate a reference to the anonymous union
2244 itself, and recur to find MEMBER. */
2245 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2246 /* When this code is called from build_field_call, the
2247 object already has the type of the anonymous union.
2248 That is because the COMPONENT_REF was already
2249 constructed, and was then disassembled before calling
2250 build_field_call. After the function-call code is
2251 cleaned up, this waste can be eliminated. */
2252 && (!same_type_ignoring_top_level_qualifiers_p
2253 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2255 tree anonymous_union
;
2257 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2258 DECL_CONTEXT (member
));
2259 object
= build_class_member_access_expr (object
,
2261 /*access_path=*/NULL_TREE
,
2266 /* Compute the type of the field, as described in [expr.ref]. */
2267 type_quals
= TYPE_UNQUALIFIED
;
2268 member_type
= TREE_TYPE (member
);
2269 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2271 type_quals
= (cp_type_quals (member_type
)
2272 | cp_type_quals (object_type
));
2274 /* A field is const (volatile) if the enclosing object, or the
2275 field itself, is const (volatile). But, a mutable field is
2276 not const, even within a const object. */
2277 if (DECL_MUTABLE_P (member
))
2278 type_quals
&= ~TYPE_QUAL_CONST
;
2279 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2282 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
2284 result
= fold_if_not_in_template (result
);
2286 /* Mark the expression const or volatile, as appropriate. Even
2287 though we've dealt with the type above, we still have to mark the
2288 expression itself. */
2289 if (type_quals
& TYPE_QUAL_CONST
)
2290 TREE_READONLY (result
) = 1;
2291 if (type_quals
& TYPE_QUAL_VOLATILE
)
2292 TREE_THIS_VOLATILE (result
) = 1;
2294 else if (BASELINK_P (member
))
2296 /* The member is a (possibly overloaded) member function. */
2300 /* If the MEMBER is exactly one static member function, then we
2301 know the type of the expression. Otherwise, we must wait
2302 until overload resolution has been performed. */
2303 functions
= BASELINK_FUNCTIONS (member
);
2304 if (TREE_CODE (functions
) == FUNCTION_DECL
2305 && DECL_STATIC_FUNCTION_P (functions
))
2306 type
= TREE_TYPE (functions
);
2308 type
= unknown_type_node
;
2309 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2310 base. That will happen when the function is called. */
2311 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2313 else if (TREE_CODE (member
) == CONST_DECL
)
2315 /* The member is an enumerator. */
2317 /* If OBJECT has side-effects, they are supposed to occur. */
2318 if (TREE_SIDE_EFFECTS (object
))
2319 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2324 if (complain
& tf_error
)
2325 error ("invalid use of %qD", member
);
2326 return error_mark_node
;
2329 if (!preserve_reference
)
2332 If E2 is declared to have type "reference to T", then ... the
2333 type of E1.E2 is T. */
2334 result
= convert_from_reference (result
);
2339 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2340 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2343 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2345 tree object_type
= TREE_TYPE (object
);
2346 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2349 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2351 error ("qualified type %qT does not match destructor name ~%qT",
2353 return error_mark_node
;
2355 if (TREE_CODE (dtor_type
) == IDENTIFIER_NODE
)
2357 /* In a template, names we can't find a match for are still accepted
2358 destructor names, and we check them here. */
2359 if (check_dtor_name (object_type
, dtor_type
))
2360 dtor_type
= object_type
;
2363 error ("object type %qT does not match destructor name ~%qT",
2364 object_type
, dtor_type
);
2365 return error_mark_node
;
2369 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2371 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2372 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2373 return error_mark_node
;
2375 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2376 /*protect=*/1, /*want_type=*/false);
2377 expr
= (adjust_result_of_qualified_name_lookup
2378 (expr
, dtor_type
, object_type
));
2382 /* An expression of the form "A::template B" has been resolved to
2383 DECL. Issue a diagnostic if B is not a template or template
2387 check_template_keyword (tree decl
)
2389 /* The standard says:
2393 If a name prefixed by the keyword template is not a member
2394 template, the program is ill-formed.
2396 DR 228 removed the restriction that the template be a member
2399 DR 96, if accepted would add the further restriction that explicit
2400 template arguments must be provided if the template keyword is
2401 used, but, as of 2005-10-16, that DR is still in "drafting". If
2402 this DR is accepted, then the semantic checks here can be
2403 simplified, as the entity named must in fact be a template
2404 specialization, rather than, as at present, a set of overloaded
2405 functions containing at least one template function. */
2406 if (TREE_CODE (decl
) != TEMPLATE_DECL
2407 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2409 if (!is_overloaded_fn (decl
))
2410 permerror (input_location
, "%qD is not a template", decl
);
2415 if (BASELINK_P (fns
))
2416 fns
= BASELINK_FUNCTIONS (fns
);
2419 tree fn
= OVL_CURRENT (fns
);
2420 if (TREE_CODE (fn
) == TEMPLATE_DECL
2421 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2423 if (TREE_CODE (fn
) == FUNCTION_DECL
2424 && DECL_USE_TEMPLATE (fn
)
2425 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2427 fns
= OVL_NEXT (fns
);
2430 permerror (input_location
, "%qD is not a template", decl
);
2435 /* This function is called by the parser to process a class member
2436 access expression of the form OBJECT.NAME. NAME is a node used by
2437 the parser to represent a name; it is not yet a DECL. It may,
2438 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2439 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2440 there is no reason to do the lookup twice, so the parser keeps the
2441 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2442 be a template via the use of the "A::template B" syntax. */
2445 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2446 tsubst_flags_t complain
)
2451 tree access_path
= NULL_TREE
;
2452 tree orig_object
= object
;
2453 tree orig_name
= name
;
2455 if (object
== error_mark_node
|| name
== error_mark_node
)
2456 return error_mark_node
;
2458 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2459 if (!objc_is_public (object
, name
))
2460 return error_mark_node
;
2462 object_type
= TREE_TYPE (object
);
2464 if (processing_template_decl
)
2466 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2467 dependent_type_p (object_type
)
2468 /* If NAME is just an IDENTIFIER_NODE, then the expression
2470 || TREE_CODE (object
) == IDENTIFIER_NODE
2471 /* If NAME is "f<args>", where either 'f' or 'args' is
2472 dependent, then the expression is dependent. */
2473 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2474 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2475 TREE_OPERAND (name
, 1)))
2476 /* If NAME is "T::X" where "T" is dependent, then the
2477 expression is dependent. */
2478 || (TREE_CODE (name
) == SCOPE_REF
2479 && TYPE_P (TREE_OPERAND (name
, 0))
2480 && dependent_type_p (TREE_OPERAND (name
, 0))))
2481 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2482 object
= build_non_dependent_expr (object
);
2487 The type of the first expression shall be "class object" (of a
2489 if (!currently_open_class (object_type
)
2490 && !complete_type_or_else (object_type
, object
))
2491 return error_mark_node
;
2492 if (!CLASS_TYPE_P (object_type
))
2494 if (complain
& tf_error
)
2495 error ("request for member %qD in %qE, which is of non-class type %qT",
2496 name
, object
, object_type
);
2497 return error_mark_node
;
2500 if (BASELINK_P (name
))
2501 /* A member function that has already been looked up. */
2505 bool is_template_id
= false;
2506 tree template_args
= NULL_TREE
;
2509 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2511 is_template_id
= true;
2512 template_args
= TREE_OPERAND (name
, 1);
2513 name
= TREE_OPERAND (name
, 0);
2515 if (TREE_CODE (name
) == OVERLOAD
)
2516 name
= DECL_NAME (get_first_fn (name
));
2517 else if (DECL_P (name
))
2518 name
= DECL_NAME (name
);
2521 if (TREE_CODE (name
) == SCOPE_REF
)
2523 /* A qualified name. The qualifying class or namespace `S'
2524 has already been looked up; it is either a TYPE or a
2526 scope
= TREE_OPERAND (name
, 0);
2527 name
= TREE_OPERAND (name
, 1);
2529 /* If SCOPE is a namespace, then the qualified name does not
2530 name a member of OBJECT_TYPE. */
2531 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2533 if (complain
& tf_error
)
2534 error ("%<%D::%D%> is not a member of %qT",
2535 scope
, name
, object_type
);
2536 return error_mark_node
;
2539 gcc_assert (CLASS_TYPE_P (scope
));
2540 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2541 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2543 if (constructor_name_p (name
, scope
))
2545 if (complain
& tf_error
)
2546 error ("cannot call constructor %<%T::%D%> directly",
2548 return error_mark_node
;
2551 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2552 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2553 if (access_path
== error_mark_node
)
2554 return error_mark_node
;
2557 if (complain
& tf_error
)
2558 error ("%qT is not a base of %qT", scope
, object_type
);
2559 return error_mark_node
;
2565 access_path
= object_type
;
2568 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2569 member
= lookup_destructor (object
, scope
, name
);
2572 /* Look up the member. */
2573 member
= lookup_member (access_path
, name
, /*protect=*/1,
2574 /*want_type=*/false);
2575 if (member
== NULL_TREE
)
2577 if (complain
& tf_error
)
2578 error ("%qD has no member named %qE", object_type
, name
);
2579 return error_mark_node
;
2581 if (member
== error_mark_node
)
2582 return error_mark_node
;
2587 tree templ
= member
;
2589 if (BASELINK_P (templ
))
2590 templ
= lookup_template_function (templ
, template_args
);
2593 if (complain
& tf_error
)
2594 error ("%qD is not a member template function", name
);
2595 return error_mark_node
;
2600 if (TREE_DEPRECATED (member
))
2601 warn_deprecated_use (member
, NULL_TREE
);
2604 check_template_keyword (member
);
2606 expr
= build_class_member_access_expr (object
, member
, access_path
,
2607 /*preserve_reference=*/false,
2609 if (processing_template_decl
&& expr
!= error_mark_node
)
2611 if (BASELINK_P (member
))
2613 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2614 BASELINK_QUALIFIED_P (member
) = 1;
2617 return build_min_non_dep (COMPONENT_REF
, expr
,
2618 orig_object
, orig_name
,
2625 /* Return an expression for the MEMBER_NAME field in the internal
2626 representation of PTRMEM, a pointer-to-member function. (Each
2627 pointer-to-member function type gets its own RECORD_TYPE so it is
2628 more convenient to access the fields by name than by FIELD_DECL.)
2629 This routine converts the NAME to a FIELD_DECL and then creates the
2630 node for the complete expression. */
2633 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2639 /* This code is a stripped down version of
2640 build_class_member_access_expr. It does not work to use that
2641 routine directly because it expects the object to be of class
2643 ptrmem_type
= TREE_TYPE (ptrmem
);
2644 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2645 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2646 /*want_type=*/false);
2647 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2648 cp_type_quals (ptrmem_type
));
2649 return fold_build3_loc (input_location
,
2650 COMPONENT_REF
, member_type
,
2651 ptrmem
, member
, NULL_TREE
);
2654 /* Given an expression PTR for a pointer, return an expression
2655 for the value pointed to.
2656 ERRORSTRING is the name of the operator to appear in error messages.
2658 This function may need to overload OPERATOR_FNNAME.
2659 Must also handle REFERENCE_TYPEs for C++. */
2662 build_x_indirect_ref (tree expr
, ref_operator errorstring
,
2663 tsubst_flags_t complain
)
2665 tree orig_expr
= expr
;
2668 if (processing_template_decl
)
2670 /* Retain the type if we know the operand is a pointer so that
2671 describable_type doesn't make auto deduction break. */
2672 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2673 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2674 if (type_dependent_expression_p (expr
))
2675 return build_min_nt (INDIRECT_REF
, expr
);
2676 expr
= build_non_dependent_expr (expr
);
2679 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2680 NULL_TREE
, /*overloaded_p=*/NULL
, complain
);
2682 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2684 if (processing_template_decl
&& rval
!= error_mark_node
)
2685 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2690 /* Helper function called from c-common. */
2692 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2693 tree ptr
, ref_operator errorstring
)
2695 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2699 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2700 tsubst_flags_t complain
)
2704 if (ptr
== error_mark_node
)
2705 return error_mark_node
;
2707 if (ptr
== current_class_ptr
)
2708 return current_class_ref
;
2710 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2711 ? ptr
: decay_conversion (ptr
));
2712 type
= TREE_TYPE (pointer
);
2714 if (POINTER_TYPE_P (type
))
2718 If the type of the expression is "pointer to T," the type
2719 of the result is "T." */
2720 tree t
= TREE_TYPE (type
);
2722 if (CONVERT_EXPR_P (ptr
)
2723 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2725 /* If a warning is issued, mark it to avoid duplicates from
2726 the backend. This only needs to be done at
2727 warn_strict_aliasing > 2. */
2728 if (warn_strict_aliasing
> 2)
2729 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2730 type
, TREE_OPERAND (ptr
, 0)))
2731 TREE_NO_WARNING (ptr
) = 1;
2734 if (VOID_TYPE_P (t
))
2736 /* A pointer to incomplete type (other than cv void) can be
2737 dereferenced [expr.unary.op]/1 */
2738 if (complain
& tf_error
)
2739 error ("%qT is not a pointer-to-object type", type
);
2740 return error_mark_node
;
2742 else if (TREE_CODE (pointer
) == ADDR_EXPR
2743 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2744 /* The POINTER was something like `&x'. We simplify `*&x' to
2746 return TREE_OPERAND (pointer
, 0);
2749 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2751 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2752 so that we get the proper error message if the result is used
2753 to assign to. Also, &* is supposed to be a no-op. */
2754 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2755 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2756 TREE_SIDE_EFFECTS (ref
)
2757 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2761 else if (!(complain
& tf_error
))
2762 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2764 /* `pointer' won't be an error_mark_node if we were given a
2765 pointer to member, so it's cool to check for this here. */
2766 else if (TYPE_PTR_TO_MEMBER_P (type
))
2767 switch (errorstring
)
2769 case RO_ARRAY_INDEXING
:
2770 error ("invalid use of array indexing on pointer to member");
2773 error ("invalid use of unary %<*%> on pointer to member");
2775 case RO_IMPLICIT_CONVERSION
:
2776 error ("invalid use of implicit conversion on pointer to member");
2781 else if (pointer
!= error_mark_node
)
2782 switch (errorstring
)
2785 error ("invalid type argument");
2787 case RO_ARRAY_INDEXING
:
2788 error ("invalid type argument of array indexing");
2791 error ("invalid type argument of unary %<*%>");
2793 case RO_IMPLICIT_CONVERSION
:
2794 error ("invalid type argument of implicit conversion");
2799 return error_mark_node
;
2802 /* This handles expressions of the form "a[i]", which denotes
2805 This is logically equivalent in C to *(a+i), but we may do it differently.
2806 If A is a variable or a member, we generate a primitive ARRAY_REF.
2807 This avoids forcing the array out of registers, and can work on
2808 arrays that are not lvalues (for example, members of structures returned
2811 If INDEX is of some user-defined type, it must be converted to
2812 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2813 will inherit the type of the array, which will be some pointer type.
2815 LOC is the location to use in building the array reference. */
2818 build_array_ref (location_t loc
, tree array
, tree idx
)
2824 error_at (loc
, "subscript missing in array reference");
2825 return error_mark_node
;
2828 if (TREE_TYPE (array
) == error_mark_node
2829 || TREE_TYPE (idx
) == error_mark_node
)
2830 return error_mark_node
;
2832 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2834 switch (TREE_CODE (array
))
2838 tree value
= build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
);
2839 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2840 TREE_OPERAND (array
, 0), value
);
2841 SET_EXPR_LOCATION (ret
, loc
);
2846 ret
= build_conditional_expr
2847 (TREE_OPERAND (array
, 0),
2848 build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
),
2849 build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
),
2850 tf_warning_or_error
);
2851 protected_set_expr_location (ret
, loc
);
2858 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2862 warn_array_subscript_with_type_char (idx
);
2864 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2866 error_at (loc
, "array subscript is not an integer");
2867 return error_mark_node
;
2870 /* Apply integral promotions *after* noticing character types.
2871 (It is unclear why we do these promotions -- the standard
2872 does not say that we should. In fact, the natural thing would
2873 seem to be to convert IDX to ptrdiff_t; we're performing
2874 pointer arithmetic.) */
2875 idx
= perform_integral_promotions (idx
);
2877 /* An array that is indexed by a non-constant
2878 cannot be stored in a register; we must be able to do
2879 address arithmetic on its address.
2880 Likewise an array of elements of variable size. */
2881 if (TREE_CODE (idx
) != INTEGER_CST
2882 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2883 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2886 if (!cxx_mark_addressable (array
))
2887 return error_mark_node
;
2890 /* An array that is indexed by a constant value which is not within
2891 the array bounds cannot be stored in a register either; because we
2892 would get a crash in store_bit_field/extract_bit_field when trying
2893 to access a non-existent part of the register. */
2894 if (TREE_CODE (idx
) == INTEGER_CST
2895 && TYPE_DOMAIN (TREE_TYPE (array
))
2896 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
2898 if (!cxx_mark_addressable (array
))
2899 return error_mark_node
;
2902 if (!lvalue_p (array
))
2903 pedwarn (loc
, OPT_pedantic
,
2904 "ISO C++ forbids subscripting non-lvalue array");
2906 /* Note in C++ it is valid to subscript a `register' array, since
2907 it is valid to take the address of something with that
2908 storage specification. */
2912 while (TREE_CODE (foo
) == COMPONENT_REF
)
2913 foo
= TREE_OPERAND (foo
, 0);
2914 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
))
2915 warning_at (loc
, OPT_Wextra
,
2916 "subscripting array declared %<register%>");
2919 type
= TREE_TYPE (TREE_TYPE (array
));
2920 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
2921 /* Array ref is const/volatile if the array elements are
2922 or if the array is.. */
2923 TREE_READONLY (rval
)
2924 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
2925 TREE_SIDE_EFFECTS (rval
)
2926 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
2927 TREE_THIS_VOLATILE (rval
)
2928 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
2929 ret
= require_complete_type (fold_if_not_in_template (rval
));
2930 protected_set_expr_location (ret
, loc
);
2935 tree ar
= default_conversion (array
);
2936 tree ind
= default_conversion (idx
);
2938 /* Put the integer in IND to simplify error checking. */
2939 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
2946 if (ar
== error_mark_node
)
2949 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
2951 error_at (loc
, "subscripted value is neither array nor pointer");
2952 return error_mark_node
;
2954 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
2956 error_at (loc
, "array subscript is not an integer");
2957 return error_mark_node
;
2960 warn_array_subscript_with_type_char (idx
);
2962 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
2964 tf_warning_or_error
),
2966 tf_warning_or_error
);
2967 protected_set_expr_location (ret
, loc
);
2972 /* Resolve a pointer to member function. INSTANCE is the object
2973 instance to use, if the member points to a virtual member.
2975 This used to avoid checking for virtual functions if basetype
2976 has no virtual functions, according to an earlier ANSI draft.
2977 With the final ISO C++ rules, such an optimization is
2978 incorrect: A pointer to a derived member can be static_cast
2979 to pointer-to-base-member, as long as the dynamic object
2980 later has the right member. */
2983 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
2985 if (TREE_CODE (function
) == OFFSET_REF
)
2986 function
= TREE_OPERAND (function
, 1);
2988 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
2990 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
2991 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
2993 tree instance_ptr
= *instance_ptrptr
;
2994 tree instance_save_expr
= 0;
2995 if (instance_ptr
== error_mark_node
)
2997 if (TREE_CODE (function
) == PTRMEM_CST
)
2999 /* Extracting the function address from a pmf is only
3000 allowed with -Wno-pmf-conversions. It only works for
3002 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
3003 e1
= convert (fntype
, e1
);
3008 error ("object missing in use of %qE", function
);
3009 return error_mark_node
;
3013 if (TREE_SIDE_EFFECTS (instance_ptr
))
3014 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3016 if (TREE_SIDE_EFFECTS (function
))
3017 function
= save_expr (function
);
3019 /* Start by extracting all the information from the PMF itself. */
3020 e3
= pfn_from_ptrmemfunc (function
);
3021 delta
= delta_from_ptrmemfunc (function
);
3022 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3023 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3025 case ptrmemfunc_vbit_in_pfn
:
3026 e1
= cp_build_binary_op (input_location
,
3027 BIT_AND_EXPR
, idx
, integer_one_node
,
3028 tf_warning_or_error
);
3029 idx
= cp_build_binary_op (input_location
,
3030 MINUS_EXPR
, idx
, integer_one_node
,
3031 tf_warning_or_error
);
3034 case ptrmemfunc_vbit_in_delta
:
3035 e1
= cp_build_binary_op (input_location
,
3036 BIT_AND_EXPR
, delta
, integer_one_node
,
3037 tf_warning_or_error
);
3038 delta
= cp_build_binary_op (input_location
,
3039 RSHIFT_EXPR
, delta
, integer_one_node
,
3040 tf_warning_or_error
);
3047 /* Convert down to the right base before using the instance. A
3048 special case is that in a pointer to member of class C, C may
3049 be incomplete. In that case, the function will of course be
3050 a member of C, and no conversion is required. In fact,
3051 lookup_base will fail in that case, because incomplete
3052 classes do not have BINFOs. */
3053 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3054 if (!same_type_ignoring_top_level_qualifiers_p
3055 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3057 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3058 basetype
, ba_check
, NULL
);
3059 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3061 if (instance_ptr
== error_mark_node
)
3062 return error_mark_node
;
3064 /* ...and then the delta in the PMF. */
3065 instance_ptr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (instance_ptr
),
3066 instance_ptr
, fold_convert (sizetype
, delta
));
3068 /* Hand back the adjusted 'this' argument to our caller. */
3069 *instance_ptrptr
= instance_ptr
;
3071 /* Next extract the vtable pointer from the object. */
3072 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3074 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, tf_warning_or_error
);
3075 /* If the object is not dynamic the access invokes undefined
3076 behavior. As it is not executed in this case silence the
3077 spurious warnings it may provoke. */
3078 TREE_NO_WARNING (vtbl
) = 1;
3080 /* Finally, extract the function pointer from the vtable. */
3081 e2
= fold_build2_loc (input_location
,
3082 POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
,
3083 fold_convert (sizetype
, idx
));
3084 e2
= cp_build_indirect_ref (e2
, RO_NULL
, tf_warning_or_error
);
3085 TREE_CONSTANT (e2
) = 1;
3087 /* When using function descriptors, the address of the
3088 vtable entry is treated as a function pointer. */
3089 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3090 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3091 cp_build_unary_op (ADDR_EXPR
, e2
, /*noconvert=*/1,
3092 tf_warning_or_error
));
3094 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3095 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
3097 /* Make sure this doesn't get evaluated first inside one of the
3098 branches of the COND_EXPR. */
3099 if (instance_save_expr
)
3100 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3101 instance_save_expr
, e1
);
3108 /* Used by the C-common bits. */
3110 build_function_call (location_t loc ATTRIBUTE_UNUSED
,
3111 tree function
, tree params
)
3113 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3116 /* Used by the C-common bits. */
3118 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED
,
3119 tree function
, VEC(tree
,gc
) *params
,
3120 VEC(tree
,gc
) *origtypes ATTRIBUTE_UNUSED
)
3122 VEC(tree
,gc
) *orig_params
= params
;
3123 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3124 tf_warning_or_error
);
3126 /* cp_build_function_call_vec can reallocate PARAMS by adding
3127 default arguments. That should never happen here. Verify
3129 gcc_assert (params
== orig_params
);
3134 /* Build a function call using a tree list of arguments. */
3137 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3142 vec
= make_tree_vector ();
3143 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3144 VEC_safe_push (tree
, gc
, vec
, TREE_VALUE (params
));
3145 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3146 release_tree_vector (vec
);
3150 /* Build a function call using a vector of arguments. PARAMS may be
3151 NULL if there are no parameters. This changes the contents of
3155 cp_build_function_call_vec (tree function
, VEC(tree
,gc
) **params
,
3156 tsubst_flags_t complain
)
3158 tree fntype
, fndecl
;
3160 tree original
= function
;
3164 VEC(tree
,gc
) *allocated
= NULL
;
3167 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3168 expressions, like those used for ObjC messenger dispatches. */
3169 if (params
!= NULL
&& !VEC_empty (tree
, *params
))
3170 function
= objc_rewrite_function_call (function
,
3171 VEC_index (tree
, *params
, 0));
3173 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3174 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3175 if (TREE_CODE (function
) == NOP_EXPR
3176 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3177 function
= TREE_OPERAND (function
, 0);
3179 if (TREE_CODE (function
) == FUNCTION_DECL
)
3181 mark_used (function
);
3184 /* Convert anything with function type to a pointer-to-function. */
3185 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
3186 pedwarn (input_location
, OPT_pedantic
,
3187 "ISO C++ forbids calling %<::main%> from within program");
3189 function
= build_addr_func (function
);
3195 function
= build_addr_func (function
);
3198 if (function
== error_mark_node
)
3199 return error_mark_node
;
3201 fntype
= TREE_TYPE (function
);
3203 if (TYPE_PTRMEMFUNC_P (fntype
))
3205 if (complain
& tf_error
)
3206 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3207 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3208 original
, original
);
3209 return error_mark_node
;
3212 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
3213 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3215 if (!((TREE_CODE (fntype
) == POINTER_TYPE
3216 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
3218 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3220 if (complain
& tf_error
)
3221 error ("%qE cannot be used as a function", original
);
3222 return error_mark_node
;
3225 /* fntype now gets the type of function pointed to. */
3226 fntype
= TREE_TYPE (fntype
);
3227 parm_types
= TYPE_ARG_TYPES (fntype
);
3231 allocated
= make_tree_vector ();
3232 params
= &allocated
;
3235 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3238 return error_mark_node
;
3240 argarray
= VEC_address (tree
, *params
);
3242 /* Check for errors in format strings and inappropriately
3244 check_function_arguments (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
,
3247 ret
= build_cxx_call (function
, nargs
, argarray
);
3249 if (allocated
!= NULL
)
3250 release_tree_vector (allocated
);
3255 /* Convert the actual parameter expressions in the list VALUES to the
3256 types in the list TYPELIST. The converted expressions are stored
3257 back in the VALUES vector.
3258 If parmdecls is exhausted, or when an element has NULL as its type,
3259 perform the default conversions.
3261 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3263 This is also where warnings about wrong number of args are generated.
3265 Returns the actual number of arguments processed (which might be less
3266 than the length of the vector), or -1 on error.
3268 In C++, unspecified trailing parameters can be filled in with their
3269 default arguments, if such were specified. Do so here. */
3272 convert_arguments (tree typelist
, VEC(tree
,gc
) **values
, tree fndecl
,
3273 int flags
, tsubst_flags_t complain
)
3276 const char *called_thing
= 0;
3279 /* Argument passing is always copy-initialization. */
3280 flags
|= LOOKUP_ONLYCONVERTING
;
3284 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3286 if (DECL_NAME (fndecl
) == NULL_TREE
3287 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3288 called_thing
= "constructor";
3290 called_thing
= "member function";
3293 called_thing
= "function";
3296 for (i
= 0, typetail
= typelist
;
3297 i
< VEC_length (tree
, *values
);
3300 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3301 tree val
= VEC_index (tree
, *values
, i
);
3303 if (val
== error_mark_node
|| type
== error_mark_node
)
3306 if (type
== void_type_node
)
3308 if (complain
& tf_error
)
3312 error_at (input_location
, "too many arguments to %s %q#D",
3313 called_thing
, fndecl
);
3314 inform (DECL_SOURCE_LOCATION (fndecl
),
3318 error ("too many arguments to function");
3325 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3326 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3327 if (TREE_CODE (val
) == NOP_EXPR
3328 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3329 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3330 val
= TREE_OPERAND (val
, 0);
3332 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3334 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3335 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3336 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3337 val
= decay_conversion (val
);
3340 if (val
== error_mark_node
)
3345 /* Formal parm type is specified by a function prototype. */
3348 if (!COMPLETE_TYPE_P (complete_type (type
)))
3350 if (complain
& tf_error
)
3353 error ("parameter %P of %qD has incomplete type %qT",
3356 error ("parameter %P has incomplete type %qT", i
, type
);
3358 parmval
= error_mark_node
;
3362 parmval
= convert_for_initialization
3363 (NULL_TREE
, type
, val
, flags
,
3364 "argument passing", fndecl
, i
, complain
);
3365 parmval
= convert_for_arg_passing (type
, parmval
);
3368 if (parmval
== error_mark_node
)
3371 VEC_replace (tree
, *values
, i
, parmval
);
3375 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3376 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3377 /* Don't do ellipsis conversion for __built_in_constant_p
3378 as this will result in spurious errors for non-trivial
3380 val
= require_complete_type (val
);
3382 val
= convert_arg_to_ellipsis (val
);
3384 VEC_replace (tree
, *values
, i
, val
);
3388 typetail
= TREE_CHAIN (typetail
);
3391 if (typetail
!= 0 && typetail
!= void_list_node
)
3393 /* See if there are default arguments that can be used. Because
3394 we hold default arguments in the FUNCTION_TYPE (which is so
3395 wrong), we can see default parameters here from deduced
3396 contexts (and via typeof) for indirect function calls.
3397 Fortunately we know whether we have a function decl to
3398 provide default arguments in a language conformant
3400 if (fndecl
&& TREE_PURPOSE (typetail
)
3401 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3403 for (; typetail
!= void_list_node
; ++i
)
3406 = convert_default_arg (TREE_VALUE (typetail
),
3407 TREE_PURPOSE (typetail
),
3410 if (parmval
== error_mark_node
)
3413 VEC_safe_push (tree
, gc
, *values
, parmval
);
3414 typetail
= TREE_CHAIN (typetail
);
3415 /* ends with `...'. */
3416 if (typetail
== NULL_TREE
)
3422 if (complain
& tf_error
)
3426 error_at (input_location
, "too few arguments to %s %q#D",
3427 called_thing
, fndecl
);
3428 inform (DECL_SOURCE_LOCATION (fndecl
),
3432 error ("too few arguments to function");
3441 /* Build a binary-operation expression, after performing default
3442 conversions on the operands. CODE is the kind of expression to
3443 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3444 are the tree codes which correspond to ARG1 and ARG2 when issuing
3445 warnings about possibly misplaced parentheses. They may differ
3446 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3447 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3448 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3449 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3450 ARG2_CODE as ERROR_MARK. */
3453 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3454 tree arg2
, enum tree_code arg2_code
, bool *overloaded_p
,
3455 tsubst_flags_t complain
)
3464 if (processing_template_decl
)
3466 if (type_dependent_expression_p (arg1
)
3467 || type_dependent_expression_p (arg2
))
3468 return build_min_nt (code
, arg1
, arg2
);
3469 arg1
= build_non_dependent_expr (arg1
);
3470 arg2
= build_non_dependent_expr (arg2
);
3473 if (code
== DOTSTAR_EXPR
)
3474 expr
= build_m_component_ref (arg1
, arg2
);
3476 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3477 overloaded_p
, complain
);
3479 /* Check for cases such as x+y<<z which users are likely to
3480 misinterpret. But don't warn about obj << x + y, since that is a
3481 common idiom for I/O. */
3482 if (warn_parentheses
3483 && (complain
& tf_warning
)
3484 && !processing_template_decl
3485 && !error_operand_p (arg1
)
3486 && !error_operand_p (arg2
)
3487 && (code
!= LSHIFT_EXPR
3488 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3489 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3491 if (processing_template_decl
&& expr
!= error_mark_node
)
3492 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3497 /* Build and return an ARRAY_REF expression. */
3500 build_x_array_ref (tree arg1
, tree arg2
, tsubst_flags_t complain
)
3502 tree orig_arg1
= arg1
;
3503 tree orig_arg2
= arg2
;
3506 if (processing_template_decl
)
3508 if (type_dependent_expression_p (arg1
)
3509 || type_dependent_expression_p (arg2
))
3510 return build_min_nt (ARRAY_REF
, arg1
, arg2
,
3511 NULL_TREE
, NULL_TREE
);
3512 arg1
= build_non_dependent_expr (arg1
);
3513 arg2
= build_non_dependent_expr (arg2
);
3516 expr
= build_new_op (ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3517 /*overloaded_p=*/NULL
, complain
);
3519 if (processing_template_decl
&& expr
!= error_mark_node
)
3520 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3521 NULL_TREE
, NULL_TREE
);
3525 /* For the c-common bits. */
3527 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3528 int convert_p ATTRIBUTE_UNUSED
)
3530 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3534 /* Build a binary-operation expression without default conversions.
3535 CODE is the kind of expression to build.
3536 LOCATION is the location_t of the operator in the source code.
3537 This function differs from `build' in several ways:
3538 the data type of the result is computed and recorded in it,
3539 warnings are generated if arg data types are invalid,
3540 special handling for addition and subtraction of pointers is known,
3541 and some optimization is done (operations on narrow ints
3542 are done in the narrower type when that gives the same result).
3543 Constant folding is also done before the result is returned.
3545 Note that the operands will never have enumeral types
3546 because either they have just had the default conversions performed
3547 or they have both just been converted to some other type in which
3548 the arithmetic is to be done.
3550 C++: must do special pointer arithmetic when implementing
3551 multiple inheritance, and deal with pointer to member functions. */
3554 cp_build_binary_op (location_t location
,
3555 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3556 tsubst_flags_t complain
)
3559 enum tree_code code0
, code1
;
3561 const char *invalid_op_diag
;
3563 /* Expression code to give to the expression when it is built.
3564 Normally this is CODE, which is what the caller asked for,
3565 but in some special cases we change it. */
3566 enum tree_code resultcode
= code
;
3568 /* Data type in which the computation is to be performed.
3569 In the simplest cases this is the common type of the arguments. */
3570 tree result_type
= NULL
;
3572 /* Nonzero means operands have already been type-converted
3573 in whatever way is necessary.
3574 Zero means they need to be converted to RESULT_TYPE. */
3577 /* Nonzero means create the expression with this type, rather than
3579 tree build_type
= 0;
3581 /* Nonzero means after finally constructing the expression
3582 convert it to this type. */
3583 tree final_type
= 0;
3587 /* Nonzero if this is an operation like MIN or MAX which can
3588 safely be computed in short if both args are promoted shorts.
3589 Also implies COMMON.
3590 -1 indicates a bitwise operation; this makes a difference
3591 in the exact conditions for when it is safe to do the operation
3592 in a narrower mode. */
3595 /* Nonzero if this is a comparison operation;
3596 if both args are promoted shorts, compare the original shorts.
3597 Also implies COMMON. */
3598 int short_compare
= 0;
3600 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3603 /* True if both operands have arithmetic type. */
3604 bool arithmetic_types_p
;
3606 /* Apply default conversions. */
3610 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3611 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3612 || code
== TRUTH_XOR_EXPR
)
3614 if (!really_overloaded_fn (op0
))
3615 op0
= decay_conversion (op0
);
3616 if (!really_overloaded_fn (op1
))
3617 op1
= decay_conversion (op1
);
3621 if (!really_overloaded_fn (op0
))
3622 op0
= default_conversion (op0
);
3623 if (!really_overloaded_fn (op1
))
3624 op1
= default_conversion (op1
);
3627 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3628 STRIP_TYPE_NOPS (op0
);
3629 STRIP_TYPE_NOPS (op1
);
3631 /* DTRT if one side is an overloaded function, but complain about it. */
3632 if (type_unknown_p (op0
))
3634 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3635 if (t
!= error_mark_node
)
3637 if (complain
& tf_error
)
3638 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3643 if (type_unknown_p (op1
))
3645 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3646 if (t
!= error_mark_node
)
3648 if (complain
& tf_error
)
3649 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3655 type0
= TREE_TYPE (op0
);
3656 type1
= TREE_TYPE (op1
);
3658 /* The expression codes of the data types of the arguments tell us
3659 whether the arguments are integers, floating, pointers, etc. */
3660 code0
= TREE_CODE (type0
);
3661 code1
= TREE_CODE (type1
);
3663 /* If an error was already reported for one of the arguments,
3664 avoid reporting another error. */
3665 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3666 return error_mark_node
;
3668 if ((invalid_op_diag
3669 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3671 error (invalid_op_diag
);
3672 return error_mark_node
;
3675 /* Issue warnings about peculiar, but valid, uses of NULL. */
3676 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3677 /* It's reasonable to use pointer values as operands of &&
3678 and ||, so NULL is no exception. */
3679 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3680 && ( /* Both are NULL (or 0) and the operation was not a
3681 comparison or a pointer subtraction. */
3682 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3683 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
3684 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3685 || (!null_ptr_cst_p (orig_op0
)
3686 && !TYPE_PTR_P (type0
) && !TYPE_PTR_TO_MEMBER_P (type0
))
3687 || (!null_ptr_cst_p (orig_op1
)
3688 && !TYPE_PTR_P (type1
) && !TYPE_PTR_TO_MEMBER_P (type1
)))
3689 && (complain
& tf_warning
))
3690 /* Some sort of arithmetic operation involving NULL was
3692 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3697 /* Subtraction of two similar pointers.
3698 We must subtract them as integers, then divide by object size. */
3699 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3700 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3702 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3703 /* In all other cases except pointer - int, the usual arithmetic
3705 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3710 /* The pointer - int case is just like pointer + int; fall
3713 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3714 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3718 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3719 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3720 if (processing_template_decl
)
3722 result_type
= TREE_TYPE (ptr_operand
);
3725 return cp_pointer_int_sum (code
,
3736 case TRUNC_DIV_EXPR
:
3738 case FLOOR_DIV_EXPR
:
3739 case ROUND_DIV_EXPR
:
3740 case EXACT_DIV_EXPR
:
3741 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3742 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3743 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3744 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3746 enum tree_code tcode0
= code0
, tcode1
= code1
;
3748 warn_for_div_by_zero (location
, op1
);
3750 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3751 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3752 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3753 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3755 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3756 resultcode
= RDIV_EXPR
;
3758 /* When dividing two signed integers, we have to promote to int.
3759 unless we divide by a constant != -1. Note that default
3760 conversion will have been performed on the operands at this
3761 point, so we have to dig out the original type to find out if
3763 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3764 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3765 || (TREE_CODE (op1
) == INTEGER_CST
3766 && ! integer_all_onesp (op1
)));
3775 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3776 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3777 && !VECTOR_FLOAT_TYPE_P (type0
)
3778 && !VECTOR_FLOAT_TYPE_P (type1
)))
3782 case TRUNC_MOD_EXPR
:
3783 case FLOOR_MOD_EXPR
:
3784 warn_for_div_by_zero (location
, op1
);
3786 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3787 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
3788 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
3790 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3792 /* Although it would be tempting to shorten always here, that loses
3793 on some targets, since the modulo instruction is undefined if the
3794 quotient can't be represented in the computation mode. We shorten
3795 only if unsigned or if dividing by something we know != -1. */
3796 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3797 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3798 || (TREE_CODE (op1
) == INTEGER_CST
3799 && ! integer_all_onesp (op1
)));
3804 case TRUTH_ANDIF_EXPR
:
3805 case TRUTH_ORIF_EXPR
:
3806 case TRUTH_AND_EXPR
:
3808 result_type
= boolean_type_node
;
3811 /* Shift operations: result has same type as first operand;
3812 always convert second operand to int.
3813 Also set SHORT_SHIFT if shifting rightward. */
3816 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3818 result_type
= type0
;
3819 if (TREE_CODE (op1
) == INTEGER_CST
)
3821 if (tree_int_cst_lt (op1
, integer_zero_node
))
3823 if ((complain
& tf_warning
)
3824 && c_inhibit_evaluation_warnings
== 0)
3825 warning (0, "right shift count is negative");
3829 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3830 && (complain
& tf_warning
)
3831 && c_inhibit_evaluation_warnings
== 0)
3832 warning (0, "right shift count >= width of type");
3835 /* Convert the shift-count to an integer, regardless of
3836 size of value being shifted. */
3837 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3838 op1
= cp_convert (integer_type_node
, op1
);
3839 /* Avoid converting op1 to result_type later. */
3845 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3847 result_type
= type0
;
3848 if (TREE_CODE (op1
) == INTEGER_CST
)
3850 if (tree_int_cst_lt (op1
, integer_zero_node
))
3852 if ((complain
& tf_warning
)
3853 && c_inhibit_evaluation_warnings
== 0)
3854 warning (0, "left shift count is negative");
3856 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3858 if ((complain
& tf_warning
)
3859 && c_inhibit_evaluation_warnings
== 0)
3860 warning (0, "left shift count >= width of type");
3863 /* Convert the shift-count to an integer, regardless of
3864 size of value being shifted. */
3865 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3866 op1
= cp_convert (integer_type_node
, op1
);
3867 /* Avoid converting op1 to result_type later. */
3874 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3876 result_type
= type0
;
3877 if (TREE_CODE (op1
) == INTEGER_CST
)
3879 if (tree_int_cst_lt (op1
, integer_zero_node
))
3881 if (complain
& tf_warning
)
3882 warning (0, (code
== LROTATE_EXPR
)
3883 ? G_("left rotate count is negative")
3884 : G_("right rotate count is negative"));
3886 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3888 if (complain
& tf_warning
)
3889 warning (0, (code
== LROTATE_EXPR
)
3890 ? G_("left rotate count >= width of type")
3891 : G_("right rotate count >= width of type"));
3894 /* Convert the shift-count to an integer, regardless of
3895 size of value being shifted. */
3896 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3897 op1
= cp_convert (integer_type_node
, op1
);
3903 if ((complain
& tf_warning
)
3904 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
3905 warning (OPT_Wfloat_equal
,
3906 "comparing floating point with == or != is unsafe");
3907 if ((complain
& tf_warning
)
3908 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
3909 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
3910 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
3912 build_type
= boolean_type_node
;
3913 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3914 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
3915 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3916 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
3918 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3919 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
3920 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3921 CPO_COMPARISON
, complain
);
3922 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
3923 && null_ptr_cst_p (op1
))
3925 if (TREE_CODE (op0
) == ADDR_EXPR
3926 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
3928 if (complain
& tf_warning
)
3929 warning (OPT_Waddress
, "the address of %qD will never be NULL",
3930 TREE_OPERAND (op0
, 0));
3932 result_type
= type0
;
3934 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
3935 && null_ptr_cst_p (op0
))
3937 if (TREE_CODE (op1
) == ADDR_EXPR
3938 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
3940 if (complain
& tf_warning
)
3941 warning (OPT_Waddress
, "the address of %qD will never be NULL",
3942 TREE_OPERAND (op1
, 0));
3944 result_type
= type1
;
3946 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3948 result_type
= type0
;
3949 if (complain
& tf_error
)
3950 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
3952 return error_mark_node
;
3954 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
3956 result_type
= type1
;
3957 if (complain
& tf_error
)
3958 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
3960 return error_mark_node
;
3962 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
3964 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
3965 == ptrmemfunc_vbit_in_delta
)
3967 tree pfn0
= pfn_from_ptrmemfunc (op0
);
3968 tree delta0
= delta_from_ptrmemfunc (op0
);
3969 tree e1
= cp_build_binary_op (location
,
3972 fold_convert (TREE_TYPE (pfn0
),
3975 tree e2
= cp_build_binary_op (location
,
3980 e2
= cp_build_binary_op (location
,
3981 EQ_EXPR
, e2
, integer_zero_node
,
3983 op0
= cp_build_binary_op (location
,
3984 TRUTH_ANDIF_EXPR
, e1
, e2
,
3986 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
3990 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
3991 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
3993 result_type
= TREE_TYPE (op0
);
3995 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
3996 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
3997 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4000 /* E will be the final comparison. */
4002 /* E1 and E2 are for scratch. */
4010 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4011 CPO_COMPARISON
, complain
);
4013 if (!same_type_p (TREE_TYPE (op0
), type
))
4014 op0
= cp_convert_and_check (type
, op0
);
4015 if (!same_type_p (TREE_TYPE (op1
), type
))
4016 op1
= cp_convert_and_check (type
, op1
);
4018 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4019 return error_mark_node
;
4021 if (TREE_SIDE_EFFECTS (op0
))
4022 op0
= save_expr (op0
);
4023 if (TREE_SIDE_EFFECTS (op1
))
4024 op1
= save_expr (op1
);
4026 pfn0
= pfn_from_ptrmemfunc (op0
);
4027 pfn1
= pfn_from_ptrmemfunc (op1
);
4028 delta0
= delta_from_ptrmemfunc (op0
);
4029 delta1
= delta_from_ptrmemfunc (op1
);
4030 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4031 == ptrmemfunc_vbit_in_delta
)
4036 && ((op0.delta == op1.delta)
4037 || (!op0.pfn && op0.delta & 1 == 0
4038 && op1.delta & 1 == 0))
4040 The reason for the `!op0.pfn' bit is that a NULL
4041 pointer-to-member is any member with a zero PFN and
4042 LSB of the DELTA field is 0. */
4044 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4048 e1
= cp_build_binary_op (location
,
4049 EQ_EXPR
, e1
, integer_zero_node
,
4051 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4055 e2
= cp_build_binary_op (location
,
4056 EQ_EXPR
, e2
, integer_zero_node
,
4058 e1
= cp_build_binary_op (location
,
4059 TRUTH_ANDIF_EXPR
, e2
, e1
,
4061 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4063 fold_convert (TREE_TYPE (pfn0
),
4066 e2
= cp_build_binary_op (location
,
4067 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4068 e1
= cp_build_binary_op (location
,
4069 EQ_EXPR
, delta0
, delta1
, complain
);
4070 e1
= cp_build_binary_op (location
,
4071 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4078 && (!op0.pfn || op0.delta == op1.delta))
4080 The reason for the `!op0.pfn' bit is that a NULL
4081 pointer-to-member is any member with a zero PFN; the
4082 DELTA field is unspecified. */
4084 e1
= cp_build_binary_op (location
,
4085 EQ_EXPR
, delta0
, delta1
, complain
);
4086 e2
= cp_build_binary_op (location
,
4089 fold_convert (TREE_TYPE (pfn0
),
4092 e1
= cp_build_binary_op (location
,
4093 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4095 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4096 e
= cp_build_binary_op (location
,
4097 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4098 if (code
== EQ_EXPR
)
4100 return cp_build_binary_op (location
,
4101 EQ_EXPR
, e
, integer_zero_node
, complain
);
4105 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4106 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4108 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4109 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4117 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4118 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4120 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4121 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4122 CPO_COMPARISON
, complain
);
4129 if (TREE_CODE (orig_op0
) == STRING_CST
4130 || TREE_CODE (orig_op1
) == STRING_CST
)
4132 if (complain
& tf_warning
)
4133 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4136 build_type
= boolean_type_node
;
4137 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4138 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4140 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4141 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4142 CPO_COMPARISON
, complain
);
4143 else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
4144 && integer_zerop (op1
))
4145 result_type
= type0
;
4146 else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
4147 && integer_zerop (op0
))
4148 result_type
= type1
;
4149 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4151 result_type
= type0
;
4152 if (complain
& tf_error
)
4153 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4155 return error_mark_node
;
4157 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4159 result_type
= type1
;
4160 if (complain
& tf_error
)
4161 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4163 return error_mark_node
;
4167 case UNORDERED_EXPR
:
4174 build_type
= integer_type_node
;
4175 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4177 if (complain
& tf_error
)
4178 error ("unordered comparison on non-floating point argument");
4179 return error_mark_node
;
4188 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4189 || code0
== ENUMERAL_TYPE
)
4190 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4191 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4192 arithmetic_types_p
= 1;
4195 arithmetic_types_p
= 0;
4196 /* Vector arithmetic is only allowed when both sides are vectors. */
4197 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4199 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4200 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4203 binary_op_error (location
, code
, type0
, type1
);
4204 return error_mark_node
;
4206 arithmetic_types_p
= 1;
4209 /* Determine the RESULT_TYPE, if it is not already known. */
4211 && arithmetic_types_p
4212 && (shorten
|| common
|| short_compare
))
4213 result_type
= cp_common_type (type0
, type1
);
4217 if (complain
& tf_error
)
4218 error ("invalid operands of types %qT and %qT to binary %qO",
4219 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4220 return error_mark_node
;
4223 /* If we're in a template, the only thing we need to know is the
4225 if (processing_template_decl
)
4227 /* Since the middle-end checks the type when doing a build2, we
4228 need to build the tree in pieces. This built tree will never
4229 get out of the front-end as we replace it when instantiating
4231 tree tmp
= build2 (resultcode
,
4232 build_type
? build_type
: result_type
,
4234 TREE_OPERAND (tmp
, 0) = op0
;
4238 if (arithmetic_types_p
)
4240 bool first_complex
= (code0
== COMPLEX_TYPE
);
4241 bool second_complex
= (code1
== COMPLEX_TYPE
);
4242 int none_complex
= (!first_complex
&& !second_complex
);
4244 /* Adapted from patch for c/24581. */
4245 if (first_complex
!= second_complex
4246 && (code
== PLUS_EXPR
4247 || code
== MINUS_EXPR
4248 || code
== MULT_EXPR
4249 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4250 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4251 && flag_signed_zeros
)
4253 /* An operation on mixed real/complex operands must be
4254 handled specially, but the language-independent code can
4255 more easily optimize the plain complex arithmetic if
4256 -fno-signed-zeros. */
4257 tree real_type
= TREE_TYPE (result_type
);
4261 if (TREE_TYPE (op0
) != result_type
)
4262 op0
= cp_convert_and_check (result_type
, op0
);
4263 if (TREE_TYPE (op1
) != real_type
)
4264 op1
= cp_convert_and_check (real_type
, op1
);
4268 if (TREE_TYPE (op0
) != real_type
)
4269 op0
= cp_convert_and_check (real_type
, op0
);
4270 if (TREE_TYPE (op1
) != result_type
)
4271 op1
= cp_convert_and_check (result_type
, op1
);
4273 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4274 return error_mark_node
;
4277 op0
= save_expr (op0
);
4278 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4279 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4283 case TRUNC_DIV_EXPR
:
4284 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4288 real
= build2 (resultcode
, real_type
, real
, op1
);
4296 op1
= save_expr (op1
);
4297 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4298 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4302 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4305 real
= build2 (resultcode
, real_type
, op0
, real
);
4308 real
= build2 (resultcode
, real_type
, op0
, real
);
4309 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4315 return build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4318 /* For certain operations (which identify themselves by shorten != 0)
4319 if both args were extended from the same smaller type,
4320 do the arithmetic in that type and then extend.
4322 shorten !=0 and !=1 indicates a bitwise operation.
4323 For them, this optimization is safe only if
4324 both args are zero-extended or both are sign-extended.
4325 Otherwise, we might change the result.
4326 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4327 but calculated in (unsigned short) it would be (unsigned short)-1. */
4329 if (shorten
&& none_complex
)
4331 final_type
= result_type
;
4332 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4336 /* Comparison operations are shortened too but differently.
4337 They identify themselves by setting short_compare = 1. */
4341 /* Don't write &op0, etc., because that would prevent op0
4342 from being kept in a register.
4343 Instead, make copies of the our local variables and
4344 pass the copies by reference, then copy them back afterward. */
4345 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4346 enum tree_code xresultcode
= resultcode
;
4348 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4350 return cp_convert (boolean_type_node
, val
);
4351 op0
= xop0
, op1
= xop1
;
4353 resultcode
= xresultcode
;
4356 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4357 && warn_sign_compare
4358 && !TREE_NO_WARNING (orig_op0
)
4359 && !TREE_NO_WARNING (orig_op1
)
4360 /* Do not warn until the template is instantiated; we cannot
4361 bound the ranges of the arguments until that point. */
4362 && !processing_template_decl
4363 && (complain
& tf_warning
)
4364 && c_inhibit_evaluation_warnings
== 0)
4366 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4367 result_type
, resultcode
);
4371 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4372 Then the expression will be built.
4373 It will be given type FINAL_TYPE if that is nonzero;
4374 otherwise, it will be given type RESULT_TYPE. */
4377 if (TREE_TYPE (op0
) != result_type
)
4378 op0
= cp_convert_and_check (result_type
, op0
);
4379 if (TREE_TYPE (op1
) != result_type
)
4380 op1
= cp_convert_and_check (result_type
, op1
);
4382 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4383 return error_mark_node
;
4386 if (build_type
== NULL_TREE
)
4387 build_type
= result_type
;
4389 result
= build2 (resultcode
, build_type
, op0
, op1
);
4390 result
= fold_if_not_in_template (result
);
4391 if (final_type
!= 0)
4392 result
= cp_convert (final_type
, result
);
4394 if (TREE_OVERFLOW_P (result
)
4395 && !TREE_OVERFLOW_P (op0
)
4396 && !TREE_OVERFLOW_P (op1
))
4397 overflow_warning (location
, result
);
4402 /* Return a tree for the sum or difference (RESULTCODE says which)
4403 of pointer PTROP and integer INTOP. */
4406 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4408 tree res_type
= TREE_TYPE (ptrop
);
4410 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4411 in certain circumstance (when it's valid to do so). So we need
4412 to make sure it's complete. We don't need to check here, if we
4413 can actually complete it at all, as those checks will be done in
4414 pointer_int_sum() anyway. */
4415 complete_type (TREE_TYPE (res_type
));
4417 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4418 fold_if_not_in_template (intop
));
4421 /* Return a tree for the difference of pointers OP0 and OP1.
4422 The resulting tree has type int. */
4425 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4428 tree restype
= ptrdiff_type_node
;
4429 tree target_type
= TREE_TYPE (ptrtype
);
4431 if (!complete_type_or_else (target_type
, NULL_TREE
))
4432 return error_mark_node
;
4434 if (TREE_CODE (target_type
) == VOID_TYPE
)
4435 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4436 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4437 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4438 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4439 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4441 /* First do the subtraction as integers;
4442 then drop through to build the divide operator. */
4444 op0
= cp_build_binary_op (input_location
,
4446 cp_convert (restype
, op0
),
4447 cp_convert (restype
, op1
),
4448 tf_warning_or_error
);
4450 /* This generates an error if op1 is a pointer to an incomplete type. */
4451 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4452 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4454 op1
= (TYPE_PTROB_P (ptrtype
)
4455 ? size_in_bytes (target_type
)
4456 : integer_one_node
);
4458 /* Do the division. */
4460 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4461 return fold_if_not_in_template (result
);
4464 /* Construct and perhaps optimize a tree representation
4465 for a unary operation. CODE, a tree_code, specifies the operation
4466 and XARG is the operand. */
4469 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4471 tree orig_expr
= xarg
;
4475 if (processing_template_decl
)
4477 if (type_dependent_expression_p (xarg
))
4478 return build_min_nt (code
, xarg
, NULL_TREE
);
4480 xarg
= build_non_dependent_expr (xarg
);
4485 /* [expr.unary.op] says:
4487 The address of an object of incomplete type can be taken.
4489 (And is just the ordinary address operator, not an overloaded
4490 "operator &".) However, if the type is a template
4491 specialization, we must complete the type at this point so that
4492 an overloaded "operator &" will be available if required. */
4493 if (code
== ADDR_EXPR
4494 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4495 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4496 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4497 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4498 /* Don't look for a function. */;
4500 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4501 /*overloaded_p=*/NULL
, complain
);
4502 if (!exp
&& code
== ADDR_EXPR
)
4504 if (is_overloaded_fn (xarg
))
4506 tree fn
= get_first_fn (xarg
);
4507 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4509 error (DECL_CONSTRUCTOR_P (fn
)
4510 ? G_("taking address of constructor %qE")
4511 : G_("taking address of destructor %qE"),
4513 return error_mark_node
;
4517 /* A pointer to member-function can be formed only by saying
4519 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4520 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4522 if (TREE_CODE (xarg
) != OFFSET_REF
4523 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4525 error ("invalid use of %qE to form a pointer-to-member-function",
4527 if (TREE_CODE (xarg
) != OFFSET_REF
)
4528 inform (input_location
, " a qualified-id is required");
4529 return error_mark_node
;
4533 error ("parentheses around %qE cannot be used to form a"
4534 " pointer-to-member-function",
4536 PTRMEM_OK_P (xarg
) = 1;
4540 if (TREE_CODE (xarg
) == OFFSET_REF
)
4542 ptrmem
= PTRMEM_OK_P (xarg
);
4544 if (!ptrmem
&& !flag_ms_extensions
4545 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4547 /* A single non-static member, make sure we don't allow a
4548 pointer-to-member. */
4549 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4550 TREE_OPERAND (xarg
, 0),
4551 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4552 PTRMEM_OK_P (xarg
) = ptrmem
;
4555 else if (TREE_CODE (xarg
) == TARGET_EXPR
&& (complain
& tf_warning
))
4556 warning (0, "taking address of temporary");
4557 exp
= cp_build_unary_op (ADDR_EXPR
, xarg
, 0, complain
);
4560 if (processing_template_decl
&& exp
!= error_mark_node
)
4561 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4562 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4563 if (TREE_CODE (exp
) == ADDR_EXPR
)
4564 PTRMEM_OK_P (exp
) = ptrmem
;
4568 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4569 constants, where a null value is represented by an INTEGER_CST of
4573 cp_truthvalue_conversion (tree expr
)
4575 tree type
= TREE_TYPE (expr
);
4576 if (TYPE_PTRMEM_P (type
))
4577 return build_binary_op (EXPR_LOCATION (expr
),
4578 NE_EXPR
, expr
, integer_zero_node
, 1);
4580 return c_common_truthvalue_conversion (input_location
, expr
);
4583 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4586 condition_conversion (tree expr
)
4589 if (processing_template_decl
)
4591 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4592 tf_warning_or_error
, LOOKUP_NORMAL
);
4593 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4597 /* Returns the address of T. This function will fold away
4598 ADDR_EXPR of INDIRECT_REF. */
4601 build_address (tree t
)
4603 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4604 return error_mark_node
;
4605 t
= build_fold_addr_expr (t
);
4606 if (TREE_CODE (t
) != ADDR_EXPR
)
4611 /* Returns the address of T with type TYPE. */
4614 build_typed_address (tree t
, tree type
)
4616 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4617 return error_mark_node
;
4618 t
= build_fold_addr_expr_with_type (t
, type
);
4619 if (TREE_CODE (t
) != ADDR_EXPR
)
4624 /* Return a NOP_EXPR converting EXPR to TYPE. */
4627 build_nop (tree type
, tree expr
)
4629 if (type
== error_mark_node
|| error_operand_p (expr
))
4631 return build1 (NOP_EXPR
, type
, expr
);
4634 /* C++: Must handle pointers to members.
4636 Perhaps type instantiation should be extended to handle conversion
4637 from aggregates to types we don't yet know we want? (Or are those
4638 cases typically errors which should be reported?)
4640 NOCONVERT nonzero suppresses the default promotions
4641 (such as from short to int). */
4644 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
4645 tsubst_flags_t complain
)
4647 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4650 const char *errstring
= NULL
;
4652 const char *invalid_op_diag
;
4654 if (error_operand_p (arg
))
4655 return error_mark_node
;
4657 if ((invalid_op_diag
4658 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
4663 error (invalid_op_diag
);
4664 return error_mark_node
;
4669 case UNARY_PLUS_EXPR
:
4672 int flags
= WANT_ARITH
| WANT_ENUM
;
4673 /* Unary plus (but not unary minus) is allowed on pointers. */
4674 if (code
== UNARY_PLUS_EXPR
)
4675 flags
|= WANT_POINTER
;
4676 arg
= build_expr_type_conversion (flags
, arg
, true);
4678 errstring
= (code
== NEGATE_EXPR
4679 ? _("wrong type argument to unary minus")
4680 : _("wrong type argument to unary plus"));
4683 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4684 arg
= perform_integral_promotions (arg
);
4686 /* Make sure the result is not an lvalue: a unary plus or minus
4687 expression is always a rvalue. */
4694 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4698 arg
= default_conversion (arg
);
4700 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
4701 | WANT_VECTOR_OR_COMPLEX
,
4703 errstring
= _("wrong type argument to bit-complement");
4704 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4705 arg
= perform_integral_promotions (arg
);
4709 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4710 errstring
= _("wrong type argument to abs");
4711 else if (!noconvert
)
4712 arg
= default_conversion (arg
);
4716 /* Conjugating a real value is a no-op, but allow it anyway. */
4717 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4718 errstring
= _("wrong type argument to conjugation");
4719 else if (!noconvert
)
4720 arg
= default_conversion (arg
);
4723 case TRUTH_NOT_EXPR
:
4724 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
4726 val
= invert_truthvalue_loc (input_location
, arg
);
4727 if (arg
!= error_mark_node
)
4729 errstring
= _("in argument to unary !");
4736 if (TREE_CODE (arg
) == COMPLEX_CST
)
4737 return TREE_REALPART (arg
);
4738 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4740 arg
= build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4741 return fold_if_not_in_template (arg
);
4747 if (TREE_CODE (arg
) == COMPLEX_CST
)
4748 return TREE_IMAGPART (arg
);
4749 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4751 arg
= build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4752 return fold_if_not_in_template (arg
);
4755 return cp_convert (TREE_TYPE (arg
), integer_zero_node
);
4757 case PREINCREMENT_EXPR
:
4758 case POSTINCREMENT_EXPR
:
4759 case PREDECREMENT_EXPR
:
4760 case POSTDECREMENT_EXPR
:
4761 /* Handle complex lvalues (when permitted)
4762 by reduction to simpler cases. */
4764 val
= unary_complex_lvalue (code
, arg
);
4768 /* Increment or decrement the real part of the value,
4769 and don't change the imaginary part. */
4770 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4774 arg
= stabilize_reference (arg
);
4775 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
4776 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
4777 real
= cp_build_unary_op (code
, real
, 1, complain
);
4778 if (real
== error_mark_node
|| imag
== error_mark_node
)
4779 return error_mark_node
;
4780 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
4784 /* Report invalid types. */
4786 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
4789 if (code
== PREINCREMENT_EXPR
)
4790 errstring
= _("no pre-increment operator for type");
4791 else if (code
== POSTINCREMENT_EXPR
)
4792 errstring
= _("no post-increment operator for type");
4793 else if (code
== PREDECREMENT_EXPR
)
4794 errstring
= _("no pre-decrement operator for type");
4796 errstring
= _("no post-decrement operator for type");
4799 else if (arg
== error_mark_node
)
4800 return error_mark_node
;
4802 /* Report something read-only. */
4804 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
4805 || TREE_READONLY (arg
))
4807 if (complain
& tf_error
)
4808 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
4809 || code
== POSTINCREMENT_EXPR
)
4810 ? REK_INCREMENT
: REK_DECREMENT
));
4812 return error_mark_node
;
4817 tree declared_type
= unlowered_expr_type (arg
);
4819 argtype
= TREE_TYPE (arg
);
4821 /* ARM $5.2.5 last annotation says this should be forbidden. */
4822 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
4824 if (complain
& tf_error
)
4825 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
4826 ? G_("ISO C++ forbids incrementing an enum")
4827 : G_("ISO C++ forbids decrementing an enum"));
4829 return error_mark_node
;
4832 /* Compute the increment. */
4834 if (TREE_CODE (argtype
) == POINTER_TYPE
)
4836 tree type
= complete_type (TREE_TYPE (argtype
));
4838 if (!COMPLETE_OR_VOID_TYPE_P (type
))
4840 if (complain
& tf_error
)
4841 error (((code
== PREINCREMENT_EXPR
4842 || code
== POSTINCREMENT_EXPR
))
4843 ? G_("cannot increment a pointer to incomplete type %qT")
4844 : G_("cannot decrement a pointer to incomplete type %qT"),
4845 TREE_TYPE (argtype
));
4847 return error_mark_node
;
4849 else if ((pedantic
|| warn_pointer_arith
)
4850 && !TYPE_PTROB_P (argtype
))
4852 if (complain
& tf_error
)
4853 permerror (input_location
, (code
== PREINCREMENT_EXPR
4854 || code
== POSTINCREMENT_EXPR
)
4855 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
4856 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
4859 return error_mark_node
;
4862 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
4865 inc
= integer_one_node
;
4867 inc
= cp_convert (argtype
, inc
);
4869 /* Complain about anything else that is not a true lvalue. */
4870 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
4871 || code
== POSTINCREMENT_EXPR
)
4872 ? lv_increment
: lv_decrement
),
4874 return error_mark_node
;
4876 /* Forbid using -- on `bool'. */
4877 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
4879 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
4881 if (complain
& tf_error
)
4882 error ("invalid use of Boolean expression as operand "
4883 "to %<operator--%>");
4884 return error_mark_node
;
4886 val
= boolean_increment (code
, arg
);
4889 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
4891 TREE_SIDE_EFFECTS (val
) = 1;
4896 /* Note that this operation never does default_conversion
4897 regardless of NOCONVERT. */
4899 argtype
= lvalue_type (arg
);
4901 if (TREE_CODE (arg
) == OFFSET_REF
)
4904 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4906 tree type
= build_pointer_type (TREE_TYPE (argtype
));
4907 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4910 else if (pedantic
&& DECL_MAIN_P (arg
))
4913 /* Apparently a lot of autoconf scripts for C++ packages do this,
4914 so only complain if -pedantic. */
4915 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
4916 pedwarn (input_location
, OPT_pedantic
,
4917 "ISO C++ forbids taking address of function %<::main%>");
4918 else if (flag_pedantic_errors
)
4919 return error_mark_node
;
4922 /* Let &* cancel out to simplify resulting code. */
4923 if (TREE_CODE (arg
) == INDIRECT_REF
)
4925 /* We don't need to have `current_class_ptr' wrapped in a
4926 NON_LVALUE_EXPR node. */
4927 if (arg
== current_class_ref
)
4928 return current_class_ptr
;
4930 arg
= TREE_OPERAND (arg
, 0);
4931 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
4933 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
4934 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4937 /* Don't let this be an lvalue. */
4942 /* Uninstantiated types are all functions. Taking the
4943 address of a function is a no-op, so just return the
4946 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
4947 || !IDENTIFIER_OPNAME_P (arg
));
4949 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
4950 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
4952 /* They're trying to take the address of a unique non-static
4953 member function. This is ill-formed (except in MS-land),
4954 but let's try to DTRT.
4955 Note: We only handle unique functions here because we don't
4956 want to complain if there's a static overload; non-unique
4957 cases will be handled by instantiate_type. But we need to
4958 handle this case here to allow casts on the resulting PMF.
4959 We could defer this in non-MS mode, but it's easier to give
4960 a useful error here. */
4962 /* Inside constant member functions, the `this' pointer
4963 contains an extra const qualifier. TYPE_MAIN_VARIANT
4964 is used here to remove this const from the diagnostics
4965 and the created OFFSET_REF. */
4966 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
4967 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
4970 if (! flag_ms_extensions
)
4972 tree name
= DECL_NAME (fn
);
4973 if (!(complain
& tf_error
))
4974 return error_mark_node
;
4975 else if (current_class_type
4976 && TREE_OPERAND (arg
, 0) == current_class_ref
)
4977 /* An expression like &memfn. */
4978 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
4979 " or parenthesized non-static member function to form"
4980 " a pointer to member function. Say %<&%T::%D%>",
4983 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
4984 " function to form a pointer to member function."
4988 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
4992 if (type_unknown_p (arg
))
4993 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4995 /* Handle complex lvalues (when permitted)
4996 by reduction to simpler cases. */
4997 val
= unary_complex_lvalue (code
, arg
);
5001 switch (TREE_CODE (arg
))
5005 case FIX_TRUNC_EXPR
:
5006 /* Even if we're not being pedantic, we cannot allow this
5007 extension when we're instantiating in a SFINAE
5009 if (! lvalue_p (arg
) && complain
== tf_none
)
5011 if (complain
& tf_error
)
5012 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
5014 return error_mark_node
;
5019 arg
= BASELINK_FUNCTIONS (arg
);
5023 arg
= OVL_CURRENT (arg
);
5027 /* Turn a reference to a non-static data member into a
5028 pointer-to-member. */
5033 if (!PTRMEM_OK_P (arg
))
5034 return cp_build_unary_op (code
, arg
, 0, complain
);
5036 t
= TREE_OPERAND (arg
, 1);
5037 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
5039 if (complain
& tf_error
)
5040 error ("cannot create pointer to reference member %qD", t
);
5041 return error_mark_node
;
5044 type
= build_ptrmem_type (context_for_name_lookup (t
),
5046 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
5054 /* Anything not already handled and not a true memory reference
5056 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5057 && TREE_CODE (argtype
) != METHOD_TYPE
5058 && TREE_CODE (arg
) != OFFSET_REF
5059 && !lvalue_or_else (arg
, lv_addressof
, complain
))
5060 return error_mark_node
;
5062 if (argtype
!= error_mark_node
)
5063 argtype
= build_pointer_type (argtype
);
5065 /* In a template, we are processing a non-dependent expression
5066 so we can just form an ADDR_EXPR with the correct type. */
5067 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
5069 val
= build_address (arg
);
5070 if (TREE_CODE (arg
) == OFFSET_REF
)
5071 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
5073 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
5075 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
5077 /* We can only get here with a single static member
5079 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
5080 && DECL_STATIC_FUNCTION_P (fn
));
5082 val
= build_address (fn
);
5083 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
5084 /* Do not lose object's side effects. */
5085 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
5086 TREE_OPERAND (arg
, 0), val
);
5088 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
5090 if (complain
& tf_error
)
5091 error ("attempt to take address of bit-field structure member %qD",
5092 TREE_OPERAND (arg
, 1));
5093 return error_mark_node
;
5097 tree object
= TREE_OPERAND (arg
, 0);
5098 tree field
= TREE_OPERAND (arg
, 1);
5099 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5100 (TREE_TYPE (object
), decl_type_context (field
)));
5101 val
= build_address (arg
);
5104 if (TREE_CODE (argtype
) == POINTER_TYPE
5105 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
5107 build_ptrmemfunc_type (argtype
);
5108 val
= build_ptrmemfunc (argtype
, val
, 0,
5109 /*c_cast_p=*/false);
5121 argtype
= TREE_TYPE (arg
);
5122 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5125 if (complain
& tf_error
)
5126 error ("%s", errstring
);
5127 return error_mark_node
;
5130 /* Hook for the c-common bits that build a unary op. */
5132 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5133 enum tree_code code
, tree xarg
, int noconvert
)
5135 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5138 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5139 for certain kinds of expressions which are not really lvalues
5140 but which we can accept as lvalues.
5142 If ARG is not a kind of expression we can handle, return
5146 unary_complex_lvalue (enum tree_code code
, tree arg
)
5148 /* Inside a template, making these kinds of adjustments is
5149 pointless; we are only concerned with the type of the
5151 if (processing_template_decl
)
5154 /* Handle (a, b) used as an "lvalue". */
5155 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5157 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5158 tf_warning_or_error
);
5159 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5160 TREE_OPERAND (arg
, 0), real_result
);
5163 /* Handle (a ? b : c) used as an "lvalue". */
5164 if (TREE_CODE (arg
) == COND_EXPR
5165 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5166 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5168 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5169 if (TREE_CODE (arg
) == MODIFY_EXPR
5170 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5171 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5173 tree lvalue
= TREE_OPERAND (arg
, 0);
5174 if (TREE_SIDE_EFFECTS (lvalue
))
5176 lvalue
= stabilize_reference (lvalue
);
5177 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5178 lvalue
, TREE_OPERAND (arg
, 1));
5180 return unary_complex_lvalue
5181 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5184 if (code
!= ADDR_EXPR
)
5187 /* Handle (a = b) used as an "lvalue" for `&'. */
5188 if (TREE_CODE (arg
) == MODIFY_EXPR
5189 || TREE_CODE (arg
) == INIT_EXPR
)
5191 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5192 tf_warning_or_error
);
5193 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5195 TREE_NO_WARNING (arg
) = 1;
5199 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5200 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5201 || TREE_CODE (arg
) == OFFSET_REF
)
5204 /* We permit compiler to make function calls returning
5205 objects of aggregate type look like lvalues. */
5209 if (TREE_CODE (targ
) == SAVE_EXPR
)
5210 targ
= TREE_OPERAND (targ
, 0);
5212 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5214 if (TREE_CODE (arg
) == SAVE_EXPR
)
5217 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
5218 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5221 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5222 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5223 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5226 /* Don't let anything else be handled specially. */
5230 /* Mark EXP saying that we need to be able to take the
5231 address of it; it should not be allocated in a register.
5232 Value is true if successful.
5234 C++: we do not allow `current_class_ptr' to be addressable. */
5237 cxx_mark_addressable (tree exp
)
5242 switch (TREE_CODE (x
))
5249 x
= TREE_OPERAND (x
, 0);
5253 if (x
== current_class_ptr
)
5255 error ("cannot take the address of %<this%>, which is an rvalue expression");
5256 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5262 /* Caller should not be trying to mark initialized
5263 constant fields addressable. */
5264 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5265 || DECL_IN_AGGR_P (x
) == 0
5267 || DECL_EXTERNAL (x
));
5272 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5273 && !DECL_ARTIFICIAL (x
))
5275 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5278 ("address of explicit register variable %qD requested", x
);
5281 else if (extra_warnings
)
5283 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5285 TREE_ADDRESSABLE (x
) = 1;
5289 TREE_ADDRESSABLE (x
) = 1;
5293 TREE_ADDRESSABLE (x
) = 1;
5297 TREE_ADDRESSABLE (x
) = 1;
5298 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5306 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5309 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5310 tsubst_flags_t complain
)
5312 tree orig_ifexp
= ifexp
;
5313 tree orig_op1
= op1
;
5314 tree orig_op2
= op2
;
5317 if (processing_template_decl
)
5319 /* The standard says that the expression is type-dependent if
5320 IFEXP is type-dependent, even though the eventual type of the
5321 expression doesn't dependent on IFEXP. */
5322 if (type_dependent_expression_p (ifexp
)
5323 /* As a GNU extension, the middle operand may be omitted. */
5324 || (op1
&& type_dependent_expression_p (op1
))
5325 || type_dependent_expression_p (op2
))
5326 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5327 ifexp
= build_non_dependent_expr (ifexp
);
5329 op1
= build_non_dependent_expr (op1
);
5330 op2
= build_non_dependent_expr (op2
);
5333 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5334 if (processing_template_decl
&& expr
!= error_mark_node
)
5335 return build_min_non_dep (COND_EXPR
, expr
,
5336 orig_ifexp
, orig_op1
, orig_op2
);
5340 /* Given a list of expressions, return a compound expression
5341 that performs them all and returns the value of the last of them. */
5343 tree
build_x_compound_expr_from_list (tree list
, const char *msg
)
5345 tree expr
= TREE_VALUE (list
);
5347 if (TREE_CHAIN (list
))
5350 permerror (input_location
, "%s expression list treated as compound expression", msg
);
5352 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5353 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5354 tf_warning_or_error
);
5360 /* Like build_x_compound_expr_from_list, but using a VEC. */
5363 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5365 if (VEC_empty (tree
, vec
))
5367 else if (VEC_length (tree
, vec
) == 1)
5368 return VEC_index (tree
, vec
, 0);
5376 permerror (input_location
,
5377 "%s expression list treated as compound expression",
5380 expr
= VEC_index (tree
, vec
, 0);
5381 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5382 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5388 /* Handle overloading of the ',' operator when needed. */
5391 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5394 tree orig_op1
= op1
;
5395 tree orig_op2
= op2
;
5397 if (processing_template_decl
)
5399 if (type_dependent_expression_p (op1
)
5400 || type_dependent_expression_p (op2
))
5401 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5402 op1
= build_non_dependent_expr (op1
);
5403 op2
= build_non_dependent_expr (op2
);
5406 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5407 /*overloaded_p=*/NULL
, complain
);
5409 result
= cp_build_compound_expr (op1
, op2
, complain
);
5411 if (processing_template_decl
&& result
!= error_mark_node
)
5412 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5417 /* Like cp_build_compound_expr, but for the c-common bits. */
5420 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5422 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5425 /* Build a compound expression. */
5428 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5430 lhs
= convert_to_void (lhs
, "left-hand operand of comma", complain
);
5432 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5433 return error_mark_node
;
5435 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5437 /* If the rhs is a TARGET_EXPR, then build the compound
5438 expression inside the target_expr's initializer. This
5439 helps the compiler to eliminate unnecessary temporaries. */
5440 tree init
= TREE_OPERAND (rhs
, 1);
5442 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5443 TREE_OPERAND (rhs
, 1) = init
;
5448 if (type_unknown_p (rhs
))
5450 error ("no context to resolve type of %qE", rhs
);
5451 return error_mark_node
;
5454 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5457 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5458 casts away constness. CAST gives the type of cast.
5460 ??? This function warns for casting away any qualifier not just
5461 const. We would like to specify exactly what qualifiers are casted
5466 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5467 enum tree_code cast
)
5469 /* C-style casts are allowed to cast away constness. With
5470 WARN_CAST_QUAL, we still want to issue a warning. */
5471 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5474 if (!casts_away_constness (src_type
, dest_type
))
5480 warning (OPT_Wcast_qual
,
5481 "cast from type %qT to type %qT casts away qualifiers",
5482 src_type
, dest_type
);
5485 case STATIC_CAST_EXPR
:
5486 error ("static_cast from type %qT to type %qT casts away qualifiers",
5487 src_type
, dest_type
);
5490 case REINTERPRET_CAST_EXPR
:
5491 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5492 src_type
, dest_type
);
5499 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5500 (another pointer-to-member type in the same hierarchy) and return
5501 the converted expression. If ALLOW_INVERSE_P is permitted, a
5502 pointer-to-derived may be converted to pointer-to-base; otherwise,
5503 only the other direction is permitted. If C_CAST_P is true, this
5504 conversion is taking place as part of a C-style cast. */
5507 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5510 if (TYPE_PTRMEM_P (type
))
5514 if (TREE_CODE (expr
) == PTRMEM_CST
)
5515 expr
= cplus_expand_constant (expr
);
5516 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5517 TYPE_PTRMEM_CLASS_TYPE (type
),
5520 if (!integer_zerop (delta
))
5522 tree cond
, op1
, op2
;
5524 cond
= cp_build_binary_op (input_location
,
5527 build_int_cst (TREE_TYPE (expr
), -1),
5528 tf_warning_or_error
);
5529 op1
= build_nop (ptrdiff_type_node
, expr
);
5530 op2
= cp_build_binary_op (input_location
,
5531 PLUS_EXPR
, op1
, delta
,
5532 tf_warning_or_error
);
5534 expr
= fold_build3_loc (input_location
,
5535 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5539 return build_nop (type
, expr
);
5542 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5543 allow_inverse_p
, c_cast_p
);
5546 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
5547 a version of EXPR that has TREE_OVERFLOW set if it is set in ORIG.
5548 Otherwise, return EXPR unchanged. */
5551 ignore_overflows (tree expr
, tree orig
)
5553 if (TREE_CODE (expr
) == INTEGER_CST
5554 && CONSTANT_CLASS_P (orig
)
5555 && TREE_CODE (orig
) != STRING_CST
5556 && TREE_OVERFLOW (expr
) != TREE_OVERFLOW (orig
))
5558 if (!TREE_OVERFLOW (orig
))
5559 /* Ensure constant sharing. */
5560 expr
= build_int_cst_wide (TREE_TYPE (expr
),
5561 TREE_INT_CST_LOW (expr
),
5562 TREE_INT_CST_HIGH (expr
));
5565 /* Avoid clobbering a shared constant. */
5566 expr
= copy_node (expr
);
5567 TREE_OVERFLOW (expr
) = TREE_OVERFLOW (orig
);
5573 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5574 this static_cast is being attempted as one of the possible casts
5575 allowed by a C-style cast. (In that case, accessibility of base
5576 classes is not considered, and it is OK to cast away
5577 constness.) Return the result of the cast. *VALID_P is set to
5578 indicate whether or not the cast was valid. */
5581 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5582 bool *valid_p
, tsubst_flags_t complain
)
5588 /* Assume the cast is valid. */
5591 intype
= TREE_TYPE (expr
);
5593 /* Save casted types in the function's used types hash table. */
5594 used_types_insert (type
);
5596 /* [expr.static.cast]
5598 An lvalue of type "cv1 B", where B is a class type, can be cast
5599 to type "reference to cv2 D", where D is a class derived (clause
5600 _class.derived_) from B, if a valid standard conversion from
5601 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5602 same cv-qualification as, or greater cv-qualification than, cv1,
5603 and B is not a virtual base class of D. */
5604 /* We check this case before checking the validity of "TYPE t =
5605 EXPR;" below because for this case:
5608 struct D : public B { D(const B&); };
5610 void f() { static_cast<const D&>(b); }
5612 we want to avoid constructing a new D. The standard is not
5613 completely clear about this issue, but our interpretation is
5614 consistent with other compilers. */
5615 if (TREE_CODE (type
) == REFERENCE_TYPE
5616 && CLASS_TYPE_P (TREE_TYPE (type
))
5617 && CLASS_TYPE_P (intype
)
5618 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5619 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5620 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5621 build_pointer_type (TYPE_MAIN_VARIANT
5622 (TREE_TYPE (type
))))
5624 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5628 /* There is a standard conversion from "D*" to "B*" even if "B"
5629 is ambiguous or inaccessible. If this is really a
5630 static_cast, then we check both for inaccessibility and
5631 ambiguity. However, if this is a static_cast being performed
5632 because the user wrote a C-style cast, then accessibility is
5634 base
= lookup_base (TREE_TYPE (type
), intype
,
5635 c_cast_p
? ba_unique
: ba_check
,
5638 /* Convert from "B*" to "D*". This function will check that "B"
5639 is not a virtual base of "D". */
5640 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5641 base
, /*nonnull=*/false);
5642 /* Convert the pointer to a reference -- but then remember that
5643 there are no expressions with reference type in C++. */
5644 return convert_from_reference (cp_fold_convert (type
, expr
));
5647 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5648 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5649 if (TREE_CODE (type
) == REFERENCE_TYPE
5650 && TYPE_REF_IS_RVALUE (type
)
5651 && real_lvalue_p (expr
)
5652 && reference_related_p (TREE_TYPE (type
), intype
)
5653 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5655 expr
= build_typed_address (expr
, type
);
5656 return convert_from_reference (expr
);
5661 /* Resolve overloaded address here rather than once in
5662 implicit_conversion and again in the inverse code below. */
5663 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5665 expr
= instantiate_type (type
, expr
, complain
);
5666 intype
= TREE_TYPE (expr
);
5669 /* [expr.static.cast]
5671 An expression e can be explicitly converted to a type T using a
5672 static_cast of the form static_cast<T>(e) if the declaration T
5673 t(e);" is well-formed, for some invented temporary variable
5675 result
= perform_direct_initialization_if_possible (type
, expr
,
5676 c_cast_p
, complain
);
5679 result
= convert_from_reference (result
);
5681 /* Ignore any integer overflow caused by the cast. */
5682 result
= ignore_overflows (result
, orig
);
5684 /* [expr.static.cast]
5686 If T is a reference type, the result is an lvalue; otherwise,
5687 the result is an rvalue. */
5688 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5689 result
= rvalue (result
);
5693 /* [expr.static.cast]
5695 Any expression can be explicitly converted to type cv void. */
5696 if (TREE_CODE (type
) == VOID_TYPE
)
5697 return convert_to_void (expr
, /*implicit=*/NULL
, complain
);
5699 /* [expr.static.cast]
5701 The inverse of any standard conversion sequence (clause _conv_),
5702 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5703 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5704 (_conv.bool_) conversions, can be performed explicitly using
5705 static_cast subject to the restriction that the explicit
5706 conversion does not cast away constness (_expr.const.cast_), and
5707 the following additional rules for specific cases: */
5708 /* For reference, the conversions not excluded are: integral
5709 promotions, floating point promotion, integral conversions,
5710 floating point conversions, floating-integral conversions,
5711 pointer conversions, and pointer to member conversions. */
5714 A value of integral _or enumeration_ type can be explicitly
5715 converted to an enumeration type. */
5716 /* The effect of all that is that any conversion between any two
5717 types which are integral, floating, or enumeration types can be
5719 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5720 || SCALAR_FLOAT_TYPE_P (type
))
5721 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5722 || SCALAR_FLOAT_TYPE_P (intype
)))
5724 expr
= ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5726 /* Ignore any integer overflow caused by the cast. */
5727 expr
= ignore_overflows (expr
, orig
);
5731 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5732 && CLASS_TYPE_P (TREE_TYPE (type
))
5733 && CLASS_TYPE_P (TREE_TYPE (intype
))
5734 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5735 (TREE_TYPE (intype
))),
5736 build_pointer_type (TYPE_MAIN_VARIANT
5737 (TREE_TYPE (type
)))))
5742 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5743 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
5744 c_cast_p
? ba_unique
: ba_check
,
5746 return build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
5749 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5750 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5757 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
5758 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
5760 if (TYPE_PTRMEM_P (type
))
5762 t1
= (build_ptrmem_type
5764 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
5765 t2
= (build_ptrmem_type
5767 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
5774 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
5777 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5778 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
5783 /* [expr.static.cast]
5785 An rvalue of type "pointer to cv void" can be explicitly
5786 converted to a pointer to object type. A value of type pointer
5787 to object converted to "pointer to cv void" and back to the
5788 original pointer type will have its original value. */
5789 if (TREE_CODE (intype
) == POINTER_TYPE
5790 && VOID_TYPE_P (TREE_TYPE (intype
))
5791 && TYPE_PTROB_P (type
))
5794 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5795 return build_nop (type
, expr
);
5799 return error_mark_node
;
5802 /* Return an expression representing static_cast<TYPE>(EXPR). */
5805 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5810 if (type
== error_mark_node
|| expr
== error_mark_node
)
5811 return error_mark_node
;
5813 if (processing_template_decl
)
5815 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
5816 /* We don't know if it will or will not have side effects. */
5817 TREE_SIDE_EFFECTS (expr
) = 1;
5818 return convert_from_reference (expr
);
5821 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5822 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5823 if (TREE_CODE (type
) != REFERENCE_TYPE
5824 && TREE_CODE (expr
) == NOP_EXPR
5825 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5826 expr
= TREE_OPERAND (expr
, 0);
5828 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
5833 if (complain
& tf_error
)
5834 error ("invalid static_cast from type %qT to type %qT",
5835 TREE_TYPE (expr
), type
);
5836 return error_mark_node
;
5839 /* EXPR is an expression with member function or pointer-to-member
5840 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5841 not permitted by ISO C++, but we accept it in some modes. If we
5842 are not in one of those modes, issue a diagnostic. Return the
5843 converted expression. */
5846 convert_member_func_to_ptr (tree type
, tree expr
)
5851 intype
= TREE_TYPE (expr
);
5852 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
5853 || TREE_CODE (intype
) == METHOD_TYPE
);
5855 if (pedantic
|| warn_pmf2ptr
)
5856 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
5857 "converting from %qT to %qT", intype
, type
);
5859 if (TREE_CODE (intype
) == METHOD_TYPE
)
5860 expr
= build_addr_func (expr
);
5861 else if (TREE_CODE (expr
) == PTRMEM_CST
)
5862 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
5865 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
5866 decl
= build_address (decl
);
5867 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
5870 return build_nop (type
, expr
);
5873 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
5874 If C_CAST_P is true, this reinterpret cast is being done as part of
5875 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
5876 indicate whether or not reinterpret_cast was valid. */
5879 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5880 bool *valid_p
, tsubst_flags_t complain
)
5884 /* Assume the cast is invalid. */
5888 if (type
== error_mark_node
|| error_operand_p (expr
))
5889 return error_mark_node
;
5891 intype
= TREE_TYPE (expr
);
5893 /* Save casted types in the function's used types hash table. */
5894 used_types_insert (type
);
5896 /* [expr.reinterpret.cast]
5897 An lvalue expression of type T1 can be cast to the type
5898 "reference to T2" if an expression of type "pointer to T1" can be
5899 explicitly converted to the type "pointer to T2" using a
5900 reinterpret_cast. */
5901 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5903 if (! real_lvalue_p (expr
))
5905 if (complain
& tf_error
)
5906 error ("invalid cast of an rvalue expression of type "
5909 return error_mark_node
;
5912 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
5913 "B" are related class types; the reinterpret_cast does not
5914 adjust the pointer. */
5915 if (TYPE_PTR_P (intype
)
5916 && (complain
& tf_warning
)
5917 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
5918 COMPARE_BASE
| COMPARE_DERIVED
)))
5919 warning (0, "casting %qT to %qT does not dereference pointer",
5922 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0, complain
);
5924 if (warn_strict_aliasing
> 2)
5925 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
5927 if (expr
!= error_mark_node
)
5928 expr
= build_reinterpret_cast_1
5929 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
5931 if (expr
!= error_mark_node
)
5932 /* cp_build_indirect_ref isn't right for rvalue refs. */
5933 expr
= convert_from_reference (fold_convert (type
, expr
));
5937 /* As a G++ extension, we consider conversions from member
5938 functions, and pointers to member functions to
5939 pointer-to-function and pointer-to-void types. If
5940 -Wno-pmf-conversions has not been specified,
5941 convert_member_func_to_ptr will issue an error message. */
5942 if ((TYPE_PTRMEMFUNC_P (intype
)
5943 || TREE_CODE (intype
) == METHOD_TYPE
)
5944 && TYPE_PTR_P (type
)
5945 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
5946 || VOID_TYPE_P (TREE_TYPE (type
))))
5947 return convert_member_func_to_ptr (type
, expr
);
5949 /* If the cast is not to a reference type, the lvalue-to-rvalue,
5950 array-to-pointer, and function-to-pointer conversions are
5952 expr
= decay_conversion (expr
);
5954 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5955 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5956 if (TREE_CODE (expr
) == NOP_EXPR
5957 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5958 expr
= TREE_OPERAND (expr
, 0);
5960 if (error_operand_p (expr
))
5961 return error_mark_node
;
5963 intype
= TREE_TYPE (expr
);
5965 /* [expr.reinterpret.cast]
5966 A pointer can be converted to any integral type large enough to
5968 if (CP_INTEGRAL_TYPE_P (type
) && TYPE_PTR_P (intype
))
5970 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
5972 if (complain
& tf_error
)
5973 permerror (input_location
, "cast from %qT to %qT loses precision",
5976 return error_mark_node
;
5979 /* [expr.reinterpret.cast]
5980 A value of integral or enumeration type can be explicitly
5981 converted to a pointer. */
5982 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
5985 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
5986 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5987 return fold_if_not_in_template (build_nop (type
, expr
));
5988 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5989 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
5994 check_for_casting_away_constness (intype
, type
, REINTERPRET_CAST_EXPR
);
5995 /* Warn about possible alignment problems. */
5996 if (STRICT_ALIGNMENT
&& warn_cast_align
5997 && (complain
& tf_warning
)
5998 && !VOID_TYPE_P (type
)
5999 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6000 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6001 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6002 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6003 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6004 "increases required alignment of target type", intype
, type
);
6006 /* We need to strip nops here, because the front end likes to
6007 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6009 if (warn_strict_aliasing
<= 2)
6010 strict_aliasing_warning (intype
, type
, sexpr
);
6012 return fold_if_not_in_template (build_nop (type
, expr
));
6014 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6015 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6017 if (pedantic
&& (complain
& tf_warning
))
6018 /* Only issue a warning, as we have always supported this
6019 where possible, and it is necessary in some cases. DR 195
6020 addresses this issue, but as of 2004/10/26 is still in
6022 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6023 return fold_if_not_in_template (build_nop (type
, expr
));
6025 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6026 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6027 else if (TREE_CODE (intype
) == VECTOR_TYPE
6028 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6029 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6034 if (complain
& tf_error
)
6035 error ("invalid cast from type %qT to type %qT", intype
, type
);
6036 return error_mark_node
;
6039 return cp_convert (type
, expr
);
6043 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6045 if (type
== error_mark_node
|| expr
== error_mark_node
)
6046 return error_mark_node
;
6048 if (processing_template_decl
)
6050 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6052 if (!TREE_SIDE_EFFECTS (t
)
6053 && type_dependent_expression_p (expr
))
6054 /* There might turn out to be side effects inside expr. */
6055 TREE_SIDE_EFFECTS (t
) = 1;
6056 return convert_from_reference (t
);
6059 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6060 /*valid_p=*/NULL
, complain
);
6063 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6064 return an appropriate expression. Otherwise, return
6065 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6066 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6067 performing a C-style cast, its value upon return will indicate
6068 whether or not the conversion succeeded. */
6071 build_const_cast_1 (tree dst_type
, tree expr
, bool complain
,
6075 tree reference_type
;
6077 /* Callers are responsible for handling error_mark_node as a
6078 destination type. */
6079 gcc_assert (dst_type
!= error_mark_node
);
6080 /* In a template, callers should be building syntactic
6081 representations of casts, not using this machinery. */
6082 gcc_assert (!processing_template_decl
);
6084 /* Assume the conversion is invalid. */
6088 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6091 error ("invalid use of const_cast with type %qT, "
6092 "which is not a pointer, "
6093 "reference, nor a pointer-to-data-member type", dst_type
);
6094 return error_mark_node
;
6097 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6100 error ("invalid use of const_cast with type %qT, which is a pointer "
6101 "or reference to a function type", dst_type
);
6102 return error_mark_node
;
6105 /* Save casted types in the function's used types hash table. */
6106 used_types_insert (dst_type
);
6108 src_type
= TREE_TYPE (expr
);
6109 /* Expressions do not really have reference types. */
6110 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6111 src_type
= TREE_TYPE (src_type
);
6113 /* [expr.const.cast]
6115 An lvalue of type T1 can be explicitly converted to an lvalue of
6116 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6117 types) if a pointer to T1 can be explicitly converted to the type
6118 pointer to T2 using a const_cast. */
6119 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6121 reference_type
= dst_type
;
6122 if (! real_lvalue_p (expr
))
6125 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6126 src_type
, dst_type
);
6127 return error_mark_node
;
6129 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6130 src_type
= build_pointer_type (src_type
);
6134 reference_type
= NULL_TREE
;
6135 /* If the destination type is not a reference type, the
6136 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6137 conversions are performed. */
6138 src_type
= type_decays_to (src_type
);
6139 if (src_type
== error_mark_node
)
6140 return error_mark_node
;
6143 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6144 && comp_ptr_ttypes_const (dst_type
, src_type
))
6149 /* This cast is actually a C-style cast. Issue a warning if
6150 the user is making a potentially unsafe cast. */
6151 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
);
6155 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0,
6156 complain
? tf_warning_or_error
: tf_none
);
6157 expr
= build_nop (reference_type
, expr
);
6158 return convert_from_reference (expr
);
6162 expr
= decay_conversion (expr
);
6163 /* build_c_cast puts on a NOP_EXPR to make the result not an
6164 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6165 non-lvalue context. */
6166 if (TREE_CODE (expr
) == NOP_EXPR
6167 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6168 expr
= TREE_OPERAND (expr
, 0);
6169 return build_nop (dst_type
, expr
);
6174 error ("invalid const_cast from type %qT to type %qT",
6175 src_type
, dst_type
);
6176 return error_mark_node
;
6180 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6182 if (type
== error_mark_node
|| error_operand_p (expr
))
6183 return error_mark_node
;
6185 if (processing_template_decl
)
6187 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6189 if (!TREE_SIDE_EFFECTS (t
)
6190 && type_dependent_expression_p (expr
))
6191 /* There might turn out to be side effects inside expr. */
6192 TREE_SIDE_EFFECTS (t
) = 1;
6193 return convert_from_reference (t
);
6196 return build_const_cast_1 (type
, expr
, complain
& tf_error
,
6200 /* Like cp_build_c_cast, but for the c-common bits. */
6203 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6205 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6208 /* Build an expression representing an explicit C-style cast to type
6209 TYPE of expression EXPR. */
6212 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6218 if (type
== error_mark_node
|| error_operand_p (expr
))
6219 return error_mark_node
;
6221 if (processing_template_decl
)
6223 tree t
= build_min (CAST_EXPR
, type
,
6224 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6225 /* We don't know if it will or will not have side effects. */
6226 TREE_SIDE_EFFECTS (t
) = 1;
6227 return convert_from_reference (t
);
6230 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6231 'Class') should always be retained, because this information aids
6232 in method lookup. */
6233 if (objc_is_object_ptr (type
)
6234 && objc_is_object_ptr (TREE_TYPE (expr
)))
6235 return build_nop (type
, expr
);
6237 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6238 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6239 if (TREE_CODE (type
) != REFERENCE_TYPE
6240 && TREE_CODE (value
) == NOP_EXPR
6241 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6242 value
= TREE_OPERAND (value
, 0);
6244 if (TREE_CODE (type
) == ARRAY_TYPE
)
6246 /* Allow casting from T1* to T2[] because Cfront allows it.
6247 NIHCL uses it. It is not valid ISO C++ however. */
6248 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6250 if (complain
& tf_error
)
6251 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6253 return error_mark_node
;
6254 type
= build_pointer_type (TREE_TYPE (type
));
6258 if (complain
& tf_error
)
6259 error ("ISO C++ forbids casting to an array type %qT", type
);
6260 return error_mark_node
;
6264 if (TREE_CODE (type
) == FUNCTION_TYPE
6265 || TREE_CODE (type
) == METHOD_TYPE
)
6267 if (complain
& tf_error
)
6268 error ("invalid cast to function type %qT", type
);
6269 return error_mark_node
;
6272 /* A C-style cast can be a const_cast. */
6273 result
= build_const_cast_1 (type
, value
, /*complain=*/false,
6278 /* Or a static cast. */
6279 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6280 &valid_p
, complain
);
6281 /* Or a reinterpret_cast. */
6283 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6284 &valid_p
, complain
);
6285 /* The static_cast or reinterpret_cast may be followed by a
6288 /* A valid cast may result in errors if, for example, a
6289 conversion to am ambiguous base class is required. */
6290 && !error_operand_p (result
))
6294 /* Non-class rvalues always have cv-unqualified type. */
6295 if (!CLASS_TYPE_P (type
))
6296 type
= TYPE_MAIN_VARIANT (type
);
6297 result_type
= TREE_TYPE (result
);
6298 if (!CLASS_TYPE_P (result_type
))
6299 result_type
= TYPE_MAIN_VARIANT (result_type
);
6300 /* If the type of RESULT does not match TYPE, perform a
6301 const_cast to make it match. If the static_cast or
6302 reinterpret_cast succeeded, we will differ by at most
6303 cv-qualification, so the follow-on const_cast is guaranteed
6305 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6307 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6308 gcc_assert (valid_p
);
6313 return error_mark_node
;
6316 /* For use from the C common bits. */
6318 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6319 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6320 enum tree_code modifycode
,
6321 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6322 tree rhs_origtype ATTRIBUTE_UNUSED
)
6324 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6327 /* Build an assignment expression of lvalue LHS from value RHS.
6328 MODIFYCODE is the code for a binary operator that we use
6329 to combine the old value of LHS with RHS to get the new value.
6330 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6332 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6335 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6336 tsubst_flags_t complain
)
6340 tree lhstype
= TREE_TYPE (lhs
);
6341 tree olhstype
= lhstype
;
6342 bool plain_assign
= (modifycode
== NOP_EXPR
);
6344 /* Avoid duplicate error messages from operands that had errors. */
6345 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6346 return error_mark_node
;
6348 /* Handle control structure constructs used as "lvalues". */
6349 switch (TREE_CODE (lhs
))
6351 /* Handle --foo = 5; as these are valid constructs in C++. */
6352 case PREDECREMENT_EXPR
:
6353 case PREINCREMENT_EXPR
:
6354 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6355 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6356 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6357 TREE_OPERAND (lhs
, 1));
6358 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6359 modifycode
, rhs
, complain
);
6360 if (newrhs
== error_mark_node
)
6361 return error_mark_node
;
6362 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6364 /* Handle (a, b) used as an "lvalue". */
6366 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6367 modifycode
, rhs
, complain
);
6368 if (newrhs
== error_mark_node
)
6369 return error_mark_node
;
6370 return build2 (COMPOUND_EXPR
, lhstype
,
6371 TREE_OPERAND (lhs
, 0), newrhs
);
6374 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6375 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6376 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6377 TREE_OPERAND (lhs
, 1));
6378 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6380 if (newrhs
== error_mark_node
)
6381 return error_mark_node
;
6382 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6386 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6387 when neither operand has side-effects. */
6388 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6389 return error_mark_node
;
6391 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6392 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6394 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6395 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6397 TREE_OPERAND (lhs
, 0),
6398 TREE_OPERAND (lhs
, 1)),
6399 TREE_OPERAND (lhs
, 0),
6400 TREE_OPERAND (lhs
, 1));
6403 /* Handle (a ? b : c) used as an "lvalue". */
6406 /* Produce (a ? (b = rhs) : (c = rhs))
6407 except that the RHS goes through a save-expr
6408 so the code to compute it is only emitted once. */
6410 tree preeval
= NULL_TREE
;
6412 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6414 if (complain
& tf_error
)
6415 error ("void value not ignored as it ought to be");
6416 return error_mark_node
;
6419 rhs
= stabilize_expr (rhs
, &preeval
);
6421 /* Check this here to avoid odd errors when trying to convert
6422 a throw to the type of the COND_EXPR. */
6423 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6424 return error_mark_node
;
6426 cond
= build_conditional_expr
6427 (TREE_OPERAND (lhs
, 0),
6428 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6429 modifycode
, rhs
, complain
),
6430 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6431 modifycode
, rhs
, complain
),
6434 if (cond
== error_mark_node
)
6436 /* Make sure the code to compute the rhs comes out
6437 before the split. */
6439 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6447 if (modifycode
== INIT_EXPR
)
6449 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6450 /* Do the default thing. */;
6451 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6453 /* Compound literal. */
6454 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6455 /* Call convert to generate an error; see PR 11063. */
6456 rhs
= convert (lhstype
, rhs
);
6457 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6458 TREE_SIDE_EFFECTS (result
) = 1;
6461 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6462 /* Do the default thing. */;
6465 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6466 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6467 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6469 release_tree_vector (rhs_vec
);
6470 if (result
== NULL_TREE
)
6471 return error_mark_node
;
6477 lhs
= require_complete_type (lhs
);
6478 if (lhs
== error_mark_node
)
6479 return error_mark_node
;
6481 if (modifycode
== NOP_EXPR
)
6483 /* `operator=' is not an inheritable operator. */
6484 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6485 /* Do the default thing. */;
6488 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6489 lhs
, rhs
, make_node (NOP_EXPR
),
6490 /*overloaded_p=*/NULL
,
6492 if (result
== NULL_TREE
)
6493 return error_mark_node
;
6500 /* A binary op has been requested. Combine the old LHS
6501 value with the RHS producing the value we should actually
6502 store into the LHS. */
6503 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6504 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6505 || MAYBE_CLASS_TYPE_P (lhstype
)));
6507 lhs
= stabilize_reference (lhs
);
6508 newrhs
= cp_build_binary_op (input_location
,
6509 modifycode
, lhs
, rhs
,
6511 if (newrhs
== error_mark_node
)
6513 if (complain
& tf_error
)
6514 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6515 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6516 return error_mark_node
;
6519 /* Now it looks like a plain assignment. */
6520 modifycode
= NOP_EXPR
;
6522 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6523 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6526 /* The left-hand side must be an lvalue. */
6527 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6528 return error_mark_node
;
6530 /* Warn about modifying something that is `const'. Don't warn if
6531 this is initialization. */
6532 if (modifycode
!= INIT_EXPR
6533 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6534 /* Functions are not modifiable, even though they are
6536 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6537 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6538 /* If it's an aggregate and any field is const, then it is
6539 effectively const. */
6540 || (CLASS_TYPE_P (lhstype
)
6541 && C_TYPE_FIELDS_READONLY (lhstype
))))
6543 if (complain
& tf_error
)
6544 readonly_error (lhs
, REK_ASSIGNMENT
);
6546 return error_mark_node
;
6549 /* If storing into a structure or union member, it may have been given a
6550 lowered bitfield type. We need to convert to the declared type first,
6551 so retrieve it now. */
6553 olhstype
= unlowered_expr_type (lhs
);
6555 /* Convert new value to destination type. */
6557 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6561 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6563 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6564 return error_mark_node
;
6565 newrhs
= digest_init (lhstype
, newrhs
);
6568 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6569 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6571 if (complain
& tf_error
)
6572 error ("incompatible types in assignment of %qT to %qT",
6573 TREE_TYPE (rhs
), lhstype
);
6574 return error_mark_node
;
6577 /* Allow array assignment in compiler-generated code. */
6578 else if (!current_function_decl
6579 || !DECL_ARTIFICIAL (current_function_decl
))
6581 /* This routine is used for both initialization and assignment.
6582 Make sure the diagnostic message differentiates the context. */
6583 if (complain
& tf_error
)
6585 if (modifycode
== INIT_EXPR
)
6586 error ("array used as initializer");
6588 error ("invalid array assignment");
6590 return error_mark_node
;
6593 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6594 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6595 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6596 /*explicit_value_init_p=*/false,
6597 from_array
, complain
);
6600 if (modifycode
== INIT_EXPR
)
6601 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6602 LOOKUP_ONLYCONVERTING. */
6603 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6604 "initialization", NULL_TREE
, 0,
6607 newrhs
= convert_for_assignment (olhstype
, newrhs
, "assignment",
6608 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6610 if (!same_type_p (lhstype
, olhstype
))
6611 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6613 if (modifycode
!= INIT_EXPR
)
6615 if (TREE_CODE (newrhs
) == CALL_EXPR
6616 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6617 newrhs
= build_cplus_new (lhstype
, newrhs
);
6619 /* Can't initialize directly from a TARGET_EXPR, since that would
6620 cause the lhs to be constructed twice, and possibly result in
6621 accidental self-initialization. So we force the TARGET_EXPR to be
6622 expanded without a target. */
6623 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6624 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6625 TREE_OPERAND (newrhs
, 0));
6628 if (newrhs
== error_mark_node
)
6629 return error_mark_node
;
6631 if (c_dialect_objc () && flag_objc_gc
)
6633 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6639 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6640 lhstype
, lhs
, newrhs
);
6642 TREE_SIDE_EFFECTS (result
) = 1;
6644 TREE_NO_WARNING (result
) = 1;
6650 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6651 tsubst_flags_t complain
)
6653 if (processing_template_decl
)
6654 return build_min_nt (MODOP_EXPR
, lhs
,
6655 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6657 if (modifycode
!= NOP_EXPR
)
6659 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6660 make_node (modifycode
),
6661 /*overloaded_p=*/NULL
,
6665 TREE_NO_WARNING (rval
) = 1;
6669 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6672 /* Helper function for get_delta_difference which assumes FROM is a base
6673 class of TO. Returns a delta for the conversion of pointer-to-member
6674 of FROM to pointer-to-member of TO. If the conversion is invalid,
6675 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6676 If C_CAST_P is true, this conversion is taking place as part of a C-style
6680 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
)
6685 binfo
= lookup_base (to
, from
, c_cast_p
? ba_unique
: ba_check
, &kind
);
6686 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6688 error (" in pointer to member function conversion");
6689 return size_zero_node
;
6693 if (kind
!= bk_via_virtual
)
6694 return BINFO_OFFSET (binfo
);
6696 /* FROM is a virtual base class of TO. Issue an error or warning
6697 depending on whether or not this is a reinterpret cast. */
6699 error ("pointer to member conversion via virtual base %qT",
6700 BINFO_TYPE (binfo_from_vbase (binfo
)));
6702 return size_zero_node
;
6709 /* Get difference in deltas for different pointer to member function
6710 types. Returns an integer constant of type PTRDIFF_TYPE_NODE. If
6711 the conversion is invalid, the constant is zero. If
6712 ALLOW_INVERSE_P is true, then allow reverse conversions as well.
6713 If C_CAST_P is true this conversion is taking place as part of a
6716 Note that the naming of FROM and TO is kind of backwards; the return
6717 value is what we add to a TO in order to get a FROM. They are named
6718 this way because we call this function to find out how to convert from
6719 a pointer to member of FROM to a pointer to member of TO. */
6722 get_delta_difference (tree from
, tree to
,
6723 bool allow_inverse_p
,
6728 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
6729 /* Pointer to member of incomplete class is permitted*/
6730 result
= size_zero_node
;
6732 result
= get_delta_difference_1 (from
, to
, c_cast_p
);
6736 if (!allow_inverse_p
)
6738 error_not_base_type (from
, to
);
6739 error (" in pointer to member conversion");
6740 result
= size_zero_node
;
6744 result
= get_delta_difference_1 (to
, from
, c_cast_p
);
6747 result
= size_diffop_loc (input_location
,
6748 size_zero_node
, result
);
6751 error_not_base_type (from
, to
);
6752 error (" in pointer to member conversion");
6753 result
= size_zero_node
;
6758 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
6762 /* Return a constructor for the pointer-to-member-function TYPE using
6763 the other components as specified. */
6766 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
6771 VEC(constructor_elt
, gc
) *v
;
6773 /* Pull the FIELD_DECLs out of the type. */
6774 pfn_field
= TYPE_FIELDS (type
);
6775 delta_field
= TREE_CHAIN (pfn_field
);
6777 /* Make sure DELTA has the type we want. */
6778 delta
= convert_and_check (delta_type_node
, delta
);
6780 /* Convert to the correct target type if necessary. */
6781 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
6783 /* Finish creating the initializer. */
6784 v
= VEC_alloc(constructor_elt
, gc
, 2);
6785 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
6786 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
6787 u
= build_constructor (type
, v
);
6788 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
6789 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
6790 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
6792 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
6797 /* Build a constructor for a pointer to member function. It can be
6798 used to initialize global variables, local variable, or used
6799 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6802 If FORCE is nonzero, then force this conversion, even if
6803 we would rather not do it. Usually set when using an explicit
6804 cast. A C-style cast is being processed iff C_CAST_P is true.
6806 Return error_mark_node, if something goes wrong. */
6809 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
)
6815 if (error_operand_p (pfn
))
6816 return error_mark_node
;
6818 pfn_type
= TREE_TYPE (pfn
);
6819 to_type
= build_ptrmemfunc_type (type
);
6821 /* Handle multiple conversions of pointer to member functions. */
6822 if (TYPE_PTRMEMFUNC_P (pfn_type
))
6824 tree delta
= NULL_TREE
;
6825 tree npfn
= NULL_TREE
;
6829 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
6830 error ("invalid conversion to type %qT from type %qT",
6833 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
6834 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
6838 /* We don't have to do any conversion to convert a
6839 pointer-to-member to its own type. But, we don't want to
6840 just return a PTRMEM_CST if there's an explicit cast; that
6841 cast should make the expression an invalid template argument. */
6842 if (TREE_CODE (pfn
) != PTRMEM_CST
)
6844 if (same_type_p (to_type
, pfn_type
))
6846 else if (integer_zerop (n
))
6847 return build_reinterpret_cast (to_type
, pfn
,
6848 tf_warning_or_error
);
6851 if (TREE_SIDE_EFFECTS (pfn
))
6852 pfn
= save_expr (pfn
);
6854 /* Obtain the function pointer and the current DELTA. */
6855 if (TREE_CODE (pfn
) == PTRMEM_CST
)
6856 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
6859 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
6860 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
6863 /* Just adjust the DELTA field. */
6864 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6865 (TREE_TYPE (delta
), ptrdiff_type_node
));
6866 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
6867 n
= cp_build_binary_op (input_location
,
6868 LSHIFT_EXPR
, n
, integer_one_node
,
6869 tf_warning_or_error
);
6870 delta
= cp_build_binary_op (input_location
,
6871 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
6872 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
6875 /* Handle null pointer to member function conversions. */
6876 if (integer_zerop (pfn
))
6878 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
6879 return build_ptrmemfunc1 (to_type
,
6884 if (type_unknown_p (pfn
))
6885 return instantiate_type (type
, pfn
, tf_warning_or_error
);
6887 fn
= TREE_OPERAND (pfn
, 0);
6888 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
6889 /* In a template, we will have preserved the
6891 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
6892 return make_ptrmem_cst (to_type
, fn
);
6895 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
6898 ??? There is no consistency as to the types returned for the above
6899 values. Some code acts as if it were a sizetype and some as if it were
6900 integer_type_node. */
6903 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
6905 tree type
= TREE_TYPE (cst
);
6906 tree fn
= PTRMEM_CST_MEMBER (cst
);
6907 tree ptr_class
, fn_class
;
6909 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6911 /* The class that the function belongs to. */
6912 fn_class
= DECL_CONTEXT (fn
);
6914 /* The class that we're creating a pointer to member of. */
6915 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
6917 /* First, calculate the adjustment to the function's class. */
6918 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
6921 if (!DECL_VIRTUAL_P (fn
))
6922 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
6925 /* If we're dealing with a virtual function, we have to adjust 'this'
6926 again, to point to the base which provides the vtable entry for
6927 fn; the call will do the opposite adjustment. */
6928 tree orig_class
= DECL_CONTEXT (fn
);
6929 tree binfo
= binfo_or_else (orig_class
, fn_class
);
6930 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
6931 *delta
, BINFO_OFFSET (binfo
));
6932 *delta
= fold_if_not_in_template (*delta
);
6934 /* We set PFN to the vtable offset at which the function can be
6935 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
6936 case delta is shifted left, and then incremented). */
6937 *pfn
= DECL_VINDEX (fn
);
6938 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
6939 TYPE_SIZE_UNIT (vtable_entry_type
));
6940 *pfn
= fold_if_not_in_template (*pfn
);
6942 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
6944 case ptrmemfunc_vbit_in_pfn
:
6945 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
6947 *pfn
= fold_if_not_in_template (*pfn
);
6950 case ptrmemfunc_vbit_in_delta
:
6951 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
6952 *delta
, integer_one_node
);
6953 *delta
= fold_if_not_in_template (*delta
);
6954 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
6955 *delta
, integer_one_node
);
6956 *delta
= fold_if_not_in_template (*delta
);
6963 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
6964 *pfn
= fold_if_not_in_template (*pfn
);
6968 /* Return an expression for PFN from the pointer-to-member function
6972 pfn_from_ptrmemfunc (tree t
)
6974 if (TREE_CODE (t
) == PTRMEM_CST
)
6979 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
6984 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
6987 /* Return an expression for DELTA from the pointer-to-member function
6991 delta_from_ptrmemfunc (tree t
)
6993 if (TREE_CODE (t
) == PTRMEM_CST
)
6998 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7003 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7006 /* Convert value RHS to type TYPE as preparation for an assignment to
7007 an lvalue of type TYPE. ERRTYPE is a string to use in error
7008 messages: "assignment", "return", etc. If FNDECL is non-NULL, we
7009 are doing the conversion in order to pass the PARMNUMth argument of
7013 convert_for_assignment (tree type
, tree rhs
,
7014 const char *errtype
, tree fndecl
, int parmnum
,
7015 tsubst_flags_t complain
, int flags
)
7018 enum tree_code coder
;
7020 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7021 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7022 rhs
= TREE_OPERAND (rhs
, 0);
7024 rhstype
= TREE_TYPE (rhs
);
7025 coder
= TREE_CODE (rhstype
);
7027 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7028 && vector_types_convertible_p (type
, rhstype
, true))
7029 return convert (type
, rhs
);
7031 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7032 return error_mark_node
;
7033 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7034 return error_mark_node
;
7036 /* The RHS of an assignment cannot have void type. */
7037 if (coder
== VOID_TYPE
)
7039 if (complain
& tf_error
)
7040 error ("void value not ignored as it ought to be");
7041 return error_mark_node
;
7044 /* Simplify the RHS if possible. */
7045 if (TREE_CODE (rhs
) == CONST_DECL
)
7046 rhs
= DECL_INITIAL (rhs
);
7048 if (c_dialect_objc ())
7051 tree rname
= fndecl
;
7053 if (!strcmp (errtype
, "assignment"))
7055 else if (!strcmp (errtype
, "initialization"))
7059 tree selector
= objc_message_selector ();
7063 if (selector
&& parmno
> 1)
7070 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7071 return convert (type
, rhs
);
7076 The expression is implicitly converted (clause _conv_) to the
7077 cv-unqualified type of the left operand.
7079 We allow bad conversions here because by the time we get to this point
7080 we are committed to doing the conversion. If we end up doing a bad
7081 conversion, convert_like will complain. */
7082 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7084 /* When -Wno-pmf-conversions is use, we just silently allow
7085 conversions from pointers-to-members to plain pointers. If
7086 the conversion doesn't work, cp_convert will complain. */
7088 && TYPE_PTR_P (type
)
7089 && TYPE_PTRMEMFUNC_P (rhstype
))
7090 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7093 if (complain
& tf_error
)
7095 /* If the right-hand side has unknown type, then it is an
7096 overloaded function. Call instantiate_type to get error
7098 if (rhstype
== unknown_type_node
)
7099 instantiate_type (type
, rhs
, tf_warning_or_error
);
7101 error ("cannot convert %qT to %qT for argument %qP to %qD",
7102 rhstype
, type
, parmnum
, fndecl
);
7104 error ("cannot convert %qT to %qT in %s", rhstype
, type
,
7107 return error_mark_node
;
7110 if (warn_missing_format_attribute
)
7112 const enum tree_code codel
= TREE_CODE (type
);
7113 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7115 && check_missing_format_attribute (type
, rhstype
)
7116 && (complain
& tf_warning
))
7117 warning (OPT_Wmissing_format_attribute
,
7118 "%s might be a candidate for a format attribute",
7122 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7124 if (warn_parentheses
7125 && TREE_CODE (type
) == BOOLEAN_TYPE
7126 && TREE_CODE (rhs
) == MODIFY_EXPR
7127 && !TREE_NO_WARNING (rhs
)
7128 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7129 && (complain
& tf_warning
))
7131 location_t loc
= EXPR_HAS_LOCATION (rhs
)
7132 ? EXPR_LOCATION (rhs
) : input_location
;
7134 warning_at (loc
, OPT_Wparentheses
,
7135 "suggest parentheses around assignment used as truth value");
7136 TREE_NO_WARNING (rhs
) = 1;
7139 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7143 /* Convert RHS to be of type TYPE.
7144 If EXP is nonzero, it is the target of the initialization.
7145 ERRTYPE is a string to use in error messages.
7147 Two major differences between the behavior of
7148 `convert_for_assignment' and `convert_for_initialization'
7149 are that references are bashed in the former, while
7150 copied in the latter, and aggregates are assigned in
7151 the former (operator=) while initialized in the
7154 If using constructor make sure no conversion operator exists, if one does
7155 exist, an ambiguity exists.
7157 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7160 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7161 const char *errtype
, tree fndecl
, int parmnum
,
7162 tsubst_flags_t complain
)
7164 enum tree_code codel
= TREE_CODE (type
);
7166 enum tree_code coder
;
7168 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7169 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7170 if (TREE_CODE (rhs
) == NOP_EXPR
7171 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7172 && codel
!= REFERENCE_TYPE
)
7173 rhs
= TREE_OPERAND (rhs
, 0);
7175 if (type
== error_mark_node
7176 || rhs
== error_mark_node
7177 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7178 return error_mark_node
;
7180 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7181 && TREE_CODE (type
) != ARRAY_TYPE
7182 && (TREE_CODE (type
) != REFERENCE_TYPE
7183 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7184 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7185 && (TREE_CODE (type
) != REFERENCE_TYPE
7186 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7187 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7188 rhs
= decay_conversion (rhs
);
7190 rhstype
= TREE_TYPE (rhs
);
7191 coder
= TREE_CODE (rhstype
);
7193 if (coder
== ERROR_MARK
)
7194 return error_mark_node
;
7196 /* We accept references to incomplete types, so we can
7197 return here before checking if RHS is of complete type. */
7199 if (codel
== REFERENCE_TYPE
)
7201 /* This should eventually happen in convert_arguments. */
7202 int savew
= 0, savee
= 0;
7205 savew
= warningcount
, savee
= errorcount
;
7206 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7207 /*cleanup=*/NULL
, complain
);
7210 if (warningcount
> savew
)
7211 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7212 else if (errorcount
> savee
)
7213 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7219 exp
= require_complete_type (exp
);
7220 if (exp
== error_mark_node
)
7221 return error_mark_node
;
7223 rhstype
= non_reference (rhstype
);
7225 type
= complete_type (type
);
7227 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7228 /* Don't try to do copy-initialization if we already have
7229 direct-initialization. */
7232 if (MAYBE_CLASS_TYPE_P (type
))
7233 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
7235 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7239 /* If RETVAL is the address of, or a reference to, a local variable or
7240 temporary give an appropriate warning. */
7243 maybe_warn_about_returning_address_of_local (tree retval
)
7245 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7246 tree whats_returned
= retval
;
7250 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7251 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7252 else if (CONVERT_EXPR_P (whats_returned
)
7253 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7254 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7259 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7261 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7263 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7265 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7266 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7268 warning (0, "returning reference to temporary");
7271 if (TREE_CODE (whats_returned
) == VAR_DECL
7272 && DECL_NAME (whats_returned
)
7273 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7275 warning (0, "reference to non-lvalue returned");
7280 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7281 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7282 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7284 if (DECL_P (whats_returned
)
7285 && DECL_NAME (whats_returned
)
7286 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7287 && !(TREE_STATIC (whats_returned
)
7288 || TREE_PUBLIC (whats_returned
)))
7290 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7291 warning (0, "reference to local variable %q+D returned",
7294 warning (0, "address of local variable %q+D returned",
7300 /* Check that returning RETVAL from the current function is valid.
7301 Return an expression explicitly showing all conversions required to
7302 change RETVAL into the function return type, and to assign it to
7303 the DECL_RESULT for the function. Set *NO_WARNING to true if
7304 code reaches end of non-void function warning shouldn't be issued
7305 on this RETURN_EXPR. */
7308 check_return_expr (tree retval
, bool *no_warning
)
7311 /* The type actually returned by the function, after any
7314 int fn_returns_value_p
;
7315 bool named_return_value_okay_p
;
7317 *no_warning
= false;
7319 /* A `volatile' function is one that isn't supposed to return, ever.
7320 (This is a G++ extension, used to get better code for functions
7321 that call the `volatile' function.) */
7322 if (TREE_THIS_VOLATILE (current_function_decl
))
7323 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7325 /* Check for various simple errors. */
7326 if (DECL_DESTRUCTOR_P (current_function_decl
))
7329 error ("returning a value from a destructor");
7332 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7334 if (in_function_try_handler
)
7335 /* If a return statement appears in a handler of the
7336 function-try-block of a constructor, the program is ill-formed. */
7337 error ("cannot return from a handler of a function-try-block of a constructor");
7339 /* You can't return a value from a constructor. */
7340 error ("returning a value from a constructor");
7344 /* As an extension, deduce lambda return type from a return statement
7345 anywhere in the body. */
7346 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7348 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7349 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7351 tree type
= lambda_return_type (retval
);
7352 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7354 if (VOID_TYPE_P (type
))
7356 else if (oldtype
== NULL_TREE
)
7358 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7359 "can only be deduced when the return statement is "
7360 "the only statement in the function body");
7361 apply_lambda_return_type (lambda
, type
);
7363 else if (!same_type_p (type
, oldtype
))
7364 error ("inconsistent types %qT and %qT deduced for "
7365 "lambda return type", type
, oldtype
);
7369 if (processing_template_decl
)
7371 current_function_returns_value
= 1;
7372 if (check_for_bare_parameter_packs (retval
))
7373 retval
= error_mark_node
;
7377 /* When no explicit return-value is given in a function with a named
7378 return value, the named return value is used. */
7379 result
= DECL_RESULT (current_function_decl
);
7380 valtype
= TREE_TYPE (result
);
7381 gcc_assert (valtype
!= NULL_TREE
);
7382 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7383 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7386 /* Check for a return statement with no return value in a function
7387 that's supposed to return a value. */
7388 if (!retval
&& fn_returns_value_p
)
7390 permerror (input_location
, "return-statement with no value, in function returning %qT",
7392 /* Clear this, so finish_function won't say that we reach the
7393 end of a non-void function (which we don't, we gave a
7395 current_function_returns_null
= 0;
7396 /* And signal caller that TREE_NO_WARNING should be set on the
7397 RETURN_EXPR to avoid control reaches end of non-void function
7398 warnings in tree-cfg.c. */
7401 /* Check for a return statement with a value in a function that
7402 isn't supposed to return a value. */
7403 else if (retval
&& !fn_returns_value_p
)
7405 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7406 /* You can return a `void' value from a function of `void'
7407 type. In that case, we have to evaluate the expression for
7408 its side-effects. */
7409 finish_expr_stmt (retval
);
7411 permerror (input_location
, "return-statement with a value, in function "
7412 "returning 'void'");
7413 current_function_returns_null
= 1;
7415 /* There's really no value to return, after all. */
7419 /* Remember that this function can sometimes return without a
7421 current_function_returns_null
= 1;
7423 /* Remember that this function did return a value. */
7424 current_function_returns_value
= 1;
7426 /* Check for erroneous operands -- but after giving ourselves a
7427 chance to provide an error about returning a value from a void
7429 if (error_operand_p (retval
))
7431 current_function_return_value
= error_mark_node
;
7432 return error_mark_node
;
7435 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7436 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7437 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7438 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7440 && retval
&& null_ptr_cst_p (retval
))
7441 warning (0, "%<operator new%> must not return NULL unless it is "
7442 "declared %<throw()%> (or -fcheck-new is in effect)");
7444 /* Effective C++ rule 15. See also start_function. */
7446 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7450 /* The function return type must be a reference to the current
7452 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7453 && same_type_ignoring_top_level_qualifiers_p
7454 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7456 /* Returning '*this' is obviously OK. */
7457 if (retval
== current_class_ref
)
7459 /* If we are calling a function whose return type is the same of
7460 the current class reference, it is ok. */
7461 else if (TREE_CODE (retval
) == INDIRECT_REF
7462 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7467 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7470 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7472 [...] For a function with a class return type, if the expression
7473 in the return statement is the name of a local object, and the cv-
7474 unqualified type of the local object is the same as the function
7475 return type, an implementation is permitted to omit creating the tem-
7476 porary object to hold the function return value [...]
7478 So, if this is a value-returning function that always returns the same
7479 local variable, remember it.
7481 It might be nice to be more flexible, and choose the first suitable
7482 variable even if the function sometimes returns something else, but
7483 then we run the risk of clobbering the variable we chose if the other
7484 returned expression uses the chosen variable somehow. And people expect
7485 this restriction, anyway. (jason 2000-11-19)
7487 See finish_function and finalize_nrv for the rest of this optimization. */
7489 named_return_value_okay_p
=
7490 (retval
!= NULL_TREE
7491 /* Must be a local, automatic variable. */
7492 && TREE_CODE (retval
) == VAR_DECL
7493 && DECL_CONTEXT (retval
) == current_function_decl
7494 && ! TREE_STATIC (retval
)
7495 && ! DECL_ANON_UNION_VAR_P (retval
)
7496 && (DECL_ALIGN (retval
)
7497 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7498 /* The cv-unqualified type of the returned value must be the
7499 same as the cv-unqualified return type of the
7501 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7503 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7504 /* And the returned value must be non-volatile. */
7505 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7507 if (fn_returns_value_p
&& flag_elide_constructors
)
7509 if (named_return_value_okay_p
7510 && (current_function_return_value
== NULL_TREE
7511 || current_function_return_value
== retval
))
7512 current_function_return_value
= retval
;
7514 current_function_return_value
= error_mark_node
;
7517 /* We don't need to do any conversions when there's nothing being
7522 /* Do any required conversions. */
7523 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7524 /* No conversions are required. */
7528 /* The type the function is declared to return. */
7529 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7530 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7532 /* The functype's return type will have been set to void, if it
7533 was an incomplete type. Just treat this as 'return;' */
7534 if (VOID_TYPE_P (functype
))
7535 return error_mark_node
;
7537 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7538 treated as an rvalue for the purposes of overload resolution to
7539 favor move constructors over copy constructors. */
7540 if ((cxx_dialect
!= cxx98
)
7541 && named_return_value_okay_p
7542 /* The variable must not have the `volatile' qualifier. */
7543 && !(cp_type_quals (TREE_TYPE (retval
)) & TYPE_QUAL_VOLATILE
)
7544 /* The return type must be a class type. */
7545 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7546 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7548 /* First convert the value to the function's return type, then
7549 to the type of return value's location to handle the
7550 case that functype is smaller than the valtype. */
7551 retval
= convert_for_initialization
7552 (NULL_TREE
, functype
, retval
, flags
, "return", NULL_TREE
, 0,
7553 tf_warning_or_error
);
7554 retval
= convert (valtype
, retval
);
7556 /* If the conversion failed, treat this just like `return;'. */
7557 if (retval
== error_mark_node
)
7559 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7560 else if (! cfun
->returns_struct
7561 && TREE_CODE (retval
) == TARGET_EXPR
7562 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7563 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7564 TREE_OPERAND (retval
, 0));
7566 maybe_warn_about_returning_address_of_local (retval
);
7569 /* Actually copy the value returned into the appropriate location. */
7570 if (retval
&& retval
!= result
)
7571 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7577 /* Returns nonzero if the pointer-type FROM can be converted to the
7578 pointer-type TO via a qualification conversion. If CONSTP is -1,
7579 then we return nonzero if the pointers are similar, and the
7580 cv-qualification signature of FROM is a proper subset of that of TO.
7582 If CONSTP is positive, then all outer pointers have been
7586 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7588 bool to_more_cv_qualified
= false;
7589 bool is_opaque_pointer
= false;
7591 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7593 if (TREE_CODE (to
) != TREE_CODE (from
))
7596 if (TREE_CODE (from
) == OFFSET_TYPE
7597 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7598 TYPE_OFFSET_BASETYPE (to
)))
7601 /* Const and volatile mean something different for function types,
7602 so the usual checks are not appropriate. */
7603 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7605 /* In Objective-C++, some types may have been 'volatilized' by
7606 the compiler for EH; when comparing them here, the volatile
7607 qualification must be ignored. */
7608 bool objc_quals_match
= objc_type_quals_match (to
, from
);
7610 if (!at_least_as_qualified_p (to
, from
) && !objc_quals_match
)
7613 if (!at_least_as_qualified_p (from
, to
) && !objc_quals_match
)
7617 to_more_cv_qualified
= true;
7621 constp
&= TYPE_READONLY (to
);
7624 if (TREE_CODE (to
) == VECTOR_TYPE
)
7625 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7627 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
7628 return ((constp
>= 0 || to_more_cv_qualified
)
7629 && (is_opaque_pointer
7630 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
7634 /* When comparing, say, char ** to char const **, this function takes
7635 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7636 types to this function. */
7639 comp_ptr_ttypes (tree to
, tree from
)
7641 return comp_ptr_ttypes_real (to
, from
, 1);
7644 /* Returns true iff FNTYPE is a non-class type that involves
7645 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7646 if a parameter type is ill-formed. */
7649 error_type_p (const_tree type
)
7653 switch (TREE_CODE (type
))
7659 case REFERENCE_TYPE
:
7661 return error_type_p (TREE_TYPE (type
));
7665 if (error_type_p (TREE_TYPE (type
)))
7667 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7668 if (error_type_p (TREE_VALUE (t
)))
7673 if (TYPE_PTRMEMFUNC_P (type
))
7674 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
7682 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7683 type or inheritance-related types, regardless of cv-quals. */
7686 ptr_reasonably_similar (const_tree to
, const_tree from
)
7688 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7690 /* Any target type is similar enough to void. */
7691 if (TREE_CODE (to
) == VOID_TYPE
)
7692 return !error_type_p (from
);
7693 if (TREE_CODE (from
) == VOID_TYPE
)
7694 return !error_type_p (to
);
7696 if (TREE_CODE (to
) != TREE_CODE (from
))
7699 if (TREE_CODE (from
) == OFFSET_TYPE
7700 && comptypes (TYPE_OFFSET_BASETYPE (to
),
7701 TYPE_OFFSET_BASETYPE (from
),
7702 COMPARE_BASE
| COMPARE_DERIVED
))
7705 if (TREE_CODE (to
) == VECTOR_TYPE
7706 && vector_types_convertible_p (to
, from
, false))
7709 if (TREE_CODE (to
) == INTEGER_TYPE
7710 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
7713 if (TREE_CODE (to
) == FUNCTION_TYPE
)
7714 return !error_type_p (to
) && !error_type_p (from
);
7716 if (TREE_CODE (to
) != POINTER_TYPE
)
7718 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
7719 COMPARE_BASE
| COMPARE_DERIVED
);
7723 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
7724 pointer-to-member types) are the same, ignoring cv-qualification at
7728 comp_ptr_ttypes_const (tree to
, tree from
)
7730 bool is_opaque_pointer
= false;
7732 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7734 if (TREE_CODE (to
) != TREE_CODE (from
))
7737 if (TREE_CODE (from
) == OFFSET_TYPE
7738 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
7739 TYPE_OFFSET_BASETYPE (to
)))
7742 if (TREE_CODE (to
) == VECTOR_TYPE
)
7743 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7745 if (TREE_CODE (to
) != POINTER_TYPE
)
7746 return (is_opaque_pointer
7747 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
7751 /* Returns the type qualifiers for this type, including the qualifiers on the
7752 elements for an array type. */
7755 cp_type_quals (const_tree type
)
7757 /* This CONST_CAST is okay because strip_array_types returns its
7758 argument unmodified and we assign it to a const_tree. */
7759 type
= strip_array_types (CONST_CAST_TREE(type
));
7760 if (type
== error_mark_node
)
7761 return TYPE_UNQUALIFIED
;
7762 return TYPE_QUALS (type
);
7765 /* Returns nonzero if the TYPE is const from a C++ perspective: look inside
7769 cp_type_readonly (const_tree type
)
7771 /* This CONST_CAST is okay because strip_array_types returns its
7772 argument unmodified and we assign it to a const_tree. */
7773 type
= strip_array_types (CONST_CAST_TREE(type
));
7774 return TYPE_READONLY (type
);
7777 /* Returns nonzero if TYPE is const or volatile. */
7780 cv_qualified_p (const_tree type
)
7782 int quals
= cp_type_quals (type
);
7783 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
7786 /* Returns nonzero if the TYPE contains a mutable member. */
7789 cp_has_mutable_p (const_tree type
)
7791 /* This CONST_CAST is okay because strip_array_types returns its
7792 argument unmodified and we assign it to a const_tree. */
7793 type
= strip_array_types (CONST_CAST_TREE(type
));
7795 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
7798 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
7799 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
7800 approximation. In particular, consider:
7803 struct S { int i; };
7804 const S s = { f(); }
7806 Here, we will make "s" as TREE_READONLY (because it is declared
7807 "const") -- only to reverse ourselves upon seeing that the
7808 initializer is non-constant. */
7811 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
7813 tree type
= TREE_TYPE (decl
);
7815 if (type
== error_mark_node
)
7818 if (TREE_CODE (decl
) == TYPE_DECL
)
7821 if (TREE_CODE (type
) == FUNCTION_TYPE
7822 && type_quals
!= TYPE_UNQUALIFIED
)
7824 /* This was an error in C++98 (cv-qualifiers cannot be added to
7825 a function type), but DR 295 makes the code well-formed by
7826 dropping the extra qualifiers. */
7829 tree bad_type
= build_qualified_type (type
, type_quals
);
7830 pedwarn (input_location
, OPT_pedantic
,
7831 "ignoring %qV qualifiers added to function type %qT",
7835 TREE_TYPE (decl
) = TYPE_MAIN_VARIANT (type
);
7839 /* Avoid setting TREE_READONLY incorrectly. */
7840 if (/* If the object has a constructor, the constructor may modify
7842 TYPE_NEEDS_CONSTRUCTING (type
)
7843 /* If the type isn't complete, we don't know yet if it will need
7845 || !COMPLETE_TYPE_P (type
)
7846 /* If the type has a mutable component, that component might be
7848 || TYPE_HAS_MUTABLE_P (type
))
7849 type_quals
&= ~TYPE_QUAL_CONST
;
7851 c_apply_type_quals_to_decl (type_quals
, decl
);
7854 /* Subroutine of casts_away_constness. Make T1 and T2 point at
7855 exemplar types such that casting T1 to T2 is casting away constness
7856 if and only if there is no implicit conversion from T1 to T2. */
7859 casts_away_constness_r (tree
*t1
, tree
*t2
)
7864 /* [expr.const.cast]
7866 For multi-level pointer to members and multi-level mixed pointers
7867 and pointers to members (conv.qual), the "member" aspect of a
7868 pointer to member level is ignored when determining if a const
7869 cv-qualifier has been cast away. */
7870 /* [expr.const.cast]
7872 For two pointer types:
7874 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
7875 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
7878 casting from X1 to X2 casts away constness if, for a non-pointer
7879 type T there does not exist an implicit conversion (clause
7882 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
7886 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
7887 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
7888 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
7890 *t1
= cp_build_qualified_type (void_type_node
,
7891 cp_type_quals (*t1
));
7892 *t2
= cp_build_qualified_type (void_type_node
,
7893 cp_type_quals (*t2
));
7897 quals1
= cp_type_quals (*t1
);
7898 quals2
= cp_type_quals (*t2
);
7900 if (TYPE_PTRMEM_P (*t1
))
7901 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
7903 *t1
= TREE_TYPE (*t1
);
7904 if (TYPE_PTRMEM_P (*t2
))
7905 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
7907 *t2
= TREE_TYPE (*t2
);
7909 casts_away_constness_r (t1
, t2
);
7910 *t1
= build_pointer_type (*t1
);
7911 *t2
= build_pointer_type (*t2
);
7912 *t1
= cp_build_qualified_type (*t1
, quals1
);
7913 *t2
= cp_build_qualified_type (*t2
, quals2
);
7916 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
7919 ??? This function returns non-zero if casting away qualifiers not
7920 just const. We would like to return to the caller exactly which
7921 qualifiers are casted away to give more accurate diagnostics.
7925 casts_away_constness (tree t1
, tree t2
)
7927 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
7929 /* [expr.const.cast]
7931 Casting from an lvalue of type T1 to an lvalue of type T2
7932 using a reference cast casts away constness if a cast from an
7933 rvalue of type "pointer to T1" to the type "pointer to T2"
7934 casts away constness. */
7935 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
7936 return casts_away_constness (build_pointer_type (t1
),
7937 build_pointer_type (TREE_TYPE (t2
)));
7940 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
7941 /* [expr.const.cast]
7943 Casting from an rvalue of type "pointer to data member of X
7944 of type T1" to the type "pointer to data member of Y of type
7945 T2" casts away constness if a cast from an rvalue of type
7946 "pointer to T1" to the type "pointer to T2" casts away
7948 return casts_away_constness
7949 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
7950 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
7952 /* Casting away constness is only something that makes sense for
7953 pointer or reference types. */
7954 if (TREE_CODE (t1
) != POINTER_TYPE
7955 || TREE_CODE (t2
) != POINTER_TYPE
)
7958 /* Top-level qualifiers don't matter. */
7959 t1
= TYPE_MAIN_VARIANT (t1
);
7960 t2
= TYPE_MAIN_VARIANT (t2
);
7961 casts_away_constness_r (&t1
, &t2
);
7962 if (!can_convert (t2
, t1
))
7968 /* If T is a REFERENCE_TYPE return the type to which T refers.
7969 Otherwise, return T itself. */
7972 non_reference (tree t
)
7974 if (TREE_CODE (t
) == REFERENCE_TYPE
)
7980 /* Return nonzero if REF is an lvalue valid for this language;
7981 otherwise, print an error message and return zero. USE says
7982 how the lvalue is being used and so selects the error message. */
7985 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
7987 int win
= lvalue_p (ref
);
7989 if (!win
&& (complain
& tf_error
))