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 tree index1
, index2
;
1147 gcc_assert (t1
&& t2
1148 && TREE_CODE (t1
) == TREE_CODE (t2
)
1149 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1150 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1151 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1153 index1
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t1
));
1154 index2
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t2
));
1156 /* If T1 and T2 belong to template parm lists of different size,
1157 let's assume they are different. */
1158 if (TEMPLATE_PARM_NUM_SIBLINGS (index1
)
1159 != TEMPLATE_PARM_NUM_SIBLINGS (index2
))
1162 /* Then compare their relative position. */
1163 if (TEMPLATE_PARM_IDX (index1
) != TEMPLATE_PARM_IDX (index2
)
1164 || TEMPLATE_PARM_LEVEL (index1
) != TEMPLATE_PARM_LEVEL (index2
)
1165 || (TEMPLATE_PARM_PARAMETER_PACK (index1
)
1166 != TEMPLATE_PARM_PARAMETER_PACK (index2
)))
1172 /* Subroutine in comptypes. */
1175 structural_comptypes (tree t1
, tree t2
, int strict
)
1180 /* Suppress errors caused by previously reported errors. */
1181 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1184 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1186 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1187 current instantiation. */
1188 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1189 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1191 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1192 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1194 if (TYPE_PTRMEMFUNC_P (t1
))
1195 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1196 if (TYPE_PTRMEMFUNC_P (t2
))
1197 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1199 /* Different classes of types can't be compatible. */
1200 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1203 /* Qualifiers must match. For array types, we will check when we
1204 recur on the array element types. */
1205 if (TREE_CODE (t1
) != ARRAY_TYPE
1206 && cp_type_quals (t1
) != cp_type_quals (t2
))
1208 if (TREE_CODE (t1
) == FUNCTION_TYPE
1209 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1211 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1214 /* Allow for two different type nodes which have essentially the same
1215 definition. Note that we already checked for equality of the type
1216 qualifiers (just above). */
1218 if (TREE_CODE (t1
) != ARRAY_TYPE
1219 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1223 /* Compare the types. Break out if they could be the same. */
1224 switch (TREE_CODE (t1
))
1228 /* All void and bool types are the same. */
1232 case FIXED_POINT_TYPE
:
1234 /* With these nodes, we can't determine type equivalence by
1235 looking at what is stored in the nodes themselves, because
1236 two nodes might have different TYPE_MAIN_VARIANTs but still
1237 represent the same type. For example, wchar_t and int could
1238 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1239 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1240 and are distinct types. On the other hand, int and the
1243 typedef int INT __attribute((may_alias));
1245 have identical properties, different TYPE_MAIN_VARIANTs, but
1246 represent the same type. The canonical type system keeps
1247 track of equivalence in this case, so we fall back on it. */
1248 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1250 case TEMPLATE_TEMPLATE_PARM
:
1251 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1252 if (!comp_template_parms_position (t1
, t2
))
1254 if (!comp_template_parms
1255 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1256 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1258 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1260 /* Don't check inheritance. */
1261 strict
= COMPARE_STRICT
;
1266 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1267 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1268 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1269 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1272 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1274 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1280 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1281 strict
& ~COMPARE_REDECLARATION
))
1283 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1287 case REFERENCE_TYPE
:
1288 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1290 /* fall through to checks for pointer types */
1293 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1294 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
)
1295 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1301 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1303 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1308 /* Target types must match incl. qualifiers. */
1309 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1313 case TEMPLATE_TYPE_PARM
:
1314 /* If T1 and T2 don't have the same relative position in their
1315 template parameters set, they can't be equal. */
1316 if (!comp_template_parms_position (t1
, t2
))
1321 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1322 TYPENAME_TYPE_FULLNAME (t2
)))
1324 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1328 case UNBOUND_CLASS_TEMPLATE
:
1329 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1331 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1336 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1341 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1342 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1346 case TYPE_PACK_EXPANSION
:
1347 return same_type_p (PACK_EXPANSION_PATTERN (t1
),
1348 PACK_EXPANSION_PATTERN (t2
));
1351 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1352 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1353 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1354 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1355 || (DECLTYPE_FOR_LAMBDA_RETURN (t1
)
1356 != DECLTYPE_FOR_LAMBDA_RETURN (t2
))
1357 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1358 DECLTYPE_TYPE_EXPR (t2
)))
1366 /* If we get here, we know that from a target independent POV the
1367 types are the same. Make sure the target attributes are also
1369 return targetm
.comp_type_attributes (t1
, t2
);
1372 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1373 is a bitwise-or of the COMPARE_* flags. */
1376 comptypes (tree t1
, tree t2
, int strict
)
1378 if (strict
== COMPARE_STRICT
)
1383 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1386 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1387 /* At least one of the types requires structural equality, so
1388 perform a deep check. */
1389 return structural_comptypes (t1
, t2
, strict
);
1391 #ifdef ENABLE_CHECKING
1392 if (USE_CANONICAL_TYPES
)
1394 bool result
= structural_comptypes (t1
, t2
, strict
);
1396 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1397 /* The two types are structurally equivalent, but their
1398 canonical types were different. This is a failure of the
1399 canonical type propagation code.*/
1401 ("canonical types differ for identical types %T and %T",
1403 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1404 /* Two types are structurally different, but the canonical
1405 types are the same. This means we were over-eager in
1406 assigning canonical types. */
1408 ("same canonical type node for different types %T and %T",
1414 if (USE_CANONICAL_TYPES
)
1415 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1418 return structural_comptypes (t1
, t2
, strict
);
1420 else if (strict
== COMPARE_STRUCTURAL
)
1421 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1423 return structural_comptypes (t1
, t2
, strict
);
1426 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1427 top-level qualifiers. */
1430 same_type_ignoring_top_level_qualifiers_p (tree type1
, tree type2
)
1432 if (type1
== error_mark_node
|| type2
== error_mark_node
)
1435 return same_type_p (TYPE_MAIN_VARIANT (type1
), TYPE_MAIN_VARIANT (type2
));
1438 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1441 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1443 int q1
= cp_type_quals (type1
);
1444 int q2
= cp_type_quals (type2
);
1446 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1447 return (q1
& q2
) == q2
;
1450 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1451 more cv-qualified that TYPE1, and 0 otherwise. */
1454 comp_cv_qualification (const_tree type1
, const_tree type2
)
1456 int q1
= cp_type_quals (type1
);
1457 int q2
= cp_type_quals (type2
);
1462 if ((q1
& q2
) == q2
)
1464 else if ((q1
& q2
) == q1
)
1470 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1471 subset of the cv-qualification signature of TYPE2, and the types
1472 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1475 comp_cv_qual_signature (tree type1
, tree type2
)
1477 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1479 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1485 /* Subroutines of `comptypes'. */
1487 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1488 equivalent in the sense that functions with those parameter types
1489 can have equivalent types. The two lists must be equivalent,
1490 element by element. */
1493 compparms (const_tree parms1
, const_tree parms2
)
1497 /* An unspecified parmlist matches any specified parmlist
1498 whose argument types don't need default promotions. */
1500 for (t1
= parms1
, t2
= parms2
;
1502 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1504 /* If one parmlist is shorter than the other,
1505 they fail to match. */
1508 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1515 /* Process a sizeof or alignof expression where the operand is a
1519 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1524 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1525 if (type
== error_mark_node
)
1526 return error_mark_node
;
1528 type
= non_reference (type
);
1529 if (TREE_CODE (type
) == METHOD_TYPE
)
1532 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
1533 "invalid application of %qs to a member function",
1534 operator_name_info
[(int) op
].name
);
1535 value
= size_one_node
;
1538 dependent_p
= dependent_type_p (type
);
1540 complete_type (type
);
1542 /* VLA types will have a non-constant size. In the body of an
1543 uninstantiated template, we don't need to try to compute the
1544 value, because the sizeof expression is not an integral
1545 constant expression in that case. And, if we do try to
1546 compute the value, we'll likely end up with SAVE_EXPRs, which
1547 the template substitution machinery does not expect to see. */
1548 || (processing_template_decl
1549 && COMPLETE_TYPE_P (type
)
1550 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1552 value
= build_min (op
, size_type_node
, type
);
1553 TREE_READONLY (value
) = 1;
1557 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1562 /* Return the size of the type, without producing any warnings for
1563 types whose size cannot be taken. This routine should be used only
1564 in some other routine that has already produced a diagnostic about
1565 using the size of such a type. */
1567 cxx_sizeof_nowarn (tree type
)
1569 if (TREE_CODE (type
) == FUNCTION_TYPE
1570 || TREE_CODE (type
) == VOID_TYPE
1571 || TREE_CODE (type
) == ERROR_MARK
)
1572 return size_one_node
;
1573 else if (!COMPLETE_TYPE_P (type
))
1574 return size_zero_node
;
1576 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1579 /* Process a sizeof expression where the operand is an expression. */
1582 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1584 if (e
== error_mark_node
)
1585 return error_mark_node
;
1587 if (processing_template_decl
)
1589 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1590 TREE_SIDE_EFFECTS (e
) = 0;
1591 TREE_READONLY (e
) = 1;
1596 /* To get the size of a static data member declared as an array of
1597 unknown bound, we need to instantiate it. */
1598 if (TREE_CODE (e
) == VAR_DECL
1599 && VAR_HAD_UNKNOWN_BOUND (e
)
1600 && DECL_TEMPLATE_INSTANTIATION (e
))
1601 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1603 e
= mark_type_use (e
);
1605 if (TREE_CODE (e
) == COMPONENT_REF
1606 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1607 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1609 if (complain
& tf_error
)
1610 error ("invalid application of %<sizeof%> to a bit-field");
1612 return error_mark_node
;
1615 else if (is_overloaded_fn (e
))
1617 if (complain
& tf_error
)
1618 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1621 return error_mark_node
;
1624 else if (type_unknown_p (e
))
1626 if (complain
& tf_error
)
1627 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1629 return error_mark_node
;
1635 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1638 /* Implement the __alignof keyword: Return the minimum required
1639 alignment of E, measured in bytes. For VAR_DECL's and
1640 FIELD_DECL's return DECL_ALIGN (which can be set from an
1641 "aligned" __attribute__ specification). */
1644 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1648 if (e
== error_mark_node
)
1649 return error_mark_node
;
1651 if (processing_template_decl
)
1653 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1654 TREE_SIDE_EFFECTS (e
) = 0;
1655 TREE_READONLY (e
) = 1;
1660 e
= mark_type_use (e
);
1662 if (TREE_CODE (e
) == VAR_DECL
)
1663 t
= size_int (DECL_ALIGN_UNIT (e
));
1664 else if (TREE_CODE (e
) == COMPONENT_REF
1665 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1666 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1668 if (complain
& tf_error
)
1669 error ("invalid application of %<__alignof%> to a bit-field");
1671 return error_mark_node
;
1674 else if (TREE_CODE (e
) == COMPONENT_REF
1675 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1676 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1677 else if (is_overloaded_fn (e
))
1679 if (complain
& tf_error
)
1680 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1683 return error_mark_node
;
1684 if (TREE_CODE (e
) == FUNCTION_DECL
)
1685 t
= size_int (DECL_ALIGN_UNIT (e
));
1689 else if (type_unknown_p (e
))
1691 if (complain
& tf_error
)
1692 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1694 return error_mark_node
;
1698 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1699 complain
& tf_error
);
1701 return fold_convert (size_type_node
, t
);
1704 /* Process a sizeof or alignof expression E with code OP where the operand
1705 is an expression. */
1708 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1710 if (op
== SIZEOF_EXPR
)
1711 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1713 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1716 /* EXPR is being used in a context that is not a function call.
1721 The expression can be used only as the left-hand operand of a
1722 member function call.
1724 [expr.mptr.operator]
1726 If the result of .* or ->* is a function, then that result can be
1727 used only as the operand for the function call operator ().
1729 by issuing an error message if appropriate. Returns true iff EXPR
1730 violates these rules. */
1733 invalid_nonstatic_memfn_p (const_tree expr
, tsubst_flags_t complain
)
1735 if (expr
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1737 if (complain
& tf_error
)
1738 error ("invalid use of non-static member function");
1744 /* If EXP is a reference to a bitfield, and the type of EXP does not
1745 match the declared type of the bitfield, return the declared type
1746 of the bitfield. Otherwise, return NULL_TREE. */
1749 is_bitfield_expr_with_lowered_type (const_tree exp
)
1751 switch (TREE_CODE (exp
))
1754 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1755 ? TREE_OPERAND (exp
, 1)
1756 : TREE_OPERAND (exp
, 0)))
1758 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1761 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1765 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1771 field
= TREE_OPERAND (exp
, 1);
1772 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1774 if (same_type_ignoring_top_level_qualifiers_p
1775 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1777 return DECL_BIT_FIELD_TYPE (field
);
1781 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1782 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1783 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1791 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1792 bitfield with a lowered type, the type of EXP is returned, rather
1796 unlowered_expr_type (const_tree exp
)
1800 type
= is_bitfield_expr_with_lowered_type (exp
);
1802 type
= TREE_TYPE (exp
);
1807 /* Perform the conversions in [expr] that apply when an lvalue appears
1808 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1809 function-to-pointer conversions. In addition, manifest constants
1810 are replaced by their values, and bitfield references are converted
1811 to their declared types. Note that this function does not perform the
1812 lvalue-to-rvalue conversion for class types. If you need that conversion
1813 to for class types, then you probably need to use force_rvalue.
1815 Although the returned value is being used as an rvalue, this
1816 function does not wrap the returned expression in a
1817 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1818 that the return value is no longer an lvalue. */
1821 decay_conversion (tree exp
)
1824 enum tree_code code
;
1826 type
= TREE_TYPE (exp
);
1827 if (type
== error_mark_node
)
1828 return error_mark_node
;
1830 exp
= mark_rvalue_use (exp
);
1832 exp
= resolve_nondeduced_context (exp
);
1833 if (type_unknown_p (exp
))
1835 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1836 return error_mark_node
;
1839 /* FIXME remove? at least need to remember that this isn't really a
1840 constant expression if EXP isn't decl_constant_var_p, like with
1841 C_MAYBE_CONST_EXPR. */
1842 exp
= decl_constant_value (exp
);
1843 if (error_operand_p (exp
))
1844 return error_mark_node
;
1846 if (NULLPTR_TYPE_P (type
))
1847 return nullptr_node
;
1849 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1850 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1851 code
= TREE_CODE (type
);
1852 if (code
== VOID_TYPE
)
1854 error ("void value not ignored as it ought to be");
1855 return error_mark_node
;
1857 if (invalid_nonstatic_memfn_p (exp
, tf_warning_or_error
))
1858 return error_mark_node
;
1859 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1860 return cp_build_addr_expr (exp
, tf_warning_or_error
);
1861 if (code
== ARRAY_TYPE
)
1866 if (TREE_CODE (exp
) == INDIRECT_REF
)
1867 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1868 TREE_OPERAND (exp
, 0));
1870 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1872 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1873 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1874 TREE_OPERAND (exp
, 0), op1
);
1878 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1880 error ("invalid use of non-lvalue array");
1881 return error_mark_node
;
1884 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1886 if (TREE_CODE (exp
) == VAR_DECL
)
1888 if (!cxx_mark_addressable (exp
))
1889 return error_mark_node
;
1890 adr
= build_nop (ptrtype
, build_address (exp
));
1893 /* This way is better for a COMPONENT_REF since it can
1894 simplify the offset for a component. */
1895 adr
= cp_build_addr_expr (exp
, tf_warning_or_error
);
1896 return cp_convert (ptrtype
, adr
);
1899 /* If a bitfield is used in a context where integral promotion
1900 applies, then the caller is expected to have used
1901 default_conversion. That function promotes bitfields correctly
1902 before calling this function. At this point, if we have a
1903 bitfield referenced, we may assume that is not subject to
1904 promotion, and that, therefore, the type of the resulting rvalue
1905 is the declared type of the bitfield. */
1906 exp
= convert_bitfield_to_declared_type (exp
);
1908 /* We do not call rvalue() here because we do not want to wrap EXP
1909 in a NON_LVALUE_EXPR. */
1913 Non-class rvalues always have cv-unqualified types. */
1914 type
= TREE_TYPE (exp
);
1915 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
1916 exp
= build_nop (cv_unqualified (type
), exp
);
1921 /* Perform preparatory conversions, as part of the "usual arithmetic
1922 conversions". In particular, as per [expr]:
1924 Whenever an lvalue expression appears as an operand of an
1925 operator that expects the rvalue for that operand, the
1926 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1927 standard conversions are applied to convert the expression to an
1930 In addition, we perform integral promotions here, as those are
1931 applied to both operands to a binary operator before determining
1932 what additional conversions should apply. */
1935 default_conversion (tree exp
)
1937 /* Check for target-specific promotions. */
1938 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
1940 exp
= cp_convert (promoted_type
, exp
);
1941 /* Perform the integral promotions first so that bitfield
1942 expressions (which may promote to "int", even if the bitfield is
1943 declared "unsigned") are promoted correctly. */
1944 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
1945 exp
= perform_integral_promotions (exp
);
1946 /* Perform the other conversions. */
1947 exp
= decay_conversion (exp
);
1952 /* EXPR is an expression with an integral or enumeration type.
1953 Perform the integral promotions in [conv.prom], and return the
1957 perform_integral_promotions (tree expr
)
1962 expr
= mark_rvalue_use (expr
);
1966 If the bitfield has an enumerated type, it is treated as any
1967 other value of that type for promotion purposes. */
1968 type
= is_bitfield_expr_with_lowered_type (expr
);
1969 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
1970 type
= TREE_TYPE (expr
);
1971 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
1972 promoted_type
= type_promotes_to (type
);
1973 if (type
!= promoted_type
)
1974 expr
= cp_convert (promoted_type
, expr
);
1978 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1979 decay_conversion to one. */
1982 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
1986 if (TREE_CODE (totype
) != POINTER_TYPE
)
1989 t
= TREE_TYPE (totype
);
1990 if (!same_type_p (t
, char_type_node
)
1991 && !same_type_p (t
, char16_type_node
)
1992 && !same_type_p (t
, char32_type_node
)
1993 && !same_type_p (t
, wchar_type_node
))
1996 if (TREE_CODE (exp
) == STRING_CST
)
1998 /* Make sure that we don't try to convert between char and wide chars. */
1999 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
2004 /* Is this a string constant which has decayed to 'const char *'? */
2005 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
2006 if (!same_type_p (TREE_TYPE (exp
), t
))
2009 if (TREE_CODE (exp
) != ADDR_EXPR
2010 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2014 /* This warning is not very useful, as it complains about printf. */
2016 warning (OPT_Wwrite_strings
,
2017 "deprecated conversion from string constant to %qT",
2023 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2024 can, for example, use as an lvalue. This code used to be in
2025 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2026 expressions, where we're dealing with aggregates. But now it's again only
2027 called from unary_complex_lvalue. The case (in particular) that led to
2028 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2032 rationalize_conditional_expr (enum tree_code code
, tree t
,
2033 tsubst_flags_t complain
)
2035 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2036 the first operand is always the one to be used if both operands
2037 are equal, so we know what conditional expression this used to be. */
2038 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2040 tree op0
= TREE_OPERAND (t
, 0);
2041 tree op1
= TREE_OPERAND (t
, 1);
2043 /* The following code is incorrect if either operand side-effects. */
2044 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2045 && !TREE_SIDE_EFFECTS (op1
));
2047 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
2048 ? LE_EXPR
: GE_EXPR
),
2049 op0
, TREE_CODE (op0
),
2050 op1
, TREE_CODE (op1
),
2051 /*overloaded_p=*/NULL
,
2053 cp_build_unary_op (code
, op0
, 0, complain
),
2054 cp_build_unary_op (code
, op1
, 0, complain
),
2059 build_conditional_expr (TREE_OPERAND (t
, 0),
2060 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2062 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2067 /* Given the TYPE of an anonymous union field inside T, return the
2068 FIELD_DECL for the field. If not found return NULL_TREE. Because
2069 anonymous unions can nest, we must also search all anonymous unions
2070 that are directly reachable. */
2073 lookup_anon_field (tree t
, tree type
)
2077 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2079 if (TREE_STATIC (field
))
2081 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2084 /* If we find it directly, return the field. */
2085 if (DECL_NAME (field
) == NULL_TREE
2086 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2091 /* Otherwise, it could be nested, search harder. */
2092 if (DECL_NAME (field
) == NULL_TREE
2093 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2095 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2103 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2104 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2105 non-NULL, it indicates the path to the base used to name MEMBER.
2106 If PRESERVE_REFERENCE is true, the expression returned will have
2107 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2108 returned will have the type referred to by the reference.
2110 This function does not perform access control; that is either done
2111 earlier by the parser when the name of MEMBER is resolved to MEMBER
2112 itself, or later when overload resolution selects one of the
2113 functions indicated by MEMBER. */
2116 build_class_member_access_expr (tree object
, tree member
,
2117 tree access_path
, bool preserve_reference
,
2118 tsubst_flags_t complain
)
2122 tree result
= NULL_TREE
;
2124 if (error_operand_p (object
) || error_operand_p (member
))
2125 return error_mark_node
;
2127 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2131 The type of the first expression shall be "class object" (of a
2133 object_type
= TREE_TYPE (object
);
2134 if (!currently_open_class (object_type
)
2135 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2136 return error_mark_node
;
2137 if (!CLASS_TYPE_P (object_type
))
2139 if (complain
& tf_error
)
2140 error ("request for member %qD in %qE, which is of non-class type %qT",
2141 member
, object
, object_type
);
2142 return error_mark_node
;
2145 /* The standard does not seem to actually say that MEMBER must be a
2146 member of OBJECT_TYPE. However, that is clearly what is
2148 if (DECL_P (member
))
2150 member_scope
= DECL_CLASS_CONTEXT (member
);
2152 if (TREE_DEPRECATED (member
))
2153 warn_deprecated_use (member
, NULL_TREE
);
2156 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2157 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2158 presently be the anonymous union. Go outwards until we find a
2159 type related to OBJECT_TYPE. */
2160 while (ANON_AGGR_TYPE_P (member_scope
)
2161 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2163 member_scope
= TYPE_CONTEXT (member_scope
);
2164 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2166 if (complain
& tf_error
)
2168 if (TREE_CODE (member
) == FIELD_DECL
)
2169 error ("invalid use of nonstatic data member %qE", member
);
2171 error ("%qD is not a member of %qT", member
, object_type
);
2173 return error_mark_node
;
2176 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2177 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2178 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2180 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2182 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2185 /* In [expr.ref], there is an explicit list of the valid choices for
2186 MEMBER. We check for each of those cases here. */
2187 if (TREE_CODE (member
) == VAR_DECL
)
2189 /* A static data member. */
2191 mark_exp_read (object
);
2192 /* If OBJECT has side-effects, they are supposed to occur. */
2193 if (TREE_SIDE_EFFECTS (object
))
2194 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2196 else if (TREE_CODE (member
) == FIELD_DECL
)
2198 /* A non-static data member. */
2203 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
2204 && integer_zerop (TREE_OPERAND (object
, 0)));
2206 /* Convert OBJECT to the type of MEMBER. */
2207 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2208 TYPE_MAIN_VARIANT (member_scope
)))
2213 binfo
= lookup_base (access_path
? access_path
: object_type
,
2214 member_scope
, ba_unique
, &kind
);
2215 if (binfo
== error_mark_node
)
2216 return error_mark_node
;
2218 /* It is invalid to try to get to a virtual base of a
2219 NULL object. The most common cause is invalid use of
2221 if (null_object_p
&& kind
== bk_via_virtual
)
2223 if (complain
& tf_error
)
2225 error ("invalid access to non-static data member %qD of "
2228 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2230 return error_mark_node
;
2233 /* Convert to the base. */
2234 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2236 /* If we found the base successfully then we should be able
2237 to convert to it successfully. */
2238 gcc_assert (object
!= error_mark_node
);
2241 /* Complain about other invalid uses of offsetof, even though they will
2242 give the right answer. Note that we complain whether or not they
2243 actually used the offsetof macro, since there's no way to know at this
2244 point. So we just give a warning, instead of a pedwarn. */
2245 /* Do not produce this warning for base class field references, because
2246 we know for a fact that didn't come from offsetof. This does occur
2247 in various testsuite cases where a null object is passed where a
2248 vtable access is required. */
2249 if (null_object_p
&& warn_invalid_offsetof
2250 && CLASSTYPE_NON_STD_LAYOUT (object_type
)
2251 && !DECL_FIELD_IS_BASE (member
)
2252 && cp_unevaluated_operand
== 0
2253 && (complain
& tf_warning
))
2255 warning (OPT_Winvalid_offsetof
,
2256 "invalid access to non-static data member %qD "
2257 " of NULL object", member
);
2258 warning (OPT_Winvalid_offsetof
,
2259 "(perhaps the %<offsetof%> macro was used incorrectly)");
2262 /* If MEMBER is from an anonymous aggregate, we have converted
2263 OBJECT so that it refers to the class containing the
2264 anonymous union. Generate a reference to the anonymous union
2265 itself, and recur to find MEMBER. */
2266 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2267 /* When this code is called from build_field_call, the
2268 object already has the type of the anonymous union.
2269 That is because the COMPONENT_REF was already
2270 constructed, and was then disassembled before calling
2271 build_field_call. After the function-call code is
2272 cleaned up, this waste can be eliminated. */
2273 && (!same_type_ignoring_top_level_qualifiers_p
2274 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2276 tree anonymous_union
;
2278 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2279 DECL_CONTEXT (member
));
2280 object
= build_class_member_access_expr (object
,
2282 /*access_path=*/NULL_TREE
,
2287 /* Compute the type of the field, as described in [expr.ref]. */
2288 type_quals
= TYPE_UNQUALIFIED
;
2289 member_type
= TREE_TYPE (member
);
2290 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2292 type_quals
= (cp_type_quals (member_type
)
2293 | cp_type_quals (object_type
));
2295 /* A field is const (volatile) if the enclosing object, or the
2296 field itself, is const (volatile). But, a mutable field is
2297 not const, even within a const object. */
2298 if (DECL_MUTABLE_P (member
))
2299 type_quals
&= ~TYPE_QUAL_CONST
;
2300 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2303 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
2305 result
= fold_if_not_in_template (result
);
2307 /* Mark the expression const or volatile, as appropriate. Even
2308 though we've dealt with the type above, we still have to mark the
2309 expression itself. */
2310 if (type_quals
& TYPE_QUAL_CONST
)
2311 TREE_READONLY (result
) = 1;
2312 if (type_quals
& TYPE_QUAL_VOLATILE
)
2313 TREE_THIS_VOLATILE (result
) = 1;
2315 else if (BASELINK_P (member
))
2317 /* The member is a (possibly overloaded) member function. */
2321 /* If the MEMBER is exactly one static member function, then we
2322 know the type of the expression. Otherwise, we must wait
2323 until overload resolution has been performed. */
2324 functions
= BASELINK_FUNCTIONS (member
);
2325 if (TREE_CODE (functions
) == FUNCTION_DECL
2326 && DECL_STATIC_FUNCTION_P (functions
))
2327 type
= TREE_TYPE (functions
);
2329 type
= unknown_type_node
;
2330 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2331 base. That will happen when the function is called. */
2332 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2334 else if (TREE_CODE (member
) == CONST_DECL
)
2336 /* The member is an enumerator. */
2338 /* If OBJECT has side-effects, they are supposed to occur. */
2339 if (TREE_SIDE_EFFECTS (object
))
2340 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2345 if (complain
& tf_error
)
2346 error ("invalid use of %qD", member
);
2347 return error_mark_node
;
2350 if (!preserve_reference
)
2353 If E2 is declared to have type "reference to T", then ... the
2354 type of E1.E2 is T. */
2355 result
= convert_from_reference (result
);
2360 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2361 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2364 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2366 tree object_type
= TREE_TYPE (object
);
2367 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2370 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2372 error ("qualified type %qT does not match destructor name ~%qT",
2374 return error_mark_node
;
2376 if (TREE_CODE (dtor_type
) == IDENTIFIER_NODE
)
2378 /* In a template, names we can't find a match for are still accepted
2379 destructor names, and we check them here. */
2380 if (check_dtor_name (object_type
, dtor_type
))
2381 dtor_type
= object_type
;
2384 error ("object type %qT does not match destructor name ~%qT",
2385 object_type
, dtor_type
);
2386 return error_mark_node
;
2390 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2392 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2393 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2394 return error_mark_node
;
2396 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2397 /*protect=*/1, /*want_type=*/false);
2398 expr
= (adjust_result_of_qualified_name_lookup
2399 (expr
, dtor_type
, object_type
));
2403 /* An expression of the form "A::template B" has been resolved to
2404 DECL. Issue a diagnostic if B is not a template or template
2408 check_template_keyword (tree decl
)
2410 /* The standard says:
2414 If a name prefixed by the keyword template is not a member
2415 template, the program is ill-formed.
2417 DR 228 removed the restriction that the template be a member
2420 DR 96, if accepted would add the further restriction that explicit
2421 template arguments must be provided if the template keyword is
2422 used, but, as of 2005-10-16, that DR is still in "drafting". If
2423 this DR is accepted, then the semantic checks here can be
2424 simplified, as the entity named must in fact be a template
2425 specialization, rather than, as at present, a set of overloaded
2426 functions containing at least one template function. */
2427 if (TREE_CODE (decl
) != TEMPLATE_DECL
2428 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2430 if (!is_overloaded_fn (decl
))
2431 permerror (input_location
, "%qD is not a template", decl
);
2436 if (BASELINK_P (fns
))
2437 fns
= BASELINK_FUNCTIONS (fns
);
2440 tree fn
= OVL_CURRENT (fns
);
2441 if (TREE_CODE (fn
) == TEMPLATE_DECL
2442 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2444 if (TREE_CODE (fn
) == FUNCTION_DECL
2445 && DECL_USE_TEMPLATE (fn
)
2446 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2448 fns
= OVL_NEXT (fns
);
2451 permerror (input_location
, "%qD is not a template", decl
);
2456 /* This function is called by the parser to process a class member
2457 access expression of the form OBJECT.NAME. NAME is a node used by
2458 the parser to represent a name; it is not yet a DECL. It may,
2459 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2460 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2461 there is no reason to do the lookup twice, so the parser keeps the
2462 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2463 be a template via the use of the "A::template B" syntax. */
2466 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2467 tsubst_flags_t complain
)
2472 tree access_path
= NULL_TREE
;
2473 tree orig_object
= object
;
2474 tree orig_name
= name
;
2476 if (object
== error_mark_node
|| name
== error_mark_node
)
2477 return error_mark_node
;
2479 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2480 if (!objc_is_public (object
, name
))
2481 return error_mark_node
;
2483 object_type
= TREE_TYPE (object
);
2485 if (processing_template_decl
)
2487 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2488 dependent_type_p (object_type
)
2489 /* If NAME is just an IDENTIFIER_NODE, then the expression
2491 || TREE_CODE (object
) == IDENTIFIER_NODE
2492 /* If NAME is "f<args>", where either 'f' or 'args' is
2493 dependent, then the expression is dependent. */
2494 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2495 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2496 TREE_OPERAND (name
, 1)))
2497 /* If NAME is "T::X" where "T" is dependent, then the
2498 expression is dependent. */
2499 || (TREE_CODE (name
) == SCOPE_REF
2500 && TYPE_P (TREE_OPERAND (name
, 0))
2501 && dependent_type_p (TREE_OPERAND (name
, 0))))
2502 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2503 object
= build_non_dependent_expr (object
);
2505 else if (c_dialect_objc ()
2506 && TREE_CODE (name
) == IDENTIFIER_NODE
2507 && (expr
= objc_maybe_build_component_ref (object
, name
)))
2512 The type of the first expression shall be "class object" (of a
2514 if (!currently_open_class (object_type
)
2515 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2516 return error_mark_node
;
2517 if (!CLASS_TYPE_P (object_type
))
2519 if (complain
& tf_error
)
2520 error ("request for member %qD in %qE, which is of non-class type %qT",
2521 name
, object
, object_type
);
2522 return error_mark_node
;
2525 if (BASELINK_P (name
))
2526 /* A member function that has already been looked up. */
2530 bool is_template_id
= false;
2531 tree template_args
= NULL_TREE
;
2534 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2536 is_template_id
= true;
2537 template_args
= TREE_OPERAND (name
, 1);
2538 name
= TREE_OPERAND (name
, 0);
2540 if (TREE_CODE (name
) == OVERLOAD
)
2541 name
= DECL_NAME (get_first_fn (name
));
2542 else if (DECL_P (name
))
2543 name
= DECL_NAME (name
);
2546 if (TREE_CODE (name
) == SCOPE_REF
)
2548 /* A qualified name. The qualifying class or namespace `S'
2549 has already been looked up; it is either a TYPE or a
2551 scope
= TREE_OPERAND (name
, 0);
2552 name
= TREE_OPERAND (name
, 1);
2554 /* If SCOPE is a namespace, then the qualified name does not
2555 name a member of OBJECT_TYPE. */
2556 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2558 if (complain
& tf_error
)
2559 error ("%<%D::%D%> is not a member of %qT",
2560 scope
, name
, object_type
);
2561 return error_mark_node
;
2564 gcc_assert (CLASS_TYPE_P (scope
));
2565 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2566 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2568 if (constructor_name_p (name
, scope
))
2570 if (complain
& tf_error
)
2571 error ("cannot call constructor %<%T::%D%> directly",
2573 return error_mark_node
;
2576 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2577 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2578 if (access_path
== error_mark_node
)
2579 return error_mark_node
;
2582 if (complain
& tf_error
)
2583 error ("%qT is not a base of %qT", scope
, object_type
);
2584 return error_mark_node
;
2590 access_path
= object_type
;
2593 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2594 member
= lookup_destructor (object
, scope
, name
);
2597 /* Look up the member. */
2598 member
= lookup_member (access_path
, name
, /*protect=*/1,
2599 /*want_type=*/false);
2600 if (member
== NULL_TREE
)
2602 if (complain
& tf_error
)
2603 error ("%qD has no member named %qE", object_type
, name
);
2604 return error_mark_node
;
2606 if (member
== error_mark_node
)
2607 return error_mark_node
;
2612 tree templ
= member
;
2614 if (BASELINK_P (templ
))
2615 templ
= lookup_template_function (templ
, template_args
);
2618 if (complain
& tf_error
)
2619 error ("%qD is not a member template function", name
);
2620 return error_mark_node
;
2625 if (TREE_DEPRECATED (member
))
2626 warn_deprecated_use (member
, NULL_TREE
);
2629 check_template_keyword (member
);
2631 expr
= build_class_member_access_expr (object
, member
, access_path
,
2632 /*preserve_reference=*/false,
2634 if (processing_template_decl
&& expr
!= error_mark_node
)
2636 if (BASELINK_P (member
))
2638 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2639 BASELINK_QUALIFIED_P (member
) = 1;
2642 return build_min_non_dep (COMPONENT_REF
, expr
,
2643 orig_object
, orig_name
,
2650 /* Return an expression for the MEMBER_NAME field in the internal
2651 representation of PTRMEM, a pointer-to-member function. (Each
2652 pointer-to-member function type gets its own RECORD_TYPE so it is
2653 more convenient to access the fields by name than by FIELD_DECL.)
2654 This routine converts the NAME to a FIELD_DECL and then creates the
2655 node for the complete expression. */
2658 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2664 /* This code is a stripped down version of
2665 build_class_member_access_expr. It does not work to use that
2666 routine directly because it expects the object to be of class
2668 ptrmem_type
= TREE_TYPE (ptrmem
);
2669 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2670 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2671 /*want_type=*/false);
2672 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2673 cp_type_quals (ptrmem_type
));
2674 return fold_build3_loc (input_location
,
2675 COMPONENT_REF
, member_type
,
2676 ptrmem
, member
, NULL_TREE
);
2679 /* Given an expression PTR for a pointer, return an expression
2680 for the value pointed to.
2681 ERRORSTRING is the name of the operator to appear in error messages.
2683 This function may need to overload OPERATOR_FNNAME.
2684 Must also handle REFERENCE_TYPEs for C++. */
2687 build_x_indirect_ref (tree expr
, ref_operator errorstring
,
2688 tsubst_flags_t complain
)
2690 tree orig_expr
= expr
;
2693 if (processing_template_decl
)
2695 /* Retain the type if we know the operand is a pointer so that
2696 describable_type doesn't make auto deduction break. */
2697 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2698 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2699 if (type_dependent_expression_p (expr
))
2700 return build_min_nt (INDIRECT_REF
, expr
);
2701 expr
= build_non_dependent_expr (expr
);
2704 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2705 NULL_TREE
, /*overloaded_p=*/NULL
, complain
);
2707 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2709 if (processing_template_decl
&& rval
!= error_mark_node
)
2710 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2715 /* Helper function called from c-common. */
2717 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2718 tree ptr
, ref_operator errorstring
)
2720 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2724 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2725 tsubst_flags_t complain
)
2729 if (ptr
== error_mark_node
)
2730 return error_mark_node
;
2732 if (ptr
== current_class_ptr
)
2733 return current_class_ref
;
2735 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2736 ? ptr
: decay_conversion (ptr
));
2737 type
= TREE_TYPE (pointer
);
2739 if (POINTER_TYPE_P (type
))
2743 If the type of the expression is "pointer to T," the type
2744 of the result is "T." */
2745 tree t
= TREE_TYPE (type
);
2747 if (CONVERT_EXPR_P (ptr
)
2748 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2750 /* If a warning is issued, mark it to avoid duplicates from
2751 the backend. This only needs to be done at
2752 warn_strict_aliasing > 2. */
2753 if (warn_strict_aliasing
> 2)
2754 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2755 type
, TREE_OPERAND (ptr
, 0)))
2756 TREE_NO_WARNING (ptr
) = 1;
2759 if (VOID_TYPE_P (t
))
2761 /* A pointer to incomplete type (other than cv void) can be
2762 dereferenced [expr.unary.op]/1 */
2763 if (complain
& tf_error
)
2764 error ("%qT is not a pointer-to-object type", type
);
2765 return error_mark_node
;
2767 else if (TREE_CODE (pointer
) == ADDR_EXPR
2768 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2769 /* The POINTER was something like `&x'. We simplify `*&x' to
2771 return TREE_OPERAND (pointer
, 0);
2774 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2776 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2777 so that we get the proper error message if the result is used
2778 to assign to. Also, &* is supposed to be a no-op. */
2779 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2780 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2781 TREE_SIDE_EFFECTS (ref
)
2782 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2786 else if (!(complain
& tf_error
))
2787 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2789 /* `pointer' won't be an error_mark_node if we were given a
2790 pointer to member, so it's cool to check for this here. */
2791 else if (TYPE_PTR_TO_MEMBER_P (type
))
2792 switch (errorstring
)
2794 case RO_ARRAY_INDEXING
:
2795 error ("invalid use of array indexing on pointer to member");
2798 error ("invalid use of unary %<*%> on pointer to member");
2800 case RO_IMPLICIT_CONVERSION
:
2801 error ("invalid use of implicit conversion on pointer to member");
2806 else if (pointer
!= error_mark_node
)
2807 switch (errorstring
)
2810 error ("invalid type argument");
2812 case RO_ARRAY_INDEXING
:
2813 error ("invalid type argument of array indexing");
2816 error ("invalid type argument of unary %<*%>");
2818 case RO_IMPLICIT_CONVERSION
:
2819 error ("invalid type argument of implicit conversion");
2824 return error_mark_node
;
2827 /* This handles expressions of the form "a[i]", which denotes
2830 This is logically equivalent in C to *(a+i), but we may do it differently.
2831 If A is a variable or a member, we generate a primitive ARRAY_REF.
2832 This avoids forcing the array out of registers, and can work on
2833 arrays that are not lvalues (for example, members of structures returned
2836 If INDEX is of some user-defined type, it must be converted to
2837 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2838 will inherit the type of the array, which will be some pointer type.
2840 LOC is the location to use in building the array reference. */
2843 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
2844 tsubst_flags_t complain
)
2850 if (complain
& tf_error
)
2851 error_at (loc
, "subscript missing in array reference");
2852 return error_mark_node
;
2855 if (TREE_TYPE (array
) == error_mark_node
2856 || TREE_TYPE (idx
) == error_mark_node
)
2857 return error_mark_node
;
2859 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2861 switch (TREE_CODE (array
))
2865 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2867 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2868 TREE_OPERAND (array
, 0), value
);
2869 SET_EXPR_LOCATION (ret
, loc
);
2874 ret
= build_conditional_expr
2875 (TREE_OPERAND (array
, 0),
2876 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2878 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
2880 tf_warning_or_error
);
2881 protected_set_expr_location (ret
, loc
);
2888 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2892 warn_array_subscript_with_type_char (idx
);
2894 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2896 if (complain
& tf_error
)
2897 error_at (loc
, "array subscript is not an integer");
2898 return error_mark_node
;
2901 /* Apply integral promotions *after* noticing character types.
2902 (It is unclear why we do these promotions -- the standard
2903 does not say that we should. In fact, the natural thing would
2904 seem to be to convert IDX to ptrdiff_t; we're performing
2905 pointer arithmetic.) */
2906 idx
= perform_integral_promotions (idx
);
2908 /* An array that is indexed by a non-constant
2909 cannot be stored in a register; we must be able to do
2910 address arithmetic on its address.
2911 Likewise an array of elements of variable size. */
2912 if (TREE_CODE (idx
) != INTEGER_CST
2913 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2914 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2917 if (!cxx_mark_addressable (array
))
2918 return error_mark_node
;
2921 /* An array that is indexed by a constant value which is not within
2922 the array bounds cannot be stored in a register either; because we
2923 would get a crash in store_bit_field/extract_bit_field when trying
2924 to access a non-existent part of the register. */
2925 if (TREE_CODE (idx
) == INTEGER_CST
2926 && TYPE_DOMAIN (TREE_TYPE (array
))
2927 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
2929 if (!cxx_mark_addressable (array
))
2930 return error_mark_node
;
2933 if (!lvalue_p (array
) && (complain
& tf_error
))
2934 pedwarn (loc
, OPT_pedantic
,
2935 "ISO C++ forbids subscripting non-lvalue array");
2937 /* Note in C++ it is valid to subscript a `register' array, since
2938 it is valid to take the address of something with that
2939 storage specification. */
2943 while (TREE_CODE (foo
) == COMPONENT_REF
)
2944 foo
= TREE_OPERAND (foo
, 0);
2945 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
)
2946 && (complain
& tf_warning
))
2947 warning_at (loc
, OPT_Wextra
,
2948 "subscripting array declared %<register%>");
2951 type
= TREE_TYPE (TREE_TYPE (array
));
2952 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
2953 /* Array ref is const/volatile if the array elements are
2954 or if the array is.. */
2955 TREE_READONLY (rval
)
2956 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
2957 TREE_SIDE_EFFECTS (rval
)
2958 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
2959 TREE_THIS_VOLATILE (rval
)
2960 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
2961 ret
= require_complete_type_sfinae (fold_if_not_in_template (rval
),
2963 protected_set_expr_location (ret
, loc
);
2968 tree ar
= default_conversion (array
);
2969 tree ind
= default_conversion (idx
);
2971 /* Put the integer in IND to simplify error checking. */
2972 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
2979 if (ar
== error_mark_node
)
2982 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
2984 if (complain
& tf_error
)
2985 error_at (loc
, "subscripted value is neither array nor pointer");
2986 return error_mark_node
;
2988 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
2990 if (complain
& tf_error
)
2991 error_at (loc
, "array subscript is not an integer");
2992 return error_mark_node
;
2995 warn_array_subscript_with_type_char (idx
);
2997 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
3002 protected_set_expr_location (ret
, loc
);
3007 /* Entry point for Obj-C++. */
3010 build_array_ref (location_t loc
, tree array
, tree idx
)
3012 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
3015 /* Resolve a pointer to member function. INSTANCE is the object
3016 instance to use, if the member points to a virtual member.
3018 This used to avoid checking for virtual functions if basetype
3019 has no virtual functions, according to an earlier ANSI draft.
3020 With the final ISO C++ rules, such an optimization is
3021 incorrect: A pointer to a derived member can be static_cast
3022 to pointer-to-base-member, as long as the dynamic object
3023 later has the right member. */
3026 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
3028 if (TREE_CODE (function
) == OFFSET_REF
)
3029 function
= TREE_OPERAND (function
, 1);
3031 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3033 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
3034 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3036 tree instance_ptr
= *instance_ptrptr
;
3037 tree instance_save_expr
= 0;
3038 if (instance_ptr
== error_mark_node
)
3040 if (TREE_CODE (function
) == PTRMEM_CST
)
3042 /* Extracting the function address from a pmf is only
3043 allowed with -Wno-pmf-conversions. It only works for
3045 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
3046 e1
= convert (fntype
, e1
);
3051 error ("object missing in use of %qE", function
);
3052 return error_mark_node
;
3056 if (TREE_SIDE_EFFECTS (instance_ptr
))
3057 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3059 if (TREE_SIDE_EFFECTS (function
))
3060 function
= save_expr (function
);
3062 /* Start by extracting all the information from the PMF itself. */
3063 e3
= pfn_from_ptrmemfunc (function
);
3064 delta
= delta_from_ptrmemfunc (function
);
3065 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3066 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3068 case ptrmemfunc_vbit_in_pfn
:
3069 e1
= cp_build_binary_op (input_location
,
3070 BIT_AND_EXPR
, idx
, integer_one_node
,
3071 tf_warning_or_error
);
3072 idx
= cp_build_binary_op (input_location
,
3073 MINUS_EXPR
, idx
, integer_one_node
,
3074 tf_warning_or_error
);
3077 case ptrmemfunc_vbit_in_delta
:
3078 e1
= cp_build_binary_op (input_location
,
3079 BIT_AND_EXPR
, delta
, integer_one_node
,
3080 tf_warning_or_error
);
3081 delta
= cp_build_binary_op (input_location
,
3082 RSHIFT_EXPR
, delta
, integer_one_node
,
3083 tf_warning_or_error
);
3090 /* Convert down to the right base before using the instance. A
3091 special case is that in a pointer to member of class C, C may
3092 be incomplete. In that case, the function will of course be
3093 a member of C, and no conversion is required. In fact,
3094 lookup_base will fail in that case, because incomplete
3095 classes do not have BINFOs. */
3096 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3097 if (!same_type_ignoring_top_level_qualifiers_p
3098 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3100 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3101 basetype
, ba_check
, NULL
);
3102 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3104 if (instance_ptr
== error_mark_node
)
3105 return error_mark_node
;
3107 /* ...and then the delta in the PMF. */
3108 instance_ptr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (instance_ptr
),
3109 instance_ptr
, fold_convert (sizetype
, delta
));
3111 /* Hand back the adjusted 'this' argument to our caller. */
3112 *instance_ptrptr
= instance_ptr
;
3114 /* Next extract the vtable pointer from the object. */
3115 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3117 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, tf_warning_or_error
);
3118 /* If the object is not dynamic the access invokes undefined
3119 behavior. As it is not executed in this case silence the
3120 spurious warnings it may provoke. */
3121 TREE_NO_WARNING (vtbl
) = 1;
3123 /* Finally, extract the function pointer from the vtable. */
3124 e2
= fold_build2_loc (input_location
,
3125 POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
,
3126 fold_convert (sizetype
, idx
));
3127 e2
= cp_build_indirect_ref (e2
, RO_NULL
, tf_warning_or_error
);
3128 TREE_CONSTANT (e2
) = 1;
3130 /* When using function descriptors, the address of the
3131 vtable entry is treated as a function pointer. */
3132 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3133 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3134 cp_build_addr_expr (e2
, tf_warning_or_error
));
3136 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3137 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
3139 /* Make sure this doesn't get evaluated first inside one of the
3140 branches of the COND_EXPR. */
3141 if (instance_save_expr
)
3142 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3143 instance_save_expr
, e1
);
3150 /* Used by the C-common bits. */
3152 build_function_call (location_t loc ATTRIBUTE_UNUSED
,
3153 tree function
, tree params
)
3155 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3158 /* Used by the C-common bits. */
3160 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED
,
3161 tree function
, VEC(tree
,gc
) *params
,
3162 VEC(tree
,gc
) *origtypes ATTRIBUTE_UNUSED
)
3164 VEC(tree
,gc
) *orig_params
= params
;
3165 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3166 tf_warning_or_error
);
3168 /* cp_build_function_call_vec can reallocate PARAMS by adding
3169 default arguments. That should never happen here. Verify
3171 gcc_assert (params
== orig_params
);
3176 /* Build a function call using a tree list of arguments. */
3179 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3184 vec
= make_tree_vector ();
3185 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3186 VEC_safe_push (tree
, gc
, vec
, TREE_VALUE (params
));
3187 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3188 release_tree_vector (vec
);
3192 /* Build a function call using varargs. */
3195 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3201 vec
= make_tree_vector ();
3202 va_start (args
, complain
);
3203 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3204 VEC_safe_push (tree
, gc
, vec
, t
);
3206 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3207 release_tree_vector (vec
);
3211 /* Build a function call using a vector of arguments. PARAMS may be
3212 NULL if there are no parameters. This changes the contents of
3216 cp_build_function_call_vec (tree function
, VEC(tree
,gc
) **params
,
3217 tsubst_flags_t complain
)
3219 tree fntype
, fndecl
;
3221 tree original
= function
;
3225 VEC(tree
,gc
) *allocated
= NULL
;
3228 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3229 expressions, like those used for ObjC messenger dispatches. */
3230 if (params
!= NULL
&& !VEC_empty (tree
, *params
))
3231 function
= objc_rewrite_function_call (function
,
3232 VEC_index (tree
, *params
, 0));
3234 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3235 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3236 if (TREE_CODE (function
) == NOP_EXPR
3237 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3238 function
= TREE_OPERAND (function
, 0);
3240 if (TREE_CODE (function
) == FUNCTION_DECL
)
3242 mark_used (function
);
3245 /* Convert anything with function type to a pointer-to-function. */
3246 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
3247 pedwarn (input_location
, OPT_pedantic
,
3248 "ISO C++ forbids calling %<::main%> from within program");
3250 function
= build_addr_func (function
);
3256 function
= build_addr_func (function
);
3259 if (function
== error_mark_node
)
3260 return error_mark_node
;
3262 fntype
= TREE_TYPE (function
);
3264 if (TYPE_PTRMEMFUNC_P (fntype
))
3266 if (complain
& tf_error
)
3267 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3268 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3269 original
, original
);
3270 return error_mark_node
;
3273 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
3274 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3276 if (!((TREE_CODE (fntype
) == POINTER_TYPE
3277 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
3279 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3281 if (complain
& tf_error
)
3282 error ("%qE cannot be used as a function", original
);
3283 return error_mark_node
;
3286 /* fntype now gets the type of function pointed to. */
3287 fntype
= TREE_TYPE (fntype
);
3288 parm_types
= TYPE_ARG_TYPES (fntype
);
3292 allocated
= make_tree_vector ();
3293 params
= &allocated
;
3296 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3299 return error_mark_node
;
3301 argarray
= VEC_address (tree
, *params
);
3303 /* Check for errors in format strings and inappropriately
3305 check_function_arguments (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
,
3308 ret
= build_cxx_call (function
, nargs
, argarray
);
3310 if (allocated
!= NULL
)
3311 release_tree_vector (allocated
);
3316 /* Subroutine of convert_arguments.
3317 Warn about wrong number of args are genereted. */
3320 warn_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3324 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3326 if (DECL_NAME (fndecl
) == NULL_TREE
3327 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3330 ? G_("too many arguments to constructor %q#D")
3331 : G_("too few arguments to constructor %q#D"),
3336 ? G_("too many arguments to member function %q#D")
3337 : G_("too few arguments to member function %q#D"),
3343 ? G_("too many arguments to function %q#D")
3344 : G_("too few arguments to function %q#D"),
3346 inform (DECL_SOURCE_LOCATION (fndecl
),
3351 if (c_dialect_objc () && objc_message_selector ())
3354 ? G_("too many arguments to method %q#D")
3355 : G_("too few arguments to method %q#D"),
3356 objc_message_selector ());
3358 error_at (loc
, too_many_p
? G_("too many arguments to function")
3359 : G_("too few arguments to function"));
3363 /* Convert the actual parameter expressions in the list VALUES to the
3364 types in the list TYPELIST. The converted expressions are stored
3365 back in the VALUES vector.
3366 If parmdecls is exhausted, or when an element has NULL as its type,
3367 perform the default conversions.
3369 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3371 This is also where warnings about wrong number of args are generated.
3373 Returns the actual number of arguments processed (which might be less
3374 than the length of the vector), or -1 on error.
3376 In C++, unspecified trailing parameters can be filled in with their
3377 default arguments, if such were specified. Do so here. */
3380 convert_arguments (tree typelist
, VEC(tree
,gc
) **values
, tree fndecl
,
3381 int flags
, tsubst_flags_t complain
)
3386 /* Argument passing is always copy-initialization. */
3387 flags
|= LOOKUP_ONLYCONVERTING
;
3389 for (i
= 0, typetail
= typelist
;
3390 i
< VEC_length (tree
, *values
);
3393 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3394 tree val
= VEC_index (tree
, *values
, i
);
3396 if (val
== error_mark_node
|| type
== error_mark_node
)
3399 if (type
== void_type_node
)
3401 if (complain
& tf_error
)
3403 warn_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3410 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3411 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3412 if (TREE_CODE (val
) == NOP_EXPR
3413 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3414 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3415 val
= TREE_OPERAND (val
, 0);
3417 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3419 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3420 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3421 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3422 val
= decay_conversion (val
);
3425 if (val
== error_mark_node
)
3430 /* Formal parm type is specified by a function prototype. */
3433 if (!COMPLETE_TYPE_P (complete_type (type
)))
3435 if (complain
& tf_error
)
3438 error ("parameter %P of %qD has incomplete type %qT",
3441 error ("parameter %P has incomplete type %qT", i
, type
);
3443 parmval
= error_mark_node
;
3447 parmval
= convert_for_initialization
3448 (NULL_TREE
, type
, val
, flags
,
3449 ICR_ARGPASS
, fndecl
, i
, complain
);
3450 parmval
= convert_for_arg_passing (type
, parmval
);
3453 if (parmval
== error_mark_node
)
3456 VEC_replace (tree
, *values
, i
, parmval
);
3460 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3461 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3462 /* Don't do ellipsis conversion for __built_in_constant_p
3463 as this will result in spurious errors for non-trivial
3465 val
= require_complete_type_sfinae (val
, complain
);
3467 val
= convert_arg_to_ellipsis (val
);
3469 VEC_replace (tree
, *values
, i
, val
);
3473 typetail
= TREE_CHAIN (typetail
);
3476 if (typetail
!= 0 && typetail
!= void_list_node
)
3478 /* See if there are default arguments that can be used. Because
3479 we hold default arguments in the FUNCTION_TYPE (which is so
3480 wrong), we can see default parameters here from deduced
3481 contexts (and via typeof) for indirect function calls.
3482 Fortunately we know whether we have a function decl to
3483 provide default arguments in a language conformant
3485 if (fndecl
&& TREE_PURPOSE (typetail
)
3486 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3488 for (; typetail
!= void_list_node
; ++i
)
3491 = convert_default_arg (TREE_VALUE (typetail
),
3492 TREE_PURPOSE (typetail
),
3495 if (parmval
== error_mark_node
)
3498 VEC_safe_push (tree
, gc
, *values
, parmval
);
3499 typetail
= TREE_CHAIN (typetail
);
3500 /* ends with `...'. */
3501 if (typetail
== NULL_TREE
)
3507 if (complain
& tf_error
)
3508 warn_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3516 /* Build a binary-operation expression, after performing default
3517 conversions on the operands. CODE is the kind of expression to
3518 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3519 are the tree codes which correspond to ARG1 and ARG2 when issuing
3520 warnings about possibly misplaced parentheses. They may differ
3521 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3522 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3523 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3524 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3525 ARG2_CODE as ERROR_MARK. */
3528 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3529 tree arg2
, enum tree_code arg2_code
, bool *overloaded_p
,
3530 tsubst_flags_t complain
)
3539 if (processing_template_decl
)
3541 if (type_dependent_expression_p (arg1
)
3542 || type_dependent_expression_p (arg2
))
3543 return build_min_nt (code
, arg1
, arg2
);
3544 arg1
= build_non_dependent_expr (arg1
);
3545 arg2
= build_non_dependent_expr (arg2
);
3548 if (code
== DOTSTAR_EXPR
)
3549 expr
= build_m_component_ref (arg1
, arg2
);
3551 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3552 overloaded_p
, complain
);
3554 /* Check for cases such as x+y<<z which users are likely to
3555 misinterpret. But don't warn about obj << x + y, since that is a
3556 common idiom for I/O. */
3557 if (warn_parentheses
3558 && (complain
& tf_warning
)
3559 && !processing_template_decl
3560 && !error_operand_p (arg1
)
3561 && !error_operand_p (arg2
)
3562 && (code
!= LSHIFT_EXPR
3563 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3564 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3566 if (processing_template_decl
&& expr
!= error_mark_node
)
3567 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3572 /* Build and return an ARRAY_REF expression. */
3575 build_x_array_ref (tree arg1
, tree arg2
, tsubst_flags_t complain
)
3577 tree orig_arg1
= arg1
;
3578 tree orig_arg2
= arg2
;
3581 if (processing_template_decl
)
3583 if (type_dependent_expression_p (arg1
)
3584 || type_dependent_expression_p (arg2
))
3585 return build_min_nt (ARRAY_REF
, arg1
, arg2
,
3586 NULL_TREE
, NULL_TREE
);
3587 arg1
= build_non_dependent_expr (arg1
);
3588 arg2
= build_non_dependent_expr (arg2
);
3591 expr
= build_new_op (ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3592 /*overloaded_p=*/NULL
, complain
);
3594 if (processing_template_decl
&& expr
!= error_mark_node
)
3595 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3596 NULL_TREE
, NULL_TREE
);
3600 /* For the c-common bits. */
3602 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3603 int convert_p ATTRIBUTE_UNUSED
)
3605 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3609 /* Build a binary-operation expression without default conversions.
3610 CODE is the kind of expression to build.
3611 LOCATION is the location_t of the operator in the source code.
3612 This function differs from `build' in several ways:
3613 the data type of the result is computed and recorded in it,
3614 warnings are generated if arg data types are invalid,
3615 special handling for addition and subtraction of pointers is known,
3616 and some optimization is done (operations on narrow ints
3617 are done in the narrower type when that gives the same result).
3618 Constant folding is also done before the result is returned.
3620 Note that the operands will never have enumeral types
3621 because either they have just had the default conversions performed
3622 or they have both just been converted to some other type in which
3623 the arithmetic is to be done.
3625 C++: must do special pointer arithmetic when implementing
3626 multiple inheritance, and deal with pointer to member functions. */
3629 cp_build_binary_op (location_t location
,
3630 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3631 tsubst_flags_t complain
)
3634 enum tree_code code0
, code1
;
3636 const char *invalid_op_diag
;
3638 /* Expression code to give to the expression when it is built.
3639 Normally this is CODE, which is what the caller asked for,
3640 but in some special cases we change it. */
3641 enum tree_code resultcode
= code
;
3643 /* Data type in which the computation is to be performed.
3644 In the simplest cases this is the common type of the arguments. */
3645 tree result_type
= NULL
;
3647 /* Nonzero means operands have already been type-converted
3648 in whatever way is necessary.
3649 Zero means they need to be converted to RESULT_TYPE. */
3652 /* Nonzero means create the expression with this type, rather than
3654 tree build_type
= 0;
3656 /* Nonzero means after finally constructing the expression
3657 convert it to this type. */
3658 tree final_type
= 0;
3662 /* Nonzero if this is an operation like MIN or MAX which can
3663 safely be computed in short if both args are promoted shorts.
3664 Also implies COMMON.
3665 -1 indicates a bitwise operation; this makes a difference
3666 in the exact conditions for when it is safe to do the operation
3667 in a narrower mode. */
3670 /* Nonzero if this is a comparison operation;
3671 if both args are promoted shorts, compare the original shorts.
3672 Also implies COMMON. */
3673 int short_compare
= 0;
3675 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3678 /* True if both operands have arithmetic type. */
3679 bool arithmetic_types_p
;
3681 /* Apply default conversions. */
3685 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3686 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3687 || code
== TRUTH_XOR_EXPR
)
3689 if (!really_overloaded_fn (op0
))
3690 op0
= decay_conversion (op0
);
3691 if (!really_overloaded_fn (op1
))
3692 op1
= decay_conversion (op1
);
3696 if (!really_overloaded_fn (op0
))
3697 op0
= default_conversion (op0
);
3698 if (!really_overloaded_fn (op1
))
3699 op1
= default_conversion (op1
);
3702 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3703 STRIP_TYPE_NOPS (op0
);
3704 STRIP_TYPE_NOPS (op1
);
3706 /* DTRT if one side is an overloaded function, but complain about it. */
3707 if (type_unknown_p (op0
))
3709 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3710 if (t
!= error_mark_node
)
3712 if (complain
& tf_error
)
3713 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3718 if (type_unknown_p (op1
))
3720 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3721 if (t
!= error_mark_node
)
3723 if (complain
& tf_error
)
3724 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3730 type0
= TREE_TYPE (op0
);
3731 type1
= TREE_TYPE (op1
);
3733 /* The expression codes of the data types of the arguments tell us
3734 whether the arguments are integers, floating, pointers, etc. */
3735 code0
= TREE_CODE (type0
);
3736 code1
= TREE_CODE (type1
);
3738 /* If an error was already reported for one of the arguments,
3739 avoid reporting another error. */
3740 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3741 return error_mark_node
;
3743 if ((invalid_op_diag
3744 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3746 error (invalid_op_diag
);
3747 return error_mark_node
;
3750 /* Issue warnings about peculiar, but valid, uses of NULL. */
3751 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3752 /* It's reasonable to use pointer values as operands of &&
3753 and ||, so NULL is no exception. */
3754 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3755 && ( /* Both are NULL (or 0) and the operation was not a
3756 comparison or a pointer subtraction. */
3757 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3758 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
3759 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3760 || (!null_ptr_cst_p (orig_op0
)
3761 && !TYPE_PTR_P (type0
) && !TYPE_PTR_TO_MEMBER_P (type0
))
3762 || (!null_ptr_cst_p (orig_op1
)
3763 && !TYPE_PTR_P (type1
) && !TYPE_PTR_TO_MEMBER_P (type1
)))
3764 && (complain
& tf_warning
))
3765 /* Some sort of arithmetic operation involving NULL was
3767 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3772 /* Subtraction of two similar pointers.
3773 We must subtract them as integers, then divide by object size. */
3774 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3775 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3777 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3778 /* In all other cases except pointer - int, the usual arithmetic
3780 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3785 /* The pointer - int case is just like pointer + int; fall
3788 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3789 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3793 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3794 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3795 if (processing_template_decl
)
3797 result_type
= TREE_TYPE (ptr_operand
);
3800 return cp_pointer_int_sum (code
,
3811 case TRUNC_DIV_EXPR
:
3813 case FLOOR_DIV_EXPR
:
3814 case ROUND_DIV_EXPR
:
3815 case EXACT_DIV_EXPR
:
3816 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3817 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3818 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3819 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3821 enum tree_code tcode0
= code0
, tcode1
= code1
;
3823 warn_for_div_by_zero (location
, op1
);
3825 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3826 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3827 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3828 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3830 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3831 resultcode
= RDIV_EXPR
;
3833 /* When dividing two signed integers, we have to promote to int.
3834 unless we divide by a constant != -1. Note that default
3835 conversion will have been performed on the operands at this
3836 point, so we have to dig out the original type to find out if
3838 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3839 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3840 || (TREE_CODE (op1
) == INTEGER_CST
3841 && ! integer_all_onesp (op1
)));
3850 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3851 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3852 && !VECTOR_FLOAT_TYPE_P (type0
)
3853 && !VECTOR_FLOAT_TYPE_P (type1
)))
3857 case TRUNC_MOD_EXPR
:
3858 case FLOOR_MOD_EXPR
:
3859 warn_for_div_by_zero (location
, op1
);
3861 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3862 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
3863 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
3865 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3867 /* Although it would be tempting to shorten always here, that loses
3868 on some targets, since the modulo instruction is undefined if the
3869 quotient can't be represented in the computation mode. We shorten
3870 only if unsigned or if dividing by something we know != -1. */
3871 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3872 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3873 || (TREE_CODE (op1
) == INTEGER_CST
3874 && ! integer_all_onesp (op1
)));
3879 case TRUTH_ANDIF_EXPR
:
3880 case TRUTH_ORIF_EXPR
:
3881 case TRUTH_AND_EXPR
:
3883 result_type
= boolean_type_node
;
3886 /* Shift operations: result has same type as first operand;
3887 always convert second operand to int.
3888 Also set SHORT_SHIFT if shifting rightward. */
3891 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3893 result_type
= type0
;
3894 if (TREE_CODE (op1
) == INTEGER_CST
)
3896 if (tree_int_cst_lt (op1
, integer_zero_node
))
3898 if ((complain
& tf_warning
)
3899 && c_inhibit_evaluation_warnings
== 0)
3900 warning (0, "right shift count is negative");
3904 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3905 && (complain
& tf_warning
)
3906 && c_inhibit_evaluation_warnings
== 0)
3907 warning (0, "right shift count >= width of type");
3910 /* Convert the shift-count to an integer, regardless of
3911 size of value being shifted. */
3912 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3913 op1
= cp_convert (integer_type_node
, op1
);
3914 /* Avoid converting op1 to result_type later. */
3920 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3922 result_type
= type0
;
3923 if (TREE_CODE (op1
) == INTEGER_CST
)
3925 if (tree_int_cst_lt (op1
, integer_zero_node
))
3927 if ((complain
& tf_warning
)
3928 && c_inhibit_evaluation_warnings
== 0)
3929 warning (0, "left shift count is negative");
3931 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3933 if ((complain
& tf_warning
)
3934 && c_inhibit_evaluation_warnings
== 0)
3935 warning (0, "left shift count >= width of type");
3938 /* Convert the shift-count to an integer, regardless of
3939 size of value being shifted. */
3940 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3941 op1
= cp_convert (integer_type_node
, op1
);
3942 /* Avoid converting op1 to result_type later. */
3949 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3951 result_type
= type0
;
3952 if (TREE_CODE (op1
) == INTEGER_CST
)
3954 if (tree_int_cst_lt (op1
, integer_zero_node
))
3956 if (complain
& tf_warning
)
3957 warning (0, (code
== LROTATE_EXPR
)
3958 ? G_("left rotate count is negative")
3959 : G_("right rotate count is negative"));
3961 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3963 if (complain
& tf_warning
)
3964 warning (0, (code
== LROTATE_EXPR
)
3965 ? G_("left rotate count >= width of type")
3966 : G_("right rotate count >= width of type"));
3969 /* Convert the shift-count to an integer, regardless of
3970 size of value being shifted. */
3971 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3972 op1
= cp_convert (integer_type_node
, op1
);
3978 if ((complain
& tf_warning
)
3979 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
3980 warning (OPT_Wfloat_equal
,
3981 "comparing floating point with == or != is unsafe");
3982 if ((complain
& tf_warning
)
3983 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
3984 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
3985 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
3987 build_type
= boolean_type_node
;
3988 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3989 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
3990 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3991 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
3993 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3994 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
3995 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3996 CPO_COMPARISON
, complain
);
3997 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
3998 && null_ptr_cst_p (op1
))
4000 if (TREE_CODE (op0
) == ADDR_EXPR
4001 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
4003 if (complain
& tf_warning
)
4004 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4005 TREE_OPERAND (op0
, 0));
4007 result_type
= type0
;
4009 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
4010 && null_ptr_cst_p (op0
))
4012 if (TREE_CODE (op1
) == ADDR_EXPR
4013 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
4015 if (complain
& tf_warning
)
4016 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4017 TREE_OPERAND (op1
, 0));
4019 result_type
= type1
;
4021 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4022 /* One of the operands must be of nullptr_t type. */
4023 result_type
= TREE_TYPE (nullptr_node
);
4024 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4026 result_type
= type0
;
4027 if (complain
& tf_error
)
4028 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4030 return error_mark_node
;
4032 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4034 result_type
= type1
;
4035 if (complain
& tf_error
)
4036 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4038 return error_mark_node
;
4040 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
4042 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4043 == ptrmemfunc_vbit_in_delta
)
4045 tree pfn0
= pfn_from_ptrmemfunc (op0
);
4046 tree delta0
= delta_from_ptrmemfunc (op0
);
4047 tree e1
= cp_build_binary_op (location
,
4050 fold_convert (TREE_TYPE (pfn0
),
4053 tree e2
= cp_build_binary_op (location
,
4058 e2
= cp_build_binary_op (location
,
4059 EQ_EXPR
, e2
, integer_zero_node
,
4061 op0
= cp_build_binary_op (location
,
4062 TRUTH_ANDIF_EXPR
, e1
, e2
,
4064 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
4068 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4069 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
4071 result_type
= TREE_TYPE (op0
);
4073 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4074 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4075 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4078 /* E will be the final comparison. */
4080 /* E1 and E2 are for scratch. */
4088 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4089 CPO_COMPARISON
, complain
);
4091 if (!same_type_p (TREE_TYPE (op0
), type
))
4092 op0
= cp_convert_and_check (type
, op0
);
4093 if (!same_type_p (TREE_TYPE (op1
), type
))
4094 op1
= cp_convert_and_check (type
, op1
);
4096 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4097 return error_mark_node
;
4099 if (TREE_SIDE_EFFECTS (op0
))
4100 op0
= save_expr (op0
);
4101 if (TREE_SIDE_EFFECTS (op1
))
4102 op1
= save_expr (op1
);
4104 pfn0
= pfn_from_ptrmemfunc (op0
);
4105 pfn1
= pfn_from_ptrmemfunc (op1
);
4106 delta0
= delta_from_ptrmemfunc (op0
);
4107 delta1
= delta_from_ptrmemfunc (op1
);
4108 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4109 == ptrmemfunc_vbit_in_delta
)
4114 && ((op0.delta == op1.delta)
4115 || (!op0.pfn && op0.delta & 1 == 0
4116 && op1.delta & 1 == 0))
4118 The reason for the `!op0.pfn' bit is that a NULL
4119 pointer-to-member is any member with a zero PFN and
4120 LSB of the DELTA field is 0. */
4122 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4126 e1
= cp_build_binary_op (location
,
4127 EQ_EXPR
, e1
, integer_zero_node
,
4129 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4133 e2
= cp_build_binary_op (location
,
4134 EQ_EXPR
, e2
, integer_zero_node
,
4136 e1
= cp_build_binary_op (location
,
4137 TRUTH_ANDIF_EXPR
, e2
, e1
,
4139 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4141 fold_convert (TREE_TYPE (pfn0
),
4144 e2
= cp_build_binary_op (location
,
4145 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4146 e1
= cp_build_binary_op (location
,
4147 EQ_EXPR
, delta0
, delta1
, complain
);
4148 e1
= cp_build_binary_op (location
,
4149 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4156 && (!op0.pfn || op0.delta == op1.delta))
4158 The reason for the `!op0.pfn' bit is that a NULL
4159 pointer-to-member is any member with a zero PFN; the
4160 DELTA field is unspecified. */
4162 e1
= cp_build_binary_op (location
,
4163 EQ_EXPR
, delta0
, delta1
, complain
);
4164 e2
= cp_build_binary_op (location
,
4167 fold_convert (TREE_TYPE (pfn0
),
4170 e1
= cp_build_binary_op (location
,
4171 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4173 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4174 e
= cp_build_binary_op (location
,
4175 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4176 if (code
== EQ_EXPR
)
4178 return cp_build_binary_op (location
,
4179 EQ_EXPR
, e
, integer_zero_node
, complain
);
4183 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4184 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4186 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4187 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4195 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4196 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4198 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4199 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4200 CPO_COMPARISON
, complain
);
4207 if (TREE_CODE (orig_op0
) == STRING_CST
4208 || TREE_CODE (orig_op1
) == STRING_CST
)
4210 if (complain
& tf_warning
)
4211 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4214 build_type
= boolean_type_node
;
4215 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4216 || code0
== ENUMERAL_TYPE
)
4217 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4218 || code1
== ENUMERAL_TYPE
))
4220 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4221 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4222 CPO_COMPARISON
, complain
);
4223 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4224 result_type
= type0
;
4225 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4226 result_type
= type1
;
4227 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4228 /* One of the operands must be of nullptr_t type. */
4229 result_type
= TREE_TYPE (nullptr_node
);
4230 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4232 result_type
= type0
;
4233 if (complain
& tf_error
)
4234 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4236 return error_mark_node
;
4238 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4240 result_type
= type1
;
4241 if (complain
& tf_error
)
4242 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4244 return error_mark_node
;
4248 case UNORDERED_EXPR
:
4255 build_type
= integer_type_node
;
4256 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4258 if (complain
& tf_error
)
4259 error ("unordered comparison on non-floating point argument");
4260 return error_mark_node
;
4269 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4270 || code0
== ENUMERAL_TYPE
)
4271 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4272 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4273 arithmetic_types_p
= 1;
4276 arithmetic_types_p
= 0;
4277 /* Vector arithmetic is only allowed when both sides are vectors. */
4278 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4280 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4281 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4284 binary_op_error (location
, code
, type0
, type1
);
4285 return error_mark_node
;
4287 arithmetic_types_p
= 1;
4290 /* Determine the RESULT_TYPE, if it is not already known. */
4292 && arithmetic_types_p
4293 && (shorten
|| common
|| short_compare
))
4295 result_type
= cp_common_type (type0
, type1
);
4296 do_warn_double_promotion (result_type
, type0
, type1
,
4297 "implicit conversion from %qT to %qT "
4298 "to match other operand of binary "
4305 if (complain
& tf_error
)
4306 error ("invalid operands of types %qT and %qT to binary %qO",
4307 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4308 return error_mark_node
;
4311 /* If we're in a template, the only thing we need to know is the
4313 if (processing_template_decl
)
4315 /* Since the middle-end checks the type when doing a build2, we
4316 need to build the tree in pieces. This built tree will never
4317 get out of the front-end as we replace it when instantiating
4319 tree tmp
= build2 (resultcode
,
4320 build_type
? build_type
: result_type
,
4322 TREE_OPERAND (tmp
, 0) = op0
;
4326 if (arithmetic_types_p
)
4328 bool first_complex
= (code0
== COMPLEX_TYPE
);
4329 bool second_complex
= (code1
== COMPLEX_TYPE
);
4330 int none_complex
= (!first_complex
&& !second_complex
);
4332 /* Adapted from patch for c/24581. */
4333 if (first_complex
!= second_complex
4334 && (code
== PLUS_EXPR
4335 || code
== MINUS_EXPR
4336 || code
== MULT_EXPR
4337 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4338 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4339 && flag_signed_zeros
)
4341 /* An operation on mixed real/complex operands must be
4342 handled specially, but the language-independent code can
4343 more easily optimize the plain complex arithmetic if
4344 -fno-signed-zeros. */
4345 tree real_type
= TREE_TYPE (result_type
);
4349 if (TREE_TYPE (op0
) != result_type
)
4350 op0
= cp_convert_and_check (result_type
, op0
);
4351 if (TREE_TYPE (op1
) != real_type
)
4352 op1
= cp_convert_and_check (real_type
, op1
);
4356 if (TREE_TYPE (op0
) != real_type
)
4357 op0
= cp_convert_and_check (real_type
, op0
);
4358 if (TREE_TYPE (op1
) != result_type
)
4359 op1
= cp_convert_and_check (result_type
, op1
);
4361 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4362 return error_mark_node
;
4365 op0
= save_expr (op0
);
4366 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4367 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4371 case TRUNC_DIV_EXPR
:
4372 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4376 real
= build2 (resultcode
, real_type
, real
, op1
);
4384 op1
= save_expr (op1
);
4385 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4386 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4390 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4393 real
= build2 (resultcode
, real_type
, op0
, real
);
4396 real
= build2 (resultcode
, real_type
, op0
, real
);
4397 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4403 return build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4406 /* For certain operations (which identify themselves by shorten != 0)
4407 if both args were extended from the same smaller type,
4408 do the arithmetic in that type and then extend.
4410 shorten !=0 and !=1 indicates a bitwise operation.
4411 For them, this optimization is safe only if
4412 both args are zero-extended or both are sign-extended.
4413 Otherwise, we might change the result.
4414 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4415 but calculated in (unsigned short) it would be (unsigned short)-1. */
4417 if (shorten
&& none_complex
)
4419 final_type
= result_type
;
4420 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4424 /* Comparison operations are shortened too but differently.
4425 They identify themselves by setting short_compare = 1. */
4429 /* Don't write &op0, etc., because that would prevent op0
4430 from being kept in a register.
4431 Instead, make copies of the our local variables and
4432 pass the copies by reference, then copy them back afterward. */
4433 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4434 enum tree_code xresultcode
= resultcode
;
4436 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4438 return cp_convert (boolean_type_node
, val
);
4439 op0
= xop0
, op1
= xop1
;
4441 resultcode
= xresultcode
;
4444 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4445 && warn_sign_compare
4446 && !TREE_NO_WARNING (orig_op0
)
4447 && !TREE_NO_WARNING (orig_op1
)
4448 /* Do not warn until the template is instantiated; we cannot
4449 bound the ranges of the arguments until that point. */
4450 && !processing_template_decl
4451 && (complain
& tf_warning
)
4452 && c_inhibit_evaluation_warnings
== 0)
4454 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4455 result_type
, resultcode
);
4459 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4460 Then the expression will be built.
4461 It will be given type FINAL_TYPE if that is nonzero;
4462 otherwise, it will be given type RESULT_TYPE. */
4465 if (TREE_TYPE (op0
) != result_type
)
4466 op0
= cp_convert_and_check (result_type
, op0
);
4467 if (TREE_TYPE (op1
) != result_type
)
4468 op1
= cp_convert_and_check (result_type
, op1
);
4470 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4471 return error_mark_node
;
4474 if (build_type
== NULL_TREE
)
4475 build_type
= result_type
;
4477 result
= build2 (resultcode
, build_type
, op0
, op1
);
4478 result
= fold_if_not_in_template (result
);
4479 if (final_type
!= 0)
4480 result
= cp_convert (final_type
, result
);
4482 if (TREE_OVERFLOW_P (result
)
4483 && !TREE_OVERFLOW_P (op0
)
4484 && !TREE_OVERFLOW_P (op1
))
4485 overflow_warning (location
, result
);
4490 /* Return a tree for the sum or difference (RESULTCODE says which)
4491 of pointer PTROP and integer INTOP. */
4494 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4496 tree res_type
= TREE_TYPE (ptrop
);
4498 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4499 in certain circumstance (when it's valid to do so). So we need
4500 to make sure it's complete. We don't need to check here, if we
4501 can actually complete it at all, as those checks will be done in
4502 pointer_int_sum() anyway. */
4503 complete_type (TREE_TYPE (res_type
));
4505 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4506 fold_if_not_in_template (intop
));
4509 /* Return a tree for the difference of pointers OP0 and OP1.
4510 The resulting tree has type int. */
4513 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4516 tree restype
= ptrdiff_type_node
;
4517 tree target_type
= TREE_TYPE (ptrtype
);
4519 if (!complete_type_or_else (target_type
, NULL_TREE
))
4520 return error_mark_node
;
4522 if (TREE_CODE (target_type
) == VOID_TYPE
)
4523 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4524 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4525 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4526 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4527 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4529 /* First do the subtraction as integers;
4530 then drop through to build the divide operator. */
4532 op0
= cp_build_binary_op (input_location
,
4534 cp_convert (restype
, op0
),
4535 cp_convert (restype
, op1
),
4536 tf_warning_or_error
);
4538 /* This generates an error if op1 is a pointer to an incomplete type. */
4539 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4540 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4542 op1
= (TYPE_PTROB_P (ptrtype
)
4543 ? size_in_bytes (target_type
)
4544 : integer_one_node
);
4546 /* Do the division. */
4548 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4549 return fold_if_not_in_template (result
);
4552 /* Construct and perhaps optimize a tree representation
4553 for a unary operation. CODE, a tree_code, specifies the operation
4554 and XARG is the operand. */
4557 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4559 tree orig_expr
= xarg
;
4563 if (processing_template_decl
)
4565 if (type_dependent_expression_p (xarg
))
4566 return build_min_nt (code
, xarg
, NULL_TREE
);
4568 xarg
= build_non_dependent_expr (xarg
);
4573 /* [expr.unary.op] says:
4575 The address of an object of incomplete type can be taken.
4577 (And is just the ordinary address operator, not an overloaded
4578 "operator &".) However, if the type is a template
4579 specialization, we must complete the type at this point so that
4580 an overloaded "operator &" will be available if required. */
4581 if (code
== ADDR_EXPR
4582 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4583 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4584 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4585 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4586 /* Don't look for a function. */;
4588 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4589 /*overloaded_p=*/NULL
, complain
);
4590 if (!exp
&& code
== ADDR_EXPR
)
4592 if (is_overloaded_fn (xarg
))
4594 tree fn
= get_first_fn (xarg
);
4595 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4597 error (DECL_CONSTRUCTOR_P (fn
)
4598 ? G_("taking address of constructor %qE")
4599 : G_("taking address of destructor %qE"),
4601 return error_mark_node
;
4605 /* A pointer to member-function can be formed only by saying
4607 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4608 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4610 if (TREE_CODE (xarg
) != OFFSET_REF
4611 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4613 error ("invalid use of %qE to form a pointer-to-member-function",
4615 if (TREE_CODE (xarg
) != OFFSET_REF
)
4616 inform (input_location
, " a qualified-id is required");
4617 return error_mark_node
;
4621 error ("parentheses around %qE cannot be used to form a"
4622 " pointer-to-member-function",
4624 PTRMEM_OK_P (xarg
) = 1;
4628 if (TREE_CODE (xarg
) == OFFSET_REF
)
4630 ptrmem
= PTRMEM_OK_P (xarg
);
4632 if (!ptrmem
&& !flag_ms_extensions
4633 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4635 /* A single non-static member, make sure we don't allow a
4636 pointer-to-member. */
4637 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4638 TREE_OPERAND (xarg
, 0),
4639 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4640 PTRMEM_OK_P (xarg
) = ptrmem
;
4644 exp
= cp_build_addr_expr_strict (xarg
, complain
);
4647 if (processing_template_decl
&& exp
!= error_mark_node
)
4648 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4649 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4650 if (TREE_CODE (exp
) == ADDR_EXPR
)
4651 PTRMEM_OK_P (exp
) = ptrmem
;
4655 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4656 constants, where a null value is represented by an INTEGER_CST of
4660 cp_truthvalue_conversion (tree expr
)
4662 tree type
= TREE_TYPE (expr
);
4663 if (TYPE_PTRMEM_P (type
))
4664 return build_binary_op (EXPR_LOCATION (expr
),
4665 NE_EXPR
, expr
, integer_zero_node
, 1);
4667 return c_common_truthvalue_conversion (input_location
, expr
);
4670 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4673 condition_conversion (tree expr
)
4676 if (processing_template_decl
)
4678 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4679 tf_warning_or_error
, LOOKUP_NORMAL
);
4680 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4684 /* Returns the address of T. This function will fold away
4685 ADDR_EXPR of INDIRECT_REF. */
4688 build_address (tree t
)
4690 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4691 return error_mark_node
;
4692 t
= build_fold_addr_expr (t
);
4693 if (TREE_CODE (t
) != ADDR_EXPR
)
4698 /* Returns the address of T with type TYPE. */
4701 build_typed_address (tree t
, tree type
)
4703 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4704 return error_mark_node
;
4705 t
= build_fold_addr_expr_with_type (t
, type
);
4706 if (TREE_CODE (t
) != ADDR_EXPR
)
4711 /* Return a NOP_EXPR converting EXPR to TYPE. */
4714 build_nop (tree type
, tree expr
)
4716 if (type
== error_mark_node
|| error_operand_p (expr
))
4718 return build1 (NOP_EXPR
, type
, expr
);
4721 /* Take the address of ARG, whatever that means under C++ semantics.
4722 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
4723 and class rvalues as well.
4725 Nothing should call this function directly; instead, callers should use
4726 cp_build_addr_expr or cp_build_addr_expr_strict. */
4729 cp_build_addr_expr_1 (tree arg
, bool strict_lvalue
, tsubst_flags_t complain
)
4734 if (!arg
|| error_operand_p (arg
))
4735 return error_mark_node
;
4737 arg
= mark_lvalue_use (arg
);
4738 argtype
= lvalue_type (arg
);
4740 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
4741 || !IDENTIFIER_OPNAME_P (arg
));
4743 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
4744 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
4746 /* They're trying to take the address of a unique non-static
4747 member function. This is ill-formed (except in MS-land),
4748 but let's try to DTRT.
4749 Note: We only handle unique functions here because we don't
4750 want to complain if there's a static overload; non-unique
4751 cases will be handled by instantiate_type. But we need to
4752 handle this case here to allow casts on the resulting PMF.
4753 We could defer this in non-MS mode, but it's easier to give
4754 a useful error here. */
4756 /* Inside constant member functions, the `this' pointer
4757 contains an extra const qualifier. TYPE_MAIN_VARIANT
4758 is used here to remove this const from the diagnostics
4759 and the created OFFSET_REF. */
4760 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
4761 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
4764 if (! flag_ms_extensions
)
4766 tree name
= DECL_NAME (fn
);
4767 if (!(complain
& tf_error
))
4768 return error_mark_node
;
4769 else if (current_class_type
4770 && TREE_OPERAND (arg
, 0) == current_class_ref
)
4771 /* An expression like &memfn. */
4772 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
4773 " or parenthesized non-static member function to form"
4774 " a pointer to member function. Say %<&%T::%D%>",
4777 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
4778 " function to form a pointer to member function."
4782 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
4785 /* Uninstantiated types are all functions. Taking the
4786 address of a function is a no-op, so just return the
4788 if (type_unknown_p (arg
))
4789 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4791 if (TREE_CODE (arg
) == OFFSET_REF
)
4792 /* We want a pointer to member; bypass all the code for actually taking
4793 the address of something. */
4796 /* Anything not already handled and not a true memory reference
4798 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4799 && TREE_CODE (argtype
) != METHOD_TYPE
)
4801 cp_lvalue_kind kind
= lvalue_kind (arg
);
4802 if (kind
== clk_none
)
4804 if (complain
& tf_error
)
4805 lvalue_error (lv_addressof
);
4806 return error_mark_node
;
4808 if (strict_lvalue
&& (kind
& (clk_rvalueref
|clk_class
)))
4810 if (!(complain
& tf_error
))
4811 return error_mark_node
;
4812 if (kind
& clk_class
)
4813 /* Make this a permerror because we used to accept it. */
4814 permerror (input_location
, "taking address of temporary");
4816 error ("taking address of xvalue (rvalue reference)");
4820 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4822 tree type
= build_pointer_type (TREE_TYPE (argtype
));
4823 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4826 else if (pedantic
&& DECL_MAIN_P (arg
))
4829 /* Apparently a lot of autoconf scripts for C++ packages do this,
4830 so only complain if -pedantic. */
4831 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
4832 pedwarn (input_location
, OPT_pedantic
,
4833 "ISO C++ forbids taking address of function %<::main%>");
4834 else if (flag_pedantic_errors
)
4835 return error_mark_node
;
4838 /* Let &* cancel out to simplify resulting code. */
4839 if (TREE_CODE (arg
) == INDIRECT_REF
)
4841 /* We don't need to have `current_class_ptr' wrapped in a
4842 NON_LVALUE_EXPR node. */
4843 if (arg
== current_class_ref
)
4844 return current_class_ptr
;
4846 arg
= TREE_OPERAND (arg
, 0);
4847 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
4849 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
4850 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4853 /* Don't let this be an lvalue. */
4858 /* ??? Cope with user tricks that amount to offsetof. */
4859 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4860 && TREE_CODE (argtype
) != METHOD_TYPE
4861 && argtype
!= unknown_type_node
4862 && (val
= get_base_address (arg
))
4863 && COMPLETE_TYPE_P (TREE_TYPE (val
))
4864 && TREE_CODE (val
) == INDIRECT_REF
4865 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
4867 tree type
= build_pointer_type (argtype
);
4868 tree op0
= fold_convert (type
, TREE_OPERAND (val
, 0));
4869 tree op1
= fold_convert (sizetype
, fold_offsetof (arg
, val
));
4870 return fold_build2 (POINTER_PLUS_EXPR
, type
, op0
, op1
);
4873 /* Handle complex lvalues (when permitted)
4874 by reduction to simpler cases. */
4875 val
= unary_complex_lvalue (ADDR_EXPR
, arg
);
4879 switch (TREE_CODE (arg
))
4883 case FIX_TRUNC_EXPR
:
4884 /* Even if we're not being pedantic, we cannot allow this
4885 extension when we're instantiating in a SFINAE
4887 if (! lvalue_p (arg
) && complain
== tf_none
)
4889 if (complain
& tf_error
)
4890 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4892 return error_mark_node
;
4897 arg
= BASELINK_FUNCTIONS (arg
);
4901 arg
= OVL_CURRENT (arg
);
4906 /* Turn a reference to a non-static data member into a
4907 pointer-to-member. */
4912 gcc_assert (PTRMEM_OK_P (arg
));
4914 t
= TREE_OPERAND (arg
, 1);
4915 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
4917 if (complain
& tf_error
)
4918 error ("cannot create pointer to reference member %qD", t
);
4919 return error_mark_node
;
4922 type
= build_ptrmem_type (context_for_name_lookup (t
),
4924 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
4932 if (argtype
!= error_mark_node
)
4933 argtype
= build_pointer_type (argtype
);
4935 /* In a template, we are processing a non-dependent expression
4936 so we can just form an ADDR_EXPR with the correct type. */
4937 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
4939 val
= build_address (arg
);
4940 if (TREE_CODE (arg
) == OFFSET_REF
)
4941 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
4943 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
4945 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
4947 /* We can only get here with a single static member
4949 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4950 && DECL_STATIC_FUNCTION_P (fn
));
4952 val
= build_address (fn
);
4953 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
4954 /* Do not lose object's side effects. */
4955 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
4956 TREE_OPERAND (arg
, 0), val
);
4958 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
4960 if (complain
& tf_error
)
4961 error ("attempt to take address of bit-field structure member %qD",
4962 TREE_OPERAND (arg
, 1));
4963 return error_mark_node
;
4967 tree object
= TREE_OPERAND (arg
, 0);
4968 tree field
= TREE_OPERAND (arg
, 1);
4969 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4970 (TREE_TYPE (object
), decl_type_context (field
)));
4971 val
= build_address (arg
);
4974 if (TREE_CODE (argtype
) == POINTER_TYPE
4975 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
4977 build_ptrmemfunc_type (argtype
);
4978 val
= build_ptrmemfunc (argtype
, val
, 0,
4980 tf_warning_or_error
);
4986 /* Take the address of ARG if it has one, even if it's an rvalue. */
4989 cp_build_addr_expr (tree arg
, tsubst_flags_t complain
)
4991 return cp_build_addr_expr_1 (arg
, 0, complain
);
4994 /* Take the address of ARG, but only if it's an lvalue. */
4997 cp_build_addr_expr_strict (tree arg
, tsubst_flags_t complain
)
4999 return cp_build_addr_expr_1 (arg
, 1, complain
);
5002 /* C++: Must handle pointers to members.
5004 Perhaps type instantiation should be extended to handle conversion
5005 from aggregates to types we don't yet know we want? (Or are those
5006 cases typically errors which should be reported?)
5008 NOCONVERT nonzero suppresses the default promotions
5009 (such as from short to int). */
5012 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
5013 tsubst_flags_t complain
)
5015 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
5018 const char *errstring
= NULL
;
5020 const char *invalid_op_diag
;
5022 if (!arg
|| error_operand_p (arg
))
5023 return error_mark_node
;
5025 if ((invalid_op_diag
5026 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
5031 error (invalid_op_diag
);
5032 return error_mark_node
;
5037 case UNARY_PLUS_EXPR
:
5040 int flags
= WANT_ARITH
| WANT_ENUM
;
5041 /* Unary plus (but not unary minus) is allowed on pointers. */
5042 if (code
== UNARY_PLUS_EXPR
)
5043 flags
|= WANT_POINTER
;
5044 arg
= build_expr_type_conversion (flags
, arg
, true);
5046 errstring
= (code
== NEGATE_EXPR
5047 ? _("wrong type argument to unary minus")
5048 : _("wrong type argument to unary plus"));
5051 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5052 arg
= perform_integral_promotions (arg
);
5054 /* Make sure the result is not an lvalue: a unary plus or minus
5055 expression is always a rvalue. */
5062 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5066 arg
= default_conversion (arg
);
5068 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
5069 | WANT_VECTOR_OR_COMPLEX
,
5071 errstring
= _("wrong type argument to bit-complement");
5072 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5073 arg
= perform_integral_promotions (arg
);
5077 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5078 errstring
= _("wrong type argument to abs");
5079 else if (!noconvert
)
5080 arg
= default_conversion (arg
);
5084 /* Conjugating a real value is a no-op, but allow it anyway. */
5085 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5086 errstring
= _("wrong type argument to conjugation");
5087 else if (!noconvert
)
5088 arg
= default_conversion (arg
);
5091 case TRUTH_NOT_EXPR
:
5092 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
5094 val
= invert_truthvalue_loc (input_location
, arg
);
5095 if (arg
!= error_mark_node
)
5097 errstring
= _("in argument to unary !");
5104 if (TREE_CODE (arg
) == COMPLEX_CST
)
5105 return TREE_REALPART (arg
);
5106 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5108 arg
= build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
5109 return fold_if_not_in_template (arg
);
5115 if (TREE_CODE (arg
) == COMPLEX_CST
)
5116 return TREE_IMAGPART (arg
);
5117 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5119 arg
= build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
5120 return fold_if_not_in_template (arg
);
5123 return cp_convert (TREE_TYPE (arg
), integer_zero_node
);
5125 case PREINCREMENT_EXPR
:
5126 case POSTINCREMENT_EXPR
:
5127 case PREDECREMENT_EXPR
:
5128 case POSTDECREMENT_EXPR
:
5129 /* Handle complex lvalues (when permitted)
5130 by reduction to simpler cases. */
5132 val
= unary_complex_lvalue (code
, arg
);
5136 arg
= mark_lvalue_use (arg
);
5138 /* Increment or decrement the real part of the value,
5139 and don't change the imaginary part. */
5140 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5144 arg
= stabilize_reference (arg
);
5145 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
5146 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
5147 real
= cp_build_unary_op (code
, real
, 1, complain
);
5148 if (real
== error_mark_node
|| imag
== error_mark_node
)
5149 return error_mark_node
;
5150 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
5154 /* Report invalid types. */
5156 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
5159 if (code
== PREINCREMENT_EXPR
)
5160 errstring
= _("no pre-increment operator for type");
5161 else if (code
== POSTINCREMENT_EXPR
)
5162 errstring
= _("no post-increment operator for type");
5163 else if (code
== PREDECREMENT_EXPR
)
5164 errstring
= _("no pre-decrement operator for type");
5166 errstring
= _("no post-decrement operator for type");
5169 else if (arg
== error_mark_node
)
5170 return error_mark_node
;
5172 /* Report something read-only. */
5174 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
5175 || TREE_READONLY (arg
))
5177 if (complain
& tf_error
)
5178 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
5179 || code
== POSTINCREMENT_EXPR
)
5180 ? REK_INCREMENT
: REK_DECREMENT
));
5182 return error_mark_node
;
5187 tree declared_type
= unlowered_expr_type (arg
);
5189 argtype
= TREE_TYPE (arg
);
5191 /* ARM $5.2.5 last annotation says this should be forbidden. */
5192 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
5194 if (complain
& tf_error
)
5195 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
5196 ? G_("ISO C++ forbids incrementing an enum")
5197 : G_("ISO C++ forbids decrementing an enum"));
5199 return error_mark_node
;
5202 /* Compute the increment. */
5204 if (TREE_CODE (argtype
) == POINTER_TYPE
)
5206 tree type
= complete_type (TREE_TYPE (argtype
));
5208 if (!COMPLETE_OR_VOID_TYPE_P (type
))
5210 if (complain
& tf_error
)
5211 error (((code
== PREINCREMENT_EXPR
5212 || code
== POSTINCREMENT_EXPR
))
5213 ? G_("cannot increment a pointer to incomplete type %qT")
5214 : G_("cannot decrement a pointer to incomplete type %qT"),
5215 TREE_TYPE (argtype
));
5217 return error_mark_node
;
5219 else if ((pedantic
|| warn_pointer_arith
)
5220 && !TYPE_PTROB_P (argtype
))
5222 if (complain
& tf_error
)
5223 permerror (input_location
, (code
== PREINCREMENT_EXPR
5224 || code
== POSTINCREMENT_EXPR
)
5225 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
5226 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
5229 return error_mark_node
;
5232 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
5235 inc
= integer_one_node
;
5237 inc
= cp_convert (argtype
, inc
);
5239 /* Complain about anything else that is not a true lvalue. */
5240 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
5241 || code
== POSTINCREMENT_EXPR
)
5242 ? lv_increment
: lv_decrement
),
5244 return error_mark_node
;
5246 /* Forbid using -- on `bool'. */
5247 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
5249 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
5251 if (complain
& tf_error
)
5252 error ("invalid use of Boolean expression as operand "
5253 "to %<operator--%>");
5254 return error_mark_node
;
5256 val
= boolean_increment (code
, arg
);
5259 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
5261 TREE_SIDE_EFFECTS (val
) = 1;
5266 /* Note that this operation never does default_conversion
5267 regardless of NOCONVERT. */
5268 return cp_build_addr_expr (arg
, complain
);
5277 argtype
= TREE_TYPE (arg
);
5278 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5281 if (complain
& tf_error
)
5282 error ("%s", errstring
);
5283 return error_mark_node
;
5286 /* Hook for the c-common bits that build a unary op. */
5288 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5289 enum tree_code code
, tree xarg
, int noconvert
)
5291 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5294 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5295 for certain kinds of expressions which are not really lvalues
5296 but which we can accept as lvalues.
5298 If ARG is not a kind of expression we can handle, return
5302 unary_complex_lvalue (enum tree_code code
, tree arg
)
5304 /* Inside a template, making these kinds of adjustments is
5305 pointless; we are only concerned with the type of the
5307 if (processing_template_decl
)
5310 /* Handle (a, b) used as an "lvalue". */
5311 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5313 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5314 tf_warning_or_error
);
5315 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5316 TREE_OPERAND (arg
, 0), real_result
);
5319 /* Handle (a ? b : c) used as an "lvalue". */
5320 if (TREE_CODE (arg
) == COND_EXPR
5321 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5322 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5324 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5325 if (TREE_CODE (arg
) == MODIFY_EXPR
5326 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5327 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5329 tree lvalue
= TREE_OPERAND (arg
, 0);
5330 if (TREE_SIDE_EFFECTS (lvalue
))
5332 lvalue
= stabilize_reference (lvalue
);
5333 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5334 lvalue
, TREE_OPERAND (arg
, 1));
5336 return unary_complex_lvalue
5337 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5340 if (code
!= ADDR_EXPR
)
5343 /* Handle (a = b) used as an "lvalue" for `&'. */
5344 if (TREE_CODE (arg
) == MODIFY_EXPR
5345 || TREE_CODE (arg
) == INIT_EXPR
)
5347 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5348 tf_warning_or_error
);
5349 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5351 TREE_NO_WARNING (arg
) = 1;
5355 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5356 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5357 || TREE_CODE (arg
) == OFFSET_REF
)
5360 /* We permit compiler to make function calls returning
5361 objects of aggregate type look like lvalues. */
5365 if (TREE_CODE (targ
) == SAVE_EXPR
)
5366 targ
= TREE_OPERAND (targ
, 0);
5368 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5370 if (TREE_CODE (arg
) == SAVE_EXPR
)
5373 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
5374 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5377 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5378 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5379 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5382 /* Don't let anything else be handled specially. */
5386 /* Mark EXP saying that we need to be able to take the
5387 address of it; it should not be allocated in a register.
5388 Value is true if successful.
5390 C++: we do not allow `current_class_ptr' to be addressable. */
5393 cxx_mark_addressable (tree exp
)
5398 switch (TREE_CODE (x
))
5405 x
= TREE_OPERAND (x
, 0);
5409 if (x
== current_class_ptr
)
5411 error ("cannot take the address of %<this%>, which is an rvalue expression");
5412 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5418 /* Caller should not be trying to mark initialized
5419 constant fields addressable. */
5420 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5421 || DECL_IN_AGGR_P (x
) == 0
5423 || DECL_EXTERNAL (x
));
5428 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5429 && !DECL_ARTIFICIAL (x
))
5431 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5434 ("address of explicit register variable %qD requested", x
);
5437 else if (extra_warnings
)
5439 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5441 TREE_ADDRESSABLE (x
) = 1;
5445 TREE_ADDRESSABLE (x
) = 1;
5449 TREE_ADDRESSABLE (x
) = 1;
5453 TREE_ADDRESSABLE (x
) = 1;
5454 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5462 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5465 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5466 tsubst_flags_t complain
)
5468 tree orig_ifexp
= ifexp
;
5469 tree orig_op1
= op1
;
5470 tree orig_op2
= op2
;
5473 if (processing_template_decl
)
5475 /* The standard says that the expression is type-dependent if
5476 IFEXP is type-dependent, even though the eventual type of the
5477 expression doesn't dependent on IFEXP. */
5478 if (type_dependent_expression_p (ifexp
)
5479 /* As a GNU extension, the middle operand may be omitted. */
5480 || (op1
&& type_dependent_expression_p (op1
))
5481 || type_dependent_expression_p (op2
))
5482 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5483 ifexp
= build_non_dependent_expr (ifexp
);
5485 op1
= build_non_dependent_expr (op1
);
5486 op2
= build_non_dependent_expr (op2
);
5489 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5490 if (processing_template_decl
&& expr
!= error_mark_node
)
5491 return build_min_non_dep (COND_EXPR
, expr
,
5492 orig_ifexp
, orig_op1
, orig_op2
);
5496 /* Given a list of expressions, return a compound expression
5497 that performs them all and returns the value of the last of them. */
5500 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
,
5501 tsubst_flags_t complain
)
5503 tree expr
= TREE_VALUE (list
);
5505 if (TREE_CHAIN (list
))
5507 if (complain
& tf_error
)
5511 permerror (input_location
, "expression list treated as compound "
5512 "expression in initializer");
5515 permerror (input_location
, "expression list treated as compound "
5516 "expression in mem-initializer");
5519 permerror (input_location
, "expression list treated as compound "
5520 "expression in functional cast");
5526 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5527 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5534 /* Like build_x_compound_expr_from_list, but using a VEC. */
5537 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5539 if (VEC_empty (tree
, vec
))
5541 else if (VEC_length (tree
, vec
) == 1)
5542 return VEC_index (tree
, vec
, 0);
5550 permerror (input_location
,
5551 "%s expression list treated as compound expression",
5554 expr
= VEC_index (tree
, vec
, 0);
5555 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5556 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5562 /* Handle overloading of the ',' operator when needed. */
5565 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5568 tree orig_op1
= op1
;
5569 tree orig_op2
= op2
;
5571 if (processing_template_decl
)
5573 if (type_dependent_expression_p (op1
)
5574 || type_dependent_expression_p (op2
))
5575 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5576 op1
= build_non_dependent_expr (op1
);
5577 op2
= build_non_dependent_expr (op2
);
5580 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5581 /*overloaded_p=*/NULL
, complain
);
5583 result
= cp_build_compound_expr (op1
, op2
, complain
);
5585 if (processing_template_decl
&& result
!= error_mark_node
)
5586 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5591 /* Like cp_build_compound_expr, but for the c-common bits. */
5594 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5596 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5599 /* Build a compound expression. */
5602 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5604 lhs
= convert_to_void (lhs
, ICV_LEFT_OF_COMMA
, complain
);
5606 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5607 return error_mark_node
;
5609 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5611 /* If the rhs is a TARGET_EXPR, then build the compound
5612 expression inside the target_expr's initializer. This
5613 helps the compiler to eliminate unnecessary temporaries. */
5614 tree init
= TREE_OPERAND (rhs
, 1);
5616 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5617 TREE_OPERAND (rhs
, 1) = init
;
5622 if (type_unknown_p (rhs
))
5624 error ("no context to resolve type of %qE", rhs
);
5625 return error_mark_node
;
5628 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5631 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5632 casts away constness. CAST gives the type of cast.
5634 ??? This function warns for casting away any qualifier not just
5635 const. We would like to specify exactly what qualifiers are casted
5640 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5641 enum tree_code cast
)
5643 /* C-style casts are allowed to cast away constness. With
5644 WARN_CAST_QUAL, we still want to issue a warning. */
5645 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5648 if (!casts_away_constness (src_type
, dest_type
))
5654 warning (OPT_Wcast_qual
,
5655 "cast from type %qT to type %qT casts away qualifiers",
5656 src_type
, dest_type
);
5659 case STATIC_CAST_EXPR
:
5660 error ("static_cast from type %qT to type %qT casts away qualifiers",
5661 src_type
, dest_type
);
5664 case REINTERPRET_CAST_EXPR
:
5665 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5666 src_type
, dest_type
);
5673 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5674 (another pointer-to-member type in the same hierarchy) and return
5675 the converted expression. If ALLOW_INVERSE_P is permitted, a
5676 pointer-to-derived may be converted to pointer-to-base; otherwise,
5677 only the other direction is permitted. If C_CAST_P is true, this
5678 conversion is taking place as part of a C-style cast. */
5681 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5682 bool c_cast_p
, tsubst_flags_t complain
)
5684 if (TYPE_PTRMEM_P (type
))
5688 if (TREE_CODE (expr
) == PTRMEM_CST
)
5689 expr
= cplus_expand_constant (expr
);
5690 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5691 TYPE_PTRMEM_CLASS_TYPE (type
),
5693 c_cast_p
, complain
);
5694 if (delta
== error_mark_node
)
5695 return error_mark_node
;
5697 if (!integer_zerop (delta
))
5699 tree cond
, op1
, op2
;
5701 cond
= cp_build_binary_op (input_location
,
5704 build_int_cst (TREE_TYPE (expr
), -1),
5705 tf_warning_or_error
);
5706 op1
= build_nop (ptrdiff_type_node
, expr
);
5707 op2
= cp_build_binary_op (input_location
,
5708 PLUS_EXPR
, op1
, delta
,
5709 tf_warning_or_error
);
5711 expr
= fold_build3_loc (input_location
,
5712 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5716 return build_nop (type
, expr
);
5719 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5720 allow_inverse_p
, c_cast_p
, complain
);
5723 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
5724 a version of EXPR that has TREE_OVERFLOW set if it is set in ORIG.
5725 Otherwise, return EXPR unchanged. */
5728 ignore_overflows (tree expr
, tree orig
)
5730 if (TREE_CODE (expr
) == INTEGER_CST
5731 && CONSTANT_CLASS_P (orig
)
5732 && TREE_CODE (orig
) != STRING_CST
5733 && TREE_OVERFLOW (expr
) != TREE_OVERFLOW (orig
))
5735 if (!TREE_OVERFLOW (orig
))
5736 /* Ensure constant sharing. */
5737 expr
= build_int_cst_wide (TREE_TYPE (expr
),
5738 TREE_INT_CST_LOW (expr
),
5739 TREE_INT_CST_HIGH (expr
));
5742 /* Avoid clobbering a shared constant. */
5743 expr
= copy_node (expr
);
5744 TREE_OVERFLOW (expr
) = TREE_OVERFLOW (orig
);
5750 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5751 this static_cast is being attempted as one of the possible casts
5752 allowed by a C-style cast. (In that case, accessibility of base
5753 classes is not considered, and it is OK to cast away
5754 constness.) Return the result of the cast. *VALID_P is set to
5755 indicate whether or not the cast was valid. */
5758 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5759 bool *valid_p
, tsubst_flags_t complain
)
5765 /* Assume the cast is valid. */
5768 intype
= TREE_TYPE (expr
);
5770 /* Save casted types in the function's used types hash table. */
5771 used_types_insert (type
);
5773 /* [expr.static.cast]
5775 An lvalue of type "cv1 B", where B is a class type, can be cast
5776 to type "reference to cv2 D", where D is a class derived (clause
5777 _class.derived_) from B, if a valid standard conversion from
5778 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5779 same cv-qualification as, or greater cv-qualification than, cv1,
5780 and B is not a virtual base class of D. */
5781 /* We check this case before checking the validity of "TYPE t =
5782 EXPR;" below because for this case:
5785 struct D : public B { D(const B&); };
5787 void f() { static_cast<const D&>(b); }
5789 we want to avoid constructing a new D. The standard is not
5790 completely clear about this issue, but our interpretation is
5791 consistent with other compilers. */
5792 if (TREE_CODE (type
) == REFERENCE_TYPE
5793 && CLASS_TYPE_P (TREE_TYPE (type
))
5794 && CLASS_TYPE_P (intype
)
5795 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5796 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5797 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5798 build_pointer_type (TYPE_MAIN_VARIANT
5799 (TREE_TYPE (type
))))
5801 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5805 /* There is a standard conversion from "D*" to "B*" even if "B"
5806 is ambiguous or inaccessible. If this is really a
5807 static_cast, then we check both for inaccessibility and
5808 ambiguity. However, if this is a static_cast being performed
5809 because the user wrote a C-style cast, then accessibility is
5811 base
= lookup_base (TREE_TYPE (type
), intype
,
5812 c_cast_p
? ba_unique
: ba_check
,
5815 /* Convert from "B*" to "D*". This function will check that "B"
5816 is not a virtual base of "D". */
5817 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5818 base
, /*nonnull=*/false);
5819 /* Convert the pointer to a reference -- but then remember that
5820 there are no expressions with reference type in C++. */
5821 return convert_from_reference (cp_fold_convert (type
, expr
));
5824 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5825 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5826 if (TREE_CODE (type
) == REFERENCE_TYPE
5827 && TYPE_REF_IS_RVALUE (type
)
5828 && real_lvalue_p (expr
)
5829 && reference_related_p (TREE_TYPE (type
), intype
)
5830 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5832 expr
= build_typed_address (expr
, type
);
5833 return convert_from_reference (expr
);
5838 /* Resolve overloaded address here rather than once in
5839 implicit_conversion and again in the inverse code below. */
5840 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5842 expr
= instantiate_type (type
, expr
, complain
);
5843 intype
= TREE_TYPE (expr
);
5846 /* [expr.static.cast]
5848 An expression e can be explicitly converted to a type T using a
5849 static_cast of the form static_cast<T>(e) if the declaration T
5850 t(e);" is well-formed, for some invented temporary variable
5852 result
= perform_direct_initialization_if_possible (type
, expr
,
5853 c_cast_p
, complain
);
5856 result
= convert_from_reference (result
);
5858 /* Ignore any integer overflow caused by the cast. */
5859 result
= ignore_overflows (result
, orig
);
5861 /* [expr.static.cast]
5863 If T is a reference type, the result is an lvalue; otherwise,
5864 the result is an rvalue. */
5865 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5866 result
= rvalue (result
);
5870 /* [expr.static.cast]
5872 Any expression can be explicitly converted to type cv void. */
5873 if (TREE_CODE (type
) == VOID_TYPE
)
5874 return convert_to_void (expr
, ICV_CAST
, complain
);
5876 /* [expr.static.cast]
5878 The inverse of any standard conversion sequence (clause _conv_),
5879 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5880 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5881 (_conv.bool_) conversions, can be performed explicitly using
5882 static_cast subject to the restriction that the explicit
5883 conversion does not cast away constness (_expr.const.cast_), and
5884 the following additional rules for specific cases: */
5885 /* For reference, the conversions not excluded are: integral
5886 promotions, floating point promotion, integral conversions,
5887 floating point conversions, floating-integral conversions,
5888 pointer conversions, and pointer to member conversions. */
5891 A value of integral _or enumeration_ type can be explicitly
5892 converted to an enumeration type. */
5893 /* The effect of all that is that any conversion between any two
5894 types which are integral, floating, or enumeration types can be
5896 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5897 || SCALAR_FLOAT_TYPE_P (type
))
5898 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5899 || SCALAR_FLOAT_TYPE_P (intype
)))
5901 expr
= ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5903 /* Ignore any integer overflow caused by the cast. */
5904 expr
= ignore_overflows (expr
, orig
);
5908 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5909 && CLASS_TYPE_P (TREE_TYPE (type
))
5910 && CLASS_TYPE_P (TREE_TYPE (intype
))
5911 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5912 (TREE_TYPE (intype
))),
5913 build_pointer_type (TYPE_MAIN_VARIANT
5914 (TREE_TYPE (type
)))))
5919 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5920 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
5921 c_cast_p
? ba_unique
: ba_check
,
5923 return build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
5926 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5927 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5934 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
5935 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
5937 if (TYPE_PTRMEM_P (type
))
5939 t1
= (build_ptrmem_type
5941 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
5942 t2
= (build_ptrmem_type
5944 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
5951 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
5954 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5955 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
5956 c_cast_p
, tf_warning_or_error
);
5960 /* [expr.static.cast]
5962 An rvalue of type "pointer to cv void" can be explicitly
5963 converted to a pointer to object type. A value of type pointer
5964 to object converted to "pointer to cv void" and back to the
5965 original pointer type will have its original value. */
5966 if (TREE_CODE (intype
) == POINTER_TYPE
5967 && VOID_TYPE_P (TREE_TYPE (intype
))
5968 && TYPE_PTROB_P (type
))
5971 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5972 return build_nop (type
, expr
);
5976 return error_mark_node
;
5979 /* Return an expression representing static_cast<TYPE>(EXPR). */
5982 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5987 if (type
== error_mark_node
|| expr
== error_mark_node
)
5988 return error_mark_node
;
5990 if (processing_template_decl
)
5992 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
5993 /* We don't know if it will or will not have side effects. */
5994 TREE_SIDE_EFFECTS (expr
) = 1;
5995 return convert_from_reference (expr
);
5998 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5999 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6000 if (TREE_CODE (type
) != REFERENCE_TYPE
6001 && TREE_CODE (expr
) == NOP_EXPR
6002 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6003 expr
= TREE_OPERAND (expr
, 0);
6005 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
6010 if (complain
& tf_error
)
6011 error ("invalid static_cast from type %qT to type %qT",
6012 TREE_TYPE (expr
), type
);
6013 return error_mark_node
;
6016 /* EXPR is an expression with member function or pointer-to-member
6017 function type. TYPE is a pointer type. Converting EXPR to TYPE is
6018 not permitted by ISO C++, but we accept it in some modes. If we
6019 are not in one of those modes, issue a diagnostic. Return the
6020 converted expression. */
6023 convert_member_func_to_ptr (tree type
, tree expr
)
6028 intype
= TREE_TYPE (expr
);
6029 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
6030 || TREE_CODE (intype
) == METHOD_TYPE
);
6032 if (pedantic
|| warn_pmf2ptr
)
6033 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
6034 "converting from %qT to %qT", intype
, type
);
6036 if (TREE_CODE (intype
) == METHOD_TYPE
)
6037 expr
= build_addr_func (expr
);
6038 else if (TREE_CODE (expr
) == PTRMEM_CST
)
6039 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
6042 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
6043 decl
= build_address (decl
);
6044 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
6047 return build_nop (type
, expr
);
6050 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
6051 If C_CAST_P is true, this reinterpret cast is being done as part of
6052 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
6053 indicate whether or not reinterpret_cast was valid. */
6056 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6057 bool *valid_p
, tsubst_flags_t complain
)
6061 /* Assume the cast is invalid. */
6065 if (type
== error_mark_node
|| error_operand_p (expr
))
6066 return error_mark_node
;
6068 intype
= TREE_TYPE (expr
);
6070 /* Save casted types in the function's used types hash table. */
6071 used_types_insert (type
);
6073 /* [expr.reinterpret.cast]
6074 An lvalue expression of type T1 can be cast to the type
6075 "reference to T2" if an expression of type "pointer to T1" can be
6076 explicitly converted to the type "pointer to T2" using a
6077 reinterpret_cast. */
6078 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6080 if (! real_lvalue_p (expr
))
6082 if (complain
& tf_error
)
6083 error ("invalid cast of an rvalue expression of type "
6086 return error_mark_node
;
6089 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6090 "B" are related class types; the reinterpret_cast does not
6091 adjust the pointer. */
6092 if (TYPE_PTR_P (intype
)
6093 && (complain
& tf_warning
)
6094 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
6095 COMPARE_BASE
| COMPARE_DERIVED
)))
6096 warning (0, "casting %qT to %qT does not dereference pointer",
6099 expr
= cp_build_addr_expr (expr
, complain
);
6101 if (warn_strict_aliasing
> 2)
6102 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
6104 if (expr
!= error_mark_node
)
6105 expr
= build_reinterpret_cast_1
6106 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
6108 if (expr
!= error_mark_node
)
6109 /* cp_build_indirect_ref isn't right for rvalue refs. */
6110 expr
= convert_from_reference (fold_convert (type
, expr
));
6114 /* As a G++ extension, we consider conversions from member
6115 functions, and pointers to member functions to
6116 pointer-to-function and pointer-to-void types. If
6117 -Wno-pmf-conversions has not been specified,
6118 convert_member_func_to_ptr will issue an error message. */
6119 if ((TYPE_PTRMEMFUNC_P (intype
)
6120 || TREE_CODE (intype
) == METHOD_TYPE
)
6121 && TYPE_PTR_P (type
)
6122 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6123 || VOID_TYPE_P (TREE_TYPE (type
))))
6124 return convert_member_func_to_ptr (type
, expr
);
6126 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6127 array-to-pointer, and function-to-pointer conversions are
6129 expr
= decay_conversion (expr
);
6131 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6132 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6133 if (TREE_CODE (expr
) == NOP_EXPR
6134 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6135 expr
= TREE_OPERAND (expr
, 0);
6137 if (error_operand_p (expr
))
6138 return error_mark_node
;
6140 intype
= TREE_TYPE (expr
);
6142 /* [expr.reinterpret.cast]
6143 A pointer can be converted to any integral type large enough to
6144 hold it. ... A value of type std::nullptr_t can be converted to
6145 an integral type; the conversion has the same meaning and
6146 validity as a conversion of (void*)0 to the integral type. */
6147 if (CP_INTEGRAL_TYPE_P (type
)
6148 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
6150 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
6152 if (complain
& tf_error
)
6153 permerror (input_location
, "cast from %qT to %qT loses precision",
6156 return error_mark_node
;
6158 if (NULLPTR_TYPE_P (intype
))
6159 return build_int_cst (type
, 0);
6161 /* [expr.reinterpret.cast]
6162 A value of integral or enumeration type can be explicitly
6163 converted to a pointer. */
6164 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6167 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6168 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6169 return fold_if_not_in_template (build_nop (type
, expr
));
6170 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6171 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6176 check_for_casting_away_constness (intype
, type
, REINTERPRET_CAST_EXPR
);
6177 /* Warn about possible alignment problems. */
6178 if (STRICT_ALIGNMENT
&& warn_cast_align
6179 && (complain
& tf_warning
)
6180 && !VOID_TYPE_P (type
)
6181 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6182 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6183 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6184 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6185 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6186 "increases required alignment of target type", intype
, type
);
6188 /* We need to strip nops here, because the front end likes to
6189 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6191 if (warn_strict_aliasing
<= 2)
6192 strict_aliasing_warning (intype
, type
, sexpr
);
6194 return fold_if_not_in_template (build_nop (type
, expr
));
6196 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6197 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6199 if (pedantic
&& (complain
& tf_warning
))
6200 /* Only issue a warning, as we have always supported this
6201 where possible, and it is necessary in some cases. DR 195
6202 addresses this issue, but as of 2004/10/26 is still in
6204 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6205 return fold_if_not_in_template (build_nop (type
, expr
));
6207 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6208 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6209 else if (TREE_CODE (intype
) == VECTOR_TYPE
6210 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6211 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6216 if (complain
& tf_error
)
6217 error ("invalid cast from type %qT to type %qT", intype
, type
);
6218 return error_mark_node
;
6221 return cp_convert (type
, expr
);
6225 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6227 if (type
== error_mark_node
|| expr
== error_mark_node
)
6228 return error_mark_node
;
6230 if (processing_template_decl
)
6232 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6234 if (!TREE_SIDE_EFFECTS (t
)
6235 && type_dependent_expression_p (expr
))
6236 /* There might turn out to be side effects inside expr. */
6237 TREE_SIDE_EFFECTS (t
) = 1;
6238 return convert_from_reference (t
);
6241 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6242 /*valid_p=*/NULL
, complain
);
6245 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6246 return an appropriate expression. Otherwise, return
6247 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6248 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6249 performing a C-style cast, its value upon return will indicate
6250 whether or not the conversion succeeded. */
6253 build_const_cast_1 (tree dst_type
, tree expr
, bool complain
,
6257 tree reference_type
;
6259 /* Callers are responsible for handling error_mark_node as a
6260 destination type. */
6261 gcc_assert (dst_type
!= error_mark_node
);
6262 /* In a template, callers should be building syntactic
6263 representations of casts, not using this machinery. */
6264 gcc_assert (!processing_template_decl
);
6266 /* Assume the conversion is invalid. */
6270 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6273 error ("invalid use of const_cast with type %qT, "
6274 "which is not a pointer, "
6275 "reference, nor a pointer-to-data-member type", dst_type
);
6276 return error_mark_node
;
6279 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6282 error ("invalid use of const_cast with type %qT, which is a pointer "
6283 "or reference to a function type", dst_type
);
6284 return error_mark_node
;
6287 /* Save casted types in the function's used types hash table. */
6288 used_types_insert (dst_type
);
6290 src_type
= TREE_TYPE (expr
);
6291 /* Expressions do not really have reference types. */
6292 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6293 src_type
= TREE_TYPE (src_type
);
6295 /* [expr.const.cast]
6297 An lvalue of type T1 can be explicitly converted to an lvalue of
6298 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6299 types) if a pointer to T1 can be explicitly converted to the type
6300 pointer to T2 using a const_cast. */
6301 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6303 reference_type
= dst_type
;
6304 if (! real_lvalue_p (expr
))
6307 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6308 src_type
, dst_type
);
6309 return error_mark_node
;
6311 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6312 src_type
= build_pointer_type (src_type
);
6316 reference_type
= NULL_TREE
;
6317 /* If the destination type is not a reference type, the
6318 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6319 conversions are performed. */
6320 src_type
= type_decays_to (src_type
);
6321 if (src_type
== error_mark_node
)
6322 return error_mark_node
;
6325 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6326 && comp_ptr_ttypes_const (dst_type
, src_type
))
6331 /* This cast is actually a C-style cast. Issue a warning if
6332 the user is making a potentially unsafe cast. */
6333 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
);
6337 expr
= cp_build_addr_expr (expr
,
6338 complain
? tf_warning_or_error
: tf_none
);
6339 expr
= build_nop (reference_type
, expr
);
6340 return convert_from_reference (expr
);
6344 expr
= decay_conversion (expr
);
6345 /* build_c_cast puts on a NOP_EXPR to make the result not an
6346 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6347 non-lvalue context. */
6348 if (TREE_CODE (expr
) == NOP_EXPR
6349 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6350 expr
= TREE_OPERAND (expr
, 0);
6351 return build_nop (dst_type
, expr
);
6356 error ("invalid const_cast from type %qT to type %qT",
6357 src_type
, dst_type
);
6358 return error_mark_node
;
6362 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6364 if (type
== error_mark_node
|| error_operand_p (expr
))
6365 return error_mark_node
;
6367 if (processing_template_decl
)
6369 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6371 if (!TREE_SIDE_EFFECTS (t
)
6372 && type_dependent_expression_p (expr
))
6373 /* There might turn out to be side effects inside expr. */
6374 TREE_SIDE_EFFECTS (t
) = 1;
6375 return convert_from_reference (t
);
6378 return build_const_cast_1 (type
, expr
, complain
& tf_error
,
6382 /* Like cp_build_c_cast, but for the c-common bits. */
6385 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6387 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6390 /* Build an expression representing an explicit C-style cast to type
6391 TYPE of expression EXPR. */
6394 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6400 if (type
== error_mark_node
|| error_operand_p (expr
))
6401 return error_mark_node
;
6403 if (processing_template_decl
)
6405 tree t
= build_min (CAST_EXPR
, type
,
6406 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6407 /* We don't know if it will or will not have side effects. */
6408 TREE_SIDE_EFFECTS (t
) = 1;
6409 return convert_from_reference (t
);
6412 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6413 'Class') should always be retained, because this information aids
6414 in method lookup. */
6415 if (objc_is_object_ptr (type
)
6416 && objc_is_object_ptr (TREE_TYPE (expr
)))
6417 return build_nop (type
, expr
);
6419 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6420 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6421 if (TREE_CODE (type
) != REFERENCE_TYPE
6422 && TREE_CODE (value
) == NOP_EXPR
6423 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6424 value
= TREE_OPERAND (value
, 0);
6426 if (TREE_CODE (type
) == ARRAY_TYPE
)
6428 /* Allow casting from T1* to T2[] because Cfront allows it.
6429 NIHCL uses it. It is not valid ISO C++ however. */
6430 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6432 if (complain
& tf_error
)
6433 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6435 return error_mark_node
;
6436 type
= build_pointer_type (TREE_TYPE (type
));
6440 if (complain
& tf_error
)
6441 error ("ISO C++ forbids casting to an array type %qT", type
);
6442 return error_mark_node
;
6446 if (TREE_CODE (type
) == FUNCTION_TYPE
6447 || TREE_CODE (type
) == METHOD_TYPE
)
6449 if (complain
& tf_error
)
6450 error ("invalid cast to function type %qT", type
);
6451 return error_mark_node
;
6454 if (TREE_CODE (type
) == POINTER_TYPE
6455 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
6456 /* Casting to an integer of smaller size is an error detected elsewhere. */
6457 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
6458 /* Don't warn about converting any constant. */
6459 && !TREE_CONSTANT (value
))
6460 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
6461 "cast to pointer from integer of different size");
6463 /* A C-style cast can be a const_cast. */
6464 result
= build_const_cast_1 (type
, value
, /*complain=*/false,
6469 /* Or a static cast. */
6470 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6471 &valid_p
, complain
);
6472 /* Or a reinterpret_cast. */
6474 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6475 &valid_p
, complain
);
6476 /* The static_cast or reinterpret_cast may be followed by a
6479 /* A valid cast may result in errors if, for example, a
6480 conversion to am ambiguous base class is required. */
6481 && !error_operand_p (result
))
6485 /* Non-class rvalues always have cv-unqualified type. */
6486 if (!CLASS_TYPE_P (type
))
6487 type
= TYPE_MAIN_VARIANT (type
);
6488 result_type
= TREE_TYPE (result
);
6489 if (!CLASS_TYPE_P (result_type
))
6490 result_type
= TYPE_MAIN_VARIANT (result_type
);
6491 /* If the type of RESULT does not match TYPE, perform a
6492 const_cast to make it match. If the static_cast or
6493 reinterpret_cast succeeded, we will differ by at most
6494 cv-qualification, so the follow-on const_cast is guaranteed
6496 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6498 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6499 gcc_assert (valid_p
);
6504 return error_mark_node
;
6507 /* For use from the C common bits. */
6509 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6510 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6511 enum tree_code modifycode
,
6512 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6513 tree rhs_origtype ATTRIBUTE_UNUSED
)
6515 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6518 /* Build an assignment expression of lvalue LHS from value RHS.
6519 MODIFYCODE is the code for a binary operator that we use
6520 to combine the old value of LHS with RHS to get the new value.
6521 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6523 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6526 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6527 tsubst_flags_t complain
)
6531 tree lhstype
= TREE_TYPE (lhs
);
6532 tree olhstype
= lhstype
;
6533 bool plain_assign
= (modifycode
== NOP_EXPR
);
6535 /* Avoid duplicate error messages from operands that had errors. */
6536 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6537 return error_mark_node
;
6539 /* Handle control structure constructs used as "lvalues". */
6540 switch (TREE_CODE (lhs
))
6542 /* Handle --foo = 5; as these are valid constructs in C++. */
6543 case PREDECREMENT_EXPR
:
6544 case PREINCREMENT_EXPR
:
6545 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6546 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6547 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6548 TREE_OPERAND (lhs
, 1));
6549 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6550 modifycode
, rhs
, complain
);
6551 if (newrhs
== error_mark_node
)
6552 return error_mark_node
;
6553 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6555 /* Handle (a, b) used as an "lvalue". */
6557 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6558 modifycode
, rhs
, complain
);
6559 if (newrhs
== error_mark_node
)
6560 return error_mark_node
;
6561 return build2 (COMPOUND_EXPR
, lhstype
,
6562 TREE_OPERAND (lhs
, 0), newrhs
);
6565 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6566 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6567 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6568 TREE_OPERAND (lhs
, 1));
6569 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6571 if (newrhs
== error_mark_node
)
6572 return error_mark_node
;
6573 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6577 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6578 when neither operand has side-effects. */
6579 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6580 return error_mark_node
;
6582 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6583 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6585 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6586 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6588 TREE_OPERAND (lhs
, 0),
6589 TREE_OPERAND (lhs
, 1)),
6590 TREE_OPERAND (lhs
, 0),
6591 TREE_OPERAND (lhs
, 1));
6594 /* Handle (a ? b : c) used as an "lvalue". */
6597 /* Produce (a ? (b = rhs) : (c = rhs))
6598 except that the RHS goes through a save-expr
6599 so the code to compute it is only emitted once. */
6601 tree preeval
= NULL_TREE
;
6603 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6605 if (complain
& tf_error
)
6606 error ("void value not ignored as it ought to be");
6607 return error_mark_node
;
6610 rhs
= stabilize_expr (rhs
, &preeval
);
6612 /* Check this here to avoid odd errors when trying to convert
6613 a throw to the type of the COND_EXPR. */
6614 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6615 return error_mark_node
;
6617 cond
= build_conditional_expr
6618 (TREE_OPERAND (lhs
, 0),
6619 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6620 modifycode
, rhs
, complain
),
6621 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6622 modifycode
, rhs
, complain
),
6625 if (cond
== error_mark_node
)
6627 /* Make sure the code to compute the rhs comes out
6628 before the split. */
6630 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6638 if (modifycode
== INIT_EXPR
)
6640 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6641 /* Do the default thing. */;
6642 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6644 /* Compound literal. */
6645 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6646 /* Call convert to generate an error; see PR 11063. */
6647 rhs
= convert (lhstype
, rhs
);
6648 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6649 TREE_SIDE_EFFECTS (result
) = 1;
6652 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6653 /* Do the default thing. */;
6656 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6657 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6658 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6660 release_tree_vector (rhs_vec
);
6661 if (result
== NULL_TREE
)
6662 return error_mark_node
;
6668 lhs
= require_complete_type_sfinae (lhs
, complain
);
6669 if (lhs
== error_mark_node
)
6670 return error_mark_node
;
6672 if (modifycode
== NOP_EXPR
)
6674 if (c_dialect_objc ())
6676 result
= objc_maybe_build_modify_expr (lhs
, rhs
);
6681 /* `operator=' is not an inheritable operator. */
6682 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6683 /* Do the default thing. */;
6686 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6687 lhs
, rhs
, make_node (NOP_EXPR
),
6688 /*overloaded_p=*/NULL
,
6690 if (result
== NULL_TREE
)
6691 return error_mark_node
;
6698 /* A binary op has been requested. Combine the old LHS
6699 value with the RHS producing the value we should actually
6700 store into the LHS. */
6701 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6702 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6703 || MAYBE_CLASS_TYPE_P (lhstype
)));
6705 lhs
= stabilize_reference (lhs
);
6706 newrhs
= cp_build_binary_op (input_location
,
6707 modifycode
, lhs
, rhs
,
6709 if (newrhs
== error_mark_node
)
6711 if (complain
& tf_error
)
6712 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6713 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6714 return error_mark_node
;
6717 /* Now it looks like a plain assignment. */
6718 modifycode
= NOP_EXPR
;
6719 if (c_dialect_objc ())
6721 result
= objc_maybe_build_modify_expr (lhs
, newrhs
);
6726 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6727 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6730 /* The left-hand side must be an lvalue. */
6731 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6732 return error_mark_node
;
6734 /* Warn about modifying something that is `const'. Don't warn if
6735 this is initialization. */
6736 if (modifycode
!= INIT_EXPR
6737 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6738 /* Functions are not modifiable, even though they are
6740 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6741 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6742 /* If it's an aggregate and any field is const, then it is
6743 effectively const. */
6744 || (CLASS_TYPE_P (lhstype
)
6745 && C_TYPE_FIELDS_READONLY (lhstype
))))
6747 if (complain
& tf_error
)
6748 readonly_error (lhs
, REK_ASSIGNMENT
);
6750 return error_mark_node
;
6753 /* If storing into a structure or union member, it may have been given a
6754 lowered bitfield type. We need to convert to the declared type first,
6755 so retrieve it now. */
6757 olhstype
= unlowered_expr_type (lhs
);
6759 /* Convert new value to destination type. */
6761 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6765 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6767 if (modifycode
!= INIT_EXPR
)
6769 if (complain
& tf_error
)
6770 error ("assigning to an array from an initializer list");
6771 return error_mark_node
;
6773 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6774 return error_mark_node
;
6775 newrhs
= digest_init (lhstype
, newrhs
);
6778 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6779 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6781 if (complain
& tf_error
)
6782 error ("incompatible types in assignment of %qT to %qT",
6783 TREE_TYPE (rhs
), lhstype
);
6784 return error_mark_node
;
6787 /* Allow array assignment in compiler-generated code. */
6788 else if (!current_function_decl
6789 || !DECL_ARTIFICIAL (current_function_decl
))
6791 /* This routine is used for both initialization and assignment.
6792 Make sure the diagnostic message differentiates the context. */
6793 if (complain
& tf_error
)
6795 if (modifycode
== INIT_EXPR
)
6796 error ("array used as initializer");
6798 error ("invalid array assignment");
6800 return error_mark_node
;
6803 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6804 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6805 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6806 /*explicit_value_init_p=*/false,
6807 from_array
, complain
);
6810 if (modifycode
== INIT_EXPR
)
6811 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6812 LOOKUP_ONLYCONVERTING. */
6813 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6814 ICR_INIT
, NULL_TREE
, 0,
6817 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
6818 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6820 if (!same_type_p (lhstype
, olhstype
))
6821 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6823 if (modifycode
!= INIT_EXPR
)
6825 if (TREE_CODE (newrhs
) == CALL_EXPR
6826 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6827 newrhs
= build_cplus_new (lhstype
, newrhs
);
6829 /* Can't initialize directly from a TARGET_EXPR, since that would
6830 cause the lhs to be constructed twice, and possibly result in
6831 accidental self-initialization. So we force the TARGET_EXPR to be
6832 expanded without a target. */
6833 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6834 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6835 TREE_OPERAND (newrhs
, 0));
6838 if (newrhs
== error_mark_node
)
6839 return error_mark_node
;
6841 if (c_dialect_objc () && flag_objc_gc
)
6843 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6849 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6850 lhstype
, lhs
, newrhs
);
6852 TREE_SIDE_EFFECTS (result
) = 1;
6854 TREE_NO_WARNING (result
) = 1;
6860 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6861 tsubst_flags_t complain
)
6863 if (processing_template_decl
)
6864 return build_min_nt (MODOP_EXPR
, lhs
,
6865 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6867 if (modifycode
!= NOP_EXPR
)
6869 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6870 make_node (modifycode
),
6871 /*overloaded_p=*/NULL
,
6875 TREE_NO_WARNING (rval
) = 1;
6879 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6882 /* Helper function for get_delta_difference which assumes FROM is a base
6883 class of TO. Returns a delta for the conversion of pointer-to-member
6884 of FROM to pointer-to-member of TO. If the conversion is invalid and
6885 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
6886 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6887 If C_CAST_P is true, this conversion is taking place as part of a
6891 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
,
6892 tsubst_flags_t complain
)
6896 base_access access
= c_cast_p
? ba_unique
: ba_check
;
6898 /* Note: ba_quiet does not distinguish between access control and
6900 if (!(complain
& tf_error
))
6903 binfo
= lookup_base (to
, from
, access
, &kind
);
6905 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6907 if (!(complain
& tf_error
))
6908 return error_mark_node
;
6910 error (" in pointer to member function conversion");
6911 return size_zero_node
;
6915 if (kind
!= bk_via_virtual
)
6916 return BINFO_OFFSET (binfo
);
6918 /* FROM is a virtual base class of TO. Issue an error or warning
6919 depending on whether or not this is a reinterpret cast. */
6921 if (!(complain
& tf_error
))
6922 return error_mark_node
;
6924 error ("pointer to member conversion via virtual base %qT",
6925 BINFO_TYPE (binfo_from_vbase (binfo
)));
6927 return size_zero_node
;
6934 /* Get difference in deltas for different pointer to member function
6935 types. If the conversion is invalid and tf_error is not set in
6936 COMPLAIN, returns error_mark_node, otherwise returns an integer
6937 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
6938 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
6939 conversions as well. If C_CAST_P is true this conversion is taking
6940 place as part of a C-style cast.
6942 Note that the naming of FROM and TO is kind of backwards; the return
6943 value is what we add to a TO in order to get a FROM. They are named
6944 this way because we call this function to find out how to convert from
6945 a pointer to member of FROM to a pointer to member of TO. */
6948 get_delta_difference (tree from
, tree to
,
6949 bool allow_inverse_p
,
6950 bool c_cast_p
, tsubst_flags_t complain
)
6954 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
6955 /* Pointer to member of incomplete class is permitted*/
6956 result
= size_zero_node
;
6958 result
= get_delta_difference_1 (from
, to
, c_cast_p
, complain
);
6960 if (result
== error_mark_node
)
6961 return error_mark_node
;
6965 if (!allow_inverse_p
)
6967 if (!(complain
& tf_error
))
6968 return error_mark_node
;
6970 error_not_base_type (from
, to
);
6971 error (" in pointer to member conversion");
6972 result
= size_zero_node
;
6976 result
= get_delta_difference_1 (to
, from
, c_cast_p
, complain
);
6978 if (result
== error_mark_node
)
6979 return error_mark_node
;
6982 result
= size_diffop_loc (input_location
,
6983 size_zero_node
, result
);
6986 if (!(complain
& tf_error
))
6987 return error_mark_node
;
6989 error_not_base_type (from
, to
);
6990 error (" in pointer to member conversion");
6991 result
= size_zero_node
;
6996 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
7000 /* Return a constructor for the pointer-to-member-function TYPE using
7001 the other components as specified. */
7004 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
7009 VEC(constructor_elt
, gc
) *v
;
7011 /* Pull the FIELD_DECLs out of the type. */
7012 pfn_field
= TYPE_FIELDS (type
);
7013 delta_field
= DECL_CHAIN (pfn_field
);
7015 /* Make sure DELTA has the type we want. */
7016 delta
= convert_and_check (delta_type_node
, delta
);
7018 /* Convert to the correct target type if necessary. */
7019 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
7021 /* Finish creating the initializer. */
7022 v
= VEC_alloc(constructor_elt
, gc
, 2);
7023 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
7024 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
7025 u
= build_constructor (type
, v
);
7026 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
7027 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
7028 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
7030 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
7035 /* Build a constructor for a pointer to member function. It can be
7036 used to initialize global variables, local variable, or used
7037 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
7040 If FORCE is nonzero, then force this conversion, even if
7041 we would rather not do it. Usually set when using an explicit
7042 cast. A C-style cast is being processed iff C_CAST_P is true.
7044 Return error_mark_node, if something goes wrong. */
7047 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
,
7048 tsubst_flags_t complain
)
7054 if (error_operand_p (pfn
))
7055 return error_mark_node
;
7057 pfn_type
= TREE_TYPE (pfn
);
7058 to_type
= build_ptrmemfunc_type (type
);
7060 /* Handle multiple conversions of pointer to member functions. */
7061 if (TYPE_PTRMEMFUNC_P (pfn_type
))
7063 tree delta
= NULL_TREE
;
7064 tree npfn
= NULL_TREE
;
7068 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
7069 error ("invalid conversion to type %qT from type %qT",
7072 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
7073 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
7075 c_cast_p
, complain
);
7076 if (n
== error_mark_node
)
7077 return error_mark_node
;
7079 /* We don't have to do any conversion to convert a
7080 pointer-to-member to its own type. But, we don't want to
7081 just return a PTRMEM_CST if there's an explicit cast; that
7082 cast should make the expression an invalid template argument. */
7083 if (TREE_CODE (pfn
) != PTRMEM_CST
)
7085 if (same_type_p (to_type
, pfn_type
))
7087 else if (integer_zerop (n
))
7088 return build_reinterpret_cast (to_type
, pfn
,
7089 tf_warning_or_error
);
7092 if (TREE_SIDE_EFFECTS (pfn
))
7093 pfn
= save_expr (pfn
);
7095 /* Obtain the function pointer and the current DELTA. */
7096 if (TREE_CODE (pfn
) == PTRMEM_CST
)
7097 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
7100 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
7101 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
7104 /* Just adjust the DELTA field. */
7105 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7106 (TREE_TYPE (delta
), ptrdiff_type_node
));
7107 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
7108 n
= cp_build_binary_op (input_location
,
7109 LSHIFT_EXPR
, n
, integer_one_node
,
7110 tf_warning_or_error
);
7111 delta
= cp_build_binary_op (input_location
,
7112 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
7113 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
7116 /* Handle null pointer to member function conversions. */
7117 if (null_ptr_cst_p (pfn
))
7119 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
7120 return build_ptrmemfunc1 (to_type
,
7125 if (type_unknown_p (pfn
))
7126 return instantiate_type (type
, pfn
, tf_warning_or_error
);
7128 fn
= TREE_OPERAND (pfn
, 0);
7129 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7130 /* In a template, we will have preserved the
7132 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
7133 return make_ptrmem_cst (to_type
, fn
);
7136 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7139 ??? There is no consistency as to the types returned for the above
7140 values. Some code acts as if it were a sizetype and some as if it were
7141 integer_type_node. */
7144 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
7146 tree type
= TREE_TYPE (cst
);
7147 tree fn
= PTRMEM_CST_MEMBER (cst
);
7148 tree ptr_class
, fn_class
;
7150 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7152 /* The class that the function belongs to. */
7153 fn_class
= DECL_CONTEXT (fn
);
7155 /* The class that we're creating a pointer to member of. */
7156 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
7158 /* First, calculate the adjustment to the function's class. */
7159 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
7160 /*c_cast_p=*/0, tf_warning_or_error
);
7162 if (!DECL_VIRTUAL_P (fn
))
7163 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
7166 /* If we're dealing with a virtual function, we have to adjust 'this'
7167 again, to point to the base which provides the vtable entry for
7168 fn; the call will do the opposite adjustment. */
7169 tree orig_class
= DECL_CONTEXT (fn
);
7170 tree binfo
= binfo_or_else (orig_class
, fn_class
);
7171 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7172 *delta
, BINFO_OFFSET (binfo
));
7173 *delta
= fold_if_not_in_template (*delta
);
7175 /* We set PFN to the vtable offset at which the function can be
7176 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7177 case delta is shifted left, and then incremented). */
7178 *pfn
= DECL_VINDEX (fn
);
7179 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
7180 TYPE_SIZE_UNIT (vtable_entry_type
));
7181 *pfn
= fold_if_not_in_template (*pfn
);
7183 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
7185 case ptrmemfunc_vbit_in_pfn
:
7186 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
7188 *pfn
= fold_if_not_in_template (*pfn
);
7191 case ptrmemfunc_vbit_in_delta
:
7192 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
7193 *delta
, integer_one_node
);
7194 *delta
= fold_if_not_in_template (*delta
);
7195 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7196 *delta
, integer_one_node
);
7197 *delta
= fold_if_not_in_template (*delta
);
7204 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
7205 *pfn
= fold_if_not_in_template (*pfn
);
7209 /* Return an expression for PFN from the pointer-to-member function
7213 pfn_from_ptrmemfunc (tree t
)
7215 if (TREE_CODE (t
) == PTRMEM_CST
)
7220 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7225 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
7228 /* Return an expression for DELTA from the pointer-to-member function
7232 delta_from_ptrmemfunc (tree t
)
7234 if (TREE_CODE (t
) == PTRMEM_CST
)
7239 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7244 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7247 /* Convert value RHS to type TYPE as preparation for an assignment to
7248 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
7249 implicit conversion is. If FNDECL is non-NULL, we are doing the
7250 conversion in order to pass the PARMNUMth argument of FNDECL.
7251 If FNDECL is NULL, we are doing the conversion in function pointer
7252 argument passing, conversion in initialization, etc. */
7255 convert_for_assignment (tree type
, tree rhs
,
7256 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7257 tsubst_flags_t complain
, int flags
)
7260 enum tree_code coder
;
7262 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7263 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7264 rhs
= TREE_OPERAND (rhs
, 0);
7266 rhstype
= TREE_TYPE (rhs
);
7267 coder
= TREE_CODE (rhstype
);
7269 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7270 && vector_types_convertible_p (type
, rhstype
, true))
7272 rhs
= mark_rvalue_use (rhs
);
7273 return convert (type
, rhs
);
7276 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7277 return error_mark_node
;
7278 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7279 return error_mark_node
;
7281 /* The RHS of an assignment cannot have void type. */
7282 if (coder
== VOID_TYPE
)
7284 if (complain
& tf_error
)
7285 error ("void value not ignored as it ought to be");
7286 return error_mark_node
;
7289 /* Simplify the RHS if possible. */
7290 if (TREE_CODE (rhs
) == CONST_DECL
)
7291 rhs
= DECL_INITIAL (rhs
);
7293 if (c_dialect_objc ())
7297 tree rname
= fndecl
;
7308 selector
= objc_message_selector ();
7310 if (selector
&& parmno
> 1)
7317 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7319 rhs
= mark_rvalue_use (rhs
);
7320 return convert (type
, rhs
);
7326 The expression is implicitly converted (clause _conv_) to the
7327 cv-unqualified type of the left operand.
7329 We allow bad conversions here because by the time we get to this point
7330 we are committed to doing the conversion. If we end up doing a bad
7331 conversion, convert_like will complain. */
7332 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7334 /* When -Wno-pmf-conversions is use, we just silently allow
7335 conversions from pointers-to-members to plain pointers. If
7336 the conversion doesn't work, cp_convert will complain. */
7338 && TYPE_PTR_P (type
)
7339 && TYPE_PTRMEMFUNC_P (rhstype
))
7340 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7343 if (complain
& tf_error
)
7345 /* If the right-hand side has unknown type, then it is an
7346 overloaded function. Call instantiate_type to get error
7348 if (rhstype
== unknown_type_node
)
7349 instantiate_type (type
, rhs
, tf_warning_or_error
);
7351 error ("cannot convert %qT to %qT for argument %qP to %qD",
7352 rhstype
, type
, parmnum
, fndecl
);
7356 case ICR_DEFAULT_ARGUMENT
:
7357 error ("cannot convert %qT to %qT in default argument",
7361 error ("cannot convert %qT to %qT in argument passing",
7364 case ICR_CONVERTING
:
7365 error ("cannot convert %qT to %qT",
7369 error ("cannot convert %qT to %qT in initialization",
7373 error ("cannot convert %qT to %qT in return",
7377 error ("cannot convert %qT to %qT in assignment",
7384 return error_mark_node
;
7387 if (warn_missing_format_attribute
)
7389 const enum tree_code codel
= TREE_CODE (type
);
7390 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7392 && check_missing_format_attribute (type
, rhstype
)
7393 && (complain
& tf_warning
))
7397 case ICR_DEFAULT_ARGUMENT
:
7399 warning (OPT_Wmissing_format_attribute
,
7400 "parameter %qP of %qD might be a candidate "
7401 "for a format attribute", parmnum
, fndecl
);
7403 warning (OPT_Wmissing_format_attribute
,
7404 "parameter might be a candidate "
7405 "for a format attribute");
7407 case ICR_CONVERTING
:
7408 warning (OPT_Wmissing_format_attribute
,
7409 "target of conversion might be might be a candidate "
7410 "for a format attribute");
7413 warning (OPT_Wmissing_format_attribute
,
7414 "target of initialization might be a candidate "
7415 "for a format attribute");
7418 warning (OPT_Wmissing_format_attribute
,
7419 "return type might be a candidate "
7420 "for a format attribute");
7423 warning (OPT_Wmissing_format_attribute
,
7424 "left-hand side of assignment might be a candidate "
7425 "for a format attribute");
7432 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7434 if (warn_parentheses
7435 && TREE_CODE (type
) == BOOLEAN_TYPE
7436 && TREE_CODE (rhs
) == MODIFY_EXPR
7437 && !TREE_NO_WARNING (rhs
)
7438 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7439 && (complain
& tf_warning
))
7441 location_t loc
= EXPR_LOC_OR_HERE (rhs
);
7443 warning_at (loc
, OPT_Wparentheses
,
7444 "suggest parentheses around assignment used as truth value");
7445 TREE_NO_WARNING (rhs
) = 1;
7448 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7452 /* Convert RHS to be of type TYPE.
7453 If EXP is nonzero, it is the target of the initialization.
7454 ERRTYPE indicates what kind of error the implicit conversion is.
7456 Two major differences between the behavior of
7457 `convert_for_assignment' and `convert_for_initialization'
7458 are that references are bashed in the former, while
7459 copied in the latter, and aggregates are assigned in
7460 the former (operator=) while initialized in the
7463 If using constructor make sure no conversion operator exists, if one does
7464 exist, an ambiguity exists.
7466 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7469 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7470 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7471 tsubst_flags_t complain
)
7473 enum tree_code codel
= TREE_CODE (type
);
7475 enum tree_code coder
;
7477 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7478 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7479 if (TREE_CODE (rhs
) == NOP_EXPR
7480 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7481 && codel
!= REFERENCE_TYPE
)
7482 rhs
= TREE_OPERAND (rhs
, 0);
7484 if (type
== error_mark_node
7485 || rhs
== error_mark_node
7486 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7487 return error_mark_node
;
7489 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7490 && TREE_CODE (type
) != ARRAY_TYPE
7491 && (TREE_CODE (type
) != REFERENCE_TYPE
7492 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7493 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7494 && (TREE_CODE (type
) != REFERENCE_TYPE
7495 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7496 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7497 rhs
= decay_conversion (rhs
);
7499 rhstype
= TREE_TYPE (rhs
);
7500 coder
= TREE_CODE (rhstype
);
7502 if (coder
== ERROR_MARK
)
7503 return error_mark_node
;
7505 /* We accept references to incomplete types, so we can
7506 return here before checking if RHS is of complete type. */
7508 if (codel
== REFERENCE_TYPE
)
7510 /* This should eventually happen in convert_arguments. */
7511 int savew
= 0, savee
= 0;
7514 savew
= warningcount
, savee
= errorcount
;
7515 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7516 /*cleanup=*/NULL
, complain
);
7519 if (warningcount
> savew
)
7520 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7521 else if (errorcount
> savee
)
7522 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7528 exp
= require_complete_type_sfinae (exp
, complain
);
7529 if (exp
== error_mark_node
)
7530 return error_mark_node
;
7532 rhstype
= non_reference (rhstype
);
7534 type
= complete_type (type
);
7536 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7537 /* Don't try to do copy-initialization if we already have
7538 direct-initialization. */
7541 if (MAYBE_CLASS_TYPE_P (type
))
7542 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
7544 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7548 /* If RETVAL is the address of, or a reference to, a local variable or
7549 temporary give an appropriate warning. */
7552 maybe_warn_about_returning_address_of_local (tree retval
)
7554 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7555 tree whats_returned
= retval
;
7559 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7560 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7561 else if (CONVERT_EXPR_P (whats_returned
)
7562 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7563 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7568 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7570 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7572 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7574 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7575 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7577 warning (0, "returning reference to temporary");
7580 if (TREE_CODE (whats_returned
) == VAR_DECL
7581 && DECL_NAME (whats_returned
)
7582 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7584 warning (0, "reference to non-lvalue returned");
7589 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7590 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7591 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7593 if (DECL_P (whats_returned
)
7594 && DECL_NAME (whats_returned
)
7595 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7596 && !(TREE_STATIC (whats_returned
)
7597 || TREE_PUBLIC (whats_returned
)))
7599 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7600 warning (0, "reference to local variable %q+D returned",
7603 warning (0, "address of local variable %q+D returned",
7609 /* Check that returning RETVAL from the current function is valid.
7610 Return an expression explicitly showing all conversions required to
7611 change RETVAL into the function return type, and to assign it to
7612 the DECL_RESULT for the function. Set *NO_WARNING to true if
7613 code reaches end of non-void function warning shouldn't be issued
7614 on this RETURN_EXPR. */
7617 check_return_expr (tree retval
, bool *no_warning
)
7620 /* The type actually returned by the function, after any
7623 int fn_returns_value_p
;
7624 bool named_return_value_okay_p
;
7626 *no_warning
= false;
7628 /* A `volatile' function is one that isn't supposed to return, ever.
7629 (This is a G++ extension, used to get better code for functions
7630 that call the `volatile' function.) */
7631 if (TREE_THIS_VOLATILE (current_function_decl
))
7632 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7634 /* Check for various simple errors. */
7635 if (DECL_DESTRUCTOR_P (current_function_decl
))
7638 error ("returning a value from a destructor");
7641 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7643 if (in_function_try_handler
)
7644 /* If a return statement appears in a handler of the
7645 function-try-block of a constructor, the program is ill-formed. */
7646 error ("cannot return from a handler of a function-try-block of a constructor");
7648 /* You can't return a value from a constructor. */
7649 error ("returning a value from a constructor");
7653 /* As an extension, deduce lambda return type from a return statement
7654 anywhere in the body. */
7655 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7657 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7658 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7660 tree type
= lambda_return_type (retval
);
7661 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7663 if (VOID_TYPE_P (type
))
7665 else if (oldtype
== NULL_TREE
)
7667 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7668 "can only be deduced when the return statement is "
7669 "the only statement in the function body");
7670 apply_lambda_return_type (lambda
, type
);
7672 else if (!same_type_p (type
, oldtype
))
7673 error ("inconsistent types %qT and %qT deduced for "
7674 "lambda return type", type
, oldtype
);
7678 if (processing_template_decl
)
7680 current_function_returns_value
= 1;
7681 if (check_for_bare_parameter_packs (retval
))
7682 retval
= error_mark_node
;
7686 /* When no explicit return-value is given in a function with a named
7687 return value, the named return value is used. */
7688 result
= DECL_RESULT (current_function_decl
);
7689 valtype
= TREE_TYPE (result
);
7690 gcc_assert (valtype
!= NULL_TREE
);
7691 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7692 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7695 /* Check for a return statement with no return value in a function
7696 that's supposed to return a value. */
7697 if (!retval
&& fn_returns_value_p
)
7699 permerror (input_location
, "return-statement with no value, in function returning %qT",
7701 /* Clear this, so finish_function won't say that we reach the
7702 end of a non-void function (which we don't, we gave a
7704 current_function_returns_null
= 0;
7705 /* And signal caller that TREE_NO_WARNING should be set on the
7706 RETURN_EXPR to avoid control reaches end of non-void function
7707 warnings in tree-cfg.c. */
7710 /* Check for a return statement with a value in a function that
7711 isn't supposed to return a value. */
7712 else if (retval
&& !fn_returns_value_p
)
7714 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7715 /* You can return a `void' value from a function of `void'
7716 type. In that case, we have to evaluate the expression for
7717 its side-effects. */
7718 finish_expr_stmt (retval
);
7720 permerror (input_location
, "return-statement with a value, in function "
7721 "returning 'void'");
7722 current_function_returns_null
= 1;
7724 /* There's really no value to return, after all. */
7728 /* Remember that this function can sometimes return without a
7730 current_function_returns_null
= 1;
7732 /* Remember that this function did return a value. */
7733 current_function_returns_value
= 1;
7735 /* Check for erroneous operands -- but after giving ourselves a
7736 chance to provide an error about returning a value from a void
7738 if (error_operand_p (retval
))
7740 current_function_return_value
= error_mark_node
;
7741 return error_mark_node
;
7744 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7745 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7746 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7747 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7749 && retval
&& null_ptr_cst_p (retval
))
7750 warning (0, "%<operator new%> must not return NULL unless it is "
7751 "declared %<throw()%> (or -fcheck-new is in effect)");
7753 /* Effective C++ rule 15. See also start_function. */
7755 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7759 /* The function return type must be a reference to the current
7761 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7762 && same_type_ignoring_top_level_qualifiers_p
7763 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7765 /* Returning '*this' is obviously OK. */
7766 if (retval
== current_class_ref
)
7768 /* If we are calling a function whose return type is the same of
7769 the current class reference, it is ok. */
7770 else if (TREE_CODE (retval
) == INDIRECT_REF
7771 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7776 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7779 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7781 [...] For a function with a class return type, if the expression
7782 in the return statement is the name of a local object, and the cv-
7783 unqualified type of the local object is the same as the function
7784 return type, an implementation is permitted to omit creating the tem-
7785 porary object to hold the function return value [...]
7787 So, if this is a value-returning function that always returns the same
7788 local variable, remember it.
7790 It might be nice to be more flexible, and choose the first suitable
7791 variable even if the function sometimes returns something else, but
7792 then we run the risk of clobbering the variable we chose if the other
7793 returned expression uses the chosen variable somehow. And people expect
7794 this restriction, anyway. (jason 2000-11-19)
7796 See finish_function and finalize_nrv for the rest of this optimization. */
7798 named_return_value_okay_p
=
7799 (retval
!= NULL_TREE
7800 /* Must be a local, automatic variable. */
7801 && TREE_CODE (retval
) == VAR_DECL
7802 && DECL_CONTEXT (retval
) == current_function_decl
7803 && ! TREE_STATIC (retval
)
7804 && ! DECL_ANON_UNION_VAR_P (retval
)
7805 && (DECL_ALIGN (retval
)
7806 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7807 /* The cv-unqualified type of the returned value must be the
7808 same as the cv-unqualified return type of the
7810 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7812 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7813 /* And the returned value must be non-volatile. */
7814 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7816 if (fn_returns_value_p
&& flag_elide_constructors
)
7818 if (named_return_value_okay_p
7819 && (current_function_return_value
== NULL_TREE
7820 || current_function_return_value
== retval
))
7821 current_function_return_value
= retval
;
7823 current_function_return_value
= error_mark_node
;
7826 /* We don't need to do any conversions when there's nothing being
7831 /* Do any required conversions. */
7832 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7833 /* No conversions are required. */
7837 /* The type the function is declared to return. */
7838 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7839 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7841 /* The functype's return type will have been set to void, if it
7842 was an incomplete type. Just treat this as 'return;' */
7843 if (VOID_TYPE_P (functype
))
7844 return error_mark_node
;
7846 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7847 treated as an rvalue for the purposes of overload resolution to
7848 favor move constructors over copy constructors. */
7849 if ((cxx_dialect
!= cxx98
)
7850 && named_return_value_okay_p
7851 /* The variable must not have the `volatile' qualifier. */
7852 && !CP_TYPE_VOLATILE_P (TREE_TYPE (retval
))
7853 /* The return type must be a class type. */
7854 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7855 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7857 /* First convert the value to the function's return type, then
7858 to the type of return value's location to handle the
7859 case that functype is smaller than the valtype. */
7860 retval
= convert_for_initialization
7861 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
7862 tf_warning_or_error
);
7863 retval
= convert (valtype
, retval
);
7865 /* If the conversion failed, treat this just like `return;'. */
7866 if (retval
== error_mark_node
)
7868 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7869 else if (! cfun
->returns_struct
7870 && TREE_CODE (retval
) == TARGET_EXPR
7871 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7872 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7873 TREE_OPERAND (retval
, 0));
7875 maybe_warn_about_returning_address_of_local (retval
);
7878 /* Actually copy the value returned into the appropriate location. */
7879 if (retval
&& retval
!= result
)
7880 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7886 /* Returns nonzero if the pointer-type FROM can be converted to the
7887 pointer-type TO via a qualification conversion. If CONSTP is -1,
7888 then we return nonzero if the pointers are similar, and the
7889 cv-qualification signature of FROM is a proper subset of that of TO.
7891 If CONSTP is positive, then all outer pointers have been
7895 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7897 bool to_more_cv_qualified
= false;
7898 bool is_opaque_pointer
= false;
7900 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7902 if (TREE_CODE (to
) != TREE_CODE (from
))
7905 if (TREE_CODE (from
) == OFFSET_TYPE
7906 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7907 TYPE_OFFSET_BASETYPE (to
)))
7910 /* Const and volatile mean something different for function types,
7911 so the usual checks are not appropriate. */
7912 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7914 /* In Objective-C++, some types may have been 'volatilized' by
7915 the compiler for EH; when comparing them here, the volatile
7916 qualification must be ignored. */
7917 tree nv_to
= objc_non_volatilized_type (to
);
7918 tree nv_from
= objc_non_volatilized_type (from
);
7920 if (!at_least_as_qualified_p (nv_to
, nv_from
))
7923 if (!at_least_as_qualified_p (nv_from
, nv_to
))
7927 to_more_cv_qualified
= true;
7931 constp
&= TYPE_READONLY (nv_to
);
7934 if (TREE_CODE (to
) == VECTOR_TYPE
)
7935 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7937 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
7938 return ((constp
>= 0 || to_more_cv_qualified
)
7939 && (is_opaque_pointer
7940 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
7944 /* When comparing, say, char ** to char const **, this function takes
7945 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7946 types to this function. */
7949 comp_ptr_ttypes (tree to
, tree from
)
7951 return comp_ptr_ttypes_real (to
, from
, 1);
7954 /* Returns true iff FNTYPE is a non-class type that involves
7955 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7956 if a parameter type is ill-formed. */
7959 error_type_p (const_tree type
)
7963 switch (TREE_CODE (type
))
7969 case REFERENCE_TYPE
:
7971 return error_type_p (TREE_TYPE (type
));
7975 if (error_type_p (TREE_TYPE (type
)))
7977 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7978 if (error_type_p (TREE_VALUE (t
)))
7983 if (TYPE_PTRMEMFUNC_P (type
))
7984 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
7992 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7993 type or inheritance-related types, regardless of cv-quals. */
7996 ptr_reasonably_similar (const_tree to
, const_tree from
)
7998 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
8000 /* Any target type is similar enough to void. */
8001 if (TREE_CODE (to
) == VOID_TYPE
)
8002 return !error_type_p (from
);
8003 if (TREE_CODE (from
) == VOID_TYPE
)
8004 return !error_type_p (to
);
8006 if (TREE_CODE (to
) != TREE_CODE (from
))
8009 if (TREE_CODE (from
) == OFFSET_TYPE
8010 && comptypes (TYPE_OFFSET_BASETYPE (to
),
8011 TYPE_OFFSET_BASETYPE (from
),
8012 COMPARE_BASE
| COMPARE_DERIVED
))
8015 if (TREE_CODE (to
) == VECTOR_TYPE
8016 && vector_types_convertible_p (to
, from
, false))
8019 if (TREE_CODE (to
) == INTEGER_TYPE
8020 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
8023 if (TREE_CODE (to
) == FUNCTION_TYPE
)
8024 return !error_type_p (to
) && !error_type_p (from
);
8026 if (TREE_CODE (to
) != POINTER_TYPE
)
8028 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
8029 COMPARE_BASE
| COMPARE_DERIVED
);
8033 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
8034 pointer-to-member types) are the same, ignoring cv-qualification at
8038 comp_ptr_ttypes_const (tree to
, tree from
)
8040 bool is_opaque_pointer
= false;
8042 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
8044 if (TREE_CODE (to
) != TREE_CODE (from
))
8047 if (TREE_CODE (from
) == OFFSET_TYPE
8048 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
8049 TYPE_OFFSET_BASETYPE (to
)))
8052 if (TREE_CODE (to
) == VECTOR_TYPE
)
8053 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
8055 if (TREE_CODE (to
) != POINTER_TYPE
)
8056 return (is_opaque_pointer
8057 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
8061 /* Returns the type qualifiers for this type, including the qualifiers on the
8062 elements for an array type. */
8065 cp_type_quals (const_tree type
)
8068 /* This CONST_CAST is okay because strip_array_types returns its
8069 argument unmodified and we assign it to a const_tree. */
8070 type
= strip_array_types (CONST_CAST_TREE (type
));
8071 if (type
== error_mark_node
8072 /* Quals on a FUNCTION_TYPE are memfn quals. */
8073 || TREE_CODE (type
) == FUNCTION_TYPE
)
8074 return TYPE_UNQUALIFIED
;
8075 quals
= TYPE_QUALS (type
);
8076 /* METHOD and REFERENCE_TYPEs should never have quals. */
8077 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
8078 && TREE_CODE (type
) != REFERENCE_TYPE
)
8079 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
8080 == TYPE_UNQUALIFIED
));
8084 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
8088 type_memfn_quals (const_tree type
)
8090 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8091 return TYPE_QUALS (type
);
8092 else if (TREE_CODE (type
) == METHOD_TYPE
)
8093 return cp_type_quals (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))));
8098 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
8102 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
)
8104 /* Could handle METHOD_TYPE here if necessary. */
8105 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8106 if (TYPE_QUALS (type
) == memfn_quals
)
8108 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
8110 return build_qualified_type (type
, memfn_quals
);
8113 /* Returns nonzero if TYPE is const or volatile. */
8116 cv_qualified_p (const_tree type
)
8118 int quals
= cp_type_quals (type
);
8119 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
8122 /* Returns nonzero if the TYPE contains a mutable member. */
8125 cp_has_mutable_p (const_tree type
)
8127 /* This CONST_CAST is okay because strip_array_types returns its
8128 argument unmodified and we assign it to a const_tree. */
8129 type
= strip_array_types (CONST_CAST_TREE(type
));
8131 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
8134 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
8135 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
8136 approximation. In particular, consider:
8139 struct S { int i; };
8140 const S s = { f(); }
8142 Here, we will make "s" as TREE_READONLY (because it is declared
8143 "const") -- only to reverse ourselves upon seeing that the
8144 initializer is non-constant. */
8147 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
8149 tree type
= TREE_TYPE (decl
);
8151 if (type
== error_mark_node
)
8154 if (TREE_CODE (decl
) == TYPE_DECL
)
8157 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
8158 && type_quals
!= TYPE_UNQUALIFIED
));
8160 /* Avoid setting TREE_READONLY incorrectly. */
8161 if (/* If the object has a constructor, the constructor may modify
8163 TYPE_NEEDS_CONSTRUCTING (type
)
8164 /* If the type isn't complete, we don't know yet if it will need
8166 || !COMPLETE_TYPE_P (type
)
8167 /* If the type has a mutable component, that component might be
8169 || TYPE_HAS_MUTABLE_P (type
))
8170 type_quals
&= ~TYPE_QUAL_CONST
;
8172 c_apply_type_quals_to_decl (type_quals
, decl
);
8175 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8176 exemplar types such that casting T1 to T2 is casting away constness
8177 if and only if there is no implicit conversion from T1 to T2. */
8180 casts_away_constness_r (tree
*t1
, tree
*t2
)
8185 /* [expr.const.cast]
8187 For multi-level pointer to members and multi-level mixed pointers
8188 and pointers to members (conv.qual), the "member" aspect of a
8189 pointer to member level is ignored when determining if a const
8190 cv-qualifier has been cast away. */
8191 /* [expr.const.cast]
8193 For two pointer types:
8195 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8196 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8199 casting from X1 to X2 casts away constness if, for a non-pointer
8200 type T there does not exist an implicit conversion (clause
8203 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8207 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8208 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
8209 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
8211 *t1
= cp_build_qualified_type (void_type_node
,
8212 cp_type_quals (*t1
));
8213 *t2
= cp_build_qualified_type (void_type_node
,
8214 cp_type_quals (*t2
));
8218 quals1
= cp_type_quals (*t1
);
8219 quals2
= cp_type_quals (*t2
);
8221 if (TYPE_PTRMEM_P (*t1
))
8222 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
8224 *t1
= TREE_TYPE (*t1
);
8225 if (TYPE_PTRMEM_P (*t2
))
8226 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
8228 *t2
= TREE_TYPE (*t2
);
8230 casts_away_constness_r (t1
, t2
);
8231 *t1
= build_pointer_type (*t1
);
8232 *t2
= build_pointer_type (*t2
);
8233 *t1
= cp_build_qualified_type (*t1
, quals1
);
8234 *t2
= cp_build_qualified_type (*t2
, quals2
);
8237 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8240 ??? This function returns non-zero if casting away qualifiers not
8241 just const. We would like to return to the caller exactly which
8242 qualifiers are casted away to give more accurate diagnostics.
8246 casts_away_constness (tree t1
, tree t2
)
8248 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
8250 /* [expr.const.cast]
8252 Casting from an lvalue of type T1 to an lvalue of type T2
8253 using a reference cast casts away constness if a cast from an
8254 rvalue of type "pointer to T1" to the type "pointer to T2"
8255 casts away constness. */
8256 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
8257 return casts_away_constness (build_pointer_type (t1
),
8258 build_pointer_type (TREE_TYPE (t2
)));
8261 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
8262 /* [expr.const.cast]
8264 Casting from an rvalue of type "pointer to data member of X
8265 of type T1" to the type "pointer to data member of Y of type
8266 T2" casts away constness if a cast from an rvalue of type
8267 "pointer to T1" to the type "pointer to T2" casts away
8269 return casts_away_constness
8270 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
8271 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
8273 /* Casting away constness is only something that makes sense for
8274 pointer or reference types. */
8275 if (TREE_CODE (t1
) != POINTER_TYPE
8276 || TREE_CODE (t2
) != POINTER_TYPE
)
8279 /* Top-level qualifiers don't matter. */
8280 t1
= TYPE_MAIN_VARIANT (t1
);
8281 t2
= TYPE_MAIN_VARIANT (t2
);
8282 casts_away_constness_r (&t1
, &t2
);
8283 if (!can_convert (t2
, t1
))
8289 /* If T is a REFERENCE_TYPE return the type to which T refers.
8290 Otherwise, return T itself. */
8293 non_reference (tree t
)
8295 if (TREE_CODE (t
) == REFERENCE_TYPE
)
8301 /* Return nonzero if REF is an lvalue valid for this language;
8302 otherwise, print an error message and return zero. USE says
8303 how the lvalue is being used and so selects the error message. */
8306 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
8308 cp_lvalue_kind kind
= lvalue_kind (ref
);
8310 if (kind
== clk_none
)
8312 if (complain
& tf_error
)
8316 else if (kind
& (clk_rvalueref
|clk_class
))
8318 if (!(complain
& tf_error
))
8320 if (kind
& clk_class
)
8321 /* Make this a permerror because we used to accept it. */
8322 permerror (input_location
, "using temporary as lvalue");
8324 error ("using xvalue (rvalue reference) as lvalue");