1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
5 Hacked by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
24 /* This file is part of the C++ front end.
25 It contains routines to build C++ expressions given their operands,
26 including computing the types of the result, C and C++ specific error
27 checks, and some optimization. */
31 #include "coretypes.h"
38 #include "diagnostic.h"
42 #include "c-family/c-common.h"
45 static tree
pfn_from_ptrmemfunc (tree
);
46 static tree
delta_from_ptrmemfunc (tree
);
47 static tree
convert_for_assignment (tree
, tree
, impl_conv_rhs
, tree
, int,
49 static tree
cp_pointer_int_sum (enum tree_code
, tree
, tree
);
50 static tree
rationalize_conditional_expr (enum tree_code
, tree
,
52 static int comp_ptr_ttypes_real (tree
, tree
, int);
53 static bool comp_except_types (tree
, tree
, bool);
54 static bool comp_array_types (const_tree
, const_tree
, bool);
55 static tree
pointer_diff (tree
, tree
, tree
);
56 static tree
get_delta_difference (tree
, tree
, bool, bool, tsubst_flags_t
);
57 static void casts_away_constness_r (tree
*, tree
*);
58 static bool casts_away_constness (tree
, tree
);
59 static void maybe_warn_about_returning_address_of_local (tree
);
60 static tree
lookup_destructor (tree
, tree
, tree
);
61 static void warn_args_num (location_t
, tree
, bool);
62 static int convert_arguments (tree
, VEC(tree
,gc
) **, tree
, int,
65 /* Do `exp = require_complete_type (exp);' to make sure exp
66 does not have an incomplete type. (That includes void types.)
67 Returns error_mark_node if the VALUE does not have
68 complete type when this function returns. */
71 require_complete_type_sfinae (tree value
, tsubst_flags_t complain
)
75 if (processing_template_decl
|| value
== error_mark_node
)
78 if (TREE_CODE (value
) == OVERLOAD
)
79 type
= unknown_type_node
;
81 type
= TREE_TYPE (value
);
83 if (type
== error_mark_node
)
84 return error_mark_node
;
86 /* First, detect a valid value with a complete type. */
87 if (COMPLETE_TYPE_P (type
))
90 if (complete_type_or_maybe_complain (type
, value
, complain
))
93 return error_mark_node
;
97 require_complete_type (tree value
)
99 return require_complete_type_sfinae (value
, tf_warning_or_error
);
102 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
103 a template instantiation, do the instantiation. Returns TYPE,
104 whether or not it could be completed, unless something goes
105 horribly wrong, in which case the error_mark_node is returned. */
108 complete_type (tree type
)
110 if (type
== NULL_TREE
)
111 /* Rather than crash, we return something sure to cause an error
113 return error_mark_node
;
115 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
117 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
119 tree t
= complete_type (TREE_TYPE (type
));
120 unsigned int needs_constructing
, has_nontrivial_dtor
;
121 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
124 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
126 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
127 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
129 TYPE_NEEDS_CONSTRUCTING (t
) = needs_constructing
;
130 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = has_nontrivial_dtor
;
133 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
134 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
139 /* Like complete_type, but issue an error if the TYPE cannot be completed.
140 VALUE is used for informative diagnostics.
141 Returns NULL_TREE if the type cannot be made complete. */
144 complete_type_or_maybe_complain (tree type
, tree value
, tsubst_flags_t complain
)
146 type
= complete_type (type
);
147 if (type
== error_mark_node
)
148 /* We already issued an error. */
150 else if (!COMPLETE_TYPE_P (type
))
152 if (complain
& tf_error
)
153 cxx_incomplete_type_diagnostic (value
, type
, DK_ERROR
);
161 complete_type_or_else (tree type
, tree value
)
163 return complete_type_or_maybe_complain (type
, value
, tf_warning_or_error
);
166 /* Return truthvalue of whether type of EXP is instantiated. */
169 type_unknown_p (const_tree exp
)
171 return (TREE_CODE (exp
) == TREE_LIST
172 || TREE_TYPE (exp
) == unknown_type_node
);
176 /* Return the common type of two parameter lists.
177 We assume that comptypes has already been done and returned 1;
178 if that isn't so, this may crash.
180 As an optimization, free the space we allocate if the parameter
181 lists are already common. */
184 commonparms (tree p1
, tree p2
)
186 tree oldargs
= p1
, newargs
, n
;
190 len
= list_length (p1
);
191 newargs
= tree_last (p1
);
193 if (newargs
== void_list_node
)
202 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
207 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
209 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
211 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
214 else if (! TREE_PURPOSE (p1
))
216 if (TREE_PURPOSE (p2
))
218 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
224 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
226 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
228 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
231 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
234 TREE_VALUE (n
) = TREE_VALUE (p1
);
242 /* Given a type, perhaps copied for a typedef,
243 find the "original" version of it. */
245 original_type (tree t
)
247 int quals
= cp_type_quals (t
);
248 while (t
!= error_mark_node
249 && TYPE_NAME (t
) != NULL_TREE
)
251 tree x
= TYPE_NAME (t
);
252 if (TREE_CODE (x
) != TYPE_DECL
)
254 x
= DECL_ORIGINAL_TYPE (x
);
259 return cp_build_qualified_type (t
, quals
);
262 /* Return the common type for two arithmetic types T1 and T2 under the
263 usual arithmetic conversions. The default conversions have already
264 been applied, and enumerated types converted to their compatible
268 cp_common_type (tree t1
, tree t2
)
270 enum tree_code code1
= TREE_CODE (t1
);
271 enum tree_code code2
= TREE_CODE (t2
);
275 /* In what follows, we slightly generalize the rules given in [expr] so
276 as to deal with `long long' and `complex'. First, merge the
278 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
280 if (SCOPED_ENUM_P (t1
) || SCOPED_ENUM_P (t2
))
282 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
283 return build_type_attribute_variant (t1
, attributes
);
288 /* FIXME: Attributes. */
289 gcc_assert (ARITHMETIC_TYPE_P (t1
)
290 || TREE_CODE (t1
) == VECTOR_TYPE
291 || UNSCOPED_ENUM_P (t1
));
292 gcc_assert (ARITHMETIC_TYPE_P (t2
)
293 || TREE_CODE (t2
) == VECTOR_TYPE
294 || UNSCOPED_ENUM_P (t2
));
296 /* If one type is complex, form the common type of the non-complex
297 components, then make that complex. Use T1 or T2 if it is the
299 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
301 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
302 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
304 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
306 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
307 return build_type_attribute_variant (t1
, attributes
);
308 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
309 return build_type_attribute_variant (t2
, attributes
);
311 return build_type_attribute_variant (build_complex_type (subtype
),
315 if (code1
== VECTOR_TYPE
)
317 /* When we get here we should have two vectors of the same size.
318 Just prefer the unsigned one if present. */
319 if (TYPE_UNSIGNED (t1
))
320 return build_type_attribute_variant (t1
, attributes
);
322 return build_type_attribute_variant (t2
, attributes
);
325 /* If only one is real, use it as the result. */
326 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
327 return build_type_attribute_variant (t1
, attributes
);
328 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
329 return build_type_attribute_variant (t2
, attributes
);
331 /* Both real or both integers; use the one with greater precision. */
332 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
333 return build_type_attribute_variant (t1
, attributes
);
334 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
335 return build_type_attribute_variant (t2
, attributes
);
337 /* The types are the same; no need to do anything fancy. */
338 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
339 return build_type_attribute_variant (t1
, attributes
);
341 if (code1
!= REAL_TYPE
)
343 /* If one is unsigned long long, then convert the other to unsigned
345 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
346 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
347 return build_type_attribute_variant (long_long_unsigned_type_node
,
349 /* If one is a long long, and the other is an unsigned long, and
350 long long can represent all the values of an unsigned long, then
351 convert to a long long. Otherwise, convert to an unsigned long
352 long. Otherwise, if either operand is long long, convert the
355 Since we're here, we know the TYPE_PRECISION is the same;
356 therefore converting to long long cannot represent all the values
357 of an unsigned long, so we choose unsigned long long in that
359 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
360 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
362 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
363 ? long_long_unsigned_type_node
364 : long_long_integer_type_node
);
365 return build_type_attribute_variant (t
, attributes
);
367 if (int128_integer_type_node
!= NULL_TREE
368 && (same_type_p (TYPE_MAIN_VARIANT (t1
),
369 int128_integer_type_node
)
370 || same_type_p (TYPE_MAIN_VARIANT (t2
),
371 int128_integer_type_node
)))
373 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
374 ? int128_unsigned_type_node
375 : int128_integer_type_node
);
376 return build_type_attribute_variant (t
, attributes
);
379 /* Go through the same procedure, but for longs. */
380 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
381 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
382 return build_type_attribute_variant (long_unsigned_type_node
,
384 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
385 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
387 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
388 ? long_unsigned_type_node
: long_integer_type_node
);
389 return build_type_attribute_variant (t
, attributes
);
391 /* Otherwise prefer the unsigned one. */
392 if (TYPE_UNSIGNED (t1
))
393 return build_type_attribute_variant (t1
, attributes
);
395 return build_type_attribute_variant (t2
, attributes
);
399 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
400 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
401 return build_type_attribute_variant (long_double_type_node
,
403 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
404 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
405 return build_type_attribute_variant (double_type_node
,
407 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
408 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
409 return build_type_attribute_variant (float_type_node
,
412 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
413 the standard C++ floating-point types. Logic earlier in this
414 function has already eliminated the possibility that
415 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
416 compelling reason to choose one or the other. */
417 return build_type_attribute_variant (t1
, attributes
);
421 /* T1 and T2 are arithmetic or enumeration types. Return the type
422 that will result from the "usual arithmetic conversions" on T1 and
423 T2 as described in [expr]. */
426 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
428 gcc_assert (ARITHMETIC_TYPE_P (t1
)
429 || TREE_CODE (t1
) == VECTOR_TYPE
430 || UNSCOPED_ENUM_P (t1
));
431 gcc_assert (ARITHMETIC_TYPE_P (t2
)
432 || TREE_CODE (t2
) == VECTOR_TYPE
433 || UNSCOPED_ENUM_P (t2
));
435 /* Perform the integral promotions. We do not promote real types here. */
436 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1
)
437 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2
))
439 t1
= type_promotes_to (t1
);
440 t2
= type_promotes_to (t2
);
443 return cp_common_type (t1
, t2
);
446 /* Subroutine of composite_pointer_type to implement the recursive
447 case. See that function for documentation of the parameters. */
450 composite_pointer_type_r (tree t1
, tree t2
,
451 composite_pointer_operation operation
,
452 tsubst_flags_t complain
)
459 /* Determine the types pointed to by T1 and T2. */
460 if (TREE_CODE (t1
) == POINTER_TYPE
)
462 pointee1
= TREE_TYPE (t1
);
463 pointee2
= TREE_TYPE (t2
);
467 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
468 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
473 Otherwise, the composite pointer type is a pointer type
474 similar (_conv.qual_) to the type of one of the operands,
475 with a cv-qualification signature (_conv.qual_) that is the
476 union of the cv-qualification signatures of the operand
478 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
479 result_type
= pointee1
;
480 else if ((TREE_CODE (pointee1
) == POINTER_TYPE
481 && TREE_CODE (pointee2
) == POINTER_TYPE
)
482 || (TYPE_PTR_TO_MEMBER_P (pointee1
)
483 && TYPE_PTR_TO_MEMBER_P (pointee2
)))
484 result_type
= composite_pointer_type_r (pointee1
, pointee2
, operation
,
488 if (complain
& tf_error
)
493 permerror (input_location
, "comparison between "
494 "distinct pointer types %qT and %qT lacks a cast",
498 permerror (input_location
, "conversion between "
499 "distinct pointer types %qT and %qT lacks a cast",
502 case CPO_CONDITIONAL_EXPR
:
503 permerror (input_location
, "conditional expression between "
504 "distinct pointer types %qT and %qT lacks a cast",
511 result_type
= void_type_node
;
513 result_type
= cp_build_qualified_type (result_type
,
514 (cp_type_quals (pointee1
)
515 | cp_type_quals (pointee2
)));
516 /* If the original types were pointers to members, so is the
518 if (TYPE_PTR_TO_MEMBER_P (t1
))
520 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
521 TYPE_PTRMEM_CLASS_TYPE (t2
))
522 && (complain
& tf_error
))
527 permerror (input_location
, "comparison between "
528 "distinct pointer types %qT and %qT lacks a cast",
532 permerror (input_location
, "conversion between "
533 "distinct pointer types %qT and %qT lacks a cast",
536 case CPO_CONDITIONAL_EXPR
:
537 permerror (input_location
, "conditional expression between "
538 "distinct pointer types %qT and %qT lacks a cast",
545 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
549 result_type
= build_pointer_type (result_type
);
551 /* Merge the attributes. */
552 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
553 return build_type_attribute_variant (result_type
, attributes
);
556 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
557 ARG1 and ARG2 are the values with those types. The OPERATION is to
558 describe the operation between the pointer types,
559 in case an error occurs.
561 This routine also implements the computation of a common type for
562 pointers-to-members as per [expr.eq]. */
565 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
566 composite_pointer_operation operation
,
567 tsubst_flags_t complain
)
574 If one operand is a null pointer constant, the composite pointer
575 type is the type of the other operand. */
576 if (null_ptr_cst_p (arg1
))
578 if (null_ptr_cst_p (arg2
))
585 If one of the operands has type "pointer to cv1 void*", then
586 the other has type "pointer to cv2T", and the composite pointer
587 type is "pointer to cv12 void", where cv12 is the union of cv1
590 If either type is a pointer to void, make sure it is T1. */
591 if (TREE_CODE (t2
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t2
)))
599 /* Now, if T1 is a pointer to void, merge the qualifiers. */
600 if (TREE_CODE (t1
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t1
)))
605 if (TYPE_PTRFN_P (t2
) && (complain
& tf_error
))
610 pedwarn (input_location
, OPT_pedantic
,
611 "ISO C++ forbids comparison between "
612 "pointer of type %<void *%> and pointer-to-function");
615 pedwarn (input_location
, OPT_pedantic
,
616 "ISO C++ forbids conversion between "
617 "pointer of type %<void *%> and pointer-to-function");
619 case CPO_CONDITIONAL_EXPR
:
620 pedwarn (input_location
, OPT_pedantic
,
621 "ISO C++ forbids conditional expression between "
622 "pointer of type %<void *%> and pointer-to-function");
629 = cp_build_qualified_type (void_type_node
,
630 (cp_type_quals (TREE_TYPE (t1
))
631 | cp_type_quals (TREE_TYPE (t2
))));
632 result_type
= build_pointer_type (result_type
);
633 /* Merge the attributes. */
634 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
635 return build_type_attribute_variant (result_type
, attributes
);
638 if (c_dialect_objc () && TREE_CODE (t1
) == POINTER_TYPE
639 && TREE_CODE (t2
) == POINTER_TYPE
)
641 if (objc_have_common_type (t1
, t2
, -3, NULL_TREE
))
642 return objc_common_type (t1
, t2
);
645 /* [expr.eq] permits the application of a pointer conversion to
646 bring the pointers to a common type. */
647 if (TREE_CODE (t1
) == POINTER_TYPE
&& TREE_CODE (t2
) == POINTER_TYPE
648 && CLASS_TYPE_P (TREE_TYPE (t1
))
649 && CLASS_TYPE_P (TREE_TYPE (t2
))
650 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
653 class1
= TREE_TYPE (t1
);
654 class2
= TREE_TYPE (t2
);
656 if (DERIVED_FROM_P (class1
, class2
))
657 t2
= (build_pointer_type
658 (cp_build_qualified_type (class1
, cp_type_quals (class2
))));
659 else if (DERIVED_FROM_P (class2
, class1
))
660 t1
= (build_pointer_type
661 (cp_build_qualified_type (class2
, cp_type_quals (class1
))));
664 if (complain
& tf_error
)
668 error ("comparison between distinct "
669 "pointer types %qT and %qT lacks a cast", t1
, t2
);
672 error ("conversion between distinct "
673 "pointer types %qT and %qT lacks a cast", t1
, t2
);
675 case CPO_CONDITIONAL_EXPR
:
676 error ("conditional expression between distinct "
677 "pointer types %qT and %qT lacks a cast", t1
, t2
);
682 return error_mark_node
;
685 /* [expr.eq] permits the application of a pointer-to-member
686 conversion to change the class type of one of the types. */
687 else if (TYPE_PTR_TO_MEMBER_P (t1
)
688 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
689 TYPE_PTRMEM_CLASS_TYPE (t2
)))
691 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
692 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
694 if (DERIVED_FROM_P (class1
, class2
))
695 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
696 else if (DERIVED_FROM_P (class2
, class1
))
697 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
700 if (complain
& tf_error
)
704 error ("comparison between distinct "
705 "pointer-to-member types %qT and %qT lacks a cast",
709 error ("conversion between distinct "
710 "pointer-to-member types %qT and %qT lacks a cast",
713 case CPO_CONDITIONAL_EXPR
:
714 error ("conditional expression between distinct "
715 "pointer-to-member types %qT and %qT lacks a cast",
721 return error_mark_node
;
725 return composite_pointer_type_r (t1
, t2
, operation
, complain
);
728 /* Return the merged type of two types.
729 We assume that comptypes has already been done and returned 1;
730 if that isn't so, this may crash.
732 This just combines attributes and default arguments; any other
733 differences would cause the two types to compare unalike. */
736 merge_types (tree t1
, tree t2
)
738 enum tree_code code1
;
739 enum tree_code code2
;
742 /* Save time if the two types are the same. */
745 if (original_type (t1
) == original_type (t2
))
748 /* If one type is nonsense, use the other. */
749 if (t1
== error_mark_node
)
751 if (t2
== error_mark_node
)
754 /* Merge the attributes. */
755 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
757 if (TYPE_PTRMEMFUNC_P (t1
))
758 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
759 if (TYPE_PTRMEMFUNC_P (t2
))
760 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
762 code1
= TREE_CODE (t1
);
763 code2
= TREE_CODE (t2
);
766 gcc_assert (code1
== TYPENAME_TYPE
|| code2
== TYPENAME_TYPE
);
767 if (code1
== TYPENAME_TYPE
)
769 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
770 code1
= TREE_CODE (t1
);
774 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
775 code2
= TREE_CODE (t2
);
783 /* For two pointers, do this recursively on the target type. */
785 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
786 int quals
= cp_type_quals (t1
);
788 if (code1
== POINTER_TYPE
)
789 t1
= build_pointer_type (target
);
791 t1
= cp_build_reference_type (target
, TYPE_REF_IS_RVALUE (t1
));
792 t1
= build_type_attribute_variant (t1
, attributes
);
793 t1
= cp_build_qualified_type (t1
, quals
);
795 if (TREE_CODE (target
) == METHOD_TYPE
)
796 t1
= build_ptrmemfunc_type (t1
);
805 quals
= cp_type_quals (t1
);
806 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
807 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
808 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
810 t1
= cp_build_qualified_type (t1
, quals
);
816 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
817 /* Save space: see if the result is identical to one of the args. */
818 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
819 return build_type_attribute_variant (t1
, attributes
);
820 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
821 return build_type_attribute_variant (t2
, attributes
);
822 /* Merge the element types, and have a size if either arg has one. */
823 t1
= build_cplus_array_type
824 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
829 /* Function types: prefer the one that specified arg types.
830 If both do, merge the arg types. Also merge the return types. */
832 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
833 tree p1
= TYPE_ARG_TYPES (t1
);
834 tree p2
= TYPE_ARG_TYPES (t2
);
838 /* Save space: see if the result is identical to one of the args. */
839 if (valtype
== TREE_TYPE (t1
) && ! p2
)
840 return cp_build_type_attribute_variant (t1
, attributes
);
841 if (valtype
== TREE_TYPE (t2
) && ! p1
)
842 return cp_build_type_attribute_variant (t2
, attributes
);
844 /* Simple way if one arg fails to specify argument types. */
845 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
847 else if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
850 parms
= commonparms (p1
, p2
);
852 rval
= build_function_type (valtype
, parms
);
853 gcc_assert (type_memfn_quals (t1
) == type_memfn_quals (t2
));
854 rval
= apply_memfn_quals (rval
, type_memfn_quals (t1
));
855 raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
856 TYPE_RAISES_EXCEPTIONS (t2
));
857 t1
= build_exception_variant (rval
, raises
);
863 /* Get this value the long way, since TYPE_METHOD_BASETYPE
864 is just the main variant of this. */
865 tree basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2
)));
866 tree raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
867 TYPE_RAISES_EXCEPTIONS (t2
));
870 /* If this was a member function type, get back to the
871 original type of type member function (i.e., without
872 the class instance variable up front. */
873 t1
= build_function_type (TREE_TYPE (t1
),
874 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
875 t2
= build_function_type (TREE_TYPE (t2
),
876 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
877 t3
= merge_types (t1
, t2
);
878 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
879 TYPE_ARG_TYPES (t3
));
880 t1
= build_exception_variant (t3
, raises
);
885 /* There is no need to merge attributes into a TYPENAME_TYPE.
886 When the type is instantiated it will have whatever
887 attributes result from the instantiation. */
893 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
895 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
898 return cp_build_type_attribute_variant (t1
, attributes
);
901 /* Return the ARRAY_TYPE type without its domain. */
904 strip_array_domain (tree type
)
907 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
908 if (TYPE_DOMAIN (type
) == NULL_TREE
)
910 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
911 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
914 /* Wrapper around cp_common_type that is used by c-common.c and other
915 front end optimizations that remove promotions.
917 Return the common type for two arithmetic types T1 and T2 under the
918 usual arithmetic conversions. The default conversions have already
919 been applied, and enumerated types converted to their compatible
923 common_type (tree t1
, tree t2
)
925 /* If one type is nonsense, use the other */
926 if (t1
== error_mark_node
)
928 if (t2
== error_mark_node
)
931 return cp_common_type (t1
, t2
);
934 /* Return the common type of two pointer types T1 and T2. This is the
935 type for the result of most arithmetic operations if the operands
936 have the given two types.
938 We assume that comp_target_types has already been done and returned
939 nonzero; if that isn't so, this may crash. */
942 common_pointer_type (tree t1
, tree t2
)
944 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
945 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
946 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
948 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
949 CPO_CONVERSION
, tf_warning_or_error
);
952 /* Compare two exception specifier types for exactness or subsetness, if
953 allowed. Returns false for mismatch, true for match (same, or
956 [except.spec] "If a class X ... objects of class X or any class publicly
957 and unambiguously derived from X. Similarly, if a pointer type Y * ...
958 exceptions of type Y * or that are pointers to any type publicly and
959 unambiguously derived from Y. Otherwise a function only allows exceptions
960 that have the same type ..."
961 This does not mention cv qualifiers and is different to what throw
962 [except.throw] and catch [except.catch] will do. They will ignore the
963 top level cv qualifiers, and allow qualifiers in the pointer to class
966 We implement the letter of the standard. */
969 comp_except_types (tree a
, tree b
, bool exact
)
971 if (same_type_p (a
, b
))
975 if (cp_type_quals (a
) || cp_type_quals (b
))
978 if (TREE_CODE (a
) == POINTER_TYPE
979 && TREE_CODE (b
) == POINTER_TYPE
)
983 if (cp_type_quals (a
) || cp_type_quals (b
))
987 if (TREE_CODE (a
) != RECORD_TYPE
988 || TREE_CODE (b
) != RECORD_TYPE
)
991 if (PUBLICLY_UNIQUELY_DERIVED_P (a
, b
))
997 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
998 If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
999 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
1000 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
1001 are unordered, but we've already filtered out duplicates. Most lists will
1002 be in order, we should try to make use of that. */
1005 comp_except_specs (const_tree t1
, const_tree t2
, int exact
)
1014 /* First handle noexcept. */
1015 if (exact
< ce_exact
)
1017 /* noexcept(false) is compatible with any throwing dynamic-exc-spec
1018 and stricter than any spec. */
1019 if (t1
== noexcept_false_spec
)
1020 return !nothrow_spec_p (t2
) || exact
== ce_derived
;
1021 /* Even a derived noexcept(false) is compatible with a throwing
1023 if (t2
== noexcept_false_spec
)
1024 return !nothrow_spec_p (t1
);
1026 /* Otherwise, if we aren't looking for an exact match, noexcept is
1027 equivalent to throw(). */
1028 if (t1
== noexcept_true_spec
)
1029 t1
= empty_except_spec
;
1030 if (t2
== noexcept_true_spec
)
1031 t2
= empty_except_spec
;
1034 /* If any noexcept is left, it is only comparable to itself;
1035 either we're looking for an exact match or we're redeclaring a
1036 template with dependent noexcept. */
1037 if ((t1
&& TREE_PURPOSE (t1
))
1038 || (t2
&& TREE_PURPOSE (t2
)))
1040 && cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)));
1042 if (t1
== NULL_TREE
) /* T1 is ... */
1043 return t2
== NULL_TREE
|| exact
== ce_derived
;
1044 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1045 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1046 if (t2
== NULL_TREE
) /* T2 is ... */
1048 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1049 return exact
== ce_derived
;
1051 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1052 Count how many we find, to determine exactness. For exact matching and
1053 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1055 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1057 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1059 tree a
= TREE_VALUE (probe
);
1060 tree b
= TREE_VALUE (t2
);
1062 if (comp_except_types (a
, b
, exact
))
1064 if (probe
== base
&& exact
> ce_derived
)
1065 base
= TREE_CHAIN (probe
);
1070 if (probe
== NULL_TREE
)
1073 return exact
== ce_derived
|| base
== NULL_TREE
|| length
== list_length (t1
);
1076 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1077 [] can match [size]. */
1080 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1089 /* The type of the array elements must be the same. */
1090 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1093 d1
= TYPE_DOMAIN (t1
);
1094 d2
= TYPE_DOMAIN (t2
);
1099 /* If one of the arrays is dimensionless, and the other has a
1100 dimension, they are of different types. However, it is valid to
1108 declarations for an array object can specify
1109 array types that differ by the presence or absence of a major
1110 array bound (_dcl.array_). */
1112 return allow_redeclaration
;
1114 /* Check that the dimensions are the same. */
1116 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1118 max1
= TYPE_MAX_VALUE (d1
);
1119 max2
= TYPE_MAX_VALUE (d2
);
1120 if (processing_template_decl
&& !abi_version_at_least (2)
1121 && !value_dependent_expression_p (max1
)
1122 && !value_dependent_expression_p (max2
))
1124 /* With abi-1 we do not fold non-dependent array bounds, (and
1125 consequently mangle them incorrectly). We must therefore
1126 fold them here, to verify the domains have the same
1132 if (!cp_tree_equal (max1
, max2
))
1138 /* Compare the relative position of T1 and T2 into their respective
1139 template parameter list.
1140 T1 and T2 must be template parameter types.
1141 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1144 comp_template_parms_position (tree t1
, tree t2
)
1146 gcc_assert (t1
&& t2
1147 && TREE_CODE (t1
) == TREE_CODE (t2
)
1148 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1149 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1150 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1152 if (TEMPLATE_TYPE_IDX (t1
) != TEMPLATE_TYPE_IDX (t2
)
1153 || TEMPLATE_TYPE_LEVEL (t1
) != TEMPLATE_TYPE_LEVEL (t2
)
1154 || (TEMPLATE_TYPE_PARAMETER_PACK (t1
)
1155 != TEMPLATE_TYPE_PARAMETER_PACK (t2
)))
1161 /* Subroutine of incompatible_dependent_types_p.
1162 Return the template parameter of the dependent type T.
1163 If T is a typedef, return the template parameters of
1164 the _decl_ of the typedef. T must be a dependent type. */
1167 get_template_parms_of_dependent_type (tree t
)
1169 tree tinfo
= NULL_TREE
, tparms
= NULL_TREE
;
1171 /* First, try the obvious case of getting the
1172 template info from T itself. */
1173 if ((tinfo
= get_template_info (t
)))
1175 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
1176 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (t
);
1177 else if (typedef_variant_p (t
)
1178 && !NAMESPACE_SCOPE_P (TYPE_NAME (t
)))
1179 tinfo
= get_template_info (DECL_CONTEXT (TYPE_NAME (t
)));
1180 /* If T is a TYPENAME_TYPE which context is a template type
1181 parameter, get the template parameters from that context. */
1182 else if (TYPE_CONTEXT (t
)
1183 && TREE_CODE (TYPE_CONTEXT (t
)) == TEMPLATE_TYPE_PARM
)
1184 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (TYPE_CONTEXT (t
));
1185 else if (TYPE_CONTEXT (t
)
1186 && !NAMESPACE_SCOPE_P (t
))
1187 tinfo
= get_template_info (TYPE_CONTEXT (t
));
1190 tparms
= DECL_TEMPLATE_PARMS (TI_TEMPLATE (tinfo
));
1195 /* Subroutine of structural_comptypes.
1196 Compare the dependent types T1 and T2.
1197 Return TRUE if we are sure they can't be equal, FALSE otherwise.
1198 The whole point of this function is to support cases where either T1 or
1199 T2 is a typedef. In those cases, we need to compare the template parameters
1200 of the _decl_ of the typedef. If those don't match then we know T1
1201 and T2 cannot be equal. */
1204 incompatible_dependent_types_p (tree t1
, tree t2
)
1206 tree tparms1
= NULL_TREE
, tparms2
= NULL_TREE
;
1207 bool t1_typedef_variant_p
, t2_typedef_variant_p
;
1209 if (!uses_template_parms (t1
) || !uses_template_parms (t2
))
1212 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
)
1214 /* If T1 and T2 don't have the same relative position in their
1215 template parameters set, they can't be equal. */
1216 if (!comp_template_parms_position (t1
, t2
))
1220 t1_typedef_variant_p
= typedef_variant_p (t1
);
1221 t2_typedef_variant_p
= typedef_variant_p (t2
);
1223 /* Either T1 or T2 must be a typedef. */
1224 if (!t1_typedef_variant_p
&& !t2_typedef_variant_p
)
1227 if (!t1_typedef_variant_p
|| !t2_typedef_variant_p
)
1228 /* Either T1 or T2 is not a typedef so we cannot compare the
1229 template parms of the typedefs of T1 and T2.
1230 At this point, if the main variant type of T1 and T2 are equal
1231 it means the two types can't be incompatible, from the perspective
1232 of this function. */
1233 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1236 /* So if we reach this point, it means either T1 or T2 is a typedef variant.
1237 Let's compare their template parameters. */
1239 tparms1
= get_template_parms_of_dependent_type (t1
);
1240 tparms2
= get_template_parms_of_dependent_type (t2
);
1242 /* If T2 is a template type parm and if we could not get the template
1243 parms it belongs to, that means we have not finished parsing the
1244 full set of template parameters of the template declaration it
1245 belongs to yet. If we could get the template parms T1 belongs to,
1246 that mostly means T1 and T2 belongs to templates that are
1247 different and incompatible. */
1248 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
1249 && (tparms1
== NULL_TREE
|| tparms2
== NULL_TREE
)
1250 && tparms1
!= tparms2
)
1253 if (tparms1
== NULL_TREE
1254 || tparms2
== NULL_TREE
1255 || tparms1
== tparms2
)
1258 /* And now compare the mighty template parms! */
1259 return !comp_template_parms (tparms1
, tparms2
);
1262 /* Subroutine in comptypes. */
1265 structural_comptypes (tree t1
, tree t2
, int strict
)
1270 /* Suppress errors caused by previously reported errors. */
1271 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1274 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1276 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1277 current instantiation. */
1278 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1279 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1281 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1282 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1284 if (TYPE_PTRMEMFUNC_P (t1
))
1285 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1286 if (TYPE_PTRMEMFUNC_P (t2
))
1287 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1289 /* Different classes of types can't be compatible. */
1290 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1293 /* Qualifiers must match. For array types, we will check when we
1294 recur on the array element types. */
1295 if (TREE_CODE (t1
) != ARRAY_TYPE
1296 && cp_type_quals (t1
) != cp_type_quals (t2
))
1298 if (TREE_CODE (t1
) == FUNCTION_TYPE
1299 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1301 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1304 /* If T1 and T2 are dependent typedefs then check upfront that
1305 the template parameters of their typedef DECLs match before
1306 going down checking their subtypes. */
1307 if (incompatible_dependent_types_p (t1
, t2
))
1310 /* Allow for two different type nodes which have essentially the same
1311 definition. Note that we already checked for equality of the type
1312 qualifiers (just above). */
1314 if (TREE_CODE (t1
) != ARRAY_TYPE
1315 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1319 /* Compare the types. Break out if they could be the same. */
1320 switch (TREE_CODE (t1
))
1324 /* All void and bool types are the same. */
1328 case FIXED_POINT_TYPE
:
1330 /* With these nodes, we can't determine type equivalence by
1331 looking at what is stored in the nodes themselves, because
1332 two nodes might have different TYPE_MAIN_VARIANTs but still
1333 represent the same type. For example, wchar_t and int could
1334 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1335 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1336 and are distinct types. On the other hand, int and the
1339 typedef int INT __attribute((may_alias));
1341 have identical properties, different TYPE_MAIN_VARIANTs, but
1342 represent the same type. The canonical type system keeps
1343 track of equivalence in this case, so we fall back on it. */
1344 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1346 case TEMPLATE_TEMPLATE_PARM
:
1347 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1348 if (!comp_template_parms_position (t1
, t2
))
1350 if (!comp_template_parms
1351 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1352 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1354 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1356 /* Don't check inheritance. */
1357 strict
= COMPARE_STRICT
;
1362 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1363 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1364 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1365 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1368 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1370 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1376 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1377 strict
& ~COMPARE_REDECLARATION
))
1379 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1383 case REFERENCE_TYPE
:
1384 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1386 /* fall through to checks for pointer types */
1389 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1390 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
)
1391 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1397 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1399 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1404 /* Target types must match incl. qualifiers. */
1405 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1409 case TEMPLATE_TYPE_PARM
:
1410 /* If incompatible_dependent_types_p called earlier didn't decide
1411 T1 and T2 were different, they might be equal. */
1415 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1416 TYPENAME_TYPE_FULLNAME (t2
)))
1418 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1422 case UNBOUND_CLASS_TEMPLATE
:
1423 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1425 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1430 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1435 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1436 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1440 case TYPE_PACK_EXPANSION
:
1441 return same_type_p (PACK_EXPANSION_PATTERN (t1
),
1442 PACK_EXPANSION_PATTERN (t2
));
1445 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1446 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1447 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1448 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1449 || (DECLTYPE_FOR_LAMBDA_RETURN (t1
)
1450 != DECLTYPE_FOR_LAMBDA_RETURN (t2
))
1451 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1452 DECLTYPE_TYPE_EXPR (t2
)))
1460 /* If we get here, we know that from a target independent POV the
1461 types are the same. Make sure the target attributes are also
1463 return targetm
.comp_type_attributes (t1
, t2
);
1466 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1467 is a bitwise-or of the COMPARE_* flags. */
1470 comptypes (tree t1
, tree t2
, int strict
)
1472 if (strict
== COMPARE_STRICT
)
1477 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1480 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1481 /* At least one of the types requires structural equality, so
1482 perform a deep check. */
1483 return structural_comptypes (t1
, t2
, strict
);
1485 #ifdef ENABLE_CHECKING
1486 if (USE_CANONICAL_TYPES
)
1488 bool result
= structural_comptypes (t1
, t2
, strict
);
1490 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1491 /* The two types are structurally equivalent, but their
1492 canonical types were different. This is a failure of the
1493 canonical type propagation code.*/
1495 ("canonical types differ for identical types %T and %T",
1497 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1498 /* Two types are structurally different, but the canonical
1499 types are the same. This means we were over-eager in
1500 assigning canonical types. */
1502 ("same canonical type node for different types %T and %T",
1508 if (USE_CANONICAL_TYPES
)
1509 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1512 return structural_comptypes (t1
, t2
, strict
);
1514 else if (strict
== COMPARE_STRUCTURAL
)
1515 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1517 return structural_comptypes (t1
, t2
, strict
);
1520 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1521 top-level qualifiers. */
1524 same_type_ignoring_top_level_qualifiers_p (tree type1
, tree type2
)
1526 if (type1
== error_mark_node
|| type2
== error_mark_node
)
1529 return same_type_p (TYPE_MAIN_VARIANT (type1
), TYPE_MAIN_VARIANT (type2
));
1532 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1535 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1537 int q1
= cp_type_quals (type1
);
1538 int q2
= cp_type_quals (type2
);
1540 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1541 return (q1
& q2
) == q2
;
1544 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1545 more cv-qualified that TYPE1, and 0 otherwise. */
1548 comp_cv_qualification (const_tree type1
, const_tree type2
)
1550 int q1
= cp_type_quals (type1
);
1551 int q2
= cp_type_quals (type2
);
1556 if ((q1
& q2
) == q2
)
1558 else if ((q1
& q2
) == q1
)
1564 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1565 subset of the cv-qualification signature of TYPE2, and the types
1566 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1569 comp_cv_qual_signature (tree type1
, tree type2
)
1571 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1573 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1579 /* Subroutines of `comptypes'. */
1581 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1582 equivalent in the sense that functions with those parameter types
1583 can have equivalent types. The two lists must be equivalent,
1584 element by element. */
1587 compparms (const_tree parms1
, const_tree parms2
)
1591 /* An unspecified parmlist matches any specified parmlist
1592 whose argument types don't need default promotions. */
1594 for (t1
= parms1
, t2
= parms2
;
1596 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1598 /* If one parmlist is shorter than the other,
1599 they fail to match. */
1602 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1609 /* Process a sizeof or alignof expression where the operand is a
1613 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1618 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1619 if (type
== error_mark_node
)
1620 return error_mark_node
;
1622 type
= non_reference (type
);
1623 if (TREE_CODE (type
) == METHOD_TYPE
)
1626 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
1627 "invalid application of %qs to a member function",
1628 operator_name_info
[(int) op
].name
);
1629 value
= size_one_node
;
1632 dependent_p
= dependent_type_p (type
);
1634 complete_type (type
);
1636 /* VLA types will have a non-constant size. In the body of an
1637 uninstantiated template, we don't need to try to compute the
1638 value, because the sizeof expression is not an integral
1639 constant expression in that case. And, if we do try to
1640 compute the value, we'll likely end up with SAVE_EXPRs, which
1641 the template substitution machinery does not expect to see. */
1642 || (processing_template_decl
1643 && COMPLETE_TYPE_P (type
)
1644 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1646 value
= build_min (op
, size_type_node
, type
);
1647 TREE_READONLY (value
) = 1;
1651 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1656 /* Return the size of the type, without producing any warnings for
1657 types whose size cannot be taken. This routine should be used only
1658 in some other routine that has already produced a diagnostic about
1659 using the size of such a type. */
1661 cxx_sizeof_nowarn (tree type
)
1663 if (TREE_CODE (type
) == FUNCTION_TYPE
1664 || TREE_CODE (type
) == VOID_TYPE
1665 || TREE_CODE (type
) == ERROR_MARK
)
1666 return size_one_node
;
1667 else if (!COMPLETE_TYPE_P (type
))
1668 return size_zero_node
;
1670 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1673 /* Process a sizeof expression where the operand is an expression. */
1676 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1678 if (e
== error_mark_node
)
1679 return error_mark_node
;
1681 if (processing_template_decl
)
1683 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1684 TREE_SIDE_EFFECTS (e
) = 0;
1685 TREE_READONLY (e
) = 1;
1690 /* To get the size of a static data member declared as an array of
1691 unknown bound, we need to instantiate it. */
1692 if (TREE_CODE (e
) == VAR_DECL
1693 && VAR_HAD_UNKNOWN_BOUND (e
)
1694 && DECL_TEMPLATE_INSTANTIATION (e
))
1695 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1697 e
= mark_type_use (e
);
1699 if (TREE_CODE (e
) == COMPONENT_REF
1700 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1701 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1703 if (complain
& tf_error
)
1704 error ("invalid application of %<sizeof%> to a bit-field");
1706 return error_mark_node
;
1709 else if (is_overloaded_fn (e
))
1711 if (complain
& tf_error
)
1712 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1715 return error_mark_node
;
1718 else if (type_unknown_p (e
))
1720 if (complain
& tf_error
)
1721 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1723 return error_mark_node
;
1729 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1732 /* Implement the __alignof keyword: Return the minimum required
1733 alignment of E, measured in bytes. For VAR_DECL's and
1734 FIELD_DECL's return DECL_ALIGN (which can be set from an
1735 "aligned" __attribute__ specification). */
1738 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1742 if (e
== error_mark_node
)
1743 return error_mark_node
;
1745 if (processing_template_decl
)
1747 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1748 TREE_SIDE_EFFECTS (e
) = 0;
1749 TREE_READONLY (e
) = 1;
1754 e
= mark_type_use (e
);
1756 if (TREE_CODE (e
) == VAR_DECL
)
1757 t
= size_int (DECL_ALIGN_UNIT (e
));
1758 else if (TREE_CODE (e
) == COMPONENT_REF
1759 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1760 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1762 if (complain
& tf_error
)
1763 error ("invalid application of %<__alignof%> to a bit-field");
1765 return error_mark_node
;
1768 else if (TREE_CODE (e
) == COMPONENT_REF
1769 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1770 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1771 else if (is_overloaded_fn (e
))
1773 if (complain
& tf_error
)
1774 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1777 return error_mark_node
;
1778 if (TREE_CODE (e
) == FUNCTION_DECL
)
1779 t
= size_int (DECL_ALIGN_UNIT (e
));
1783 else if (type_unknown_p (e
))
1785 if (complain
& tf_error
)
1786 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1788 return error_mark_node
;
1792 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1793 complain
& tf_error
);
1795 return fold_convert (size_type_node
, t
);
1798 /* Process a sizeof or alignof expression E with code OP where the operand
1799 is an expression. */
1802 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1804 if (op
== SIZEOF_EXPR
)
1805 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1807 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1810 /* EXPR is being used in a context that is not a function call.
1815 The expression can be used only as the left-hand operand of a
1816 member function call.
1818 [expr.mptr.operator]
1820 If the result of .* or ->* is a function, then that result can be
1821 used only as the operand for the function call operator ().
1823 by issuing an error message if appropriate. Returns true iff EXPR
1824 violates these rules. */
1827 invalid_nonstatic_memfn_p (const_tree expr
, tsubst_flags_t complain
)
1829 if (expr
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1831 if (complain
& tf_error
)
1832 error ("invalid use of non-static member function");
1838 /* If EXP is a reference to a bitfield, and the type of EXP does not
1839 match the declared type of the bitfield, return the declared type
1840 of the bitfield. Otherwise, return NULL_TREE. */
1843 is_bitfield_expr_with_lowered_type (const_tree exp
)
1845 switch (TREE_CODE (exp
))
1848 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1849 ? TREE_OPERAND (exp
, 1)
1850 : TREE_OPERAND (exp
, 0)))
1852 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1855 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1859 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1865 field
= TREE_OPERAND (exp
, 1);
1866 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1868 if (same_type_ignoring_top_level_qualifiers_p
1869 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1871 return DECL_BIT_FIELD_TYPE (field
);
1875 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1876 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1877 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1885 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1886 bitfield with a lowered type, the type of EXP is returned, rather
1890 unlowered_expr_type (const_tree exp
)
1894 type
= is_bitfield_expr_with_lowered_type (exp
);
1896 type
= TREE_TYPE (exp
);
1901 /* Perform the conversions in [expr] that apply when an lvalue appears
1902 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1903 function-to-pointer conversions. In addition, manifest constants
1904 are replaced by their values, and bitfield references are converted
1905 to their declared types. Note that this function does not perform the
1906 lvalue-to-rvalue conversion for class types. If you need that conversion
1907 to for class types, then you probably need to use force_rvalue.
1909 Although the returned value is being used as an rvalue, this
1910 function does not wrap the returned expression in a
1911 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1912 that the return value is no longer an lvalue. */
1915 decay_conversion (tree exp
)
1918 enum tree_code code
;
1920 type
= TREE_TYPE (exp
);
1921 if (type
== error_mark_node
)
1922 return error_mark_node
;
1924 exp
= mark_rvalue_use (exp
);
1926 exp
= resolve_nondeduced_context (exp
);
1927 if (type_unknown_p (exp
))
1929 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1930 return error_mark_node
;
1933 exp
= decl_constant_value (exp
);
1934 if (error_operand_p (exp
))
1935 return error_mark_node
;
1937 if (NULLPTR_TYPE_P (type
))
1938 return nullptr_node
;
1940 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1941 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1942 code
= TREE_CODE (type
);
1943 if (code
== VOID_TYPE
)
1945 error ("void value not ignored as it ought to be");
1946 return error_mark_node
;
1948 if (invalid_nonstatic_memfn_p (exp
, tf_warning_or_error
))
1949 return error_mark_node
;
1950 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1951 return cp_build_addr_expr (exp
, tf_warning_or_error
);
1952 if (code
== ARRAY_TYPE
)
1957 if (TREE_CODE (exp
) == INDIRECT_REF
)
1958 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1959 TREE_OPERAND (exp
, 0));
1961 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1963 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1964 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1965 TREE_OPERAND (exp
, 0), op1
);
1969 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1971 error ("invalid use of non-lvalue array");
1972 return error_mark_node
;
1975 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1977 if (TREE_CODE (exp
) == VAR_DECL
)
1979 if (!cxx_mark_addressable (exp
))
1980 return error_mark_node
;
1981 adr
= build_nop (ptrtype
, build_address (exp
));
1984 /* This way is better for a COMPONENT_REF since it can
1985 simplify the offset for a component. */
1986 adr
= cp_build_addr_expr (exp
, tf_warning_or_error
);
1987 return cp_convert (ptrtype
, adr
);
1990 /* If a bitfield is used in a context where integral promotion
1991 applies, then the caller is expected to have used
1992 default_conversion. That function promotes bitfields correctly
1993 before calling this function. At this point, if we have a
1994 bitfield referenced, we may assume that is not subject to
1995 promotion, and that, therefore, the type of the resulting rvalue
1996 is the declared type of the bitfield. */
1997 exp
= convert_bitfield_to_declared_type (exp
);
1999 /* We do not call rvalue() here because we do not want to wrap EXP
2000 in a NON_LVALUE_EXPR. */
2004 Non-class rvalues always have cv-unqualified types. */
2005 type
= TREE_TYPE (exp
);
2006 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
2007 exp
= build_nop (cv_unqualified (type
), exp
);
2012 /* Perform preparatory conversions, as part of the "usual arithmetic
2013 conversions". In particular, as per [expr]:
2015 Whenever an lvalue expression appears as an operand of an
2016 operator that expects the rvalue for that operand, the
2017 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
2018 standard conversions are applied to convert the expression to an
2021 In addition, we perform integral promotions here, as those are
2022 applied to both operands to a binary operator before determining
2023 what additional conversions should apply. */
2026 default_conversion (tree exp
)
2028 /* Check for target-specific promotions. */
2029 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
2031 exp
= cp_convert (promoted_type
, exp
);
2032 /* Perform the integral promotions first so that bitfield
2033 expressions (which may promote to "int", even if the bitfield is
2034 declared "unsigned") are promoted correctly. */
2035 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
2036 exp
= perform_integral_promotions (exp
);
2037 /* Perform the other conversions. */
2038 exp
= decay_conversion (exp
);
2043 /* EXPR is an expression with an integral or enumeration type.
2044 Perform the integral promotions in [conv.prom], and return the
2048 perform_integral_promotions (tree expr
)
2053 expr
= mark_rvalue_use (expr
);
2057 If the bitfield has an enumerated type, it is treated as any
2058 other value of that type for promotion purposes. */
2059 type
= is_bitfield_expr_with_lowered_type (expr
);
2060 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
2061 type
= TREE_TYPE (expr
);
2062 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
2063 promoted_type
= type_promotes_to (type
);
2064 if (type
!= promoted_type
)
2065 expr
= cp_convert (promoted_type
, expr
);
2069 /* Returns nonzero iff exp is a STRING_CST or the result of applying
2070 decay_conversion to one. */
2073 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
2077 if (TREE_CODE (totype
) != POINTER_TYPE
)
2080 t
= TREE_TYPE (totype
);
2081 if (!same_type_p (t
, char_type_node
)
2082 && !same_type_p (t
, char16_type_node
)
2083 && !same_type_p (t
, char32_type_node
)
2084 && !same_type_p (t
, wchar_type_node
))
2087 if (TREE_CODE (exp
) == STRING_CST
)
2089 /* Make sure that we don't try to convert between char and wide chars. */
2090 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
2095 /* Is this a string constant which has decayed to 'const char *'? */
2096 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
2097 if (!same_type_p (TREE_TYPE (exp
), t
))
2100 if (TREE_CODE (exp
) != ADDR_EXPR
2101 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2105 /* This warning is not very useful, as it complains about printf. */
2107 warning (OPT_Wwrite_strings
,
2108 "deprecated conversion from string constant to %qT",
2114 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2115 can, for example, use as an lvalue. This code used to be in
2116 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2117 expressions, where we're dealing with aggregates. But now it's again only
2118 called from unary_complex_lvalue. The case (in particular) that led to
2119 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2123 rationalize_conditional_expr (enum tree_code code
, tree t
,
2124 tsubst_flags_t complain
)
2126 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2127 the first operand is always the one to be used if both operands
2128 are equal, so we know what conditional expression this used to be. */
2129 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2131 tree op0
= TREE_OPERAND (t
, 0);
2132 tree op1
= TREE_OPERAND (t
, 1);
2134 /* The following code is incorrect if either operand side-effects. */
2135 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2136 && !TREE_SIDE_EFFECTS (op1
));
2138 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
2139 ? LE_EXPR
: GE_EXPR
),
2140 op0
, TREE_CODE (op0
),
2141 op1
, TREE_CODE (op1
),
2142 /*overloaded_p=*/NULL
,
2144 cp_build_unary_op (code
, op0
, 0, complain
),
2145 cp_build_unary_op (code
, op1
, 0, complain
),
2150 build_conditional_expr (TREE_OPERAND (t
, 0),
2151 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2153 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2158 /* Given the TYPE of an anonymous union field inside T, return the
2159 FIELD_DECL for the field. If not found return NULL_TREE. Because
2160 anonymous unions can nest, we must also search all anonymous unions
2161 that are directly reachable. */
2164 lookup_anon_field (tree t
, tree type
)
2168 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2170 if (TREE_STATIC (field
))
2172 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2175 /* If we find it directly, return the field. */
2176 if (DECL_NAME (field
) == NULL_TREE
2177 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2182 /* Otherwise, it could be nested, search harder. */
2183 if (DECL_NAME (field
) == NULL_TREE
2184 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2186 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2194 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2195 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2196 non-NULL, it indicates the path to the base used to name MEMBER.
2197 If PRESERVE_REFERENCE is true, the expression returned will have
2198 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2199 returned will have the type referred to by the reference.
2201 This function does not perform access control; that is either done
2202 earlier by the parser when the name of MEMBER is resolved to MEMBER
2203 itself, or later when overload resolution selects one of the
2204 functions indicated by MEMBER. */
2207 build_class_member_access_expr (tree object
, tree member
,
2208 tree access_path
, bool preserve_reference
,
2209 tsubst_flags_t complain
)
2213 tree result
= NULL_TREE
;
2215 if (error_operand_p (object
) || error_operand_p (member
))
2216 return error_mark_node
;
2218 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2222 The type of the first expression shall be "class object" (of a
2224 object_type
= TREE_TYPE (object
);
2225 if (!currently_open_class (object_type
)
2226 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2227 return error_mark_node
;
2228 if (!CLASS_TYPE_P (object_type
))
2230 if (complain
& tf_error
)
2231 error ("request for member %qD in %qE, which is of non-class type %qT",
2232 member
, object
, object_type
);
2233 return error_mark_node
;
2236 /* The standard does not seem to actually say that MEMBER must be a
2237 member of OBJECT_TYPE. However, that is clearly what is
2239 if (DECL_P (member
))
2241 member_scope
= DECL_CLASS_CONTEXT (member
);
2243 if (TREE_DEPRECATED (member
))
2244 warn_deprecated_use (member
, NULL_TREE
);
2247 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2248 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2249 presently be the anonymous union. Go outwards until we find a
2250 type related to OBJECT_TYPE. */
2251 while (ANON_AGGR_TYPE_P (member_scope
)
2252 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2254 member_scope
= TYPE_CONTEXT (member_scope
);
2255 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2257 if (complain
& tf_error
)
2259 if (TREE_CODE (member
) == FIELD_DECL
)
2260 error ("invalid use of nonstatic data member %qE", member
);
2262 error ("%qD is not a member of %qT", member
, object_type
);
2264 return error_mark_node
;
2267 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2268 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2269 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2271 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2273 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2276 /* In [expr.ref], there is an explicit list of the valid choices for
2277 MEMBER. We check for each of those cases here. */
2278 if (TREE_CODE (member
) == VAR_DECL
)
2280 /* A static data member. */
2282 mark_exp_read (object
);
2283 /* If OBJECT has side-effects, they are supposed to occur. */
2284 if (TREE_SIDE_EFFECTS (object
))
2285 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2287 else if (TREE_CODE (member
) == FIELD_DECL
)
2289 /* A non-static data member. */
2294 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
2295 && integer_zerop (TREE_OPERAND (object
, 0)));
2297 /* Convert OBJECT to the type of MEMBER. */
2298 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2299 TYPE_MAIN_VARIANT (member_scope
)))
2304 binfo
= lookup_base (access_path
? access_path
: object_type
,
2305 member_scope
, ba_unique
, &kind
);
2306 if (binfo
== error_mark_node
)
2307 return error_mark_node
;
2309 /* It is invalid to try to get to a virtual base of a
2310 NULL object. The most common cause is invalid use of
2312 if (null_object_p
&& kind
== bk_via_virtual
)
2314 if (complain
& tf_error
)
2316 error ("invalid access to non-static data member %qD of "
2319 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2321 return error_mark_node
;
2324 /* Convert to the base. */
2325 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2327 /* If we found the base successfully then we should be able
2328 to convert to it successfully. */
2329 gcc_assert (object
!= error_mark_node
);
2332 /* Complain about other invalid uses of offsetof, even though they will
2333 give the right answer. Note that we complain whether or not they
2334 actually used the offsetof macro, since there's no way to know at this
2335 point. So we just give a warning, instead of a pedwarn. */
2336 /* Do not produce this warning for base class field references, because
2337 we know for a fact that didn't come from offsetof. This does occur
2338 in various testsuite cases where a null object is passed where a
2339 vtable access is required. */
2340 if (null_object_p
&& warn_invalid_offsetof
2341 && CLASSTYPE_NON_STD_LAYOUT (object_type
)
2342 && !DECL_FIELD_IS_BASE (member
)
2343 && cp_unevaluated_operand
== 0
2344 && (complain
& tf_warning
))
2346 warning (OPT_Winvalid_offsetof
,
2347 "invalid access to non-static data member %qD "
2348 " of NULL object", member
);
2349 warning (OPT_Winvalid_offsetof
,
2350 "(perhaps the %<offsetof%> macro was used incorrectly)");
2353 /* If MEMBER is from an anonymous aggregate, we have converted
2354 OBJECT so that it refers to the class containing the
2355 anonymous union. Generate a reference to the anonymous union
2356 itself, and recur to find MEMBER. */
2357 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2358 /* When this code is called from build_field_call, the
2359 object already has the type of the anonymous union.
2360 That is because the COMPONENT_REF was already
2361 constructed, and was then disassembled before calling
2362 build_field_call. After the function-call code is
2363 cleaned up, this waste can be eliminated. */
2364 && (!same_type_ignoring_top_level_qualifiers_p
2365 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2367 tree anonymous_union
;
2369 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2370 DECL_CONTEXT (member
));
2371 object
= build_class_member_access_expr (object
,
2373 /*access_path=*/NULL_TREE
,
2378 /* Compute the type of the field, as described in [expr.ref]. */
2379 type_quals
= TYPE_UNQUALIFIED
;
2380 member_type
= TREE_TYPE (member
);
2381 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2383 type_quals
= (cp_type_quals (member_type
)
2384 | cp_type_quals (object_type
));
2386 /* A field is const (volatile) if the enclosing object, or the
2387 field itself, is const (volatile). But, a mutable field is
2388 not const, even within a const object. */
2389 if (DECL_MUTABLE_P (member
))
2390 type_quals
&= ~TYPE_QUAL_CONST
;
2391 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2394 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
2396 result
= fold_if_not_in_template (result
);
2398 /* Mark the expression const or volatile, as appropriate. Even
2399 though we've dealt with the type above, we still have to mark the
2400 expression itself. */
2401 if (type_quals
& TYPE_QUAL_CONST
)
2402 TREE_READONLY (result
) = 1;
2403 if (type_quals
& TYPE_QUAL_VOLATILE
)
2404 TREE_THIS_VOLATILE (result
) = 1;
2406 else if (BASELINK_P (member
))
2408 /* The member is a (possibly overloaded) member function. */
2412 /* If the MEMBER is exactly one static member function, then we
2413 know the type of the expression. Otherwise, we must wait
2414 until overload resolution has been performed. */
2415 functions
= BASELINK_FUNCTIONS (member
);
2416 if (TREE_CODE (functions
) == FUNCTION_DECL
2417 && DECL_STATIC_FUNCTION_P (functions
))
2418 type
= TREE_TYPE (functions
);
2420 type
= unknown_type_node
;
2421 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2422 base. That will happen when the function is called. */
2423 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2425 else if (TREE_CODE (member
) == CONST_DECL
)
2427 /* The member is an enumerator. */
2429 /* If OBJECT has side-effects, they are supposed to occur. */
2430 if (TREE_SIDE_EFFECTS (object
))
2431 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2436 if (complain
& tf_error
)
2437 error ("invalid use of %qD", member
);
2438 return error_mark_node
;
2441 if (!preserve_reference
)
2444 If E2 is declared to have type "reference to T", then ... the
2445 type of E1.E2 is T. */
2446 result
= convert_from_reference (result
);
2451 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2452 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2455 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2457 tree object_type
= TREE_TYPE (object
);
2458 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2461 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2463 error ("qualified type %qT does not match destructor name ~%qT",
2465 return error_mark_node
;
2467 if (TREE_CODE (dtor_type
) == IDENTIFIER_NODE
)
2469 /* In a template, names we can't find a match for are still accepted
2470 destructor names, and we check them here. */
2471 if (check_dtor_name (object_type
, dtor_type
))
2472 dtor_type
= object_type
;
2475 error ("object type %qT does not match destructor name ~%qT",
2476 object_type
, dtor_type
);
2477 return error_mark_node
;
2481 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2483 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2484 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2485 return error_mark_node
;
2487 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2488 /*protect=*/1, /*want_type=*/false);
2489 expr
= (adjust_result_of_qualified_name_lookup
2490 (expr
, dtor_type
, object_type
));
2494 /* An expression of the form "A::template B" has been resolved to
2495 DECL. Issue a diagnostic if B is not a template or template
2499 check_template_keyword (tree decl
)
2501 /* The standard says:
2505 If a name prefixed by the keyword template is not a member
2506 template, the program is ill-formed.
2508 DR 228 removed the restriction that the template be a member
2511 DR 96, if accepted would add the further restriction that explicit
2512 template arguments must be provided if the template keyword is
2513 used, but, as of 2005-10-16, that DR is still in "drafting". If
2514 this DR is accepted, then the semantic checks here can be
2515 simplified, as the entity named must in fact be a template
2516 specialization, rather than, as at present, a set of overloaded
2517 functions containing at least one template function. */
2518 if (TREE_CODE (decl
) != TEMPLATE_DECL
2519 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2521 if (!is_overloaded_fn (decl
))
2522 permerror (input_location
, "%qD is not a template", decl
);
2527 if (BASELINK_P (fns
))
2528 fns
= BASELINK_FUNCTIONS (fns
);
2531 tree fn
= OVL_CURRENT (fns
);
2532 if (TREE_CODE (fn
) == TEMPLATE_DECL
2533 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2535 if (TREE_CODE (fn
) == FUNCTION_DECL
2536 && DECL_USE_TEMPLATE (fn
)
2537 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2539 fns
= OVL_NEXT (fns
);
2542 permerror (input_location
, "%qD is not a template", decl
);
2547 /* This function is called by the parser to process a class member
2548 access expression of the form OBJECT.NAME. NAME is a node used by
2549 the parser to represent a name; it is not yet a DECL. It may,
2550 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2551 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2552 there is no reason to do the lookup twice, so the parser keeps the
2553 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2554 be a template via the use of the "A::template B" syntax. */
2557 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2558 tsubst_flags_t complain
)
2563 tree access_path
= NULL_TREE
;
2564 tree orig_object
= object
;
2565 tree orig_name
= name
;
2567 if (object
== error_mark_node
|| name
== error_mark_node
)
2568 return error_mark_node
;
2570 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2571 if (!objc_is_public (object
, name
))
2572 return error_mark_node
;
2574 object_type
= TREE_TYPE (object
);
2576 if (processing_template_decl
)
2578 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2579 dependent_type_p (object_type
)
2580 /* If NAME is just an IDENTIFIER_NODE, then the expression
2582 || TREE_CODE (object
) == IDENTIFIER_NODE
2583 /* If NAME is "f<args>", where either 'f' or 'args' is
2584 dependent, then the expression is dependent. */
2585 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2586 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2587 TREE_OPERAND (name
, 1)))
2588 /* If NAME is "T::X" where "T" is dependent, then the
2589 expression is dependent. */
2590 || (TREE_CODE (name
) == SCOPE_REF
2591 && TYPE_P (TREE_OPERAND (name
, 0))
2592 && dependent_type_p (TREE_OPERAND (name
, 0))))
2593 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2594 object
= build_non_dependent_expr (object
);
2599 The type of the first expression shall be "class object" (of a
2601 if (!currently_open_class (object_type
)
2602 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2603 return error_mark_node
;
2604 if (!CLASS_TYPE_P (object_type
))
2606 if (complain
& tf_error
)
2607 error ("request for member %qD in %qE, which is of non-class type %qT",
2608 name
, object
, object_type
);
2609 return error_mark_node
;
2612 if (BASELINK_P (name
))
2613 /* A member function that has already been looked up. */
2617 bool is_template_id
= false;
2618 tree template_args
= NULL_TREE
;
2621 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2623 is_template_id
= true;
2624 template_args
= TREE_OPERAND (name
, 1);
2625 name
= TREE_OPERAND (name
, 0);
2627 if (TREE_CODE (name
) == OVERLOAD
)
2628 name
= DECL_NAME (get_first_fn (name
));
2629 else if (DECL_P (name
))
2630 name
= DECL_NAME (name
);
2633 if (TREE_CODE (name
) == SCOPE_REF
)
2635 /* A qualified name. The qualifying class or namespace `S'
2636 has already been looked up; it is either a TYPE or a
2638 scope
= TREE_OPERAND (name
, 0);
2639 name
= TREE_OPERAND (name
, 1);
2641 /* If SCOPE is a namespace, then the qualified name does not
2642 name a member of OBJECT_TYPE. */
2643 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2645 if (complain
& tf_error
)
2646 error ("%<%D::%D%> is not a member of %qT",
2647 scope
, name
, object_type
);
2648 return error_mark_node
;
2651 gcc_assert (CLASS_TYPE_P (scope
));
2652 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2653 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2655 if (constructor_name_p (name
, scope
))
2657 if (complain
& tf_error
)
2658 error ("cannot call constructor %<%T::%D%> directly",
2660 return error_mark_node
;
2663 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2664 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2665 if (access_path
== error_mark_node
)
2666 return error_mark_node
;
2669 if (complain
& tf_error
)
2670 error ("%qT is not a base of %qT", scope
, object_type
);
2671 return error_mark_node
;
2677 access_path
= object_type
;
2680 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2681 member
= lookup_destructor (object
, scope
, name
);
2684 /* Look up the member. */
2685 member
= lookup_member (access_path
, name
, /*protect=*/1,
2686 /*want_type=*/false);
2687 if (member
== NULL_TREE
)
2689 if (complain
& tf_error
)
2690 error ("%qD has no member named %qE", object_type
, name
);
2691 return error_mark_node
;
2693 if (member
== error_mark_node
)
2694 return error_mark_node
;
2699 tree templ
= member
;
2701 if (BASELINK_P (templ
))
2702 templ
= lookup_template_function (templ
, template_args
);
2705 if (complain
& tf_error
)
2706 error ("%qD is not a member template function", name
);
2707 return error_mark_node
;
2712 if (TREE_DEPRECATED (member
))
2713 warn_deprecated_use (member
, NULL_TREE
);
2716 check_template_keyword (member
);
2718 expr
= build_class_member_access_expr (object
, member
, access_path
,
2719 /*preserve_reference=*/false,
2721 if (processing_template_decl
&& expr
!= error_mark_node
)
2723 if (BASELINK_P (member
))
2725 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2726 BASELINK_QUALIFIED_P (member
) = 1;
2729 return build_min_non_dep (COMPONENT_REF
, expr
,
2730 orig_object
, orig_name
,
2737 /* Return an expression for the MEMBER_NAME field in the internal
2738 representation of PTRMEM, a pointer-to-member function. (Each
2739 pointer-to-member function type gets its own RECORD_TYPE so it is
2740 more convenient to access the fields by name than by FIELD_DECL.)
2741 This routine converts the NAME to a FIELD_DECL and then creates the
2742 node for the complete expression. */
2745 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2751 /* This code is a stripped down version of
2752 build_class_member_access_expr. It does not work to use that
2753 routine directly because it expects the object to be of class
2755 ptrmem_type
= TREE_TYPE (ptrmem
);
2756 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2757 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2758 /*want_type=*/false);
2759 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2760 cp_type_quals (ptrmem_type
));
2761 return fold_build3_loc (input_location
,
2762 COMPONENT_REF
, member_type
,
2763 ptrmem
, member
, NULL_TREE
);
2766 /* Given an expression PTR for a pointer, return an expression
2767 for the value pointed to.
2768 ERRORSTRING is the name of the operator to appear in error messages.
2770 This function may need to overload OPERATOR_FNNAME.
2771 Must also handle REFERENCE_TYPEs for C++. */
2774 build_x_indirect_ref (tree expr
, ref_operator errorstring
,
2775 tsubst_flags_t complain
)
2777 tree orig_expr
= expr
;
2780 if (processing_template_decl
)
2782 /* Retain the type if we know the operand is a pointer so that
2783 describable_type doesn't make auto deduction break. */
2784 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2785 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2786 if (type_dependent_expression_p (expr
))
2787 return build_min_nt (INDIRECT_REF
, expr
);
2788 expr
= build_non_dependent_expr (expr
);
2791 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2792 NULL_TREE
, /*overloaded_p=*/NULL
, complain
);
2794 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2796 if (processing_template_decl
&& rval
!= error_mark_node
)
2797 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2802 /* Helper function called from c-common. */
2804 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2805 tree ptr
, ref_operator errorstring
)
2807 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2811 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2812 tsubst_flags_t complain
)
2816 if (ptr
== error_mark_node
)
2817 return error_mark_node
;
2819 if (ptr
== current_class_ptr
)
2820 return current_class_ref
;
2822 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2823 ? ptr
: decay_conversion (ptr
));
2824 type
= TREE_TYPE (pointer
);
2826 if (POINTER_TYPE_P (type
))
2830 If the type of the expression is "pointer to T," the type
2831 of the result is "T." */
2832 tree t
= TREE_TYPE (type
);
2834 if (CONVERT_EXPR_P (ptr
)
2835 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2837 /* If a warning is issued, mark it to avoid duplicates from
2838 the backend. This only needs to be done at
2839 warn_strict_aliasing > 2. */
2840 if (warn_strict_aliasing
> 2)
2841 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2842 type
, TREE_OPERAND (ptr
, 0)))
2843 TREE_NO_WARNING (ptr
) = 1;
2846 if (VOID_TYPE_P (t
))
2848 /* A pointer to incomplete type (other than cv void) can be
2849 dereferenced [expr.unary.op]/1 */
2850 if (complain
& tf_error
)
2851 error ("%qT is not a pointer-to-object type", type
);
2852 return error_mark_node
;
2854 else if (TREE_CODE (pointer
) == ADDR_EXPR
2855 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2856 /* The POINTER was something like `&x'. We simplify `*&x' to
2858 return TREE_OPERAND (pointer
, 0);
2861 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2863 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2864 so that we get the proper error message if the result is used
2865 to assign to. Also, &* is supposed to be a no-op. */
2866 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2867 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2868 TREE_SIDE_EFFECTS (ref
)
2869 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2873 else if (!(complain
& tf_error
))
2874 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2876 /* `pointer' won't be an error_mark_node if we were given a
2877 pointer to member, so it's cool to check for this here. */
2878 else if (TYPE_PTR_TO_MEMBER_P (type
))
2879 switch (errorstring
)
2881 case RO_ARRAY_INDEXING
:
2882 error ("invalid use of array indexing on pointer to member");
2885 error ("invalid use of unary %<*%> on pointer to member");
2887 case RO_IMPLICIT_CONVERSION
:
2888 error ("invalid use of implicit conversion on pointer to member");
2893 else if (pointer
!= error_mark_node
)
2894 switch (errorstring
)
2897 error ("invalid type argument");
2899 case RO_ARRAY_INDEXING
:
2900 error ("invalid type argument of array indexing");
2903 error ("invalid type argument of unary %<*%>");
2905 case RO_IMPLICIT_CONVERSION
:
2906 error ("invalid type argument of implicit conversion");
2911 return error_mark_node
;
2914 /* This handles expressions of the form "a[i]", which denotes
2917 This is logically equivalent in C to *(a+i), but we may do it differently.
2918 If A is a variable or a member, we generate a primitive ARRAY_REF.
2919 This avoids forcing the array out of registers, and can work on
2920 arrays that are not lvalues (for example, members of structures returned
2923 If INDEX is of some user-defined type, it must be converted to
2924 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2925 will inherit the type of the array, which will be some pointer type.
2927 LOC is the location to use in building the array reference. */
2930 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
2931 tsubst_flags_t complain
)
2937 if (complain
& tf_error
)
2938 error_at (loc
, "subscript missing in array reference");
2939 return error_mark_node
;
2942 if (TREE_TYPE (array
) == error_mark_node
2943 || TREE_TYPE (idx
) == error_mark_node
)
2944 return error_mark_node
;
2946 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2948 switch (TREE_CODE (array
))
2952 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2954 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2955 TREE_OPERAND (array
, 0), value
);
2956 SET_EXPR_LOCATION (ret
, loc
);
2961 ret
= build_conditional_expr
2962 (TREE_OPERAND (array
, 0),
2963 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2965 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
2967 tf_warning_or_error
);
2968 protected_set_expr_location (ret
, loc
);
2975 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2979 warn_array_subscript_with_type_char (idx
);
2981 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2983 if (complain
& tf_error
)
2984 error_at (loc
, "array subscript is not an integer");
2985 return error_mark_node
;
2988 /* Apply integral promotions *after* noticing character types.
2989 (It is unclear why we do these promotions -- the standard
2990 does not say that we should. In fact, the natural thing would
2991 seem to be to convert IDX to ptrdiff_t; we're performing
2992 pointer arithmetic.) */
2993 idx
= perform_integral_promotions (idx
);
2995 /* An array that is indexed by a non-constant
2996 cannot be stored in a register; we must be able to do
2997 address arithmetic on its address.
2998 Likewise an array of elements of variable size. */
2999 if (TREE_CODE (idx
) != INTEGER_CST
3000 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
3001 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
3004 if (!cxx_mark_addressable (array
))
3005 return error_mark_node
;
3008 /* An array that is indexed by a constant value which is not within
3009 the array bounds cannot be stored in a register either; because we
3010 would get a crash in store_bit_field/extract_bit_field when trying
3011 to access a non-existent part of the register. */
3012 if (TREE_CODE (idx
) == INTEGER_CST
3013 && TYPE_DOMAIN (TREE_TYPE (array
))
3014 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
3016 if (!cxx_mark_addressable (array
))
3017 return error_mark_node
;
3020 if (!lvalue_p (array
) && (complain
& tf_error
))
3021 pedwarn (loc
, OPT_pedantic
,
3022 "ISO C++ forbids subscripting non-lvalue array");
3024 /* Note in C++ it is valid to subscript a `register' array, since
3025 it is valid to take the address of something with that
3026 storage specification. */
3030 while (TREE_CODE (foo
) == COMPONENT_REF
)
3031 foo
= TREE_OPERAND (foo
, 0);
3032 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
)
3033 && (complain
& tf_warning
))
3034 warning_at (loc
, OPT_Wextra
,
3035 "subscripting array declared %<register%>");
3038 type
= TREE_TYPE (TREE_TYPE (array
));
3039 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
3040 /* Array ref is const/volatile if the array elements are
3041 or if the array is.. */
3042 TREE_READONLY (rval
)
3043 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
3044 TREE_SIDE_EFFECTS (rval
)
3045 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
3046 TREE_THIS_VOLATILE (rval
)
3047 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
3048 ret
= require_complete_type_sfinae (fold_if_not_in_template (rval
),
3050 protected_set_expr_location (ret
, loc
);
3055 tree ar
= default_conversion (array
);
3056 tree ind
= default_conversion (idx
);
3058 /* Put the integer in IND to simplify error checking. */
3059 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
3066 if (ar
== error_mark_node
)
3069 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
3071 if (complain
& tf_error
)
3072 error_at (loc
, "subscripted value is neither array nor pointer");
3073 return error_mark_node
;
3075 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
3077 if (complain
& tf_error
)
3078 error_at (loc
, "array subscript is not an integer");
3079 return error_mark_node
;
3082 warn_array_subscript_with_type_char (idx
);
3084 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
3089 protected_set_expr_location (ret
, loc
);
3094 /* Entry point for Obj-C++. */
3097 build_array_ref (location_t loc
, tree array
, tree idx
)
3099 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
3102 /* Resolve a pointer to member function. INSTANCE is the object
3103 instance to use, if the member points to a virtual member.
3105 This used to avoid checking for virtual functions if basetype
3106 has no virtual functions, according to an earlier ANSI draft.
3107 With the final ISO C++ rules, such an optimization is
3108 incorrect: A pointer to a derived member can be static_cast
3109 to pointer-to-base-member, as long as the dynamic object
3110 later has the right member. */
3113 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
3115 if (TREE_CODE (function
) == OFFSET_REF
)
3116 function
= TREE_OPERAND (function
, 1);
3118 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3120 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
3121 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3123 tree instance_ptr
= *instance_ptrptr
;
3124 tree instance_save_expr
= 0;
3125 if (instance_ptr
== error_mark_node
)
3127 if (TREE_CODE (function
) == PTRMEM_CST
)
3129 /* Extracting the function address from a pmf is only
3130 allowed with -Wno-pmf-conversions. It only works for
3132 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
3133 e1
= convert (fntype
, e1
);
3138 error ("object missing in use of %qE", function
);
3139 return error_mark_node
;
3143 if (TREE_SIDE_EFFECTS (instance_ptr
))
3144 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3146 if (TREE_SIDE_EFFECTS (function
))
3147 function
= save_expr (function
);
3149 /* Start by extracting all the information from the PMF itself. */
3150 e3
= pfn_from_ptrmemfunc (function
);
3151 delta
= delta_from_ptrmemfunc (function
);
3152 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3153 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3155 case ptrmemfunc_vbit_in_pfn
:
3156 e1
= cp_build_binary_op (input_location
,
3157 BIT_AND_EXPR
, idx
, integer_one_node
,
3158 tf_warning_or_error
);
3159 idx
= cp_build_binary_op (input_location
,
3160 MINUS_EXPR
, idx
, integer_one_node
,
3161 tf_warning_or_error
);
3164 case ptrmemfunc_vbit_in_delta
:
3165 e1
= cp_build_binary_op (input_location
,
3166 BIT_AND_EXPR
, delta
, integer_one_node
,
3167 tf_warning_or_error
);
3168 delta
= cp_build_binary_op (input_location
,
3169 RSHIFT_EXPR
, delta
, integer_one_node
,
3170 tf_warning_or_error
);
3177 /* Convert down to the right base before using the instance. A
3178 special case is that in a pointer to member of class C, C may
3179 be incomplete. In that case, the function will of course be
3180 a member of C, and no conversion is required. In fact,
3181 lookup_base will fail in that case, because incomplete
3182 classes do not have BINFOs. */
3183 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3184 if (!same_type_ignoring_top_level_qualifiers_p
3185 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3187 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3188 basetype
, ba_check
, NULL
);
3189 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3191 if (instance_ptr
== error_mark_node
)
3192 return error_mark_node
;
3194 /* ...and then the delta in the PMF. */
3195 instance_ptr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (instance_ptr
),
3196 instance_ptr
, fold_convert (sizetype
, delta
));
3198 /* Hand back the adjusted 'this' argument to our caller. */
3199 *instance_ptrptr
= instance_ptr
;
3201 /* Next extract the vtable pointer from the object. */
3202 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3204 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, tf_warning_or_error
);
3205 /* If the object is not dynamic the access invokes undefined
3206 behavior. As it is not executed in this case silence the
3207 spurious warnings it may provoke. */
3208 TREE_NO_WARNING (vtbl
) = 1;
3210 /* Finally, extract the function pointer from the vtable. */
3211 e2
= fold_build2_loc (input_location
,
3212 POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
,
3213 fold_convert (sizetype
, idx
));
3214 e2
= cp_build_indirect_ref (e2
, RO_NULL
, tf_warning_or_error
);
3215 TREE_CONSTANT (e2
) = 1;
3217 /* When using function descriptors, the address of the
3218 vtable entry is treated as a function pointer. */
3219 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3220 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3221 cp_build_addr_expr (e2
, tf_warning_or_error
));
3223 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3224 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
3226 /* Make sure this doesn't get evaluated first inside one of the
3227 branches of the COND_EXPR. */
3228 if (instance_save_expr
)
3229 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3230 instance_save_expr
, e1
);
3237 /* Used by the C-common bits. */
3239 build_function_call (location_t loc ATTRIBUTE_UNUSED
,
3240 tree function
, tree params
)
3242 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3245 /* Used by the C-common bits. */
3247 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED
,
3248 tree function
, VEC(tree
,gc
) *params
,
3249 VEC(tree
,gc
) *origtypes ATTRIBUTE_UNUSED
)
3251 VEC(tree
,gc
) *orig_params
= params
;
3252 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3253 tf_warning_or_error
);
3255 /* cp_build_function_call_vec can reallocate PARAMS by adding
3256 default arguments. That should never happen here. Verify
3258 gcc_assert (params
== orig_params
);
3263 /* Build a function call using a tree list of arguments. */
3266 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3271 vec
= make_tree_vector ();
3272 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3273 VEC_safe_push (tree
, gc
, vec
, TREE_VALUE (params
));
3274 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3275 release_tree_vector (vec
);
3279 /* Build a function call using varargs. */
3282 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3288 vec
= make_tree_vector ();
3289 va_start (args
, complain
);
3290 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3291 VEC_safe_push (tree
, gc
, vec
, t
);
3293 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3294 release_tree_vector (vec
);
3298 /* Build a function call using a vector of arguments. PARAMS may be
3299 NULL if there are no parameters. This changes the contents of
3303 cp_build_function_call_vec (tree function
, VEC(tree
,gc
) **params
,
3304 tsubst_flags_t complain
)
3306 tree fntype
, fndecl
;
3308 tree original
= function
;
3312 VEC(tree
,gc
) *allocated
= NULL
;
3315 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3316 expressions, like those used for ObjC messenger dispatches. */
3317 if (params
!= NULL
&& !VEC_empty (tree
, *params
))
3318 function
= objc_rewrite_function_call (function
,
3319 VEC_index (tree
, *params
, 0));
3321 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3322 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3323 if (TREE_CODE (function
) == NOP_EXPR
3324 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3325 function
= TREE_OPERAND (function
, 0);
3327 if (TREE_CODE (function
) == FUNCTION_DECL
)
3329 mark_used (function
);
3332 /* Convert anything with function type to a pointer-to-function. */
3333 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
3334 pedwarn (input_location
, OPT_pedantic
,
3335 "ISO C++ forbids calling %<::main%> from within program");
3337 function
= build_addr_func (function
);
3343 function
= build_addr_func (function
);
3346 if (function
== error_mark_node
)
3347 return error_mark_node
;
3349 fntype
= TREE_TYPE (function
);
3351 if (TYPE_PTRMEMFUNC_P (fntype
))
3353 if (complain
& tf_error
)
3354 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3355 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3356 original
, original
);
3357 return error_mark_node
;
3360 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
3361 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3363 if (!((TREE_CODE (fntype
) == POINTER_TYPE
3364 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
3366 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3368 if (complain
& tf_error
)
3369 error ("%qE cannot be used as a function", original
);
3370 return error_mark_node
;
3373 /* fntype now gets the type of function pointed to. */
3374 fntype
= TREE_TYPE (fntype
);
3375 parm_types
= TYPE_ARG_TYPES (fntype
);
3379 allocated
= make_tree_vector ();
3380 params
= &allocated
;
3383 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3386 return error_mark_node
;
3388 argarray
= VEC_address (tree
, *params
);
3390 /* Check for errors in format strings and inappropriately
3392 check_function_arguments (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
,
3395 ret
= build_cxx_call (function
, nargs
, argarray
);
3397 if (allocated
!= NULL
)
3398 release_tree_vector (allocated
);
3403 /* Subroutine of convert_arguments.
3404 Warn about wrong number of args are genereted. */
3407 warn_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3411 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3413 if (DECL_NAME (fndecl
) == NULL_TREE
3414 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3417 ? G_("too many arguments to constructor %q#D")
3418 : G_("too few arguments to constructor %q#D"),
3423 ? G_("too many arguments to member function %q#D")
3424 : G_("too few arguments to member function %q#D"),
3430 ? G_("too many arguments to function %q#D")
3431 : G_("too few arguments to function %q#D"),
3433 inform (DECL_SOURCE_LOCATION (fndecl
),
3438 if (c_dialect_objc () && objc_message_selector ())
3441 ? G_("too many arguments to method %q#D")
3442 : G_("too few arguments to method %q#D"),
3443 objc_message_selector ());
3445 error_at (loc
, too_many_p
? G_("too many arguments to function")
3446 : G_("too few arguments to function"));
3450 /* Convert the actual parameter expressions in the list VALUES to the
3451 types in the list TYPELIST. The converted expressions are stored
3452 back in the VALUES vector.
3453 If parmdecls is exhausted, or when an element has NULL as its type,
3454 perform the default conversions.
3456 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3458 This is also where warnings about wrong number of args are generated.
3460 Returns the actual number of arguments processed (which might be less
3461 than the length of the vector), or -1 on error.
3463 In C++, unspecified trailing parameters can be filled in with their
3464 default arguments, if such were specified. Do so here. */
3467 convert_arguments (tree typelist
, VEC(tree
,gc
) **values
, tree fndecl
,
3468 int flags
, tsubst_flags_t complain
)
3473 /* Argument passing is always copy-initialization. */
3474 flags
|= LOOKUP_ONLYCONVERTING
;
3476 for (i
= 0, typetail
= typelist
;
3477 i
< VEC_length (tree
, *values
);
3480 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3481 tree val
= VEC_index (tree
, *values
, i
);
3483 if (val
== error_mark_node
|| type
== error_mark_node
)
3486 if (type
== void_type_node
)
3488 if (complain
& tf_error
)
3490 warn_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3497 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3498 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3499 if (TREE_CODE (val
) == NOP_EXPR
3500 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3501 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3502 val
= TREE_OPERAND (val
, 0);
3504 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3506 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3507 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3508 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3509 val
= decay_conversion (val
);
3512 if (val
== error_mark_node
)
3517 /* Formal parm type is specified by a function prototype. */
3520 if (!COMPLETE_TYPE_P (complete_type (type
)))
3522 if (complain
& tf_error
)
3525 error ("parameter %P of %qD has incomplete type %qT",
3528 error ("parameter %P has incomplete type %qT", i
, type
);
3530 parmval
= error_mark_node
;
3534 parmval
= convert_for_initialization
3535 (NULL_TREE
, type
, val
, flags
,
3536 ICR_ARGPASS
, fndecl
, i
, complain
);
3537 parmval
= convert_for_arg_passing (type
, parmval
);
3540 if (parmval
== error_mark_node
)
3543 VEC_replace (tree
, *values
, i
, parmval
);
3547 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3548 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3549 /* Don't do ellipsis conversion for __built_in_constant_p
3550 as this will result in spurious errors for non-trivial
3552 val
= require_complete_type_sfinae (val
, complain
);
3554 val
= convert_arg_to_ellipsis (val
);
3556 VEC_replace (tree
, *values
, i
, val
);
3560 typetail
= TREE_CHAIN (typetail
);
3563 if (typetail
!= 0 && typetail
!= void_list_node
)
3565 /* See if there are default arguments that can be used. Because
3566 we hold default arguments in the FUNCTION_TYPE (which is so
3567 wrong), we can see default parameters here from deduced
3568 contexts (and via typeof) for indirect function calls.
3569 Fortunately we know whether we have a function decl to
3570 provide default arguments in a language conformant
3572 if (fndecl
&& TREE_PURPOSE (typetail
)
3573 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3575 for (; typetail
!= void_list_node
; ++i
)
3578 = convert_default_arg (TREE_VALUE (typetail
),
3579 TREE_PURPOSE (typetail
),
3582 if (parmval
== error_mark_node
)
3585 VEC_safe_push (tree
, gc
, *values
, parmval
);
3586 typetail
= TREE_CHAIN (typetail
);
3587 /* ends with `...'. */
3588 if (typetail
== NULL_TREE
)
3594 if (complain
& tf_error
)
3595 warn_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3603 /* Build a binary-operation expression, after performing default
3604 conversions on the operands. CODE is the kind of expression to
3605 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3606 are the tree codes which correspond to ARG1 and ARG2 when issuing
3607 warnings about possibly misplaced parentheses. They may differ
3608 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3609 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3610 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3611 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3612 ARG2_CODE as ERROR_MARK. */
3615 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3616 tree arg2
, enum tree_code arg2_code
, bool *overloaded_p
,
3617 tsubst_flags_t complain
)
3626 if (processing_template_decl
)
3628 if (type_dependent_expression_p (arg1
)
3629 || type_dependent_expression_p (arg2
))
3630 return build_min_nt (code
, arg1
, arg2
);
3631 arg1
= build_non_dependent_expr (arg1
);
3632 arg2
= build_non_dependent_expr (arg2
);
3635 if (code
== DOTSTAR_EXPR
)
3636 expr
= build_m_component_ref (arg1
, arg2
);
3638 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3639 overloaded_p
, complain
);
3641 /* Check for cases such as x+y<<z which users are likely to
3642 misinterpret. But don't warn about obj << x + y, since that is a
3643 common idiom for I/O. */
3644 if (warn_parentheses
3645 && (complain
& tf_warning
)
3646 && !processing_template_decl
3647 && !error_operand_p (arg1
)
3648 && !error_operand_p (arg2
)
3649 && (code
!= LSHIFT_EXPR
3650 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3651 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3653 if (processing_template_decl
&& expr
!= error_mark_node
)
3654 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3659 /* Build and return an ARRAY_REF expression. */
3662 build_x_array_ref (tree arg1
, tree arg2
, tsubst_flags_t complain
)
3664 tree orig_arg1
= arg1
;
3665 tree orig_arg2
= arg2
;
3668 if (processing_template_decl
)
3670 if (type_dependent_expression_p (arg1
)
3671 || type_dependent_expression_p (arg2
))
3672 return build_min_nt (ARRAY_REF
, arg1
, arg2
,
3673 NULL_TREE
, NULL_TREE
);
3674 arg1
= build_non_dependent_expr (arg1
);
3675 arg2
= build_non_dependent_expr (arg2
);
3678 expr
= build_new_op (ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3679 /*overloaded_p=*/NULL
, complain
);
3681 if (processing_template_decl
&& expr
!= error_mark_node
)
3682 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3683 NULL_TREE
, NULL_TREE
);
3687 /* For the c-common bits. */
3689 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3690 int convert_p ATTRIBUTE_UNUSED
)
3692 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3696 /* Build a binary-operation expression without default conversions.
3697 CODE is the kind of expression to build.
3698 LOCATION is the location_t of the operator in the source code.
3699 This function differs from `build' in several ways:
3700 the data type of the result is computed and recorded in it,
3701 warnings are generated if arg data types are invalid,
3702 special handling for addition and subtraction of pointers is known,
3703 and some optimization is done (operations on narrow ints
3704 are done in the narrower type when that gives the same result).
3705 Constant folding is also done before the result is returned.
3707 Note that the operands will never have enumeral types
3708 because either they have just had the default conversions performed
3709 or they have both just been converted to some other type in which
3710 the arithmetic is to be done.
3712 C++: must do special pointer arithmetic when implementing
3713 multiple inheritance, and deal with pointer to member functions. */
3716 cp_build_binary_op (location_t location
,
3717 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3718 tsubst_flags_t complain
)
3721 enum tree_code code0
, code1
;
3723 const char *invalid_op_diag
;
3725 /* Expression code to give to the expression when it is built.
3726 Normally this is CODE, which is what the caller asked for,
3727 but in some special cases we change it. */
3728 enum tree_code resultcode
= code
;
3730 /* Data type in which the computation is to be performed.
3731 In the simplest cases this is the common type of the arguments. */
3732 tree result_type
= NULL
;
3734 /* Nonzero means operands have already been type-converted
3735 in whatever way is necessary.
3736 Zero means they need to be converted to RESULT_TYPE. */
3739 /* Nonzero means create the expression with this type, rather than
3741 tree build_type
= 0;
3743 /* Nonzero means after finally constructing the expression
3744 convert it to this type. */
3745 tree final_type
= 0;
3749 /* Nonzero if this is an operation like MIN or MAX which can
3750 safely be computed in short if both args are promoted shorts.
3751 Also implies COMMON.
3752 -1 indicates a bitwise operation; this makes a difference
3753 in the exact conditions for when it is safe to do the operation
3754 in a narrower mode. */
3757 /* Nonzero if this is a comparison operation;
3758 if both args are promoted shorts, compare the original shorts.
3759 Also implies COMMON. */
3760 int short_compare
= 0;
3762 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3765 /* True if both operands have arithmetic type. */
3766 bool arithmetic_types_p
;
3768 /* Apply default conversions. */
3772 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3773 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3774 || code
== TRUTH_XOR_EXPR
)
3776 if (!really_overloaded_fn (op0
))
3777 op0
= decay_conversion (op0
);
3778 if (!really_overloaded_fn (op1
))
3779 op1
= decay_conversion (op1
);
3783 if (!really_overloaded_fn (op0
))
3784 op0
= default_conversion (op0
);
3785 if (!really_overloaded_fn (op1
))
3786 op1
= default_conversion (op1
);
3789 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3790 STRIP_TYPE_NOPS (op0
);
3791 STRIP_TYPE_NOPS (op1
);
3793 /* DTRT if one side is an overloaded function, but complain about it. */
3794 if (type_unknown_p (op0
))
3796 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3797 if (t
!= error_mark_node
)
3799 if (complain
& tf_error
)
3800 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3805 if (type_unknown_p (op1
))
3807 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3808 if (t
!= error_mark_node
)
3810 if (complain
& tf_error
)
3811 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3817 type0
= TREE_TYPE (op0
);
3818 type1
= TREE_TYPE (op1
);
3820 /* The expression codes of the data types of the arguments tell us
3821 whether the arguments are integers, floating, pointers, etc. */
3822 code0
= TREE_CODE (type0
);
3823 code1
= TREE_CODE (type1
);
3825 /* If an error was already reported for one of the arguments,
3826 avoid reporting another error. */
3827 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3828 return error_mark_node
;
3830 if ((invalid_op_diag
3831 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3833 error (invalid_op_diag
);
3834 return error_mark_node
;
3837 /* Issue warnings about peculiar, but valid, uses of NULL. */
3838 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3839 /* It's reasonable to use pointer values as operands of &&
3840 and ||, so NULL is no exception. */
3841 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3842 && ( /* Both are NULL (or 0) and the operation was not a
3843 comparison or a pointer subtraction. */
3844 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3845 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
3846 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3847 || (!null_ptr_cst_p (orig_op0
)
3848 && !TYPE_PTR_P (type0
) && !TYPE_PTR_TO_MEMBER_P (type0
))
3849 || (!null_ptr_cst_p (orig_op1
)
3850 && !TYPE_PTR_P (type1
) && !TYPE_PTR_TO_MEMBER_P (type1
)))
3851 && (complain
& tf_warning
))
3852 /* Some sort of arithmetic operation involving NULL was
3854 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3859 /* Subtraction of two similar pointers.
3860 We must subtract them as integers, then divide by object size. */
3861 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3862 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3864 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3865 /* In all other cases except pointer - int, the usual arithmetic
3867 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3872 /* The pointer - int case is just like pointer + int; fall
3875 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3876 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3880 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3881 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3882 if (processing_template_decl
)
3884 result_type
= TREE_TYPE (ptr_operand
);
3887 return cp_pointer_int_sum (code
,
3898 case TRUNC_DIV_EXPR
:
3900 case FLOOR_DIV_EXPR
:
3901 case ROUND_DIV_EXPR
:
3902 case EXACT_DIV_EXPR
:
3903 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3904 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3905 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3906 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3908 enum tree_code tcode0
= code0
, tcode1
= code1
;
3910 warn_for_div_by_zero (location
, op1
);
3912 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3913 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3914 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3915 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3917 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3918 resultcode
= RDIV_EXPR
;
3920 /* When dividing two signed integers, we have to promote to int.
3921 unless we divide by a constant != -1. Note that default
3922 conversion will have been performed on the operands at this
3923 point, so we have to dig out the original type to find out if
3925 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3926 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3927 || (TREE_CODE (op1
) == INTEGER_CST
3928 && ! integer_all_onesp (op1
)));
3937 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3938 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3939 && !VECTOR_FLOAT_TYPE_P (type0
)
3940 && !VECTOR_FLOAT_TYPE_P (type1
)))
3944 case TRUNC_MOD_EXPR
:
3945 case FLOOR_MOD_EXPR
:
3946 warn_for_div_by_zero (location
, op1
);
3948 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3949 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
3950 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
3952 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3954 /* Although it would be tempting to shorten always here, that loses
3955 on some targets, since the modulo instruction is undefined if the
3956 quotient can't be represented in the computation mode. We shorten
3957 only if unsigned or if dividing by something we know != -1. */
3958 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3959 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3960 || (TREE_CODE (op1
) == INTEGER_CST
3961 && ! integer_all_onesp (op1
)));
3966 case TRUTH_ANDIF_EXPR
:
3967 case TRUTH_ORIF_EXPR
:
3968 case TRUTH_AND_EXPR
:
3970 result_type
= boolean_type_node
;
3973 /* Shift operations: result has same type as first operand;
3974 always convert second operand to int.
3975 Also set SHORT_SHIFT if shifting rightward. */
3978 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3980 result_type
= type0
;
3981 if (TREE_CODE (op1
) == INTEGER_CST
)
3983 if (tree_int_cst_lt (op1
, integer_zero_node
))
3985 if ((complain
& tf_warning
)
3986 && c_inhibit_evaluation_warnings
== 0)
3987 warning (0, "right shift count is negative");
3991 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3992 && (complain
& tf_warning
)
3993 && c_inhibit_evaluation_warnings
== 0)
3994 warning (0, "right shift count >= width of type");
3997 /* Convert the shift-count to an integer, regardless of
3998 size of value being shifted. */
3999 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
4000 op1
= cp_convert (integer_type_node
, op1
);
4001 /* Avoid converting op1 to result_type later. */
4007 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4009 result_type
= type0
;
4010 if (TREE_CODE (op1
) == INTEGER_CST
)
4012 if (tree_int_cst_lt (op1
, integer_zero_node
))
4014 if ((complain
& tf_warning
)
4015 && c_inhibit_evaluation_warnings
== 0)
4016 warning (0, "left shift count is negative");
4018 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
4020 if ((complain
& tf_warning
)
4021 && c_inhibit_evaluation_warnings
== 0)
4022 warning (0, "left shift count >= width of type");
4025 /* Convert the shift-count to an integer, regardless of
4026 size of value being shifted. */
4027 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
4028 op1
= cp_convert (integer_type_node
, op1
);
4029 /* Avoid converting op1 to result_type later. */
4036 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4038 result_type
= type0
;
4039 if (TREE_CODE (op1
) == INTEGER_CST
)
4041 if (tree_int_cst_lt (op1
, integer_zero_node
))
4043 if (complain
& tf_warning
)
4044 warning (0, (code
== LROTATE_EXPR
)
4045 ? G_("left rotate count is negative")
4046 : G_("right rotate count is negative"));
4048 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
4050 if (complain
& tf_warning
)
4051 warning (0, (code
== LROTATE_EXPR
)
4052 ? G_("left rotate count >= width of type")
4053 : G_("right rotate count >= width of type"));
4056 /* Convert the shift-count to an integer, regardless of
4057 size of value being shifted. */
4058 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
4059 op1
= cp_convert (integer_type_node
, op1
);
4065 if ((complain
& tf_warning
)
4066 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
4067 warning (OPT_Wfloat_equal
,
4068 "comparing floating point with == or != is unsafe");
4069 if ((complain
& tf_warning
)
4070 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
4071 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
4072 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4074 build_type
= boolean_type_node
;
4075 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4076 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
4077 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4078 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
4080 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4081 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
4082 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4083 CPO_COMPARISON
, complain
);
4084 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
4085 && null_ptr_cst_p (op1
))
4087 if (TREE_CODE (op0
) == ADDR_EXPR
4088 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
4090 if (complain
& tf_warning
)
4091 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4092 TREE_OPERAND (op0
, 0));
4094 result_type
= type0
;
4096 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
4097 && null_ptr_cst_p (op0
))
4099 if (TREE_CODE (op1
) == ADDR_EXPR
4100 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
4102 if (complain
& tf_warning
)
4103 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4104 TREE_OPERAND (op1
, 0));
4106 result_type
= type1
;
4108 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4109 /* One of the operands must be of nullptr_t type. */
4110 result_type
= TREE_TYPE (nullptr_node
);
4111 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4113 result_type
= type0
;
4114 if (complain
& tf_error
)
4115 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4117 return error_mark_node
;
4119 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4121 result_type
= type1
;
4122 if (complain
& tf_error
)
4123 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4125 return error_mark_node
;
4127 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
4129 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4130 == ptrmemfunc_vbit_in_delta
)
4132 tree pfn0
= pfn_from_ptrmemfunc (op0
);
4133 tree delta0
= delta_from_ptrmemfunc (op0
);
4134 tree e1
= cp_build_binary_op (location
,
4137 fold_convert (TREE_TYPE (pfn0
),
4140 tree e2
= cp_build_binary_op (location
,
4145 e2
= cp_build_binary_op (location
,
4146 EQ_EXPR
, e2
, integer_zero_node
,
4148 op0
= cp_build_binary_op (location
,
4149 TRUTH_ANDIF_EXPR
, e1
, e2
,
4151 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
4155 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4156 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
4158 result_type
= TREE_TYPE (op0
);
4160 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4161 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4162 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4165 /* E will be the final comparison. */
4167 /* E1 and E2 are for scratch. */
4175 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4176 CPO_COMPARISON
, complain
);
4178 if (!same_type_p (TREE_TYPE (op0
), type
))
4179 op0
= cp_convert_and_check (type
, op0
);
4180 if (!same_type_p (TREE_TYPE (op1
), type
))
4181 op1
= cp_convert_and_check (type
, op1
);
4183 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4184 return error_mark_node
;
4186 if (TREE_SIDE_EFFECTS (op0
))
4187 op0
= save_expr (op0
);
4188 if (TREE_SIDE_EFFECTS (op1
))
4189 op1
= save_expr (op1
);
4191 pfn0
= pfn_from_ptrmemfunc (op0
);
4192 pfn1
= pfn_from_ptrmemfunc (op1
);
4193 delta0
= delta_from_ptrmemfunc (op0
);
4194 delta1
= delta_from_ptrmemfunc (op1
);
4195 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4196 == ptrmemfunc_vbit_in_delta
)
4201 && ((op0.delta == op1.delta)
4202 || (!op0.pfn && op0.delta & 1 == 0
4203 && op1.delta & 1 == 0))
4205 The reason for the `!op0.pfn' bit is that a NULL
4206 pointer-to-member is any member with a zero PFN and
4207 LSB of the DELTA field is 0. */
4209 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4213 e1
= cp_build_binary_op (location
,
4214 EQ_EXPR
, e1
, integer_zero_node
,
4216 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4220 e2
= cp_build_binary_op (location
,
4221 EQ_EXPR
, e2
, integer_zero_node
,
4223 e1
= cp_build_binary_op (location
,
4224 TRUTH_ANDIF_EXPR
, e2
, e1
,
4226 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4228 fold_convert (TREE_TYPE (pfn0
),
4231 e2
= cp_build_binary_op (location
,
4232 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4233 e1
= cp_build_binary_op (location
,
4234 EQ_EXPR
, delta0
, delta1
, complain
);
4235 e1
= cp_build_binary_op (location
,
4236 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4243 && (!op0.pfn || op0.delta == op1.delta))
4245 The reason for the `!op0.pfn' bit is that a NULL
4246 pointer-to-member is any member with a zero PFN; the
4247 DELTA field is unspecified. */
4249 e1
= cp_build_binary_op (location
,
4250 EQ_EXPR
, delta0
, delta1
, complain
);
4251 e2
= cp_build_binary_op (location
,
4254 fold_convert (TREE_TYPE (pfn0
),
4257 e1
= cp_build_binary_op (location
,
4258 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4260 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4261 e
= cp_build_binary_op (location
,
4262 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4263 if (code
== EQ_EXPR
)
4265 return cp_build_binary_op (location
,
4266 EQ_EXPR
, e
, integer_zero_node
, complain
);
4270 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4271 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4273 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4274 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4282 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4283 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4285 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4286 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4287 CPO_COMPARISON
, complain
);
4294 if (TREE_CODE (orig_op0
) == STRING_CST
4295 || TREE_CODE (orig_op1
) == STRING_CST
)
4297 if (complain
& tf_warning
)
4298 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4301 build_type
= boolean_type_node
;
4302 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4303 || code0
== ENUMERAL_TYPE
)
4304 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4305 || code1
== ENUMERAL_TYPE
))
4307 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4308 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4309 CPO_COMPARISON
, complain
);
4310 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4311 result_type
= type0
;
4312 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4313 result_type
= type1
;
4314 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4315 /* One of the operands must be of nullptr_t type. */
4316 result_type
= TREE_TYPE (nullptr_node
);
4317 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4319 result_type
= type0
;
4320 if (complain
& tf_error
)
4321 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4323 return error_mark_node
;
4325 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4327 result_type
= type1
;
4328 if (complain
& tf_error
)
4329 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4331 return error_mark_node
;
4335 case UNORDERED_EXPR
:
4342 build_type
= integer_type_node
;
4343 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4345 if (complain
& tf_error
)
4346 error ("unordered comparison on non-floating point argument");
4347 return error_mark_node
;
4356 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4357 || code0
== ENUMERAL_TYPE
)
4358 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4359 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4360 arithmetic_types_p
= 1;
4363 arithmetic_types_p
= 0;
4364 /* Vector arithmetic is only allowed when both sides are vectors. */
4365 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4367 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4368 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4371 binary_op_error (location
, code
, type0
, type1
);
4372 return error_mark_node
;
4374 arithmetic_types_p
= 1;
4377 /* Determine the RESULT_TYPE, if it is not already known. */
4379 && arithmetic_types_p
4380 && (shorten
|| common
|| short_compare
))
4382 result_type
= cp_common_type (type0
, type1
);
4383 do_warn_double_promotion (result_type
, type0
, type1
,
4384 "implicit conversion from %qT to %qT "
4385 "to match other operand of binary "
4392 if (complain
& tf_error
)
4393 error ("invalid operands of types %qT and %qT to binary %qO",
4394 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4395 return error_mark_node
;
4398 /* If we're in a template, the only thing we need to know is the
4400 if (processing_template_decl
)
4402 /* Since the middle-end checks the type when doing a build2, we
4403 need to build the tree in pieces. This built tree will never
4404 get out of the front-end as we replace it when instantiating
4406 tree tmp
= build2 (resultcode
,
4407 build_type
? build_type
: result_type
,
4409 TREE_OPERAND (tmp
, 0) = op0
;
4413 if (arithmetic_types_p
)
4415 bool first_complex
= (code0
== COMPLEX_TYPE
);
4416 bool second_complex
= (code1
== COMPLEX_TYPE
);
4417 int none_complex
= (!first_complex
&& !second_complex
);
4419 /* Adapted from patch for c/24581. */
4420 if (first_complex
!= second_complex
4421 && (code
== PLUS_EXPR
4422 || code
== MINUS_EXPR
4423 || code
== MULT_EXPR
4424 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4425 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4426 && flag_signed_zeros
)
4428 /* An operation on mixed real/complex operands must be
4429 handled specially, but the language-independent code can
4430 more easily optimize the plain complex arithmetic if
4431 -fno-signed-zeros. */
4432 tree real_type
= TREE_TYPE (result_type
);
4436 if (TREE_TYPE (op0
) != result_type
)
4437 op0
= cp_convert_and_check (result_type
, op0
);
4438 if (TREE_TYPE (op1
) != real_type
)
4439 op1
= cp_convert_and_check (real_type
, op1
);
4443 if (TREE_TYPE (op0
) != real_type
)
4444 op0
= cp_convert_and_check (real_type
, op0
);
4445 if (TREE_TYPE (op1
) != result_type
)
4446 op1
= cp_convert_and_check (result_type
, op1
);
4448 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4449 return error_mark_node
;
4452 op0
= save_expr (op0
);
4453 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4454 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4458 case TRUNC_DIV_EXPR
:
4459 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4463 real
= build2 (resultcode
, real_type
, real
, op1
);
4471 op1
= save_expr (op1
);
4472 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4473 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4477 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4480 real
= build2 (resultcode
, real_type
, op0
, real
);
4483 real
= build2 (resultcode
, real_type
, op0
, real
);
4484 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4490 return build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4493 /* For certain operations (which identify themselves by shorten != 0)
4494 if both args were extended from the same smaller type,
4495 do the arithmetic in that type and then extend.
4497 shorten !=0 and !=1 indicates a bitwise operation.
4498 For them, this optimization is safe only if
4499 both args are zero-extended or both are sign-extended.
4500 Otherwise, we might change the result.
4501 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4502 but calculated in (unsigned short) it would be (unsigned short)-1. */
4504 if (shorten
&& none_complex
)
4506 final_type
= result_type
;
4507 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4511 /* Comparison operations are shortened too but differently.
4512 They identify themselves by setting short_compare = 1. */
4516 /* Don't write &op0, etc., because that would prevent op0
4517 from being kept in a register.
4518 Instead, make copies of the our local variables and
4519 pass the copies by reference, then copy them back afterward. */
4520 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4521 enum tree_code xresultcode
= resultcode
;
4523 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4525 return cp_convert (boolean_type_node
, val
);
4526 op0
= xop0
, op1
= xop1
;
4528 resultcode
= xresultcode
;
4531 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4532 && warn_sign_compare
4533 && !TREE_NO_WARNING (orig_op0
)
4534 && !TREE_NO_WARNING (orig_op1
)
4535 /* Do not warn until the template is instantiated; we cannot
4536 bound the ranges of the arguments until that point. */
4537 && !processing_template_decl
4538 && (complain
& tf_warning
)
4539 && c_inhibit_evaluation_warnings
== 0)
4541 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4542 result_type
, resultcode
);
4546 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4547 Then the expression will be built.
4548 It will be given type FINAL_TYPE if that is nonzero;
4549 otherwise, it will be given type RESULT_TYPE. */
4552 if (TREE_TYPE (op0
) != result_type
)
4553 op0
= cp_convert_and_check (result_type
, op0
);
4554 if (TREE_TYPE (op1
) != result_type
)
4555 op1
= cp_convert_and_check (result_type
, op1
);
4557 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4558 return error_mark_node
;
4561 if (build_type
== NULL_TREE
)
4562 build_type
= result_type
;
4564 result
= build2 (resultcode
, build_type
, op0
, op1
);
4565 result
= fold_if_not_in_template (result
);
4566 if (final_type
!= 0)
4567 result
= cp_convert (final_type
, result
);
4569 if (TREE_OVERFLOW_P (result
)
4570 && !TREE_OVERFLOW_P (op0
)
4571 && !TREE_OVERFLOW_P (op1
))
4572 overflow_warning (location
, result
);
4577 /* Return a tree for the sum or difference (RESULTCODE says which)
4578 of pointer PTROP and integer INTOP. */
4581 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4583 tree res_type
= TREE_TYPE (ptrop
);
4585 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4586 in certain circumstance (when it's valid to do so). So we need
4587 to make sure it's complete. We don't need to check here, if we
4588 can actually complete it at all, as those checks will be done in
4589 pointer_int_sum() anyway. */
4590 complete_type (TREE_TYPE (res_type
));
4592 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4593 fold_if_not_in_template (intop
));
4596 /* Return a tree for the difference of pointers OP0 and OP1.
4597 The resulting tree has type int. */
4600 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4603 tree restype
= ptrdiff_type_node
;
4604 tree target_type
= TREE_TYPE (ptrtype
);
4606 if (!complete_type_or_else (target_type
, NULL_TREE
))
4607 return error_mark_node
;
4609 if (TREE_CODE (target_type
) == VOID_TYPE
)
4610 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4611 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4612 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4613 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4614 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4616 /* First do the subtraction as integers;
4617 then drop through to build the divide operator. */
4619 op0
= cp_build_binary_op (input_location
,
4621 cp_convert (restype
, op0
),
4622 cp_convert (restype
, op1
),
4623 tf_warning_or_error
);
4625 /* This generates an error if op1 is a pointer to an incomplete type. */
4626 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4627 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4629 op1
= (TYPE_PTROB_P (ptrtype
)
4630 ? size_in_bytes (target_type
)
4631 : integer_one_node
);
4633 /* Do the division. */
4635 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4636 return fold_if_not_in_template (result
);
4639 /* Construct and perhaps optimize a tree representation
4640 for a unary operation. CODE, a tree_code, specifies the operation
4641 and XARG is the operand. */
4644 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4646 tree orig_expr
= xarg
;
4650 if (processing_template_decl
)
4652 if (type_dependent_expression_p (xarg
))
4653 return build_min_nt (code
, xarg
, NULL_TREE
);
4655 xarg
= build_non_dependent_expr (xarg
);
4660 /* [expr.unary.op] says:
4662 The address of an object of incomplete type can be taken.
4664 (And is just the ordinary address operator, not an overloaded
4665 "operator &".) However, if the type is a template
4666 specialization, we must complete the type at this point so that
4667 an overloaded "operator &" will be available if required. */
4668 if (code
== ADDR_EXPR
4669 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4670 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4671 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4672 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4673 /* Don't look for a function. */;
4675 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4676 /*overloaded_p=*/NULL
, complain
);
4677 if (!exp
&& code
== ADDR_EXPR
)
4679 if (is_overloaded_fn (xarg
))
4681 tree fn
= get_first_fn (xarg
);
4682 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4684 error (DECL_CONSTRUCTOR_P (fn
)
4685 ? G_("taking address of constructor %qE")
4686 : G_("taking address of destructor %qE"),
4688 return error_mark_node
;
4692 /* A pointer to member-function can be formed only by saying
4694 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4695 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4697 if (TREE_CODE (xarg
) != OFFSET_REF
4698 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4700 error ("invalid use of %qE to form a pointer-to-member-function",
4702 if (TREE_CODE (xarg
) != OFFSET_REF
)
4703 inform (input_location
, " a qualified-id is required");
4704 return error_mark_node
;
4708 error ("parentheses around %qE cannot be used to form a"
4709 " pointer-to-member-function",
4711 PTRMEM_OK_P (xarg
) = 1;
4715 if (TREE_CODE (xarg
) == OFFSET_REF
)
4717 ptrmem
= PTRMEM_OK_P (xarg
);
4719 if (!ptrmem
&& !flag_ms_extensions
4720 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4722 /* A single non-static member, make sure we don't allow a
4723 pointer-to-member. */
4724 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4725 TREE_OPERAND (xarg
, 0),
4726 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4727 PTRMEM_OK_P (xarg
) = ptrmem
;
4731 exp
= cp_build_addr_expr_strict (xarg
, complain
);
4734 if (processing_template_decl
&& exp
!= error_mark_node
)
4735 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4736 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4737 if (TREE_CODE (exp
) == ADDR_EXPR
)
4738 PTRMEM_OK_P (exp
) = ptrmem
;
4742 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4743 constants, where a null value is represented by an INTEGER_CST of
4747 cp_truthvalue_conversion (tree expr
)
4749 tree type
= TREE_TYPE (expr
);
4750 if (TYPE_PTRMEM_P (type
))
4751 return build_binary_op (EXPR_LOCATION (expr
),
4752 NE_EXPR
, expr
, integer_zero_node
, 1);
4754 return c_common_truthvalue_conversion (input_location
, expr
);
4757 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4760 condition_conversion (tree expr
)
4763 if (processing_template_decl
)
4765 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4766 tf_warning_or_error
, LOOKUP_NORMAL
);
4767 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4771 /* Returns the address of T. This function will fold away
4772 ADDR_EXPR of INDIRECT_REF. */
4775 build_address (tree t
)
4777 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4778 return error_mark_node
;
4779 t
= build_fold_addr_expr (t
);
4780 if (TREE_CODE (t
) != ADDR_EXPR
)
4785 /* Returns the address of T with type TYPE. */
4788 build_typed_address (tree t
, tree type
)
4790 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4791 return error_mark_node
;
4792 t
= build_fold_addr_expr_with_type (t
, type
);
4793 if (TREE_CODE (t
) != ADDR_EXPR
)
4798 /* Return a NOP_EXPR converting EXPR to TYPE. */
4801 build_nop (tree type
, tree expr
)
4803 if (type
== error_mark_node
|| error_operand_p (expr
))
4805 return build1 (NOP_EXPR
, type
, expr
);
4808 /* Take the address of ARG, whatever that means under C++ semantics.
4809 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
4810 and class rvalues as well.
4812 Nothing should call this function directly; instead, callers should use
4813 cp_build_addr_expr or cp_build_addr_expr_strict. */
4816 cp_build_addr_expr_1 (tree arg
, bool strict_lvalue
, tsubst_flags_t complain
)
4821 if (!arg
|| error_operand_p (arg
))
4822 return error_mark_node
;
4824 arg
= mark_lvalue_use (arg
);
4825 argtype
= lvalue_type (arg
);
4827 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
4828 || !IDENTIFIER_OPNAME_P (arg
));
4830 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
4831 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
4833 /* They're trying to take the address of a unique non-static
4834 member function. This is ill-formed (except in MS-land),
4835 but let's try to DTRT.
4836 Note: We only handle unique functions here because we don't
4837 want to complain if there's a static overload; non-unique
4838 cases will be handled by instantiate_type. But we need to
4839 handle this case here to allow casts on the resulting PMF.
4840 We could defer this in non-MS mode, but it's easier to give
4841 a useful error here. */
4843 /* Inside constant member functions, the `this' pointer
4844 contains an extra const qualifier. TYPE_MAIN_VARIANT
4845 is used here to remove this const from the diagnostics
4846 and the created OFFSET_REF. */
4847 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
4848 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
4851 if (! flag_ms_extensions
)
4853 tree name
= DECL_NAME (fn
);
4854 if (!(complain
& tf_error
))
4855 return error_mark_node
;
4856 else if (current_class_type
4857 && TREE_OPERAND (arg
, 0) == current_class_ref
)
4858 /* An expression like &memfn. */
4859 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
4860 " or parenthesized non-static member function to form"
4861 " a pointer to member function. Say %<&%T::%D%>",
4864 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
4865 " function to form a pointer to member function."
4869 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
4872 /* Uninstantiated types are all functions. Taking the
4873 address of a function is a no-op, so just return the
4875 if (type_unknown_p (arg
))
4876 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4878 if (TREE_CODE (arg
) == OFFSET_REF
)
4879 /* We want a pointer to member; bypass all the code for actually taking
4880 the address of something. */
4883 /* Anything not already handled and not a true memory reference
4885 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4886 && TREE_CODE (argtype
) != METHOD_TYPE
)
4888 cp_lvalue_kind kind
= lvalue_kind (arg
);
4889 if (kind
== clk_none
)
4891 if (complain
& tf_error
)
4892 lvalue_error (lv_addressof
);
4893 return error_mark_node
;
4895 if (strict_lvalue
&& (kind
& (clk_rvalueref
|clk_class
)))
4897 if (!(complain
& tf_error
))
4898 return error_mark_node
;
4899 if (kind
& clk_class
)
4900 /* Make this a permerror because we used to accept it. */
4901 permerror (input_location
, "taking address of temporary");
4903 error ("taking address of xvalue (rvalue reference)");
4907 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4909 tree type
= build_pointer_type (TREE_TYPE (argtype
));
4910 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4913 else if (pedantic
&& DECL_MAIN_P (arg
))
4916 /* Apparently a lot of autoconf scripts for C++ packages do this,
4917 so only complain if -pedantic. */
4918 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
4919 pedwarn (input_location
, OPT_pedantic
,
4920 "ISO C++ forbids taking address of function %<::main%>");
4921 else if (flag_pedantic_errors
)
4922 return error_mark_node
;
4925 /* Let &* cancel out to simplify resulting code. */
4926 if (TREE_CODE (arg
) == INDIRECT_REF
)
4928 /* We don't need to have `current_class_ptr' wrapped in a
4929 NON_LVALUE_EXPR node. */
4930 if (arg
== current_class_ref
)
4931 return current_class_ptr
;
4933 arg
= TREE_OPERAND (arg
, 0);
4934 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
4936 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
4937 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4940 /* Don't let this be an lvalue. */
4945 /* ??? Cope with user tricks that amount to offsetof. */
4946 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4947 && TREE_CODE (argtype
) != METHOD_TYPE
4948 && argtype
!= unknown_type_node
4949 && (val
= get_base_address (arg
))
4950 && TREE_CODE (val
) == INDIRECT_REF
4951 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
4953 tree type
= build_pointer_type (argtype
);
4954 tree op0
= fold_convert (type
, TREE_OPERAND (val
, 0));
4955 tree op1
= fold_convert (sizetype
, fold_offsetof (arg
, val
));
4956 return fold_build2 (POINTER_PLUS_EXPR
, type
, op0
, op1
);
4959 /* Handle complex lvalues (when permitted)
4960 by reduction to simpler cases. */
4961 val
= unary_complex_lvalue (ADDR_EXPR
, arg
);
4965 switch (TREE_CODE (arg
))
4969 case FIX_TRUNC_EXPR
:
4970 /* Even if we're not being pedantic, we cannot allow this
4971 extension when we're instantiating in a SFINAE
4973 if (! lvalue_p (arg
) && complain
== tf_none
)
4975 if (complain
& tf_error
)
4976 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4978 return error_mark_node
;
4983 arg
= BASELINK_FUNCTIONS (arg
);
4987 arg
= OVL_CURRENT (arg
);
4992 /* Turn a reference to a non-static data member into a
4993 pointer-to-member. */
4998 gcc_assert (PTRMEM_OK_P (arg
));
5000 t
= TREE_OPERAND (arg
, 1);
5001 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
5003 if (complain
& tf_error
)
5004 error ("cannot create pointer to reference member %qD", t
);
5005 return error_mark_node
;
5008 type
= build_ptrmem_type (context_for_name_lookup (t
),
5010 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
5018 if (argtype
!= error_mark_node
)
5019 argtype
= build_pointer_type (argtype
);
5021 /* In a template, we are processing a non-dependent expression
5022 so we can just form an ADDR_EXPR with the correct type. */
5023 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
5025 val
= build_address (arg
);
5026 if (TREE_CODE (arg
) == OFFSET_REF
)
5027 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
5029 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
5031 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
5033 /* We can only get here with a single static member
5035 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
5036 && DECL_STATIC_FUNCTION_P (fn
));
5038 val
= build_address (fn
);
5039 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
5040 /* Do not lose object's side effects. */
5041 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
5042 TREE_OPERAND (arg
, 0), val
);
5044 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
5046 if (complain
& tf_error
)
5047 error ("attempt to take address of bit-field structure member %qD",
5048 TREE_OPERAND (arg
, 1));
5049 return error_mark_node
;
5053 tree object
= TREE_OPERAND (arg
, 0);
5054 tree field
= TREE_OPERAND (arg
, 1);
5055 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5056 (TREE_TYPE (object
), decl_type_context (field
)));
5057 val
= build_address (arg
);
5060 if (TREE_CODE (argtype
) == POINTER_TYPE
5061 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
5063 build_ptrmemfunc_type (argtype
);
5064 val
= build_ptrmemfunc (argtype
, val
, 0,
5066 tf_warning_or_error
);
5072 /* Take the address of ARG if it has one, even if it's an rvalue. */
5075 cp_build_addr_expr (tree arg
, tsubst_flags_t complain
)
5077 return cp_build_addr_expr_1 (arg
, 0, complain
);
5080 /* Take the address of ARG, but only if it's an lvalue. */
5083 cp_build_addr_expr_strict (tree arg
, tsubst_flags_t complain
)
5085 return cp_build_addr_expr_1 (arg
, 1, complain
);
5088 /* C++: Must handle pointers to members.
5090 Perhaps type instantiation should be extended to handle conversion
5091 from aggregates to types we don't yet know we want? (Or are those
5092 cases typically errors which should be reported?)
5094 NOCONVERT nonzero suppresses the default promotions
5095 (such as from short to int). */
5098 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
5099 tsubst_flags_t complain
)
5101 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
5104 const char *errstring
= NULL
;
5106 const char *invalid_op_diag
;
5108 if (!arg
|| error_operand_p (arg
))
5109 return error_mark_node
;
5111 if ((invalid_op_diag
5112 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
5117 error (invalid_op_diag
);
5118 return error_mark_node
;
5123 case UNARY_PLUS_EXPR
:
5126 int flags
= WANT_ARITH
| WANT_ENUM
;
5127 /* Unary plus (but not unary minus) is allowed on pointers. */
5128 if (code
== UNARY_PLUS_EXPR
)
5129 flags
|= WANT_POINTER
;
5130 arg
= build_expr_type_conversion (flags
, arg
, true);
5132 errstring
= (code
== NEGATE_EXPR
5133 ? _("wrong type argument to unary minus")
5134 : _("wrong type argument to unary plus"));
5137 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5138 arg
= perform_integral_promotions (arg
);
5140 /* Make sure the result is not an lvalue: a unary plus or minus
5141 expression is always a rvalue. */
5148 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5152 arg
= default_conversion (arg
);
5154 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
5155 | WANT_VECTOR_OR_COMPLEX
,
5157 errstring
= _("wrong type argument to bit-complement");
5158 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5159 arg
= perform_integral_promotions (arg
);
5163 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5164 errstring
= _("wrong type argument to abs");
5165 else if (!noconvert
)
5166 arg
= default_conversion (arg
);
5170 /* Conjugating a real value is a no-op, but allow it anyway. */
5171 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5172 errstring
= _("wrong type argument to conjugation");
5173 else if (!noconvert
)
5174 arg
= default_conversion (arg
);
5177 case TRUTH_NOT_EXPR
:
5178 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
5180 val
= invert_truthvalue_loc (input_location
, arg
);
5181 if (arg
!= error_mark_node
)
5183 errstring
= _("in argument to unary !");
5190 if (TREE_CODE (arg
) == COMPLEX_CST
)
5191 return TREE_REALPART (arg
);
5192 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5194 arg
= build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
5195 return fold_if_not_in_template (arg
);
5201 if (TREE_CODE (arg
) == COMPLEX_CST
)
5202 return TREE_IMAGPART (arg
);
5203 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5205 arg
= build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
5206 return fold_if_not_in_template (arg
);
5209 return cp_convert (TREE_TYPE (arg
), integer_zero_node
);
5211 case PREINCREMENT_EXPR
:
5212 case POSTINCREMENT_EXPR
:
5213 case PREDECREMENT_EXPR
:
5214 case POSTDECREMENT_EXPR
:
5215 /* Handle complex lvalues (when permitted)
5216 by reduction to simpler cases. */
5218 val
= unary_complex_lvalue (code
, arg
);
5222 arg
= mark_lvalue_use (arg
);
5224 /* Increment or decrement the real part of the value,
5225 and don't change the imaginary part. */
5226 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5230 arg
= stabilize_reference (arg
);
5231 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
5232 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
5233 real
= cp_build_unary_op (code
, real
, 1, complain
);
5234 if (real
== error_mark_node
|| imag
== error_mark_node
)
5235 return error_mark_node
;
5236 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
5240 /* Report invalid types. */
5242 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
5245 if (code
== PREINCREMENT_EXPR
)
5246 errstring
= _("no pre-increment operator for type");
5247 else if (code
== POSTINCREMENT_EXPR
)
5248 errstring
= _("no post-increment operator for type");
5249 else if (code
== PREDECREMENT_EXPR
)
5250 errstring
= _("no pre-decrement operator for type");
5252 errstring
= _("no post-decrement operator for type");
5255 else if (arg
== error_mark_node
)
5256 return error_mark_node
;
5258 /* Report something read-only. */
5260 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
5261 || TREE_READONLY (arg
))
5263 if (complain
& tf_error
)
5264 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
5265 || code
== POSTINCREMENT_EXPR
)
5266 ? REK_INCREMENT
: REK_DECREMENT
));
5268 return error_mark_node
;
5273 tree declared_type
= unlowered_expr_type (arg
);
5275 argtype
= TREE_TYPE (arg
);
5277 /* ARM $5.2.5 last annotation says this should be forbidden. */
5278 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
5280 if (complain
& tf_error
)
5281 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
5282 ? G_("ISO C++ forbids incrementing an enum")
5283 : G_("ISO C++ forbids decrementing an enum"));
5285 return error_mark_node
;
5288 /* Compute the increment. */
5290 if (TREE_CODE (argtype
) == POINTER_TYPE
)
5292 tree type
= complete_type (TREE_TYPE (argtype
));
5294 if (!COMPLETE_OR_VOID_TYPE_P (type
))
5296 if (complain
& tf_error
)
5297 error (((code
== PREINCREMENT_EXPR
5298 || code
== POSTINCREMENT_EXPR
))
5299 ? G_("cannot increment a pointer to incomplete type %qT")
5300 : G_("cannot decrement a pointer to incomplete type %qT"),
5301 TREE_TYPE (argtype
));
5303 return error_mark_node
;
5305 else if ((pedantic
|| warn_pointer_arith
)
5306 && !TYPE_PTROB_P (argtype
))
5308 if (complain
& tf_error
)
5309 permerror (input_location
, (code
== PREINCREMENT_EXPR
5310 || code
== POSTINCREMENT_EXPR
)
5311 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
5312 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
5315 return error_mark_node
;
5318 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
5321 inc
= integer_one_node
;
5323 inc
= cp_convert (argtype
, inc
);
5325 /* Complain about anything else that is not a true lvalue. */
5326 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
5327 || code
== POSTINCREMENT_EXPR
)
5328 ? lv_increment
: lv_decrement
),
5330 return error_mark_node
;
5332 /* Forbid using -- on `bool'. */
5333 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
5335 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
5337 if (complain
& tf_error
)
5338 error ("invalid use of Boolean expression as operand "
5339 "to %<operator--%>");
5340 return error_mark_node
;
5342 val
= boolean_increment (code
, arg
);
5345 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
5347 TREE_SIDE_EFFECTS (val
) = 1;
5352 /* Note that this operation never does default_conversion
5353 regardless of NOCONVERT. */
5354 return cp_build_addr_expr (arg
, complain
);
5363 argtype
= TREE_TYPE (arg
);
5364 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5367 if (complain
& tf_error
)
5368 error ("%s", errstring
);
5369 return error_mark_node
;
5372 /* Hook for the c-common bits that build a unary op. */
5374 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5375 enum tree_code code
, tree xarg
, int noconvert
)
5377 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5380 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5381 for certain kinds of expressions which are not really lvalues
5382 but which we can accept as lvalues.
5384 If ARG is not a kind of expression we can handle, return
5388 unary_complex_lvalue (enum tree_code code
, tree arg
)
5390 /* Inside a template, making these kinds of adjustments is
5391 pointless; we are only concerned with the type of the
5393 if (processing_template_decl
)
5396 /* Handle (a, b) used as an "lvalue". */
5397 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5399 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5400 tf_warning_or_error
);
5401 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5402 TREE_OPERAND (arg
, 0), real_result
);
5405 /* Handle (a ? b : c) used as an "lvalue". */
5406 if (TREE_CODE (arg
) == COND_EXPR
5407 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5408 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5410 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5411 if (TREE_CODE (arg
) == MODIFY_EXPR
5412 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5413 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5415 tree lvalue
= TREE_OPERAND (arg
, 0);
5416 if (TREE_SIDE_EFFECTS (lvalue
))
5418 lvalue
= stabilize_reference (lvalue
);
5419 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5420 lvalue
, TREE_OPERAND (arg
, 1));
5422 return unary_complex_lvalue
5423 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5426 if (code
!= ADDR_EXPR
)
5429 /* Handle (a = b) used as an "lvalue" for `&'. */
5430 if (TREE_CODE (arg
) == MODIFY_EXPR
5431 || TREE_CODE (arg
) == INIT_EXPR
)
5433 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5434 tf_warning_or_error
);
5435 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5437 TREE_NO_WARNING (arg
) = 1;
5441 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5442 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5443 || TREE_CODE (arg
) == OFFSET_REF
)
5446 /* We permit compiler to make function calls returning
5447 objects of aggregate type look like lvalues. */
5451 if (TREE_CODE (targ
) == SAVE_EXPR
)
5452 targ
= TREE_OPERAND (targ
, 0);
5454 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5456 if (TREE_CODE (arg
) == SAVE_EXPR
)
5459 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
5460 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5463 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5464 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5465 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5468 /* Don't let anything else be handled specially. */
5472 /* Mark EXP saying that we need to be able to take the
5473 address of it; it should not be allocated in a register.
5474 Value is true if successful.
5476 C++: we do not allow `current_class_ptr' to be addressable. */
5479 cxx_mark_addressable (tree exp
)
5484 switch (TREE_CODE (x
))
5491 x
= TREE_OPERAND (x
, 0);
5495 if (x
== current_class_ptr
)
5497 error ("cannot take the address of %<this%>, which is an rvalue expression");
5498 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5504 /* Caller should not be trying to mark initialized
5505 constant fields addressable. */
5506 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5507 || DECL_IN_AGGR_P (x
) == 0
5509 || DECL_EXTERNAL (x
));
5514 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5515 && !DECL_ARTIFICIAL (x
))
5517 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5520 ("address of explicit register variable %qD requested", x
);
5523 else if (extra_warnings
)
5525 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5527 TREE_ADDRESSABLE (x
) = 1;
5531 TREE_ADDRESSABLE (x
) = 1;
5535 TREE_ADDRESSABLE (x
) = 1;
5539 TREE_ADDRESSABLE (x
) = 1;
5540 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5548 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5551 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5552 tsubst_flags_t complain
)
5554 tree orig_ifexp
= ifexp
;
5555 tree orig_op1
= op1
;
5556 tree orig_op2
= op2
;
5559 if (processing_template_decl
)
5561 /* The standard says that the expression is type-dependent if
5562 IFEXP is type-dependent, even though the eventual type of the
5563 expression doesn't dependent on IFEXP. */
5564 if (type_dependent_expression_p (ifexp
)
5565 /* As a GNU extension, the middle operand may be omitted. */
5566 || (op1
&& type_dependent_expression_p (op1
))
5567 || type_dependent_expression_p (op2
))
5568 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5569 ifexp
= build_non_dependent_expr (ifexp
);
5571 op1
= build_non_dependent_expr (op1
);
5572 op2
= build_non_dependent_expr (op2
);
5575 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5576 if (processing_template_decl
&& expr
!= error_mark_node
)
5577 return build_min_non_dep (COND_EXPR
, expr
,
5578 orig_ifexp
, orig_op1
, orig_op2
);
5582 /* Given a list of expressions, return a compound expression
5583 that performs them all and returns the value of the last of them. */
5586 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
,
5587 tsubst_flags_t complain
)
5589 tree expr
= TREE_VALUE (list
);
5591 if (TREE_CHAIN (list
))
5593 if (complain
& tf_error
)
5597 permerror (input_location
, "expression list treated as compound "
5598 "expression in initializer");
5601 permerror (input_location
, "expression list treated as compound "
5602 "expression in mem-initializer");
5605 permerror (input_location
, "expression list treated as compound "
5606 "expression in functional cast");
5612 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5613 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5620 /* Like build_x_compound_expr_from_list, but using a VEC. */
5623 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5625 if (VEC_empty (tree
, vec
))
5627 else if (VEC_length (tree
, vec
) == 1)
5628 return VEC_index (tree
, vec
, 0);
5636 permerror (input_location
,
5637 "%s expression list treated as compound expression",
5640 expr
= VEC_index (tree
, vec
, 0);
5641 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5642 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5648 /* Handle overloading of the ',' operator when needed. */
5651 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5654 tree orig_op1
= op1
;
5655 tree orig_op2
= op2
;
5657 if (processing_template_decl
)
5659 if (type_dependent_expression_p (op1
)
5660 || type_dependent_expression_p (op2
))
5661 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5662 op1
= build_non_dependent_expr (op1
);
5663 op2
= build_non_dependent_expr (op2
);
5666 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5667 /*overloaded_p=*/NULL
, complain
);
5669 result
= cp_build_compound_expr (op1
, op2
, complain
);
5671 if (processing_template_decl
&& result
!= error_mark_node
)
5672 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5677 /* Like cp_build_compound_expr, but for the c-common bits. */
5680 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5682 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5685 /* Build a compound expression. */
5688 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5690 lhs
= convert_to_void (lhs
, ICV_LEFT_OF_COMMA
, complain
);
5692 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5693 return error_mark_node
;
5695 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5697 /* If the rhs is a TARGET_EXPR, then build the compound
5698 expression inside the target_expr's initializer. This
5699 helps the compiler to eliminate unnecessary temporaries. */
5700 tree init
= TREE_OPERAND (rhs
, 1);
5702 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5703 TREE_OPERAND (rhs
, 1) = init
;
5708 if (type_unknown_p (rhs
))
5710 error ("no context to resolve type of %qE", rhs
);
5711 return error_mark_node
;
5714 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5717 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5718 casts away constness. CAST gives the type of cast.
5720 ??? This function warns for casting away any qualifier not just
5721 const. We would like to specify exactly what qualifiers are casted
5726 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5727 enum tree_code cast
)
5729 /* C-style casts are allowed to cast away constness. With
5730 WARN_CAST_QUAL, we still want to issue a warning. */
5731 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5734 if (!casts_away_constness (src_type
, dest_type
))
5740 warning (OPT_Wcast_qual
,
5741 "cast from type %qT to type %qT casts away qualifiers",
5742 src_type
, dest_type
);
5745 case STATIC_CAST_EXPR
:
5746 error ("static_cast from type %qT to type %qT casts away qualifiers",
5747 src_type
, dest_type
);
5750 case REINTERPRET_CAST_EXPR
:
5751 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5752 src_type
, dest_type
);
5759 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5760 (another pointer-to-member type in the same hierarchy) and return
5761 the converted expression. If ALLOW_INVERSE_P is permitted, a
5762 pointer-to-derived may be converted to pointer-to-base; otherwise,
5763 only the other direction is permitted. If C_CAST_P is true, this
5764 conversion is taking place as part of a C-style cast. */
5767 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5768 bool c_cast_p
, tsubst_flags_t complain
)
5770 if (TYPE_PTRMEM_P (type
))
5774 if (TREE_CODE (expr
) == PTRMEM_CST
)
5775 expr
= cplus_expand_constant (expr
);
5776 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5777 TYPE_PTRMEM_CLASS_TYPE (type
),
5779 c_cast_p
, complain
);
5780 if (delta
== error_mark_node
)
5781 return error_mark_node
;
5783 if (!integer_zerop (delta
))
5785 tree cond
, op1
, op2
;
5787 cond
= cp_build_binary_op (input_location
,
5790 build_int_cst (TREE_TYPE (expr
), -1),
5791 tf_warning_or_error
);
5792 op1
= build_nop (ptrdiff_type_node
, expr
);
5793 op2
= cp_build_binary_op (input_location
,
5794 PLUS_EXPR
, op1
, delta
,
5795 tf_warning_or_error
);
5797 expr
= fold_build3_loc (input_location
,
5798 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5802 return build_nop (type
, expr
);
5805 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5806 allow_inverse_p
, c_cast_p
, complain
);
5809 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
5810 a version of EXPR that has TREE_OVERFLOW set if it is set in ORIG.
5811 Otherwise, return EXPR unchanged. */
5814 ignore_overflows (tree expr
, tree orig
)
5816 if (TREE_CODE (expr
) == INTEGER_CST
5817 && CONSTANT_CLASS_P (orig
)
5818 && TREE_CODE (orig
) != STRING_CST
5819 && TREE_OVERFLOW (expr
) != TREE_OVERFLOW (orig
))
5821 if (!TREE_OVERFLOW (orig
))
5822 /* Ensure constant sharing. */
5823 expr
= build_int_cst_wide (TREE_TYPE (expr
),
5824 TREE_INT_CST_LOW (expr
),
5825 TREE_INT_CST_HIGH (expr
));
5828 /* Avoid clobbering a shared constant. */
5829 expr
= copy_node (expr
);
5830 TREE_OVERFLOW (expr
) = TREE_OVERFLOW (orig
);
5836 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5837 this static_cast is being attempted as one of the possible casts
5838 allowed by a C-style cast. (In that case, accessibility of base
5839 classes is not considered, and it is OK to cast away
5840 constness.) Return the result of the cast. *VALID_P is set to
5841 indicate whether or not the cast was valid. */
5844 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5845 bool *valid_p
, tsubst_flags_t complain
)
5851 /* Assume the cast is valid. */
5854 intype
= TREE_TYPE (expr
);
5856 /* Save casted types in the function's used types hash table. */
5857 used_types_insert (type
);
5859 /* [expr.static.cast]
5861 An lvalue of type "cv1 B", where B is a class type, can be cast
5862 to type "reference to cv2 D", where D is a class derived (clause
5863 _class.derived_) from B, if a valid standard conversion from
5864 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5865 same cv-qualification as, or greater cv-qualification than, cv1,
5866 and B is not a virtual base class of D. */
5867 /* We check this case before checking the validity of "TYPE t =
5868 EXPR;" below because for this case:
5871 struct D : public B { D(const B&); };
5873 void f() { static_cast<const D&>(b); }
5875 we want to avoid constructing a new D. The standard is not
5876 completely clear about this issue, but our interpretation is
5877 consistent with other compilers. */
5878 if (TREE_CODE (type
) == REFERENCE_TYPE
5879 && CLASS_TYPE_P (TREE_TYPE (type
))
5880 && CLASS_TYPE_P (intype
)
5881 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5882 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5883 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5884 build_pointer_type (TYPE_MAIN_VARIANT
5885 (TREE_TYPE (type
))))
5887 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5891 /* There is a standard conversion from "D*" to "B*" even if "B"
5892 is ambiguous or inaccessible. If this is really a
5893 static_cast, then we check both for inaccessibility and
5894 ambiguity. However, if this is a static_cast being performed
5895 because the user wrote a C-style cast, then accessibility is
5897 base
= lookup_base (TREE_TYPE (type
), intype
,
5898 c_cast_p
? ba_unique
: ba_check
,
5901 /* Convert from "B*" to "D*". This function will check that "B"
5902 is not a virtual base of "D". */
5903 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5904 base
, /*nonnull=*/false);
5905 /* Convert the pointer to a reference -- but then remember that
5906 there are no expressions with reference type in C++. */
5907 return convert_from_reference (cp_fold_convert (type
, expr
));
5910 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5911 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5912 if (TREE_CODE (type
) == REFERENCE_TYPE
5913 && TYPE_REF_IS_RVALUE (type
)
5914 && real_lvalue_p (expr
)
5915 && reference_related_p (TREE_TYPE (type
), intype
)
5916 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5918 expr
= build_typed_address (expr
, type
);
5919 return convert_from_reference (expr
);
5924 /* Resolve overloaded address here rather than once in
5925 implicit_conversion and again in the inverse code below. */
5926 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5928 expr
= instantiate_type (type
, expr
, complain
);
5929 intype
= TREE_TYPE (expr
);
5932 /* [expr.static.cast]
5934 An expression e can be explicitly converted to a type T using a
5935 static_cast of the form static_cast<T>(e) if the declaration T
5936 t(e);" is well-formed, for some invented temporary variable
5938 result
= perform_direct_initialization_if_possible (type
, expr
,
5939 c_cast_p
, complain
);
5942 result
= convert_from_reference (result
);
5944 /* Ignore any integer overflow caused by the cast. */
5945 result
= ignore_overflows (result
, orig
);
5947 /* [expr.static.cast]
5949 If T is a reference type, the result is an lvalue; otherwise,
5950 the result is an rvalue. */
5951 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5952 result
= rvalue (result
);
5956 /* [expr.static.cast]
5958 Any expression can be explicitly converted to type cv void. */
5959 if (TREE_CODE (type
) == VOID_TYPE
)
5960 return convert_to_void (expr
, ICV_CAST
, complain
);
5962 /* [expr.static.cast]
5964 The inverse of any standard conversion sequence (clause _conv_),
5965 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5966 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5967 (_conv.bool_) conversions, can be performed explicitly using
5968 static_cast subject to the restriction that the explicit
5969 conversion does not cast away constness (_expr.const.cast_), and
5970 the following additional rules for specific cases: */
5971 /* For reference, the conversions not excluded are: integral
5972 promotions, floating point promotion, integral conversions,
5973 floating point conversions, floating-integral conversions,
5974 pointer conversions, and pointer to member conversions. */
5977 A value of integral _or enumeration_ type can be explicitly
5978 converted to an enumeration type. */
5979 /* The effect of all that is that any conversion between any two
5980 types which are integral, floating, or enumeration types can be
5982 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5983 || SCALAR_FLOAT_TYPE_P (type
))
5984 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5985 || SCALAR_FLOAT_TYPE_P (intype
)))
5987 expr
= ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5989 /* Ignore any integer overflow caused by the cast. */
5990 expr
= ignore_overflows (expr
, orig
);
5994 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5995 && CLASS_TYPE_P (TREE_TYPE (type
))
5996 && CLASS_TYPE_P (TREE_TYPE (intype
))
5997 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5998 (TREE_TYPE (intype
))),
5999 build_pointer_type (TYPE_MAIN_VARIANT
6000 (TREE_TYPE (type
)))))
6005 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
6006 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
6007 c_cast_p
? ba_unique
: ba_check
,
6009 return build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
6012 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6013 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6020 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
6021 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
6023 if (TYPE_PTRMEM_P (type
))
6025 t1
= (build_ptrmem_type
6027 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
6028 t2
= (build_ptrmem_type
6030 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
6037 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
6040 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
6041 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
6042 c_cast_p
, tf_warning_or_error
);
6046 /* [expr.static.cast]
6048 An rvalue of type "pointer to cv void" can be explicitly
6049 converted to a pointer to object type. A value of type pointer
6050 to object converted to "pointer to cv void" and back to the
6051 original pointer type will have its original value. */
6052 if (TREE_CODE (intype
) == POINTER_TYPE
6053 && VOID_TYPE_P (TREE_TYPE (intype
))
6054 && TYPE_PTROB_P (type
))
6057 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
6058 return build_nop (type
, expr
);
6062 return error_mark_node
;
6065 /* Return an expression representing static_cast<TYPE>(EXPR). */
6068 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6073 if (type
== error_mark_node
|| expr
== error_mark_node
)
6074 return error_mark_node
;
6076 if (processing_template_decl
)
6078 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
6079 /* We don't know if it will or will not have side effects. */
6080 TREE_SIDE_EFFECTS (expr
) = 1;
6081 return convert_from_reference (expr
);
6084 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6085 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6086 if (TREE_CODE (type
) != REFERENCE_TYPE
6087 && TREE_CODE (expr
) == NOP_EXPR
6088 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6089 expr
= TREE_OPERAND (expr
, 0);
6091 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
6096 if (complain
& tf_error
)
6097 error ("invalid static_cast from type %qT to type %qT",
6098 TREE_TYPE (expr
), type
);
6099 return error_mark_node
;
6102 /* EXPR is an expression with member function or pointer-to-member
6103 function type. TYPE is a pointer type. Converting EXPR to TYPE is
6104 not permitted by ISO C++, but we accept it in some modes. If we
6105 are not in one of those modes, issue a diagnostic. Return the
6106 converted expression. */
6109 convert_member_func_to_ptr (tree type
, tree expr
)
6114 intype
= TREE_TYPE (expr
);
6115 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
6116 || TREE_CODE (intype
) == METHOD_TYPE
);
6118 if (pedantic
|| warn_pmf2ptr
)
6119 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
6120 "converting from %qT to %qT", intype
, type
);
6122 if (TREE_CODE (intype
) == METHOD_TYPE
)
6123 expr
= build_addr_func (expr
);
6124 else if (TREE_CODE (expr
) == PTRMEM_CST
)
6125 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
6128 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
6129 decl
= build_address (decl
);
6130 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
6133 return build_nop (type
, expr
);
6136 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
6137 If C_CAST_P is true, this reinterpret cast is being done as part of
6138 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
6139 indicate whether or not reinterpret_cast was valid. */
6142 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6143 bool *valid_p
, tsubst_flags_t complain
)
6147 /* Assume the cast is invalid. */
6151 if (type
== error_mark_node
|| error_operand_p (expr
))
6152 return error_mark_node
;
6154 intype
= TREE_TYPE (expr
);
6156 /* Save casted types in the function's used types hash table. */
6157 used_types_insert (type
);
6159 /* [expr.reinterpret.cast]
6160 An lvalue expression of type T1 can be cast to the type
6161 "reference to T2" if an expression of type "pointer to T1" can be
6162 explicitly converted to the type "pointer to T2" using a
6163 reinterpret_cast. */
6164 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6166 if (! real_lvalue_p (expr
))
6168 if (complain
& tf_error
)
6169 error ("invalid cast of an rvalue expression of type "
6172 return error_mark_node
;
6175 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6176 "B" are related class types; the reinterpret_cast does not
6177 adjust the pointer. */
6178 if (TYPE_PTR_P (intype
)
6179 && (complain
& tf_warning
)
6180 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
6181 COMPARE_BASE
| COMPARE_DERIVED
)))
6182 warning (0, "casting %qT to %qT does not dereference pointer",
6185 expr
= cp_build_addr_expr (expr
, complain
);
6187 if (warn_strict_aliasing
> 2)
6188 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
6190 if (expr
!= error_mark_node
)
6191 expr
= build_reinterpret_cast_1
6192 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
6194 if (expr
!= error_mark_node
)
6195 /* cp_build_indirect_ref isn't right for rvalue refs. */
6196 expr
= convert_from_reference (fold_convert (type
, expr
));
6200 /* As a G++ extension, we consider conversions from member
6201 functions, and pointers to member functions to
6202 pointer-to-function and pointer-to-void types. If
6203 -Wno-pmf-conversions has not been specified,
6204 convert_member_func_to_ptr will issue an error message. */
6205 if ((TYPE_PTRMEMFUNC_P (intype
)
6206 || TREE_CODE (intype
) == METHOD_TYPE
)
6207 && TYPE_PTR_P (type
)
6208 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6209 || VOID_TYPE_P (TREE_TYPE (type
))))
6210 return convert_member_func_to_ptr (type
, expr
);
6212 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6213 array-to-pointer, and function-to-pointer conversions are
6215 expr
= decay_conversion (expr
);
6217 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6218 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6219 if (TREE_CODE (expr
) == NOP_EXPR
6220 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6221 expr
= TREE_OPERAND (expr
, 0);
6223 if (error_operand_p (expr
))
6224 return error_mark_node
;
6226 intype
= TREE_TYPE (expr
);
6228 /* [expr.reinterpret.cast]
6229 A pointer can be converted to any integral type large enough to
6230 hold it. ... A value of type std::nullptr_t can be converted to
6231 an integral type; the conversion has the same meaning and
6232 validity as a conversion of (void*)0 to the integral type. */
6233 if (CP_INTEGRAL_TYPE_P (type
)
6234 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
6236 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
6238 if (complain
& tf_error
)
6239 permerror (input_location
, "cast from %qT to %qT loses precision",
6242 return error_mark_node
;
6244 if (NULLPTR_TYPE_P (intype
))
6245 return build_int_cst (type
, 0);
6247 /* [expr.reinterpret.cast]
6248 A value of integral or enumeration type can be explicitly
6249 converted to a pointer. */
6250 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6253 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6254 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6255 return fold_if_not_in_template (build_nop (type
, expr
));
6256 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6257 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6262 check_for_casting_away_constness (intype
, type
, REINTERPRET_CAST_EXPR
);
6263 /* Warn about possible alignment problems. */
6264 if (STRICT_ALIGNMENT
&& warn_cast_align
6265 && (complain
& tf_warning
)
6266 && !VOID_TYPE_P (type
)
6267 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6268 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6269 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6270 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6271 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6272 "increases required alignment of target type", intype
, type
);
6274 /* We need to strip nops here, because the front end likes to
6275 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6277 if (warn_strict_aliasing
<= 2)
6278 strict_aliasing_warning (intype
, type
, sexpr
);
6280 return fold_if_not_in_template (build_nop (type
, expr
));
6282 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6283 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6285 if (pedantic
&& (complain
& tf_warning
))
6286 /* Only issue a warning, as we have always supported this
6287 where possible, and it is necessary in some cases. DR 195
6288 addresses this issue, but as of 2004/10/26 is still in
6290 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6291 return fold_if_not_in_template (build_nop (type
, expr
));
6293 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6294 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6295 else if (TREE_CODE (intype
) == VECTOR_TYPE
6296 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6297 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6302 if (complain
& tf_error
)
6303 error ("invalid cast from type %qT to type %qT", intype
, type
);
6304 return error_mark_node
;
6307 return cp_convert (type
, expr
);
6311 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6313 if (type
== error_mark_node
|| expr
== error_mark_node
)
6314 return error_mark_node
;
6316 if (processing_template_decl
)
6318 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6320 if (!TREE_SIDE_EFFECTS (t
)
6321 && type_dependent_expression_p (expr
))
6322 /* There might turn out to be side effects inside expr. */
6323 TREE_SIDE_EFFECTS (t
) = 1;
6324 return convert_from_reference (t
);
6327 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6328 /*valid_p=*/NULL
, complain
);
6331 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6332 return an appropriate expression. Otherwise, return
6333 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6334 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6335 performing a C-style cast, its value upon return will indicate
6336 whether or not the conversion succeeded. */
6339 build_const_cast_1 (tree dst_type
, tree expr
, bool complain
,
6343 tree reference_type
;
6345 /* Callers are responsible for handling error_mark_node as a
6346 destination type. */
6347 gcc_assert (dst_type
!= error_mark_node
);
6348 /* In a template, callers should be building syntactic
6349 representations of casts, not using this machinery. */
6350 gcc_assert (!processing_template_decl
);
6352 /* Assume the conversion is invalid. */
6356 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6359 error ("invalid use of const_cast with type %qT, "
6360 "which is not a pointer, "
6361 "reference, nor a pointer-to-data-member type", dst_type
);
6362 return error_mark_node
;
6365 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6368 error ("invalid use of const_cast with type %qT, which is a pointer "
6369 "or reference to a function type", dst_type
);
6370 return error_mark_node
;
6373 /* Save casted types in the function's used types hash table. */
6374 used_types_insert (dst_type
);
6376 src_type
= TREE_TYPE (expr
);
6377 /* Expressions do not really have reference types. */
6378 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6379 src_type
= TREE_TYPE (src_type
);
6381 /* [expr.const.cast]
6383 An lvalue of type T1 can be explicitly converted to an lvalue of
6384 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6385 types) if a pointer to T1 can be explicitly converted to the type
6386 pointer to T2 using a const_cast. */
6387 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6389 reference_type
= dst_type
;
6390 if (! real_lvalue_p (expr
))
6393 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6394 src_type
, dst_type
);
6395 return error_mark_node
;
6397 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6398 src_type
= build_pointer_type (src_type
);
6402 reference_type
= NULL_TREE
;
6403 /* If the destination type is not a reference type, the
6404 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6405 conversions are performed. */
6406 src_type
= type_decays_to (src_type
);
6407 if (src_type
== error_mark_node
)
6408 return error_mark_node
;
6411 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6412 && comp_ptr_ttypes_const (dst_type
, src_type
))
6417 /* This cast is actually a C-style cast. Issue a warning if
6418 the user is making a potentially unsafe cast. */
6419 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
);
6423 expr
= cp_build_addr_expr (expr
,
6424 complain
? tf_warning_or_error
: tf_none
);
6425 expr
= build_nop (reference_type
, expr
);
6426 return convert_from_reference (expr
);
6430 expr
= decay_conversion (expr
);
6431 /* build_c_cast puts on a NOP_EXPR to make the result not an
6432 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6433 non-lvalue context. */
6434 if (TREE_CODE (expr
) == NOP_EXPR
6435 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6436 expr
= TREE_OPERAND (expr
, 0);
6437 return build_nop (dst_type
, expr
);
6442 error ("invalid const_cast from type %qT to type %qT",
6443 src_type
, dst_type
);
6444 return error_mark_node
;
6448 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6450 if (type
== error_mark_node
|| error_operand_p (expr
))
6451 return error_mark_node
;
6453 if (processing_template_decl
)
6455 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6457 if (!TREE_SIDE_EFFECTS (t
)
6458 && type_dependent_expression_p (expr
))
6459 /* There might turn out to be side effects inside expr. */
6460 TREE_SIDE_EFFECTS (t
) = 1;
6461 return convert_from_reference (t
);
6464 return build_const_cast_1 (type
, expr
, complain
& tf_error
,
6468 /* Like cp_build_c_cast, but for the c-common bits. */
6471 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6473 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6476 /* Build an expression representing an explicit C-style cast to type
6477 TYPE of expression EXPR. */
6480 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6486 if (type
== error_mark_node
|| error_operand_p (expr
))
6487 return error_mark_node
;
6489 if (processing_template_decl
)
6491 tree t
= build_min (CAST_EXPR
, type
,
6492 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6493 /* We don't know if it will or will not have side effects. */
6494 TREE_SIDE_EFFECTS (t
) = 1;
6495 return convert_from_reference (t
);
6498 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6499 'Class') should always be retained, because this information aids
6500 in method lookup. */
6501 if (objc_is_object_ptr (type
)
6502 && objc_is_object_ptr (TREE_TYPE (expr
)))
6503 return build_nop (type
, expr
);
6505 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6506 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6507 if (TREE_CODE (type
) != REFERENCE_TYPE
6508 && TREE_CODE (value
) == NOP_EXPR
6509 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6510 value
= TREE_OPERAND (value
, 0);
6512 if (TREE_CODE (type
) == ARRAY_TYPE
)
6514 /* Allow casting from T1* to T2[] because Cfront allows it.
6515 NIHCL uses it. It is not valid ISO C++ however. */
6516 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6518 if (complain
& tf_error
)
6519 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6521 return error_mark_node
;
6522 type
= build_pointer_type (TREE_TYPE (type
));
6526 if (complain
& tf_error
)
6527 error ("ISO C++ forbids casting to an array type %qT", type
);
6528 return error_mark_node
;
6532 if (TREE_CODE (type
) == FUNCTION_TYPE
6533 || TREE_CODE (type
) == METHOD_TYPE
)
6535 if (complain
& tf_error
)
6536 error ("invalid cast to function type %qT", type
);
6537 return error_mark_node
;
6540 if (TREE_CODE (type
) == POINTER_TYPE
6541 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
6542 /* Casting to an integer of smaller size is an error detected elsewhere. */
6543 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
6544 /* Don't warn about converting any constant. */
6545 && !TREE_CONSTANT (value
))
6546 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
6547 "cast to pointer from integer of different size");
6549 /* A C-style cast can be a const_cast. */
6550 result
= build_const_cast_1 (type
, value
, /*complain=*/false,
6555 /* Or a static cast. */
6556 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6557 &valid_p
, complain
);
6558 /* Or a reinterpret_cast. */
6560 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6561 &valid_p
, complain
);
6562 /* The static_cast or reinterpret_cast may be followed by a
6565 /* A valid cast may result in errors if, for example, a
6566 conversion to am ambiguous base class is required. */
6567 && !error_operand_p (result
))
6571 /* Non-class rvalues always have cv-unqualified type. */
6572 if (!CLASS_TYPE_P (type
))
6573 type
= TYPE_MAIN_VARIANT (type
);
6574 result_type
= TREE_TYPE (result
);
6575 if (!CLASS_TYPE_P (result_type
))
6576 result_type
= TYPE_MAIN_VARIANT (result_type
);
6577 /* If the type of RESULT does not match TYPE, perform a
6578 const_cast to make it match. If the static_cast or
6579 reinterpret_cast succeeded, we will differ by at most
6580 cv-qualification, so the follow-on const_cast is guaranteed
6582 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6584 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6585 gcc_assert (valid_p
);
6590 return error_mark_node
;
6593 /* For use from the C common bits. */
6595 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6596 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6597 enum tree_code modifycode
,
6598 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6599 tree rhs_origtype ATTRIBUTE_UNUSED
)
6601 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6604 /* Build an assignment expression of lvalue LHS from value RHS.
6605 MODIFYCODE is the code for a binary operator that we use
6606 to combine the old value of LHS with RHS to get the new value.
6607 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6609 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6612 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6613 tsubst_flags_t complain
)
6617 tree lhstype
= TREE_TYPE (lhs
);
6618 tree olhstype
= lhstype
;
6619 bool plain_assign
= (modifycode
== NOP_EXPR
);
6621 /* Avoid duplicate error messages from operands that had errors. */
6622 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6623 return error_mark_node
;
6625 /* Handle control structure constructs used as "lvalues". */
6626 switch (TREE_CODE (lhs
))
6628 /* Handle --foo = 5; as these are valid constructs in C++. */
6629 case PREDECREMENT_EXPR
:
6630 case PREINCREMENT_EXPR
:
6631 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6632 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6633 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6634 TREE_OPERAND (lhs
, 1));
6635 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6636 modifycode
, rhs
, complain
);
6637 if (newrhs
== error_mark_node
)
6638 return error_mark_node
;
6639 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6641 /* Handle (a, b) used as an "lvalue". */
6643 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6644 modifycode
, rhs
, complain
);
6645 if (newrhs
== error_mark_node
)
6646 return error_mark_node
;
6647 return build2 (COMPOUND_EXPR
, lhstype
,
6648 TREE_OPERAND (lhs
, 0), newrhs
);
6651 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6652 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6653 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6654 TREE_OPERAND (lhs
, 1));
6655 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6657 if (newrhs
== error_mark_node
)
6658 return error_mark_node
;
6659 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6663 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6664 when neither operand has side-effects. */
6665 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6666 return error_mark_node
;
6668 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6669 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6671 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6672 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6674 TREE_OPERAND (lhs
, 0),
6675 TREE_OPERAND (lhs
, 1)),
6676 TREE_OPERAND (lhs
, 0),
6677 TREE_OPERAND (lhs
, 1));
6680 /* Handle (a ? b : c) used as an "lvalue". */
6683 /* Produce (a ? (b = rhs) : (c = rhs))
6684 except that the RHS goes through a save-expr
6685 so the code to compute it is only emitted once. */
6687 tree preeval
= NULL_TREE
;
6689 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6691 if (complain
& tf_error
)
6692 error ("void value not ignored as it ought to be");
6693 return error_mark_node
;
6696 rhs
= stabilize_expr (rhs
, &preeval
);
6698 /* Check this here to avoid odd errors when trying to convert
6699 a throw to the type of the COND_EXPR. */
6700 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6701 return error_mark_node
;
6703 cond
= build_conditional_expr
6704 (TREE_OPERAND (lhs
, 0),
6705 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6706 modifycode
, rhs
, complain
),
6707 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6708 modifycode
, rhs
, complain
),
6711 if (cond
== error_mark_node
)
6713 /* Make sure the code to compute the rhs comes out
6714 before the split. */
6716 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6724 if (modifycode
== INIT_EXPR
)
6726 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6727 /* Do the default thing. */;
6728 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6730 /* Compound literal. */
6731 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6732 /* Call convert to generate an error; see PR 11063. */
6733 rhs
= convert (lhstype
, rhs
);
6734 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6735 TREE_SIDE_EFFECTS (result
) = 1;
6738 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6739 /* Do the default thing. */;
6742 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6743 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6744 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6746 release_tree_vector (rhs_vec
);
6747 if (result
== NULL_TREE
)
6748 return error_mark_node
;
6754 lhs
= require_complete_type_sfinae (lhs
, complain
);
6755 if (lhs
== error_mark_node
)
6756 return error_mark_node
;
6758 if (modifycode
== NOP_EXPR
)
6760 /* `operator=' is not an inheritable operator. */
6761 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6762 /* Do the default thing. */;
6765 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6766 lhs
, rhs
, make_node (NOP_EXPR
),
6767 /*overloaded_p=*/NULL
,
6769 if (result
== NULL_TREE
)
6770 return error_mark_node
;
6777 /* A binary op has been requested. Combine the old LHS
6778 value with the RHS producing the value we should actually
6779 store into the LHS. */
6780 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6781 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6782 || MAYBE_CLASS_TYPE_P (lhstype
)));
6784 lhs
= stabilize_reference (lhs
);
6785 newrhs
= cp_build_binary_op (input_location
,
6786 modifycode
, lhs
, rhs
,
6788 if (newrhs
== error_mark_node
)
6790 if (complain
& tf_error
)
6791 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6792 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6793 return error_mark_node
;
6796 /* Now it looks like a plain assignment. */
6797 modifycode
= NOP_EXPR
;
6799 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6800 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6803 /* The left-hand side must be an lvalue. */
6804 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6805 return error_mark_node
;
6807 /* Warn about modifying something that is `const'. Don't warn if
6808 this is initialization. */
6809 if (modifycode
!= INIT_EXPR
6810 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6811 /* Functions are not modifiable, even though they are
6813 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6814 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6815 /* If it's an aggregate and any field is const, then it is
6816 effectively const. */
6817 || (CLASS_TYPE_P (lhstype
)
6818 && C_TYPE_FIELDS_READONLY (lhstype
))))
6820 if (complain
& tf_error
)
6821 readonly_error (lhs
, REK_ASSIGNMENT
);
6823 return error_mark_node
;
6826 /* If storing into a structure or union member, it may have been given a
6827 lowered bitfield type. We need to convert to the declared type first,
6828 so retrieve it now. */
6830 olhstype
= unlowered_expr_type (lhs
);
6832 /* Convert new value to destination type. */
6834 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6838 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6840 if (modifycode
!= INIT_EXPR
)
6842 if (complain
& tf_error
)
6843 error ("assigning to an array from an initializer list");
6844 return error_mark_node
;
6846 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6847 return error_mark_node
;
6848 newrhs
= digest_init (lhstype
, newrhs
);
6851 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6852 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6854 if (complain
& tf_error
)
6855 error ("incompatible types in assignment of %qT to %qT",
6856 TREE_TYPE (rhs
), lhstype
);
6857 return error_mark_node
;
6860 /* Allow array assignment in compiler-generated code. */
6861 else if (!current_function_decl
6862 || !DECL_ARTIFICIAL (current_function_decl
))
6864 /* This routine is used for both initialization and assignment.
6865 Make sure the diagnostic message differentiates the context. */
6866 if (complain
& tf_error
)
6868 if (modifycode
== INIT_EXPR
)
6869 error ("array used as initializer");
6871 error ("invalid array assignment");
6873 return error_mark_node
;
6876 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6877 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6878 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6879 /*explicit_value_init_p=*/false,
6880 from_array
, complain
);
6883 if (modifycode
== INIT_EXPR
)
6884 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6885 LOOKUP_ONLYCONVERTING. */
6886 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6887 ICR_INIT
, NULL_TREE
, 0,
6890 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
6891 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6893 if (!same_type_p (lhstype
, olhstype
))
6894 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6896 if (modifycode
!= INIT_EXPR
)
6898 if (TREE_CODE (newrhs
) == CALL_EXPR
6899 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6900 newrhs
= build_cplus_new (lhstype
, newrhs
);
6902 /* Can't initialize directly from a TARGET_EXPR, since that would
6903 cause the lhs to be constructed twice, and possibly result in
6904 accidental self-initialization. So we force the TARGET_EXPR to be
6905 expanded without a target. */
6906 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6907 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6908 TREE_OPERAND (newrhs
, 0));
6911 if (newrhs
== error_mark_node
)
6912 return error_mark_node
;
6914 if (c_dialect_objc () && flag_objc_gc
)
6916 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6922 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6923 lhstype
, lhs
, newrhs
);
6925 TREE_SIDE_EFFECTS (result
) = 1;
6927 TREE_NO_WARNING (result
) = 1;
6933 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6934 tsubst_flags_t complain
)
6936 if (processing_template_decl
)
6937 return build_min_nt (MODOP_EXPR
, lhs
,
6938 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6940 if (modifycode
!= NOP_EXPR
)
6942 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6943 make_node (modifycode
),
6944 /*overloaded_p=*/NULL
,
6948 TREE_NO_WARNING (rval
) = 1;
6952 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6955 /* Helper function for get_delta_difference which assumes FROM is a base
6956 class of TO. Returns a delta for the conversion of pointer-to-member
6957 of FROM to pointer-to-member of TO. If the conversion is invalid and
6958 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
6959 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6960 If C_CAST_P is true, this conversion is taking place as part of a
6964 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
,
6965 tsubst_flags_t complain
)
6969 base_access access
= c_cast_p
? ba_unique
: ba_check
;
6971 /* Note: ba_quiet does not distinguish between access control and
6973 if (!(complain
& tf_error
))
6976 binfo
= lookup_base (to
, from
, access
, &kind
);
6978 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6980 if (!(complain
& tf_error
))
6981 return error_mark_node
;
6983 error (" in pointer to member function conversion");
6984 return size_zero_node
;
6988 if (kind
!= bk_via_virtual
)
6989 return BINFO_OFFSET (binfo
);
6991 /* FROM is a virtual base class of TO. Issue an error or warning
6992 depending on whether or not this is a reinterpret cast. */
6994 if (!(complain
& tf_error
))
6995 return error_mark_node
;
6997 error ("pointer to member conversion via virtual base %qT",
6998 BINFO_TYPE (binfo_from_vbase (binfo
)));
7000 return size_zero_node
;
7007 /* Get difference in deltas for different pointer to member function
7008 types. If the conversion is invalid and tf_error is not set in
7009 COMPLAIN, returns error_mark_node, otherwise returns an integer
7010 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
7011 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
7012 conversions as well. If C_CAST_P is true this conversion is taking
7013 place as part of a C-style cast.
7015 Note that the naming of FROM and TO is kind of backwards; the return
7016 value is what we add to a TO in order to get a FROM. They are named
7017 this way because we call this function to find out how to convert from
7018 a pointer to member of FROM to a pointer to member of TO. */
7021 get_delta_difference (tree from
, tree to
,
7022 bool allow_inverse_p
,
7023 bool c_cast_p
, tsubst_flags_t complain
)
7027 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
7028 /* Pointer to member of incomplete class is permitted*/
7029 result
= size_zero_node
;
7031 result
= get_delta_difference_1 (from
, to
, c_cast_p
, complain
);
7033 if (result
== error_mark_node
)
7034 return error_mark_node
;
7038 if (!allow_inverse_p
)
7040 if (!(complain
& tf_error
))
7041 return error_mark_node
;
7043 error_not_base_type (from
, to
);
7044 error (" in pointer to member conversion");
7045 result
= size_zero_node
;
7049 result
= get_delta_difference_1 (to
, from
, c_cast_p
, complain
);
7051 if (result
== error_mark_node
)
7052 return error_mark_node
;
7055 result
= size_diffop_loc (input_location
,
7056 size_zero_node
, result
);
7059 if (!(complain
& tf_error
))
7060 return error_mark_node
;
7062 error_not_base_type (from
, to
);
7063 error (" in pointer to member conversion");
7064 result
= size_zero_node
;
7069 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
7073 /* Return a constructor for the pointer-to-member-function TYPE using
7074 the other components as specified. */
7077 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
7082 VEC(constructor_elt
, gc
) *v
;
7084 /* Pull the FIELD_DECLs out of the type. */
7085 pfn_field
= TYPE_FIELDS (type
);
7086 delta_field
= DECL_CHAIN (pfn_field
);
7088 /* Make sure DELTA has the type we want. */
7089 delta
= convert_and_check (delta_type_node
, delta
);
7091 /* Convert to the correct target type if necessary. */
7092 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
7094 /* Finish creating the initializer. */
7095 v
= VEC_alloc(constructor_elt
, gc
, 2);
7096 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
7097 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
7098 u
= build_constructor (type
, v
);
7099 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
7100 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
7101 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
7103 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
7108 /* Build a constructor for a pointer to member function. It can be
7109 used to initialize global variables, local variable, or used
7110 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
7113 If FORCE is nonzero, then force this conversion, even if
7114 we would rather not do it. Usually set when using an explicit
7115 cast. A C-style cast is being processed iff C_CAST_P is true.
7117 Return error_mark_node, if something goes wrong. */
7120 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
,
7121 tsubst_flags_t complain
)
7127 if (error_operand_p (pfn
))
7128 return error_mark_node
;
7130 pfn_type
= TREE_TYPE (pfn
);
7131 to_type
= build_ptrmemfunc_type (type
);
7133 /* Handle multiple conversions of pointer to member functions. */
7134 if (TYPE_PTRMEMFUNC_P (pfn_type
))
7136 tree delta
= NULL_TREE
;
7137 tree npfn
= NULL_TREE
;
7141 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
7142 error ("invalid conversion to type %qT from type %qT",
7145 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
7146 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
7148 c_cast_p
, complain
);
7149 if (n
== error_mark_node
)
7150 return error_mark_node
;
7152 /* We don't have to do any conversion to convert a
7153 pointer-to-member to its own type. But, we don't want to
7154 just return a PTRMEM_CST if there's an explicit cast; that
7155 cast should make the expression an invalid template argument. */
7156 if (TREE_CODE (pfn
) != PTRMEM_CST
)
7158 if (same_type_p (to_type
, pfn_type
))
7160 else if (integer_zerop (n
))
7161 return build_reinterpret_cast (to_type
, pfn
,
7162 tf_warning_or_error
);
7165 if (TREE_SIDE_EFFECTS (pfn
))
7166 pfn
= save_expr (pfn
);
7168 /* Obtain the function pointer and the current DELTA. */
7169 if (TREE_CODE (pfn
) == PTRMEM_CST
)
7170 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
7173 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
7174 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
7177 /* Just adjust the DELTA field. */
7178 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7179 (TREE_TYPE (delta
), ptrdiff_type_node
));
7180 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
7181 n
= cp_build_binary_op (input_location
,
7182 LSHIFT_EXPR
, n
, integer_one_node
,
7183 tf_warning_or_error
);
7184 delta
= cp_build_binary_op (input_location
,
7185 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
7186 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
7189 /* Handle null pointer to member function conversions. */
7190 if (null_ptr_cst_p (pfn
))
7192 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
7193 return build_ptrmemfunc1 (to_type
,
7198 if (type_unknown_p (pfn
))
7199 return instantiate_type (type
, pfn
, tf_warning_or_error
);
7201 fn
= TREE_OPERAND (pfn
, 0);
7202 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7203 /* In a template, we will have preserved the
7205 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
7206 return make_ptrmem_cst (to_type
, fn
);
7209 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7212 ??? There is no consistency as to the types returned for the above
7213 values. Some code acts as if it were a sizetype and some as if it were
7214 integer_type_node. */
7217 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
7219 tree type
= TREE_TYPE (cst
);
7220 tree fn
= PTRMEM_CST_MEMBER (cst
);
7221 tree ptr_class
, fn_class
;
7223 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7225 /* The class that the function belongs to. */
7226 fn_class
= DECL_CONTEXT (fn
);
7228 /* The class that we're creating a pointer to member of. */
7229 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
7231 /* First, calculate the adjustment to the function's class. */
7232 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
7233 /*c_cast_p=*/0, tf_warning_or_error
);
7235 if (!DECL_VIRTUAL_P (fn
))
7236 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
7239 /* If we're dealing with a virtual function, we have to adjust 'this'
7240 again, to point to the base which provides the vtable entry for
7241 fn; the call will do the opposite adjustment. */
7242 tree orig_class
= DECL_CONTEXT (fn
);
7243 tree binfo
= binfo_or_else (orig_class
, fn_class
);
7244 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7245 *delta
, BINFO_OFFSET (binfo
));
7246 *delta
= fold_if_not_in_template (*delta
);
7248 /* We set PFN to the vtable offset at which the function can be
7249 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7250 case delta is shifted left, and then incremented). */
7251 *pfn
= DECL_VINDEX (fn
);
7252 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
7253 TYPE_SIZE_UNIT (vtable_entry_type
));
7254 *pfn
= fold_if_not_in_template (*pfn
);
7256 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
7258 case ptrmemfunc_vbit_in_pfn
:
7259 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
7261 *pfn
= fold_if_not_in_template (*pfn
);
7264 case ptrmemfunc_vbit_in_delta
:
7265 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
7266 *delta
, integer_one_node
);
7267 *delta
= fold_if_not_in_template (*delta
);
7268 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7269 *delta
, integer_one_node
);
7270 *delta
= fold_if_not_in_template (*delta
);
7277 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
7278 *pfn
= fold_if_not_in_template (*pfn
);
7282 /* Return an expression for PFN from the pointer-to-member function
7286 pfn_from_ptrmemfunc (tree t
)
7288 if (TREE_CODE (t
) == PTRMEM_CST
)
7293 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7298 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
7301 /* Return an expression for DELTA from the pointer-to-member function
7305 delta_from_ptrmemfunc (tree t
)
7307 if (TREE_CODE (t
) == PTRMEM_CST
)
7312 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7317 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7320 /* Convert value RHS to type TYPE as preparation for an assignment to
7321 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
7322 implicit conversion is. If FNDECL is non-NULL, we are doing the
7323 conversion in order to pass the PARMNUMth argument of FNDECL.
7324 If FNDECL is NULL, we are doing the conversion in function pointer
7325 argument passing, conversion in initialization, etc. */
7328 convert_for_assignment (tree type
, tree rhs
,
7329 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7330 tsubst_flags_t complain
, int flags
)
7333 enum tree_code coder
;
7335 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7336 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7337 rhs
= TREE_OPERAND (rhs
, 0);
7339 rhstype
= TREE_TYPE (rhs
);
7340 coder
= TREE_CODE (rhstype
);
7342 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7343 && vector_types_convertible_p (type
, rhstype
, true))
7345 rhs
= mark_rvalue_use (rhs
);
7346 return convert (type
, rhs
);
7349 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7350 return error_mark_node
;
7351 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7352 return error_mark_node
;
7354 /* The RHS of an assignment cannot have void type. */
7355 if (coder
== VOID_TYPE
)
7357 if (complain
& tf_error
)
7358 error ("void value not ignored as it ought to be");
7359 return error_mark_node
;
7362 /* Simplify the RHS if possible. */
7363 if (TREE_CODE (rhs
) == CONST_DECL
)
7364 rhs
= DECL_INITIAL (rhs
);
7366 if (c_dialect_objc ())
7370 tree rname
= fndecl
;
7381 selector
= objc_message_selector ();
7383 if (selector
&& parmno
> 1)
7390 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7392 rhs
= mark_rvalue_use (rhs
);
7393 return convert (type
, rhs
);
7399 The expression is implicitly converted (clause _conv_) to the
7400 cv-unqualified type of the left operand.
7402 We allow bad conversions here because by the time we get to this point
7403 we are committed to doing the conversion. If we end up doing a bad
7404 conversion, convert_like will complain. */
7405 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7407 /* When -Wno-pmf-conversions is use, we just silently allow
7408 conversions from pointers-to-members to plain pointers. If
7409 the conversion doesn't work, cp_convert will complain. */
7411 && TYPE_PTR_P (type
)
7412 && TYPE_PTRMEMFUNC_P (rhstype
))
7413 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7416 if (complain
& tf_error
)
7418 /* If the right-hand side has unknown type, then it is an
7419 overloaded function. Call instantiate_type to get error
7421 if (rhstype
== unknown_type_node
)
7422 instantiate_type (type
, rhs
, tf_warning_or_error
);
7424 error ("cannot convert %qT to %qT for argument %qP to %qD",
7425 rhstype
, type
, parmnum
, fndecl
);
7429 case ICR_DEFAULT_ARGUMENT
:
7430 error ("cannot convert %qT to %qT in default argument",
7434 error ("cannot convert %qT to %qT in argument passing",
7437 case ICR_CONVERTING
:
7438 error ("cannot convert %qT to %qT",
7442 error ("cannot convert %qT to %qT in initialization",
7446 error ("cannot convert %qT to %qT in return",
7450 error ("cannot convert %qT to %qT in assignment",
7457 return error_mark_node
;
7460 if (warn_missing_format_attribute
)
7462 const enum tree_code codel
= TREE_CODE (type
);
7463 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7465 && check_missing_format_attribute (type
, rhstype
)
7466 && (complain
& tf_warning
))
7470 case ICR_DEFAULT_ARGUMENT
:
7472 warning (OPT_Wmissing_format_attribute
,
7473 "parameter %qP of %qD might be a candidate "
7474 "for a format attribute", parmnum
, fndecl
);
7476 warning (OPT_Wmissing_format_attribute
,
7477 "parameter might be a candidate "
7478 "for a format attribute");
7480 case ICR_CONVERTING
:
7481 warning (OPT_Wmissing_format_attribute
,
7482 "target of conversion might be might be a candidate "
7483 "for a format attribute");
7486 warning (OPT_Wmissing_format_attribute
,
7487 "target of initialization might be a candidate "
7488 "for a format attribute");
7491 warning (OPT_Wmissing_format_attribute
,
7492 "return type might be a candidate "
7493 "for a format attribute");
7496 warning (OPT_Wmissing_format_attribute
,
7497 "left-hand side of assignment might be a candidate "
7498 "for a format attribute");
7505 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7507 if (warn_parentheses
7508 && TREE_CODE (type
) == BOOLEAN_TYPE
7509 && TREE_CODE (rhs
) == MODIFY_EXPR
7510 && !TREE_NO_WARNING (rhs
)
7511 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7512 && (complain
& tf_warning
))
7514 location_t loc
= EXPR_HAS_LOCATION (rhs
)
7515 ? EXPR_LOCATION (rhs
) : input_location
;
7517 warning_at (loc
, OPT_Wparentheses
,
7518 "suggest parentheses around assignment used as truth value");
7519 TREE_NO_WARNING (rhs
) = 1;
7522 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7526 /* Convert RHS to be of type TYPE.
7527 If EXP is nonzero, it is the target of the initialization.
7528 ERRTYPE indicates what kind of error the implicit conversion is.
7530 Two major differences between the behavior of
7531 `convert_for_assignment' and `convert_for_initialization'
7532 are that references are bashed in the former, while
7533 copied in the latter, and aggregates are assigned in
7534 the former (operator=) while initialized in the
7537 If using constructor make sure no conversion operator exists, if one does
7538 exist, an ambiguity exists.
7540 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7543 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7544 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7545 tsubst_flags_t complain
)
7547 enum tree_code codel
= TREE_CODE (type
);
7549 enum tree_code coder
;
7551 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7552 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7553 if (TREE_CODE (rhs
) == NOP_EXPR
7554 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7555 && codel
!= REFERENCE_TYPE
)
7556 rhs
= TREE_OPERAND (rhs
, 0);
7558 if (type
== error_mark_node
7559 || rhs
== error_mark_node
7560 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7561 return error_mark_node
;
7563 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7564 && TREE_CODE (type
) != ARRAY_TYPE
7565 && (TREE_CODE (type
) != REFERENCE_TYPE
7566 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7567 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7568 && (TREE_CODE (type
) != REFERENCE_TYPE
7569 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7570 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7571 rhs
= decay_conversion (rhs
);
7573 rhstype
= TREE_TYPE (rhs
);
7574 coder
= TREE_CODE (rhstype
);
7576 if (coder
== ERROR_MARK
)
7577 return error_mark_node
;
7579 /* We accept references to incomplete types, so we can
7580 return here before checking if RHS is of complete type. */
7582 if (codel
== REFERENCE_TYPE
)
7584 /* This should eventually happen in convert_arguments. */
7585 int savew
= 0, savee
= 0;
7588 savew
= warningcount
, savee
= errorcount
;
7589 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7590 /*cleanup=*/NULL
, complain
);
7593 if (warningcount
> savew
)
7594 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7595 else if (errorcount
> savee
)
7596 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7602 exp
= require_complete_type_sfinae (exp
, complain
);
7603 if (exp
== error_mark_node
)
7604 return error_mark_node
;
7606 rhstype
= non_reference (rhstype
);
7608 type
= complete_type (type
);
7610 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7611 /* Don't try to do copy-initialization if we already have
7612 direct-initialization. */
7615 if (MAYBE_CLASS_TYPE_P (type
))
7616 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
7618 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7622 /* If RETVAL is the address of, or a reference to, a local variable or
7623 temporary give an appropriate warning. */
7626 maybe_warn_about_returning_address_of_local (tree retval
)
7628 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7629 tree whats_returned
= retval
;
7633 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7634 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7635 else if (CONVERT_EXPR_P (whats_returned
)
7636 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7637 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7642 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7644 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7646 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7648 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7649 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7651 warning (0, "returning reference to temporary");
7654 if (TREE_CODE (whats_returned
) == VAR_DECL
7655 && DECL_NAME (whats_returned
)
7656 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7658 warning (0, "reference to non-lvalue returned");
7663 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7664 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7665 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7667 if (DECL_P (whats_returned
)
7668 && DECL_NAME (whats_returned
)
7669 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7670 && !(TREE_STATIC (whats_returned
)
7671 || TREE_PUBLIC (whats_returned
)))
7673 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7674 warning (0, "reference to local variable %q+D returned",
7677 warning (0, "address of local variable %q+D returned",
7683 /* Check that returning RETVAL from the current function is valid.
7684 Return an expression explicitly showing all conversions required to
7685 change RETVAL into the function return type, and to assign it to
7686 the DECL_RESULT for the function. Set *NO_WARNING to true if
7687 code reaches end of non-void function warning shouldn't be issued
7688 on this RETURN_EXPR. */
7691 check_return_expr (tree retval
, bool *no_warning
)
7694 /* The type actually returned by the function, after any
7697 int fn_returns_value_p
;
7698 bool named_return_value_okay_p
;
7700 *no_warning
= false;
7702 /* A `volatile' function is one that isn't supposed to return, ever.
7703 (This is a G++ extension, used to get better code for functions
7704 that call the `volatile' function.) */
7705 if (TREE_THIS_VOLATILE (current_function_decl
))
7706 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7708 /* Check for various simple errors. */
7709 if (DECL_DESTRUCTOR_P (current_function_decl
))
7712 error ("returning a value from a destructor");
7715 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7717 if (in_function_try_handler
)
7718 /* If a return statement appears in a handler of the
7719 function-try-block of a constructor, the program is ill-formed. */
7720 error ("cannot return from a handler of a function-try-block of a constructor");
7722 /* You can't return a value from a constructor. */
7723 error ("returning a value from a constructor");
7727 /* As an extension, deduce lambda return type from a return statement
7728 anywhere in the body. */
7729 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7731 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7732 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7734 tree type
= lambda_return_type (retval
);
7735 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7737 if (VOID_TYPE_P (type
))
7739 else if (oldtype
== NULL_TREE
)
7741 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7742 "can only be deduced when the return statement is "
7743 "the only statement in the function body");
7744 apply_lambda_return_type (lambda
, type
);
7746 else if (!same_type_p (type
, oldtype
))
7747 error ("inconsistent types %qT and %qT deduced for "
7748 "lambda return type", type
, oldtype
);
7752 if (processing_template_decl
)
7754 current_function_returns_value
= 1;
7755 if (check_for_bare_parameter_packs (retval
))
7756 retval
= error_mark_node
;
7760 /* When no explicit return-value is given in a function with a named
7761 return value, the named return value is used. */
7762 result
= DECL_RESULT (current_function_decl
);
7763 valtype
= TREE_TYPE (result
);
7764 gcc_assert (valtype
!= NULL_TREE
);
7765 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7766 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7769 /* Check for a return statement with no return value in a function
7770 that's supposed to return a value. */
7771 if (!retval
&& fn_returns_value_p
)
7773 permerror (input_location
, "return-statement with no value, in function returning %qT",
7775 /* Clear this, so finish_function won't say that we reach the
7776 end of a non-void function (which we don't, we gave a
7778 current_function_returns_null
= 0;
7779 /* And signal caller that TREE_NO_WARNING should be set on the
7780 RETURN_EXPR to avoid control reaches end of non-void function
7781 warnings in tree-cfg.c. */
7784 /* Check for a return statement with a value in a function that
7785 isn't supposed to return a value. */
7786 else if (retval
&& !fn_returns_value_p
)
7788 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7789 /* You can return a `void' value from a function of `void'
7790 type. In that case, we have to evaluate the expression for
7791 its side-effects. */
7792 finish_expr_stmt (retval
);
7794 permerror (input_location
, "return-statement with a value, in function "
7795 "returning 'void'");
7796 current_function_returns_null
= 1;
7798 /* There's really no value to return, after all. */
7802 /* Remember that this function can sometimes return without a
7804 current_function_returns_null
= 1;
7806 /* Remember that this function did return a value. */
7807 current_function_returns_value
= 1;
7809 /* Check for erroneous operands -- but after giving ourselves a
7810 chance to provide an error about returning a value from a void
7812 if (error_operand_p (retval
))
7814 current_function_return_value
= error_mark_node
;
7815 return error_mark_node
;
7818 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7819 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7820 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7821 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7823 && retval
&& null_ptr_cst_p (retval
))
7824 warning (0, "%<operator new%> must not return NULL unless it is "
7825 "declared %<throw()%> (or -fcheck-new is in effect)");
7827 /* Effective C++ rule 15. See also start_function. */
7829 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7833 /* The function return type must be a reference to the current
7835 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7836 && same_type_ignoring_top_level_qualifiers_p
7837 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7839 /* Returning '*this' is obviously OK. */
7840 if (retval
== current_class_ref
)
7842 /* If we are calling a function whose return type is the same of
7843 the current class reference, it is ok. */
7844 else if (TREE_CODE (retval
) == INDIRECT_REF
7845 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7850 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7853 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7855 [...] For a function with a class return type, if the expression
7856 in the return statement is the name of a local object, and the cv-
7857 unqualified type of the local object is the same as the function
7858 return type, an implementation is permitted to omit creating the tem-
7859 porary object to hold the function return value [...]
7861 So, if this is a value-returning function that always returns the same
7862 local variable, remember it.
7864 It might be nice to be more flexible, and choose the first suitable
7865 variable even if the function sometimes returns something else, but
7866 then we run the risk of clobbering the variable we chose if the other
7867 returned expression uses the chosen variable somehow. And people expect
7868 this restriction, anyway. (jason 2000-11-19)
7870 See finish_function and finalize_nrv for the rest of this optimization. */
7872 named_return_value_okay_p
=
7873 (retval
!= NULL_TREE
7874 /* Must be a local, automatic variable. */
7875 && TREE_CODE (retval
) == VAR_DECL
7876 && DECL_CONTEXT (retval
) == current_function_decl
7877 && ! TREE_STATIC (retval
)
7878 && ! DECL_ANON_UNION_VAR_P (retval
)
7879 && (DECL_ALIGN (retval
)
7880 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7881 /* The cv-unqualified type of the returned value must be the
7882 same as the cv-unqualified return type of the
7884 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7886 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7887 /* And the returned value must be non-volatile. */
7888 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7890 if (fn_returns_value_p
&& flag_elide_constructors
)
7892 if (named_return_value_okay_p
7893 && (current_function_return_value
== NULL_TREE
7894 || current_function_return_value
== retval
))
7895 current_function_return_value
= retval
;
7897 current_function_return_value
= error_mark_node
;
7900 /* We don't need to do any conversions when there's nothing being
7905 /* Do any required conversions. */
7906 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7907 /* No conversions are required. */
7911 /* The type the function is declared to return. */
7912 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7913 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7915 /* The functype's return type will have been set to void, if it
7916 was an incomplete type. Just treat this as 'return;' */
7917 if (VOID_TYPE_P (functype
))
7918 return error_mark_node
;
7920 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7921 treated as an rvalue for the purposes of overload resolution to
7922 favor move constructors over copy constructors. */
7923 if ((cxx_dialect
!= cxx98
)
7924 && named_return_value_okay_p
7925 /* The variable must not have the `volatile' qualifier. */
7926 && !CP_TYPE_VOLATILE_P (TREE_TYPE (retval
))
7927 /* The return type must be a class type. */
7928 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7929 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7931 /* First convert the value to the function's return type, then
7932 to the type of return value's location to handle the
7933 case that functype is smaller than the valtype. */
7934 retval
= convert_for_initialization
7935 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
7936 tf_warning_or_error
);
7937 retval
= convert (valtype
, retval
);
7939 /* If the conversion failed, treat this just like `return;'. */
7940 if (retval
== error_mark_node
)
7942 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7943 else if (! cfun
->returns_struct
7944 && TREE_CODE (retval
) == TARGET_EXPR
7945 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7946 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7947 TREE_OPERAND (retval
, 0));
7949 maybe_warn_about_returning_address_of_local (retval
);
7952 /* Actually copy the value returned into the appropriate location. */
7953 if (retval
&& retval
!= result
)
7954 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7960 /* Returns nonzero if the pointer-type FROM can be converted to the
7961 pointer-type TO via a qualification conversion. If CONSTP is -1,
7962 then we return nonzero if the pointers are similar, and the
7963 cv-qualification signature of FROM is a proper subset of that of TO.
7965 If CONSTP is positive, then all outer pointers have been
7969 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7971 bool to_more_cv_qualified
= false;
7972 bool is_opaque_pointer
= false;
7974 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7976 if (TREE_CODE (to
) != TREE_CODE (from
))
7979 if (TREE_CODE (from
) == OFFSET_TYPE
7980 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7981 TYPE_OFFSET_BASETYPE (to
)))
7984 /* Const and volatile mean something different for function types,
7985 so the usual checks are not appropriate. */
7986 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7988 /* In Objective-C++, some types may have been 'volatilized' by
7989 the compiler for EH; when comparing them here, the volatile
7990 qualification must be ignored. */
7991 bool objc_quals_match
= objc_type_quals_match (to
, from
);
7993 if (!at_least_as_qualified_p (to
, from
) && !objc_quals_match
)
7996 if (!at_least_as_qualified_p (from
, to
) && !objc_quals_match
)
8000 to_more_cv_qualified
= true;
8004 constp
&= TYPE_READONLY (to
);
8007 if (TREE_CODE (to
) == VECTOR_TYPE
)
8008 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
8010 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
8011 return ((constp
>= 0 || to_more_cv_qualified
)
8012 && (is_opaque_pointer
8013 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
8017 /* When comparing, say, char ** to char const **, this function takes
8018 the 'char *' and 'char const *'. Do not pass non-pointer/reference
8019 types to this function. */
8022 comp_ptr_ttypes (tree to
, tree from
)
8024 return comp_ptr_ttypes_real (to
, from
, 1);
8027 /* Returns true iff FNTYPE is a non-class type that involves
8028 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
8029 if a parameter type is ill-formed. */
8032 error_type_p (const_tree type
)
8036 switch (TREE_CODE (type
))
8042 case REFERENCE_TYPE
:
8044 return error_type_p (TREE_TYPE (type
));
8048 if (error_type_p (TREE_TYPE (type
)))
8050 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
8051 if (error_type_p (TREE_VALUE (t
)))
8056 if (TYPE_PTRMEMFUNC_P (type
))
8057 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
8065 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
8066 type or inheritance-related types, regardless of cv-quals. */
8069 ptr_reasonably_similar (const_tree to
, const_tree from
)
8071 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
8073 /* Any target type is similar enough to void. */
8074 if (TREE_CODE (to
) == VOID_TYPE
)
8075 return !error_type_p (from
);
8076 if (TREE_CODE (from
) == VOID_TYPE
)
8077 return !error_type_p (to
);
8079 if (TREE_CODE (to
) != TREE_CODE (from
))
8082 if (TREE_CODE (from
) == OFFSET_TYPE
8083 && comptypes (TYPE_OFFSET_BASETYPE (to
),
8084 TYPE_OFFSET_BASETYPE (from
),
8085 COMPARE_BASE
| COMPARE_DERIVED
))
8088 if (TREE_CODE (to
) == VECTOR_TYPE
8089 && vector_types_convertible_p (to
, from
, false))
8092 if (TREE_CODE (to
) == INTEGER_TYPE
8093 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
8096 if (TREE_CODE (to
) == FUNCTION_TYPE
)
8097 return !error_type_p (to
) && !error_type_p (from
);
8099 if (TREE_CODE (to
) != POINTER_TYPE
)
8101 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
8102 COMPARE_BASE
| COMPARE_DERIVED
);
8106 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
8107 pointer-to-member types) are the same, ignoring cv-qualification at
8111 comp_ptr_ttypes_const (tree to
, tree from
)
8113 bool is_opaque_pointer
= false;
8115 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
8117 if (TREE_CODE (to
) != TREE_CODE (from
))
8120 if (TREE_CODE (from
) == OFFSET_TYPE
8121 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
8122 TYPE_OFFSET_BASETYPE (to
)))
8125 if (TREE_CODE (to
) == VECTOR_TYPE
)
8126 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
8128 if (TREE_CODE (to
) != POINTER_TYPE
)
8129 return (is_opaque_pointer
8130 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
8134 /* Returns the type qualifiers for this type, including the qualifiers on the
8135 elements for an array type. */
8138 cp_type_quals (const_tree type
)
8141 /* This CONST_CAST is okay because strip_array_types returns its
8142 argument unmodified and we assign it to a const_tree. */
8143 type
= strip_array_types (CONST_CAST_TREE (type
));
8144 if (type
== error_mark_node
8145 /* Quals on a FUNCTION_TYPE are memfn quals. */
8146 || TREE_CODE (type
) == FUNCTION_TYPE
)
8147 return TYPE_UNQUALIFIED
;
8148 quals
= TYPE_QUALS (type
);
8149 /* METHOD and REFERENCE_TYPEs should never have quals. */
8150 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
8151 && TREE_CODE (type
) != REFERENCE_TYPE
)
8152 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
8153 == TYPE_UNQUALIFIED
));
8157 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
8161 type_memfn_quals (const_tree type
)
8163 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8164 return TYPE_QUALS (type
);
8165 else if (TREE_CODE (type
) == METHOD_TYPE
)
8166 return cp_type_quals (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))));
8171 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
8175 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
)
8177 /* Could handle METHOD_TYPE here if necessary. */
8178 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8179 if (TYPE_QUALS (type
) == memfn_quals
)
8181 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
8183 return build_qualified_type (type
, memfn_quals
);
8186 /* Returns nonzero if TYPE is const or volatile. */
8189 cv_qualified_p (const_tree type
)
8191 int quals
= cp_type_quals (type
);
8192 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
8195 /* Returns nonzero if the TYPE contains a mutable member. */
8198 cp_has_mutable_p (const_tree type
)
8200 /* This CONST_CAST is okay because strip_array_types returns its
8201 argument unmodified and we assign it to a const_tree. */
8202 type
= strip_array_types (CONST_CAST_TREE(type
));
8204 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
8207 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
8208 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
8209 approximation. In particular, consider:
8212 struct S { int i; };
8213 const S s = { f(); }
8215 Here, we will make "s" as TREE_READONLY (because it is declared
8216 "const") -- only to reverse ourselves upon seeing that the
8217 initializer is non-constant. */
8220 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
8222 tree type
= TREE_TYPE (decl
);
8224 if (type
== error_mark_node
)
8227 if (TREE_CODE (decl
) == TYPE_DECL
)
8230 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
8231 && type_quals
!= TYPE_UNQUALIFIED
));
8233 /* Avoid setting TREE_READONLY incorrectly. */
8234 if (/* If the object has a constructor, the constructor may modify
8236 TYPE_NEEDS_CONSTRUCTING (type
)
8237 /* If the type isn't complete, we don't know yet if it will need
8239 || !COMPLETE_TYPE_P (type
)
8240 /* If the type has a mutable component, that component might be
8242 || TYPE_HAS_MUTABLE_P (type
))
8243 type_quals
&= ~TYPE_QUAL_CONST
;
8245 c_apply_type_quals_to_decl (type_quals
, decl
);
8248 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8249 exemplar types such that casting T1 to T2 is casting away constness
8250 if and only if there is no implicit conversion from T1 to T2. */
8253 casts_away_constness_r (tree
*t1
, tree
*t2
)
8258 /* [expr.const.cast]
8260 For multi-level pointer to members and multi-level mixed pointers
8261 and pointers to members (conv.qual), the "member" aspect of a
8262 pointer to member level is ignored when determining if a const
8263 cv-qualifier has been cast away. */
8264 /* [expr.const.cast]
8266 For two pointer types:
8268 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8269 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8272 casting from X1 to X2 casts away constness if, for a non-pointer
8273 type T there does not exist an implicit conversion (clause
8276 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8280 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8281 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
8282 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
8284 *t1
= cp_build_qualified_type (void_type_node
,
8285 cp_type_quals (*t1
));
8286 *t2
= cp_build_qualified_type (void_type_node
,
8287 cp_type_quals (*t2
));
8291 quals1
= cp_type_quals (*t1
);
8292 quals2
= cp_type_quals (*t2
);
8294 if (TYPE_PTRMEM_P (*t1
))
8295 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
8297 *t1
= TREE_TYPE (*t1
);
8298 if (TYPE_PTRMEM_P (*t2
))
8299 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
8301 *t2
= TREE_TYPE (*t2
);
8303 casts_away_constness_r (t1
, t2
);
8304 *t1
= build_pointer_type (*t1
);
8305 *t2
= build_pointer_type (*t2
);
8306 *t1
= cp_build_qualified_type (*t1
, quals1
);
8307 *t2
= cp_build_qualified_type (*t2
, quals2
);
8310 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8313 ??? This function returns non-zero if casting away qualifiers not
8314 just const. We would like to return to the caller exactly which
8315 qualifiers are casted away to give more accurate diagnostics.
8319 casts_away_constness (tree t1
, tree t2
)
8321 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
8323 /* [expr.const.cast]
8325 Casting from an lvalue of type T1 to an lvalue of type T2
8326 using a reference cast casts away constness if a cast from an
8327 rvalue of type "pointer to T1" to the type "pointer to T2"
8328 casts away constness. */
8329 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
8330 return casts_away_constness (build_pointer_type (t1
),
8331 build_pointer_type (TREE_TYPE (t2
)));
8334 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
8335 /* [expr.const.cast]
8337 Casting from an rvalue of type "pointer to data member of X
8338 of type T1" to the type "pointer to data member of Y of type
8339 T2" casts away constness if a cast from an rvalue of type
8340 "pointer to T1" to the type "pointer to T2" casts away
8342 return casts_away_constness
8343 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
8344 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
8346 /* Casting away constness is only something that makes sense for
8347 pointer or reference types. */
8348 if (TREE_CODE (t1
) != POINTER_TYPE
8349 || TREE_CODE (t2
) != POINTER_TYPE
)
8352 /* Top-level qualifiers don't matter. */
8353 t1
= TYPE_MAIN_VARIANT (t1
);
8354 t2
= TYPE_MAIN_VARIANT (t2
);
8355 casts_away_constness_r (&t1
, &t2
);
8356 if (!can_convert (t2
, t1
))
8362 /* If T is a REFERENCE_TYPE return the type to which T refers.
8363 Otherwise, return T itself. */
8366 non_reference (tree t
)
8368 if (TREE_CODE (t
) == REFERENCE_TYPE
)
8374 /* Return nonzero if REF is an lvalue valid for this language;
8375 otherwise, print an error message and return zero. USE says
8376 how the lvalue is being used and so selects the error message. */
8379 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
8381 cp_lvalue_kind kind
= lvalue_kind (ref
);
8383 if (kind
== clk_none
)
8385 if (complain
& tf_error
)
8389 else if (kind
& (clk_rvalueref
|clk_class
))
8391 if (!(complain
& tf_error
))
8393 if (kind
& clk_class
)
8394 /* Make this a permerror because we used to accept it. */
8395 permerror (input_location
, "using temporary as lvalue");
8397 error ("using xvalue (rvalue reference) as lvalue");