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 build_zero_cst (TREE_TYPE (pfn0
)),
4052 tree e2
= cp_build_binary_op (location
,
4057 e2
= cp_build_binary_op (location
,
4058 EQ_EXPR
, e2
, integer_zero_node
,
4060 op0
= cp_build_binary_op (location
,
4061 TRUTH_ANDIF_EXPR
, e1
, e2
,
4063 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
4067 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4068 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
4070 result_type
= TREE_TYPE (op0
);
4072 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4073 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4074 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4077 /* E will be the final comparison. */
4079 /* E1 and E2 are for scratch. */
4087 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4088 CPO_COMPARISON
, complain
);
4090 if (!same_type_p (TREE_TYPE (op0
), type
))
4091 op0
= cp_convert_and_check (type
, op0
);
4092 if (!same_type_p (TREE_TYPE (op1
), type
))
4093 op1
= cp_convert_and_check (type
, op1
);
4095 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4096 return error_mark_node
;
4098 if (TREE_SIDE_EFFECTS (op0
))
4099 op0
= save_expr (op0
);
4100 if (TREE_SIDE_EFFECTS (op1
))
4101 op1
= save_expr (op1
);
4103 pfn0
= pfn_from_ptrmemfunc (op0
);
4104 pfn1
= pfn_from_ptrmemfunc (op1
);
4105 delta0
= delta_from_ptrmemfunc (op0
);
4106 delta1
= delta_from_ptrmemfunc (op1
);
4107 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4108 == ptrmemfunc_vbit_in_delta
)
4113 && ((op0.delta == op1.delta)
4114 || (!op0.pfn && op0.delta & 1 == 0
4115 && op1.delta & 1 == 0))
4117 The reason for the `!op0.pfn' bit is that a NULL
4118 pointer-to-member is any member with a zero PFN and
4119 LSB of the DELTA field is 0. */
4121 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4125 e1
= cp_build_binary_op (location
,
4126 EQ_EXPR
, e1
, integer_zero_node
,
4128 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4132 e2
= cp_build_binary_op (location
,
4133 EQ_EXPR
, e2
, integer_zero_node
,
4135 e1
= cp_build_binary_op (location
,
4136 TRUTH_ANDIF_EXPR
, e2
, e1
,
4138 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4140 build_zero_cst (TREE_TYPE (pfn0
)),
4142 e2
= cp_build_binary_op (location
,
4143 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4144 e1
= cp_build_binary_op (location
,
4145 EQ_EXPR
, delta0
, delta1
, complain
);
4146 e1
= cp_build_binary_op (location
,
4147 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4154 && (!op0.pfn || op0.delta == op1.delta))
4156 The reason for the `!op0.pfn' bit is that a NULL
4157 pointer-to-member is any member with a zero PFN; the
4158 DELTA field is unspecified. */
4160 e1
= cp_build_binary_op (location
,
4161 EQ_EXPR
, delta0
, delta1
, complain
);
4162 e2
= cp_build_binary_op (location
,
4165 build_zero_cst (TREE_TYPE (pfn0
)),
4167 e1
= cp_build_binary_op (location
,
4168 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4170 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4171 e
= cp_build_binary_op (location
,
4172 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4173 if (code
== EQ_EXPR
)
4175 return cp_build_binary_op (location
,
4176 EQ_EXPR
, e
, integer_zero_node
, complain
);
4180 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4181 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4183 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4184 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4192 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4193 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4195 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4196 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4197 CPO_COMPARISON
, complain
);
4204 if (TREE_CODE (orig_op0
) == STRING_CST
4205 || TREE_CODE (orig_op1
) == STRING_CST
)
4207 if (complain
& tf_warning
)
4208 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4211 build_type
= boolean_type_node
;
4212 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4213 || code0
== ENUMERAL_TYPE
)
4214 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4215 || code1
== ENUMERAL_TYPE
))
4217 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4218 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4219 CPO_COMPARISON
, complain
);
4220 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4221 result_type
= type0
;
4222 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4223 result_type
= type1
;
4224 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4225 /* One of the operands must be of nullptr_t type. */
4226 result_type
= TREE_TYPE (nullptr_node
);
4227 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4229 result_type
= type0
;
4230 if (complain
& tf_error
)
4231 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4233 return error_mark_node
;
4235 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4237 result_type
= type1
;
4238 if (complain
& tf_error
)
4239 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4241 return error_mark_node
;
4245 case UNORDERED_EXPR
:
4252 build_type
= integer_type_node
;
4253 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4255 if (complain
& tf_error
)
4256 error ("unordered comparison on non-floating point argument");
4257 return error_mark_node
;
4266 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4267 || code0
== ENUMERAL_TYPE
)
4268 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4269 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4270 arithmetic_types_p
= 1;
4273 arithmetic_types_p
= 0;
4274 /* Vector arithmetic is only allowed when both sides are vectors. */
4275 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4277 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4278 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4281 binary_op_error (location
, code
, type0
, type1
);
4282 return error_mark_node
;
4284 arithmetic_types_p
= 1;
4287 /* Determine the RESULT_TYPE, if it is not already known. */
4289 && arithmetic_types_p
4290 && (shorten
|| common
|| short_compare
))
4292 result_type
= cp_common_type (type0
, type1
);
4293 do_warn_double_promotion (result_type
, type0
, type1
,
4294 "implicit conversion from %qT to %qT "
4295 "to match other operand of binary "
4302 if (complain
& tf_error
)
4303 error ("invalid operands of types %qT and %qT to binary %qO",
4304 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4305 return error_mark_node
;
4308 /* If we're in a template, the only thing we need to know is the
4310 if (processing_template_decl
)
4312 /* Since the middle-end checks the type when doing a build2, we
4313 need to build the tree in pieces. This built tree will never
4314 get out of the front-end as we replace it when instantiating
4316 tree tmp
= build2 (resultcode
,
4317 build_type
? build_type
: result_type
,
4319 TREE_OPERAND (tmp
, 0) = op0
;
4323 if (arithmetic_types_p
)
4325 bool first_complex
= (code0
== COMPLEX_TYPE
);
4326 bool second_complex
= (code1
== COMPLEX_TYPE
);
4327 int none_complex
= (!first_complex
&& !second_complex
);
4329 /* Adapted from patch for c/24581. */
4330 if (first_complex
!= second_complex
4331 && (code
== PLUS_EXPR
4332 || code
== MINUS_EXPR
4333 || code
== MULT_EXPR
4334 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4335 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4336 && flag_signed_zeros
)
4338 /* An operation on mixed real/complex operands must be
4339 handled specially, but the language-independent code can
4340 more easily optimize the plain complex arithmetic if
4341 -fno-signed-zeros. */
4342 tree real_type
= TREE_TYPE (result_type
);
4346 if (TREE_TYPE (op0
) != result_type
)
4347 op0
= cp_convert_and_check (result_type
, op0
);
4348 if (TREE_TYPE (op1
) != real_type
)
4349 op1
= cp_convert_and_check (real_type
, op1
);
4353 if (TREE_TYPE (op0
) != real_type
)
4354 op0
= cp_convert_and_check (real_type
, op0
);
4355 if (TREE_TYPE (op1
) != result_type
)
4356 op1
= cp_convert_and_check (result_type
, op1
);
4358 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4359 return error_mark_node
;
4362 op0
= save_expr (op0
);
4363 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4364 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4368 case TRUNC_DIV_EXPR
:
4369 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4373 real
= build2 (resultcode
, real_type
, real
, op1
);
4381 op1
= save_expr (op1
);
4382 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4383 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4387 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4390 real
= build2 (resultcode
, real_type
, op0
, real
);
4393 real
= build2 (resultcode
, real_type
, op0
, real
);
4394 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4400 return build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4403 /* For certain operations (which identify themselves by shorten != 0)
4404 if both args were extended from the same smaller type,
4405 do the arithmetic in that type and then extend.
4407 shorten !=0 and !=1 indicates a bitwise operation.
4408 For them, this optimization is safe only if
4409 both args are zero-extended or both are sign-extended.
4410 Otherwise, we might change the result.
4411 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4412 but calculated in (unsigned short) it would be (unsigned short)-1. */
4414 if (shorten
&& none_complex
)
4416 final_type
= result_type
;
4417 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4421 /* Comparison operations are shortened too but differently.
4422 They identify themselves by setting short_compare = 1. */
4426 /* Don't write &op0, etc., because that would prevent op0
4427 from being kept in a register.
4428 Instead, make copies of the our local variables and
4429 pass the copies by reference, then copy them back afterward. */
4430 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4431 enum tree_code xresultcode
= resultcode
;
4433 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4435 return cp_convert (boolean_type_node
, val
);
4436 op0
= xop0
, op1
= xop1
;
4438 resultcode
= xresultcode
;
4441 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4442 && warn_sign_compare
4443 && !TREE_NO_WARNING (orig_op0
)
4444 && !TREE_NO_WARNING (orig_op1
)
4445 /* Do not warn until the template is instantiated; we cannot
4446 bound the ranges of the arguments until that point. */
4447 && !processing_template_decl
4448 && (complain
& tf_warning
)
4449 && c_inhibit_evaluation_warnings
== 0)
4451 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4452 result_type
, resultcode
);
4456 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4457 Then the expression will be built.
4458 It will be given type FINAL_TYPE if that is nonzero;
4459 otherwise, it will be given type RESULT_TYPE. */
4462 if (TREE_TYPE (op0
) != result_type
)
4463 op0
= cp_convert_and_check (result_type
, op0
);
4464 if (TREE_TYPE (op1
) != result_type
)
4465 op1
= cp_convert_and_check (result_type
, op1
);
4467 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4468 return error_mark_node
;
4471 if (build_type
== NULL_TREE
)
4472 build_type
= result_type
;
4474 result
= build2 (resultcode
, build_type
, op0
, op1
);
4475 result
= fold_if_not_in_template (result
);
4476 if (final_type
!= 0)
4477 result
= cp_convert (final_type
, result
);
4479 if (TREE_OVERFLOW_P (result
)
4480 && !TREE_OVERFLOW_P (op0
)
4481 && !TREE_OVERFLOW_P (op1
))
4482 overflow_warning (location
, result
);
4487 /* Return a tree for the sum or difference (RESULTCODE says which)
4488 of pointer PTROP and integer INTOP. */
4491 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4493 tree res_type
= TREE_TYPE (ptrop
);
4495 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4496 in certain circumstance (when it's valid to do so). So we need
4497 to make sure it's complete. We don't need to check here, if we
4498 can actually complete it at all, as those checks will be done in
4499 pointer_int_sum() anyway. */
4500 complete_type (TREE_TYPE (res_type
));
4502 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4503 fold_if_not_in_template (intop
));
4506 /* Return a tree for the difference of pointers OP0 and OP1.
4507 The resulting tree has type int. */
4510 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4513 tree restype
= ptrdiff_type_node
;
4514 tree target_type
= TREE_TYPE (ptrtype
);
4516 if (!complete_type_or_else (target_type
, NULL_TREE
))
4517 return error_mark_node
;
4519 if (TREE_CODE (target_type
) == VOID_TYPE
)
4520 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4521 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4522 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4523 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4524 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4526 /* First do the subtraction as integers;
4527 then drop through to build the divide operator. */
4529 op0
= cp_build_binary_op (input_location
,
4531 cp_convert (restype
, op0
),
4532 cp_convert (restype
, op1
),
4533 tf_warning_or_error
);
4535 /* This generates an error if op1 is a pointer to an incomplete type. */
4536 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4537 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4539 op1
= (TYPE_PTROB_P (ptrtype
)
4540 ? size_in_bytes (target_type
)
4541 : integer_one_node
);
4543 /* Do the division. */
4545 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4546 return fold_if_not_in_template (result
);
4549 /* Construct and perhaps optimize a tree representation
4550 for a unary operation. CODE, a tree_code, specifies the operation
4551 and XARG is the operand. */
4554 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4556 tree orig_expr
= xarg
;
4560 if (processing_template_decl
)
4562 if (type_dependent_expression_p (xarg
))
4563 return build_min_nt (code
, xarg
, NULL_TREE
);
4565 xarg
= build_non_dependent_expr (xarg
);
4570 /* [expr.unary.op] says:
4572 The address of an object of incomplete type can be taken.
4574 (And is just the ordinary address operator, not an overloaded
4575 "operator &".) However, if the type is a template
4576 specialization, we must complete the type at this point so that
4577 an overloaded "operator &" will be available if required. */
4578 if (code
== ADDR_EXPR
4579 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4580 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4581 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4582 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4583 /* Don't look for a function. */;
4585 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4586 /*overloaded_p=*/NULL
, complain
);
4587 if (!exp
&& code
== ADDR_EXPR
)
4589 if (is_overloaded_fn (xarg
))
4591 tree fn
= get_first_fn (xarg
);
4592 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4594 error (DECL_CONSTRUCTOR_P (fn
)
4595 ? G_("taking address of constructor %qE")
4596 : G_("taking address of destructor %qE"),
4598 return error_mark_node
;
4602 /* A pointer to member-function can be formed only by saying
4604 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4605 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4607 if (TREE_CODE (xarg
) != OFFSET_REF
4608 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4610 error ("invalid use of %qE to form a pointer-to-member-function",
4612 if (TREE_CODE (xarg
) != OFFSET_REF
)
4613 inform (input_location
, " a qualified-id is required");
4614 return error_mark_node
;
4618 error ("parentheses around %qE cannot be used to form a"
4619 " pointer-to-member-function",
4621 PTRMEM_OK_P (xarg
) = 1;
4625 if (TREE_CODE (xarg
) == OFFSET_REF
)
4627 ptrmem
= PTRMEM_OK_P (xarg
);
4629 if (!ptrmem
&& !flag_ms_extensions
4630 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4632 /* A single non-static member, make sure we don't allow a
4633 pointer-to-member. */
4634 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4635 TREE_OPERAND (xarg
, 0),
4636 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4637 PTRMEM_OK_P (xarg
) = ptrmem
;
4641 exp
= cp_build_addr_expr_strict (xarg
, complain
);
4644 if (processing_template_decl
&& exp
!= error_mark_node
)
4645 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4646 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4647 if (TREE_CODE (exp
) == ADDR_EXPR
)
4648 PTRMEM_OK_P (exp
) = ptrmem
;
4652 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4653 constants, where a null value is represented by an INTEGER_CST of
4657 cp_truthvalue_conversion (tree expr
)
4659 tree type
= TREE_TYPE (expr
);
4660 if (TYPE_PTRMEM_P (type
))
4661 return build_binary_op (EXPR_LOCATION (expr
),
4662 NE_EXPR
, expr
, integer_zero_node
, 1);
4664 return c_common_truthvalue_conversion (input_location
, expr
);
4667 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4670 condition_conversion (tree expr
)
4673 if (processing_template_decl
)
4675 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4676 tf_warning_or_error
, LOOKUP_NORMAL
);
4677 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4681 /* Returns the address of T. This function will fold away
4682 ADDR_EXPR of INDIRECT_REF. */
4685 build_address (tree t
)
4687 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4688 return error_mark_node
;
4689 t
= build_fold_addr_expr (t
);
4690 if (TREE_CODE (t
) != ADDR_EXPR
)
4695 /* Returns the address of T with type TYPE. */
4698 build_typed_address (tree t
, tree type
)
4700 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4701 return error_mark_node
;
4702 t
= build_fold_addr_expr_with_type (t
, type
);
4703 if (TREE_CODE (t
) != ADDR_EXPR
)
4708 /* Return a NOP_EXPR converting EXPR to TYPE. */
4711 build_nop (tree type
, tree expr
)
4713 if (type
== error_mark_node
|| error_operand_p (expr
))
4715 return build1 (NOP_EXPR
, type
, expr
);
4718 /* Take the address of ARG, whatever that means under C++ semantics.
4719 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
4720 and class rvalues as well.
4722 Nothing should call this function directly; instead, callers should use
4723 cp_build_addr_expr or cp_build_addr_expr_strict. */
4726 cp_build_addr_expr_1 (tree arg
, bool strict_lvalue
, tsubst_flags_t complain
)
4731 if (!arg
|| error_operand_p (arg
))
4732 return error_mark_node
;
4734 arg
= mark_lvalue_use (arg
);
4735 argtype
= lvalue_type (arg
);
4737 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
4738 || !IDENTIFIER_OPNAME_P (arg
));
4740 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
4741 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
4743 /* They're trying to take the address of a unique non-static
4744 member function. This is ill-formed (except in MS-land),
4745 but let's try to DTRT.
4746 Note: We only handle unique functions here because we don't
4747 want to complain if there's a static overload; non-unique
4748 cases will be handled by instantiate_type. But we need to
4749 handle this case here to allow casts on the resulting PMF.
4750 We could defer this in non-MS mode, but it's easier to give
4751 a useful error here. */
4753 /* Inside constant member functions, the `this' pointer
4754 contains an extra const qualifier. TYPE_MAIN_VARIANT
4755 is used here to remove this const from the diagnostics
4756 and the created OFFSET_REF. */
4757 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
4758 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
4761 if (! flag_ms_extensions
)
4763 tree name
= DECL_NAME (fn
);
4764 if (!(complain
& tf_error
))
4765 return error_mark_node
;
4766 else if (current_class_type
4767 && TREE_OPERAND (arg
, 0) == current_class_ref
)
4768 /* An expression like &memfn. */
4769 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
4770 " or parenthesized non-static member function to form"
4771 " a pointer to member function. Say %<&%T::%D%>",
4774 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
4775 " function to form a pointer to member function."
4779 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
4782 /* Uninstantiated types are all functions. Taking the
4783 address of a function is a no-op, so just return the
4785 if (type_unknown_p (arg
))
4786 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4788 if (TREE_CODE (arg
) == OFFSET_REF
)
4789 /* We want a pointer to member; bypass all the code for actually taking
4790 the address of something. */
4793 /* Anything not already handled and not a true memory reference
4795 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4796 && TREE_CODE (argtype
) != METHOD_TYPE
)
4798 cp_lvalue_kind kind
= lvalue_kind (arg
);
4799 if (kind
== clk_none
)
4801 if (complain
& tf_error
)
4802 lvalue_error (lv_addressof
);
4803 return error_mark_node
;
4805 if (strict_lvalue
&& (kind
& (clk_rvalueref
|clk_class
)))
4807 if (!(complain
& tf_error
))
4808 return error_mark_node
;
4809 if (kind
& clk_class
)
4810 /* Make this a permerror because we used to accept it. */
4811 permerror (input_location
, "taking address of temporary");
4813 error ("taking address of xvalue (rvalue reference)");
4817 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4819 tree type
= build_pointer_type (TREE_TYPE (argtype
));
4820 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4823 else if (pedantic
&& DECL_MAIN_P (arg
))
4826 /* Apparently a lot of autoconf scripts for C++ packages do this,
4827 so only complain if -pedantic. */
4828 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
4829 pedwarn (input_location
, OPT_pedantic
,
4830 "ISO C++ forbids taking address of function %<::main%>");
4831 else if (flag_pedantic_errors
)
4832 return error_mark_node
;
4835 /* Let &* cancel out to simplify resulting code. */
4836 if (TREE_CODE (arg
) == INDIRECT_REF
)
4838 /* We don't need to have `current_class_ptr' wrapped in a
4839 NON_LVALUE_EXPR node. */
4840 if (arg
== current_class_ref
)
4841 return current_class_ptr
;
4843 arg
= TREE_OPERAND (arg
, 0);
4844 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
4846 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
4847 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4850 /* Don't let this be an lvalue. */
4855 /* ??? Cope with user tricks that amount to offsetof. */
4856 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4857 && TREE_CODE (argtype
) != METHOD_TYPE
4858 && argtype
!= unknown_type_node
4859 && (val
= get_base_address (arg
))
4860 && COMPLETE_TYPE_P (TREE_TYPE (val
))
4861 && TREE_CODE (val
) == INDIRECT_REF
4862 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
4864 tree type
= build_pointer_type (argtype
);
4865 tree op0
= fold_convert (type
, TREE_OPERAND (val
, 0));
4866 tree op1
= fold_convert (sizetype
, fold_offsetof (arg
, val
));
4867 return fold_build2 (POINTER_PLUS_EXPR
, type
, op0
, op1
);
4870 /* Handle complex lvalues (when permitted)
4871 by reduction to simpler cases. */
4872 val
= unary_complex_lvalue (ADDR_EXPR
, arg
);
4876 switch (TREE_CODE (arg
))
4880 case FIX_TRUNC_EXPR
:
4881 /* Even if we're not being pedantic, we cannot allow this
4882 extension when we're instantiating in a SFINAE
4884 if (! lvalue_p (arg
) && complain
== tf_none
)
4886 if (complain
& tf_error
)
4887 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4889 return error_mark_node
;
4894 arg
= BASELINK_FUNCTIONS (arg
);
4898 arg
= OVL_CURRENT (arg
);
4903 /* Turn a reference to a non-static data member into a
4904 pointer-to-member. */
4909 gcc_assert (PTRMEM_OK_P (arg
));
4911 t
= TREE_OPERAND (arg
, 1);
4912 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
4914 if (complain
& tf_error
)
4915 error ("cannot create pointer to reference member %qD", t
);
4916 return error_mark_node
;
4919 type
= build_ptrmem_type (context_for_name_lookup (t
),
4921 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
4929 if (argtype
!= error_mark_node
)
4930 argtype
= build_pointer_type (argtype
);
4932 /* In a template, we are processing a non-dependent expression
4933 so we can just form an ADDR_EXPR with the correct type. */
4934 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
4936 val
= build_address (arg
);
4937 if (TREE_CODE (arg
) == OFFSET_REF
)
4938 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
4940 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
4942 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
4944 /* We can only get here with a single static member
4946 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4947 && DECL_STATIC_FUNCTION_P (fn
));
4949 val
= build_address (fn
);
4950 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
4951 /* Do not lose object's side effects. */
4952 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
4953 TREE_OPERAND (arg
, 0), val
);
4955 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
4957 if (complain
& tf_error
)
4958 error ("attempt to take address of bit-field structure member %qD",
4959 TREE_OPERAND (arg
, 1));
4960 return error_mark_node
;
4964 tree object
= TREE_OPERAND (arg
, 0);
4965 tree field
= TREE_OPERAND (arg
, 1);
4966 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4967 (TREE_TYPE (object
), decl_type_context (field
)));
4968 val
= build_address (arg
);
4971 if (TREE_CODE (argtype
) == POINTER_TYPE
4972 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
4974 build_ptrmemfunc_type (argtype
);
4975 val
= build_ptrmemfunc (argtype
, val
, 0,
4977 tf_warning_or_error
);
4983 /* Take the address of ARG if it has one, even if it's an rvalue. */
4986 cp_build_addr_expr (tree arg
, tsubst_flags_t complain
)
4988 return cp_build_addr_expr_1 (arg
, 0, complain
);
4991 /* Take the address of ARG, but only if it's an lvalue. */
4994 cp_build_addr_expr_strict (tree arg
, tsubst_flags_t complain
)
4996 return cp_build_addr_expr_1 (arg
, 1, complain
);
4999 /* C++: Must handle pointers to members.
5001 Perhaps type instantiation should be extended to handle conversion
5002 from aggregates to types we don't yet know we want? (Or are those
5003 cases typically errors which should be reported?)
5005 NOCONVERT nonzero suppresses the default promotions
5006 (such as from short to int). */
5009 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
5010 tsubst_flags_t complain
)
5012 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
5015 const char *errstring
= NULL
;
5017 const char *invalid_op_diag
;
5019 if (!arg
|| error_operand_p (arg
))
5020 return error_mark_node
;
5022 if ((invalid_op_diag
5023 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
5028 error (invalid_op_diag
);
5029 return error_mark_node
;
5034 case UNARY_PLUS_EXPR
:
5037 int flags
= WANT_ARITH
| WANT_ENUM
;
5038 /* Unary plus (but not unary minus) is allowed on pointers. */
5039 if (code
== UNARY_PLUS_EXPR
)
5040 flags
|= WANT_POINTER
;
5041 arg
= build_expr_type_conversion (flags
, arg
, true);
5043 errstring
= (code
== NEGATE_EXPR
5044 ? _("wrong type argument to unary minus")
5045 : _("wrong type argument to unary plus"));
5048 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5049 arg
= perform_integral_promotions (arg
);
5051 /* Make sure the result is not an lvalue: a unary plus or minus
5052 expression is always a rvalue. */
5059 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5063 arg
= default_conversion (arg
);
5065 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
5066 | WANT_VECTOR_OR_COMPLEX
,
5068 errstring
= _("wrong type argument to bit-complement");
5069 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5070 arg
= perform_integral_promotions (arg
);
5074 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5075 errstring
= _("wrong type argument to abs");
5076 else if (!noconvert
)
5077 arg
= default_conversion (arg
);
5081 /* Conjugating a real value is a no-op, but allow it anyway. */
5082 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5083 errstring
= _("wrong type argument to conjugation");
5084 else if (!noconvert
)
5085 arg
= default_conversion (arg
);
5088 case TRUTH_NOT_EXPR
:
5089 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
5091 val
= invert_truthvalue_loc (input_location
, arg
);
5092 if (arg
!= error_mark_node
)
5094 errstring
= _("in argument to unary !");
5101 if (TREE_CODE (arg
) == COMPLEX_CST
)
5102 return TREE_REALPART (arg
);
5103 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5105 arg
= build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
5106 return fold_if_not_in_template (arg
);
5112 if (TREE_CODE (arg
) == COMPLEX_CST
)
5113 return TREE_IMAGPART (arg
);
5114 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5116 arg
= build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
5117 return fold_if_not_in_template (arg
);
5120 return cp_convert (TREE_TYPE (arg
), integer_zero_node
);
5122 case PREINCREMENT_EXPR
:
5123 case POSTINCREMENT_EXPR
:
5124 case PREDECREMENT_EXPR
:
5125 case POSTDECREMENT_EXPR
:
5126 /* Handle complex lvalues (when permitted)
5127 by reduction to simpler cases. */
5129 val
= unary_complex_lvalue (code
, arg
);
5133 arg
= mark_lvalue_use (arg
);
5135 /* Increment or decrement the real part of the value,
5136 and don't change the imaginary part. */
5137 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5141 arg
= stabilize_reference (arg
);
5142 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
5143 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
5144 real
= cp_build_unary_op (code
, real
, 1, complain
);
5145 if (real
== error_mark_node
|| imag
== error_mark_node
)
5146 return error_mark_node
;
5147 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
5151 /* Report invalid types. */
5153 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
5156 if (code
== PREINCREMENT_EXPR
)
5157 errstring
= _("no pre-increment operator for type");
5158 else if (code
== POSTINCREMENT_EXPR
)
5159 errstring
= _("no post-increment operator for type");
5160 else if (code
== PREDECREMENT_EXPR
)
5161 errstring
= _("no pre-decrement operator for type");
5163 errstring
= _("no post-decrement operator for type");
5166 else if (arg
== error_mark_node
)
5167 return error_mark_node
;
5169 /* Report something read-only. */
5171 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
5172 || TREE_READONLY (arg
))
5174 if (complain
& tf_error
)
5175 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
5176 || code
== POSTINCREMENT_EXPR
)
5177 ? REK_INCREMENT
: REK_DECREMENT
));
5179 return error_mark_node
;
5184 tree declared_type
= unlowered_expr_type (arg
);
5186 argtype
= TREE_TYPE (arg
);
5188 /* ARM $5.2.5 last annotation says this should be forbidden. */
5189 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
5191 if (complain
& tf_error
)
5192 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
5193 ? G_("ISO C++ forbids incrementing an enum")
5194 : G_("ISO C++ forbids decrementing an enum"));
5196 return error_mark_node
;
5199 /* Compute the increment. */
5201 if (TREE_CODE (argtype
) == POINTER_TYPE
)
5203 tree type
= complete_type (TREE_TYPE (argtype
));
5205 if (!COMPLETE_OR_VOID_TYPE_P (type
))
5207 if (complain
& tf_error
)
5208 error (((code
== PREINCREMENT_EXPR
5209 || code
== POSTINCREMENT_EXPR
))
5210 ? G_("cannot increment a pointer to incomplete type %qT")
5211 : G_("cannot decrement a pointer to incomplete type %qT"),
5212 TREE_TYPE (argtype
));
5214 return error_mark_node
;
5216 else if ((pedantic
|| warn_pointer_arith
)
5217 && !TYPE_PTROB_P (argtype
))
5219 if (complain
& tf_error
)
5220 permerror (input_location
, (code
== PREINCREMENT_EXPR
5221 || code
== POSTINCREMENT_EXPR
)
5222 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
5223 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
5226 return error_mark_node
;
5229 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
5232 inc
= integer_one_node
;
5234 inc
= cp_convert (argtype
, inc
);
5236 /* Complain about anything else that is not a true lvalue. */
5237 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
5238 || code
== POSTINCREMENT_EXPR
)
5239 ? lv_increment
: lv_decrement
),
5241 return error_mark_node
;
5243 /* Forbid using -- on `bool'. */
5244 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
5246 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
5248 if (complain
& tf_error
)
5249 error ("invalid use of Boolean expression as operand "
5250 "to %<operator--%>");
5251 return error_mark_node
;
5253 val
= boolean_increment (code
, arg
);
5256 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
5258 TREE_SIDE_EFFECTS (val
) = 1;
5263 /* Note that this operation never does default_conversion
5264 regardless of NOCONVERT. */
5265 return cp_build_addr_expr (arg
, complain
);
5274 argtype
= TREE_TYPE (arg
);
5275 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5278 if (complain
& tf_error
)
5279 error ("%s", errstring
);
5280 return error_mark_node
;
5283 /* Hook for the c-common bits that build a unary op. */
5285 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5286 enum tree_code code
, tree xarg
, int noconvert
)
5288 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5291 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5292 for certain kinds of expressions which are not really lvalues
5293 but which we can accept as lvalues.
5295 If ARG is not a kind of expression we can handle, return
5299 unary_complex_lvalue (enum tree_code code
, tree arg
)
5301 /* Inside a template, making these kinds of adjustments is
5302 pointless; we are only concerned with the type of the
5304 if (processing_template_decl
)
5307 /* Handle (a, b) used as an "lvalue". */
5308 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5310 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5311 tf_warning_or_error
);
5312 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5313 TREE_OPERAND (arg
, 0), real_result
);
5316 /* Handle (a ? b : c) used as an "lvalue". */
5317 if (TREE_CODE (arg
) == COND_EXPR
5318 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5319 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5321 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5322 if (TREE_CODE (arg
) == MODIFY_EXPR
5323 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5324 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5326 tree lvalue
= TREE_OPERAND (arg
, 0);
5327 if (TREE_SIDE_EFFECTS (lvalue
))
5329 lvalue
= stabilize_reference (lvalue
);
5330 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5331 lvalue
, TREE_OPERAND (arg
, 1));
5333 return unary_complex_lvalue
5334 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5337 if (code
!= ADDR_EXPR
)
5340 /* Handle (a = b) used as an "lvalue" for `&'. */
5341 if (TREE_CODE (arg
) == MODIFY_EXPR
5342 || TREE_CODE (arg
) == INIT_EXPR
)
5344 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5345 tf_warning_or_error
);
5346 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5348 TREE_NO_WARNING (arg
) = 1;
5352 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5353 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5354 || TREE_CODE (arg
) == OFFSET_REF
)
5357 /* We permit compiler to make function calls returning
5358 objects of aggregate type look like lvalues. */
5362 if (TREE_CODE (targ
) == SAVE_EXPR
)
5363 targ
= TREE_OPERAND (targ
, 0);
5365 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5367 if (TREE_CODE (arg
) == SAVE_EXPR
)
5370 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
5371 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5374 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5375 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5376 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5379 /* Don't let anything else be handled specially. */
5383 /* Mark EXP saying that we need to be able to take the
5384 address of it; it should not be allocated in a register.
5385 Value is true if successful.
5387 C++: we do not allow `current_class_ptr' to be addressable. */
5390 cxx_mark_addressable (tree exp
)
5395 switch (TREE_CODE (x
))
5402 x
= TREE_OPERAND (x
, 0);
5406 if (x
== current_class_ptr
)
5408 error ("cannot take the address of %<this%>, which is an rvalue expression");
5409 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5415 /* Caller should not be trying to mark initialized
5416 constant fields addressable. */
5417 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5418 || DECL_IN_AGGR_P (x
) == 0
5420 || DECL_EXTERNAL (x
));
5425 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5426 && !DECL_ARTIFICIAL (x
))
5428 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5431 ("address of explicit register variable %qD requested", x
);
5434 else if (extra_warnings
)
5436 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5438 TREE_ADDRESSABLE (x
) = 1;
5442 TREE_ADDRESSABLE (x
) = 1;
5446 TREE_ADDRESSABLE (x
) = 1;
5450 TREE_ADDRESSABLE (x
) = 1;
5451 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5459 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5462 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5463 tsubst_flags_t complain
)
5465 tree orig_ifexp
= ifexp
;
5466 tree orig_op1
= op1
;
5467 tree orig_op2
= op2
;
5470 if (processing_template_decl
)
5472 /* The standard says that the expression is type-dependent if
5473 IFEXP is type-dependent, even though the eventual type of the
5474 expression doesn't dependent on IFEXP. */
5475 if (type_dependent_expression_p (ifexp
)
5476 /* As a GNU extension, the middle operand may be omitted. */
5477 || (op1
&& type_dependent_expression_p (op1
))
5478 || type_dependent_expression_p (op2
))
5479 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5480 ifexp
= build_non_dependent_expr (ifexp
);
5482 op1
= build_non_dependent_expr (op1
);
5483 op2
= build_non_dependent_expr (op2
);
5486 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5487 if (processing_template_decl
&& expr
!= error_mark_node
)
5488 return build_min_non_dep (COND_EXPR
, expr
,
5489 orig_ifexp
, orig_op1
, orig_op2
);
5493 /* Given a list of expressions, return a compound expression
5494 that performs them all and returns the value of the last of them. */
5497 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
,
5498 tsubst_flags_t complain
)
5500 tree expr
= TREE_VALUE (list
);
5502 if (TREE_CHAIN (list
))
5504 if (complain
& tf_error
)
5508 permerror (input_location
, "expression list treated as compound "
5509 "expression in initializer");
5512 permerror (input_location
, "expression list treated as compound "
5513 "expression in mem-initializer");
5516 permerror (input_location
, "expression list treated as compound "
5517 "expression in functional cast");
5523 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5524 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5531 /* Like build_x_compound_expr_from_list, but using a VEC. */
5534 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5536 if (VEC_empty (tree
, vec
))
5538 else if (VEC_length (tree
, vec
) == 1)
5539 return VEC_index (tree
, vec
, 0);
5547 permerror (input_location
,
5548 "%s expression list treated as compound expression",
5551 expr
= VEC_index (tree
, vec
, 0);
5552 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5553 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5559 /* Handle overloading of the ',' operator when needed. */
5562 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5565 tree orig_op1
= op1
;
5566 tree orig_op2
= op2
;
5568 if (processing_template_decl
)
5570 if (type_dependent_expression_p (op1
)
5571 || type_dependent_expression_p (op2
))
5572 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5573 op1
= build_non_dependent_expr (op1
);
5574 op2
= build_non_dependent_expr (op2
);
5577 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5578 /*overloaded_p=*/NULL
, complain
);
5580 result
= cp_build_compound_expr (op1
, op2
, complain
);
5582 if (processing_template_decl
&& result
!= error_mark_node
)
5583 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5588 /* Like cp_build_compound_expr, but for the c-common bits. */
5591 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5593 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5596 /* Build a compound expression. */
5599 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5601 lhs
= convert_to_void (lhs
, ICV_LEFT_OF_COMMA
, complain
);
5603 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5604 return error_mark_node
;
5606 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5608 /* If the rhs is a TARGET_EXPR, then build the compound
5609 expression inside the target_expr's initializer. This
5610 helps the compiler to eliminate unnecessary temporaries. */
5611 tree init
= TREE_OPERAND (rhs
, 1);
5613 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5614 TREE_OPERAND (rhs
, 1) = init
;
5619 if (type_unknown_p (rhs
))
5621 error ("no context to resolve type of %qE", rhs
);
5622 return error_mark_node
;
5625 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5628 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5629 casts away constness. CAST gives the type of cast.
5631 ??? This function warns for casting away any qualifier not just
5632 const. We would like to specify exactly what qualifiers are casted
5637 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5638 enum tree_code cast
)
5640 /* C-style casts are allowed to cast away constness. With
5641 WARN_CAST_QUAL, we still want to issue a warning. */
5642 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5645 if (!casts_away_constness (src_type
, dest_type
))
5651 warning (OPT_Wcast_qual
,
5652 "cast from type %qT to type %qT casts away qualifiers",
5653 src_type
, dest_type
);
5656 case STATIC_CAST_EXPR
:
5657 error ("static_cast from type %qT to type %qT casts away qualifiers",
5658 src_type
, dest_type
);
5661 case REINTERPRET_CAST_EXPR
:
5662 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5663 src_type
, dest_type
);
5670 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5671 (another pointer-to-member type in the same hierarchy) and return
5672 the converted expression. If ALLOW_INVERSE_P is permitted, a
5673 pointer-to-derived may be converted to pointer-to-base; otherwise,
5674 only the other direction is permitted. If C_CAST_P is true, this
5675 conversion is taking place as part of a C-style cast. */
5678 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5679 bool c_cast_p
, tsubst_flags_t complain
)
5681 if (TYPE_PTRMEM_P (type
))
5685 if (TREE_CODE (expr
) == PTRMEM_CST
)
5686 expr
= cplus_expand_constant (expr
);
5687 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5688 TYPE_PTRMEM_CLASS_TYPE (type
),
5690 c_cast_p
, complain
);
5691 if (delta
== error_mark_node
)
5692 return error_mark_node
;
5694 if (!integer_zerop (delta
))
5696 tree cond
, op1
, op2
;
5698 cond
= cp_build_binary_op (input_location
,
5701 build_int_cst (TREE_TYPE (expr
), -1),
5702 tf_warning_or_error
);
5703 op1
= build_nop (ptrdiff_type_node
, expr
);
5704 op2
= cp_build_binary_op (input_location
,
5705 PLUS_EXPR
, op1
, delta
,
5706 tf_warning_or_error
);
5708 expr
= fold_build3_loc (input_location
,
5709 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5713 return build_nop (type
, expr
);
5716 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5717 allow_inverse_p
, c_cast_p
, complain
);
5720 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5721 this static_cast is being attempted as one of the possible casts
5722 allowed by a C-style cast. (In that case, accessibility of base
5723 classes is not considered, and it is OK to cast away
5724 constness.) Return the result of the cast. *VALID_P is set to
5725 indicate whether or not the cast was valid. */
5728 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5729 bool *valid_p
, tsubst_flags_t complain
)
5734 /* Assume the cast is valid. */
5737 intype
= TREE_TYPE (expr
);
5739 /* Save casted types in the function's used types hash table. */
5740 used_types_insert (type
);
5742 /* [expr.static.cast]
5744 An lvalue of type "cv1 B", where B is a class type, can be cast
5745 to type "reference to cv2 D", where D is a class derived (clause
5746 _class.derived_) from B, if a valid standard conversion from
5747 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5748 same cv-qualification as, or greater cv-qualification than, cv1,
5749 and B is not a virtual base class of D. */
5750 /* We check this case before checking the validity of "TYPE t =
5751 EXPR;" below because for this case:
5754 struct D : public B { D(const B&); };
5756 void f() { static_cast<const D&>(b); }
5758 we want to avoid constructing a new D. The standard is not
5759 completely clear about this issue, but our interpretation is
5760 consistent with other compilers. */
5761 if (TREE_CODE (type
) == REFERENCE_TYPE
5762 && CLASS_TYPE_P (TREE_TYPE (type
))
5763 && CLASS_TYPE_P (intype
)
5764 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5765 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5766 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5767 build_pointer_type (TYPE_MAIN_VARIANT
5768 (TREE_TYPE (type
))))
5770 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5774 /* There is a standard conversion from "D*" to "B*" even if "B"
5775 is ambiguous or inaccessible. If this is really a
5776 static_cast, then we check both for inaccessibility and
5777 ambiguity. However, if this is a static_cast being performed
5778 because the user wrote a C-style cast, then accessibility is
5780 base
= lookup_base (TREE_TYPE (type
), intype
,
5781 c_cast_p
? ba_unique
: ba_check
,
5784 /* Convert from "B*" to "D*". This function will check that "B"
5785 is not a virtual base of "D". */
5786 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5787 base
, /*nonnull=*/false);
5788 /* Convert the pointer to a reference -- but then remember that
5789 there are no expressions with reference type in C++.
5791 We call rvalue so that there's an actual tree code
5792 (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
5793 is a variable with the same type, the conversion would get folded
5794 away, leaving just the variable and causing lvalue_kind to give
5795 the wrong answer. */
5796 return convert_from_reference (rvalue (cp_fold_convert (type
, expr
)));
5799 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5800 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5801 if (TREE_CODE (type
) == REFERENCE_TYPE
5802 && TYPE_REF_IS_RVALUE (type
)
5803 && real_lvalue_p (expr
)
5804 && reference_related_p (TREE_TYPE (type
), intype
)
5805 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5807 expr
= build_typed_address (expr
, type
);
5808 return convert_from_reference (expr
);
5811 /* Resolve overloaded address here rather than once in
5812 implicit_conversion and again in the inverse code below. */
5813 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5815 expr
= instantiate_type (type
, expr
, complain
);
5816 intype
= TREE_TYPE (expr
);
5819 /* [expr.static.cast]
5821 An expression e can be explicitly converted to a type T using a
5822 static_cast of the form static_cast<T>(e) if the declaration T
5823 t(e);" is well-formed, for some invented temporary variable
5825 result
= perform_direct_initialization_if_possible (type
, expr
,
5826 c_cast_p
, complain
);
5829 result
= convert_from_reference (result
);
5831 /* [expr.static.cast]
5833 If T is a reference type, the result is an lvalue; otherwise,
5834 the result is an rvalue. */
5835 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5836 result
= rvalue (result
);
5840 /* [expr.static.cast]
5842 Any expression can be explicitly converted to type cv void. */
5843 if (TREE_CODE (type
) == VOID_TYPE
)
5844 return convert_to_void (expr
, ICV_CAST
, complain
);
5846 /* [expr.static.cast]
5848 The inverse of any standard conversion sequence (clause _conv_),
5849 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5850 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5851 (_conv.bool_) conversions, can be performed explicitly using
5852 static_cast subject to the restriction that the explicit
5853 conversion does not cast away constness (_expr.const.cast_), and
5854 the following additional rules for specific cases: */
5855 /* For reference, the conversions not excluded are: integral
5856 promotions, floating point promotion, integral conversions,
5857 floating point conversions, floating-integral conversions,
5858 pointer conversions, and pointer to member conversions. */
5861 A value of integral _or enumeration_ type can be explicitly
5862 converted to an enumeration type. */
5863 /* The effect of all that is that any conversion between any two
5864 types which are integral, floating, or enumeration types can be
5866 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5867 || SCALAR_FLOAT_TYPE_P (type
))
5868 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5869 || SCALAR_FLOAT_TYPE_P (intype
)))
5870 return ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5872 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5873 && CLASS_TYPE_P (TREE_TYPE (type
))
5874 && CLASS_TYPE_P (TREE_TYPE (intype
))
5875 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5876 (TREE_TYPE (intype
))),
5877 build_pointer_type (TYPE_MAIN_VARIANT
5878 (TREE_TYPE (type
)))))
5883 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5884 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
5885 c_cast_p
? ba_unique
: ba_check
,
5887 expr
= build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
5888 return cp_fold_convert(type
, expr
);
5891 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5892 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5899 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
5900 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
5902 if (TYPE_PTRMEM_P (type
))
5904 t1
= (build_ptrmem_type
5906 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
5907 t2
= (build_ptrmem_type
5909 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
5916 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
5919 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5920 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
5921 c_cast_p
, tf_warning_or_error
);
5925 /* [expr.static.cast]
5927 An rvalue of type "pointer to cv void" can be explicitly
5928 converted to a pointer to object type. A value of type pointer
5929 to object converted to "pointer to cv void" and back to the
5930 original pointer type will have its original value. */
5931 if (TREE_CODE (intype
) == POINTER_TYPE
5932 && VOID_TYPE_P (TREE_TYPE (intype
))
5933 && TYPE_PTROB_P (type
))
5936 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5937 return build_nop (type
, expr
);
5941 return error_mark_node
;
5944 /* Return an expression representing static_cast<TYPE>(EXPR). */
5947 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5952 if (type
== error_mark_node
|| expr
== error_mark_node
)
5953 return error_mark_node
;
5955 if (processing_template_decl
)
5957 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
5958 /* We don't know if it will or will not have side effects. */
5959 TREE_SIDE_EFFECTS (expr
) = 1;
5960 return convert_from_reference (expr
);
5963 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5964 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5965 if (TREE_CODE (type
) != REFERENCE_TYPE
5966 && TREE_CODE (expr
) == NOP_EXPR
5967 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5968 expr
= TREE_OPERAND (expr
, 0);
5970 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
5975 if (complain
& tf_error
)
5976 error ("invalid static_cast from type %qT to type %qT",
5977 TREE_TYPE (expr
), type
);
5978 return error_mark_node
;
5981 /* EXPR is an expression with member function or pointer-to-member
5982 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5983 not permitted by ISO C++, but we accept it in some modes. If we
5984 are not in one of those modes, issue a diagnostic. Return the
5985 converted expression. */
5988 convert_member_func_to_ptr (tree type
, tree expr
)
5993 intype
= TREE_TYPE (expr
);
5994 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
5995 || TREE_CODE (intype
) == METHOD_TYPE
);
5997 if (pedantic
|| warn_pmf2ptr
)
5998 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
5999 "converting from %qT to %qT", intype
, type
);
6001 if (TREE_CODE (intype
) == METHOD_TYPE
)
6002 expr
= build_addr_func (expr
);
6003 else if (TREE_CODE (expr
) == PTRMEM_CST
)
6004 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
6007 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
6008 decl
= build_address (decl
);
6009 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
6012 return build_nop (type
, expr
);
6015 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
6016 If C_CAST_P is true, this reinterpret cast is being done as part of
6017 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
6018 indicate whether or not reinterpret_cast was valid. */
6021 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6022 bool *valid_p
, tsubst_flags_t complain
)
6026 /* Assume the cast is invalid. */
6030 if (type
== error_mark_node
|| error_operand_p (expr
))
6031 return error_mark_node
;
6033 intype
= TREE_TYPE (expr
);
6035 /* Save casted types in the function's used types hash table. */
6036 used_types_insert (type
);
6038 /* [expr.reinterpret.cast]
6039 An lvalue expression of type T1 can be cast to the type
6040 "reference to T2" if an expression of type "pointer to T1" can be
6041 explicitly converted to the type "pointer to T2" using a
6042 reinterpret_cast. */
6043 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6045 if (! real_lvalue_p (expr
))
6047 if (complain
& tf_error
)
6048 error ("invalid cast of an rvalue expression of type "
6051 return error_mark_node
;
6054 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6055 "B" are related class types; the reinterpret_cast does not
6056 adjust the pointer. */
6057 if (TYPE_PTR_P (intype
)
6058 && (complain
& tf_warning
)
6059 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
6060 COMPARE_BASE
| COMPARE_DERIVED
)))
6061 warning (0, "casting %qT to %qT does not dereference pointer",
6064 expr
= cp_build_addr_expr (expr
, complain
);
6066 if (warn_strict_aliasing
> 2)
6067 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
6069 if (expr
!= error_mark_node
)
6070 expr
= build_reinterpret_cast_1
6071 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
6073 if (expr
!= error_mark_node
)
6074 /* cp_build_indirect_ref isn't right for rvalue refs. */
6075 expr
= convert_from_reference (fold_convert (type
, expr
));
6079 /* As a G++ extension, we consider conversions from member
6080 functions, and pointers to member functions to
6081 pointer-to-function and pointer-to-void types. If
6082 -Wno-pmf-conversions has not been specified,
6083 convert_member_func_to_ptr will issue an error message. */
6084 if ((TYPE_PTRMEMFUNC_P (intype
)
6085 || TREE_CODE (intype
) == METHOD_TYPE
)
6086 && TYPE_PTR_P (type
)
6087 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6088 || VOID_TYPE_P (TREE_TYPE (type
))))
6089 return convert_member_func_to_ptr (type
, expr
);
6091 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6092 array-to-pointer, and function-to-pointer conversions are
6094 expr
= decay_conversion (expr
);
6096 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6097 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6098 if (TREE_CODE (expr
) == NOP_EXPR
6099 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6100 expr
= TREE_OPERAND (expr
, 0);
6102 if (error_operand_p (expr
))
6103 return error_mark_node
;
6105 intype
= TREE_TYPE (expr
);
6107 /* [expr.reinterpret.cast]
6108 A pointer can be converted to any integral type large enough to
6109 hold it. ... A value of type std::nullptr_t can be converted to
6110 an integral type; the conversion has the same meaning and
6111 validity as a conversion of (void*)0 to the integral type. */
6112 if (CP_INTEGRAL_TYPE_P (type
)
6113 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
6115 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
6117 if (complain
& tf_error
)
6118 permerror (input_location
, "cast from %qT to %qT loses precision",
6121 return error_mark_node
;
6123 if (NULLPTR_TYPE_P (intype
))
6124 return build_int_cst (type
, 0);
6126 /* [expr.reinterpret.cast]
6127 A value of integral or enumeration type can be explicitly
6128 converted to a pointer. */
6129 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6132 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6133 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6134 return fold_if_not_in_template (build_nop (type
, expr
));
6135 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6136 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6141 check_for_casting_away_constness (intype
, type
, REINTERPRET_CAST_EXPR
);
6142 /* Warn about possible alignment problems. */
6143 if (STRICT_ALIGNMENT
&& warn_cast_align
6144 && (complain
& tf_warning
)
6145 && !VOID_TYPE_P (type
)
6146 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6147 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6148 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6149 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6150 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6151 "increases required alignment of target type", intype
, type
);
6153 /* We need to strip nops here, because the front end likes to
6154 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6156 if (warn_strict_aliasing
<= 2)
6157 strict_aliasing_warning (intype
, type
, sexpr
);
6159 return fold_if_not_in_template (build_nop (type
, expr
));
6161 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6162 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6164 if (pedantic
&& (complain
& tf_warning
))
6165 /* Only issue a warning, as we have always supported this
6166 where possible, and it is necessary in some cases. DR 195
6167 addresses this issue, but as of 2004/10/26 is still in
6169 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6170 return fold_if_not_in_template (build_nop (type
, expr
));
6172 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6173 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6174 else if (TREE_CODE (intype
) == VECTOR_TYPE
6175 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6176 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6181 if (complain
& tf_error
)
6182 error ("invalid cast from type %qT to type %qT", intype
, type
);
6183 return error_mark_node
;
6186 return cp_convert (type
, expr
);
6190 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6192 if (type
== error_mark_node
|| expr
== error_mark_node
)
6193 return error_mark_node
;
6195 if (processing_template_decl
)
6197 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6199 if (!TREE_SIDE_EFFECTS (t
)
6200 && type_dependent_expression_p (expr
))
6201 /* There might turn out to be side effects inside expr. */
6202 TREE_SIDE_EFFECTS (t
) = 1;
6203 return convert_from_reference (t
);
6206 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6207 /*valid_p=*/NULL
, complain
);
6210 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6211 return an appropriate expression. Otherwise, return
6212 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6213 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6214 performing a C-style cast, its value upon return will indicate
6215 whether or not the conversion succeeded. */
6218 build_const_cast_1 (tree dst_type
, tree expr
, bool complain
,
6222 tree reference_type
;
6224 /* Callers are responsible for handling error_mark_node as a
6225 destination type. */
6226 gcc_assert (dst_type
!= error_mark_node
);
6227 /* In a template, callers should be building syntactic
6228 representations of casts, not using this machinery. */
6229 gcc_assert (!processing_template_decl
);
6231 /* Assume the conversion is invalid. */
6235 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6238 error ("invalid use of const_cast with type %qT, "
6239 "which is not a pointer, "
6240 "reference, nor a pointer-to-data-member type", dst_type
);
6241 return error_mark_node
;
6244 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6247 error ("invalid use of const_cast with type %qT, which is a pointer "
6248 "or reference to a function type", dst_type
);
6249 return error_mark_node
;
6252 /* Save casted types in the function's used types hash table. */
6253 used_types_insert (dst_type
);
6255 src_type
= TREE_TYPE (expr
);
6256 /* Expressions do not really have reference types. */
6257 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6258 src_type
= TREE_TYPE (src_type
);
6260 /* [expr.const.cast]
6262 An lvalue of type T1 can be explicitly converted to an lvalue of
6263 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6264 types) if a pointer to T1 can be explicitly converted to the type
6265 pointer to T2 using a const_cast. */
6266 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6268 reference_type
= dst_type
;
6269 if (! real_lvalue_p (expr
))
6272 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6273 src_type
, dst_type
);
6274 return error_mark_node
;
6276 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6277 src_type
= build_pointer_type (src_type
);
6281 reference_type
= NULL_TREE
;
6282 /* If the destination type is not a reference type, the
6283 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6284 conversions are performed. */
6285 src_type
= type_decays_to (src_type
);
6286 if (src_type
== error_mark_node
)
6287 return error_mark_node
;
6290 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6291 && comp_ptr_ttypes_const (dst_type
, src_type
))
6296 /* This cast is actually a C-style cast. Issue a warning if
6297 the user is making a potentially unsafe cast. */
6298 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
);
6302 expr
= cp_build_addr_expr (expr
,
6303 complain
? tf_warning_or_error
: tf_none
);
6304 expr
= build_nop (reference_type
, expr
);
6305 return convert_from_reference (expr
);
6309 expr
= decay_conversion (expr
);
6310 /* build_c_cast puts on a NOP_EXPR to make the result not an
6311 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6312 non-lvalue context. */
6313 if (TREE_CODE (expr
) == NOP_EXPR
6314 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6315 expr
= TREE_OPERAND (expr
, 0);
6316 return build_nop (dst_type
, expr
);
6321 error ("invalid const_cast from type %qT to type %qT",
6322 src_type
, dst_type
);
6323 return error_mark_node
;
6327 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6329 if (type
== error_mark_node
|| error_operand_p (expr
))
6330 return error_mark_node
;
6332 if (processing_template_decl
)
6334 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6336 if (!TREE_SIDE_EFFECTS (t
)
6337 && type_dependent_expression_p (expr
))
6338 /* There might turn out to be side effects inside expr. */
6339 TREE_SIDE_EFFECTS (t
) = 1;
6340 return convert_from_reference (t
);
6343 return build_const_cast_1 (type
, expr
, complain
& tf_error
,
6347 /* Like cp_build_c_cast, but for the c-common bits. */
6350 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6352 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6355 /* Build an expression representing an explicit C-style cast to type
6356 TYPE of expression EXPR. */
6359 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6365 if (type
== error_mark_node
|| error_operand_p (expr
))
6366 return error_mark_node
;
6368 if (processing_template_decl
)
6370 tree t
= build_min (CAST_EXPR
, type
,
6371 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6372 /* We don't know if it will or will not have side effects. */
6373 TREE_SIDE_EFFECTS (t
) = 1;
6374 return convert_from_reference (t
);
6377 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6378 'Class') should always be retained, because this information aids
6379 in method lookup. */
6380 if (objc_is_object_ptr (type
)
6381 && objc_is_object_ptr (TREE_TYPE (expr
)))
6382 return build_nop (type
, expr
);
6384 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6385 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6386 if (TREE_CODE (type
) != REFERENCE_TYPE
6387 && TREE_CODE (value
) == NOP_EXPR
6388 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6389 value
= TREE_OPERAND (value
, 0);
6391 if (TREE_CODE (type
) == ARRAY_TYPE
)
6393 /* Allow casting from T1* to T2[] because Cfront allows it.
6394 NIHCL uses it. It is not valid ISO C++ however. */
6395 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6397 if (complain
& tf_error
)
6398 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6400 return error_mark_node
;
6401 type
= build_pointer_type (TREE_TYPE (type
));
6405 if (complain
& tf_error
)
6406 error ("ISO C++ forbids casting to an array type %qT", type
);
6407 return error_mark_node
;
6411 if (TREE_CODE (type
) == FUNCTION_TYPE
6412 || TREE_CODE (type
) == METHOD_TYPE
)
6414 if (complain
& tf_error
)
6415 error ("invalid cast to function type %qT", type
);
6416 return error_mark_node
;
6419 if (TREE_CODE (type
) == POINTER_TYPE
6420 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
6421 /* Casting to an integer of smaller size is an error detected elsewhere. */
6422 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
6423 /* Don't warn about converting any constant. */
6424 && !TREE_CONSTANT (value
))
6425 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
6426 "cast to pointer from integer of different size");
6428 /* A C-style cast can be a const_cast. */
6429 result
= build_const_cast_1 (type
, value
, /*complain=*/false,
6434 /* Or a static cast. */
6435 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6436 &valid_p
, complain
);
6437 /* Or a reinterpret_cast. */
6439 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6440 &valid_p
, complain
);
6441 /* The static_cast or reinterpret_cast may be followed by a
6444 /* A valid cast may result in errors if, for example, a
6445 conversion to am ambiguous base class is required. */
6446 && !error_operand_p (result
))
6450 /* Non-class rvalues always have cv-unqualified type. */
6451 if (!CLASS_TYPE_P (type
))
6452 type
= TYPE_MAIN_VARIANT (type
);
6453 result_type
= TREE_TYPE (result
);
6454 if (!CLASS_TYPE_P (result_type
))
6455 result_type
= TYPE_MAIN_VARIANT (result_type
);
6456 /* If the type of RESULT does not match TYPE, perform a
6457 const_cast to make it match. If the static_cast or
6458 reinterpret_cast succeeded, we will differ by at most
6459 cv-qualification, so the follow-on const_cast is guaranteed
6461 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6463 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6464 gcc_assert (valid_p
);
6469 return error_mark_node
;
6472 /* For use from the C common bits. */
6474 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6475 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6476 enum tree_code modifycode
,
6477 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6478 tree rhs_origtype ATTRIBUTE_UNUSED
)
6480 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6483 /* Build an assignment expression of lvalue LHS from value RHS.
6484 MODIFYCODE is the code for a binary operator that we use
6485 to combine the old value of LHS with RHS to get the new value.
6486 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6488 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6491 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6492 tsubst_flags_t complain
)
6496 tree lhstype
= TREE_TYPE (lhs
);
6497 tree olhstype
= lhstype
;
6498 bool plain_assign
= (modifycode
== NOP_EXPR
);
6500 /* Avoid duplicate error messages from operands that had errors. */
6501 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6502 return error_mark_node
;
6504 /* Handle control structure constructs used as "lvalues". */
6505 switch (TREE_CODE (lhs
))
6507 /* Handle --foo = 5; as these are valid constructs in C++. */
6508 case PREDECREMENT_EXPR
:
6509 case PREINCREMENT_EXPR
:
6510 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6511 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6512 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6513 TREE_OPERAND (lhs
, 1));
6514 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6515 modifycode
, rhs
, complain
);
6516 if (newrhs
== error_mark_node
)
6517 return error_mark_node
;
6518 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6520 /* Handle (a, b) used as an "lvalue". */
6522 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6523 modifycode
, rhs
, complain
);
6524 if (newrhs
== error_mark_node
)
6525 return error_mark_node
;
6526 return build2 (COMPOUND_EXPR
, lhstype
,
6527 TREE_OPERAND (lhs
, 0), newrhs
);
6530 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6531 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6532 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6533 TREE_OPERAND (lhs
, 1));
6534 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6536 if (newrhs
== error_mark_node
)
6537 return error_mark_node
;
6538 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6542 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6543 when neither operand has side-effects. */
6544 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6545 return error_mark_node
;
6547 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6548 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6550 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6551 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6553 TREE_OPERAND (lhs
, 0),
6554 TREE_OPERAND (lhs
, 1)),
6555 TREE_OPERAND (lhs
, 0),
6556 TREE_OPERAND (lhs
, 1));
6559 /* Handle (a ? b : c) used as an "lvalue". */
6562 /* Produce (a ? (b = rhs) : (c = rhs))
6563 except that the RHS goes through a save-expr
6564 so the code to compute it is only emitted once. */
6566 tree preeval
= NULL_TREE
;
6568 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6570 if (complain
& tf_error
)
6571 error ("void value not ignored as it ought to be");
6572 return error_mark_node
;
6575 rhs
= stabilize_expr (rhs
, &preeval
);
6577 /* Check this here to avoid odd errors when trying to convert
6578 a throw to the type of the COND_EXPR. */
6579 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6580 return error_mark_node
;
6582 cond
= build_conditional_expr
6583 (TREE_OPERAND (lhs
, 0),
6584 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6585 modifycode
, rhs
, complain
),
6586 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6587 modifycode
, rhs
, complain
),
6590 if (cond
== error_mark_node
)
6592 /* Make sure the code to compute the rhs comes out
6593 before the split. */
6595 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6603 if (modifycode
== INIT_EXPR
)
6605 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6606 /* Do the default thing. */;
6607 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6609 /* Compound literal. */
6610 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6611 /* Call convert to generate an error; see PR 11063. */
6612 rhs
= convert (lhstype
, rhs
);
6613 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6614 TREE_SIDE_EFFECTS (result
) = 1;
6617 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6618 /* Do the default thing. */;
6621 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6622 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6623 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6625 release_tree_vector (rhs_vec
);
6626 if (result
== NULL_TREE
)
6627 return error_mark_node
;
6633 lhs
= require_complete_type_sfinae (lhs
, complain
);
6634 if (lhs
== error_mark_node
)
6635 return error_mark_node
;
6637 if (modifycode
== NOP_EXPR
)
6639 if (c_dialect_objc ())
6641 result
= objc_maybe_build_modify_expr (lhs
, rhs
);
6646 /* `operator=' is not an inheritable operator. */
6647 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6648 /* Do the default thing. */;
6651 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6652 lhs
, rhs
, make_node (NOP_EXPR
),
6653 /*overloaded_p=*/NULL
,
6655 if (result
== NULL_TREE
)
6656 return error_mark_node
;
6663 /* A binary op has been requested. Combine the old LHS
6664 value with the RHS producing the value we should actually
6665 store into the LHS. */
6666 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6667 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6668 || MAYBE_CLASS_TYPE_P (lhstype
)));
6670 lhs
= stabilize_reference (lhs
);
6671 newrhs
= cp_build_binary_op (input_location
,
6672 modifycode
, lhs
, rhs
,
6674 if (newrhs
== error_mark_node
)
6676 if (complain
& tf_error
)
6677 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6678 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6679 return error_mark_node
;
6682 /* Now it looks like a plain assignment. */
6683 modifycode
= NOP_EXPR
;
6684 if (c_dialect_objc ())
6686 result
= objc_maybe_build_modify_expr (lhs
, newrhs
);
6691 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6692 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6695 /* The left-hand side must be an lvalue. */
6696 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6697 return error_mark_node
;
6699 /* Warn about modifying something that is `const'. Don't warn if
6700 this is initialization. */
6701 if (modifycode
!= INIT_EXPR
6702 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6703 /* Functions are not modifiable, even though they are
6705 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6706 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6707 /* If it's an aggregate and any field is const, then it is
6708 effectively const. */
6709 || (CLASS_TYPE_P (lhstype
)
6710 && C_TYPE_FIELDS_READONLY (lhstype
))))
6712 if (complain
& tf_error
)
6713 readonly_error (lhs
, REK_ASSIGNMENT
);
6715 return error_mark_node
;
6718 /* If storing into a structure or union member, it may have been given a
6719 lowered bitfield type. We need to convert to the declared type first,
6720 so retrieve it now. */
6722 olhstype
= unlowered_expr_type (lhs
);
6724 /* Convert new value to destination type. */
6726 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6730 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6732 if (modifycode
!= INIT_EXPR
)
6734 if (complain
& tf_error
)
6735 error ("assigning to an array from an initializer list");
6736 return error_mark_node
;
6738 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6739 return error_mark_node
;
6740 newrhs
= digest_init (lhstype
, newrhs
);
6743 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6744 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6746 if (complain
& tf_error
)
6747 error ("incompatible types in assignment of %qT to %qT",
6748 TREE_TYPE (rhs
), lhstype
);
6749 return error_mark_node
;
6752 /* Allow array assignment in compiler-generated code. */
6753 else if (!current_function_decl
6754 || !DECL_ARTIFICIAL (current_function_decl
))
6756 /* This routine is used for both initialization and assignment.
6757 Make sure the diagnostic message differentiates the context. */
6758 if (complain
& tf_error
)
6760 if (modifycode
== INIT_EXPR
)
6761 error ("array used as initializer");
6763 error ("invalid array assignment");
6765 return error_mark_node
;
6768 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6769 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6770 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6771 /*explicit_value_init_p=*/false,
6772 from_array
, complain
);
6775 if (modifycode
== INIT_EXPR
)
6776 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6777 LOOKUP_ONLYCONVERTING. */
6778 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6779 ICR_INIT
, NULL_TREE
, 0,
6782 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
6783 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6785 if (!same_type_p (lhstype
, olhstype
))
6786 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6788 if (modifycode
!= INIT_EXPR
)
6790 if (TREE_CODE (newrhs
) == CALL_EXPR
6791 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6792 newrhs
= build_cplus_new (lhstype
, newrhs
);
6794 /* Can't initialize directly from a TARGET_EXPR, since that would
6795 cause the lhs to be constructed twice, and possibly result in
6796 accidental self-initialization. So we force the TARGET_EXPR to be
6797 expanded without a target. */
6798 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6799 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6800 TREE_OPERAND (newrhs
, 0));
6803 if (newrhs
== error_mark_node
)
6804 return error_mark_node
;
6806 if (c_dialect_objc () && flag_objc_gc
)
6808 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6814 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6815 lhstype
, lhs
, newrhs
);
6817 TREE_SIDE_EFFECTS (result
) = 1;
6819 TREE_NO_WARNING (result
) = 1;
6825 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6826 tsubst_flags_t complain
)
6828 if (processing_template_decl
)
6829 return build_min_nt (MODOP_EXPR
, lhs
,
6830 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6832 if (modifycode
!= NOP_EXPR
)
6834 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6835 make_node (modifycode
),
6836 /*overloaded_p=*/NULL
,
6840 TREE_NO_WARNING (rval
) = 1;
6844 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6847 /* Helper function for get_delta_difference which assumes FROM is a base
6848 class of TO. Returns a delta for the conversion of pointer-to-member
6849 of FROM to pointer-to-member of TO. If the conversion is invalid and
6850 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
6851 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6852 If C_CAST_P is true, this conversion is taking place as part of a
6856 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
,
6857 tsubst_flags_t complain
)
6861 base_access access
= c_cast_p
? ba_unique
: ba_check
;
6863 /* Note: ba_quiet does not distinguish between access control and
6865 if (!(complain
& tf_error
))
6868 binfo
= lookup_base (to
, from
, access
, &kind
);
6870 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6872 if (!(complain
& tf_error
))
6873 return error_mark_node
;
6875 error (" in pointer to member function conversion");
6876 return size_zero_node
;
6880 if (kind
!= bk_via_virtual
)
6881 return BINFO_OFFSET (binfo
);
6883 /* FROM is a virtual base class of TO. Issue an error or warning
6884 depending on whether or not this is a reinterpret cast. */
6886 if (!(complain
& tf_error
))
6887 return error_mark_node
;
6889 error ("pointer to member conversion via virtual base %qT",
6890 BINFO_TYPE (binfo_from_vbase (binfo
)));
6892 return size_zero_node
;
6899 /* Get difference in deltas for different pointer to member function
6900 types. If the conversion is invalid and tf_error is not set in
6901 COMPLAIN, returns error_mark_node, otherwise returns an integer
6902 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
6903 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
6904 conversions as well. If C_CAST_P is true this conversion is taking
6905 place as part of a C-style cast.
6907 Note that the naming of FROM and TO is kind of backwards; the return
6908 value is what we add to a TO in order to get a FROM. They are named
6909 this way because we call this function to find out how to convert from
6910 a pointer to member of FROM to a pointer to member of TO. */
6913 get_delta_difference (tree from
, tree to
,
6914 bool allow_inverse_p
,
6915 bool c_cast_p
, tsubst_flags_t complain
)
6919 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
6920 /* Pointer to member of incomplete class is permitted*/
6921 result
= size_zero_node
;
6923 result
= get_delta_difference_1 (from
, to
, c_cast_p
, complain
);
6925 if (result
== error_mark_node
)
6926 return error_mark_node
;
6930 if (!allow_inverse_p
)
6932 if (!(complain
& tf_error
))
6933 return error_mark_node
;
6935 error_not_base_type (from
, to
);
6936 error (" in pointer to member conversion");
6937 result
= size_zero_node
;
6941 result
= get_delta_difference_1 (to
, from
, c_cast_p
, complain
);
6943 if (result
== error_mark_node
)
6944 return error_mark_node
;
6947 result
= size_diffop_loc (input_location
,
6948 size_zero_node
, result
);
6951 if (!(complain
& tf_error
))
6952 return error_mark_node
;
6954 error_not_base_type (from
, to
);
6955 error (" in pointer to member conversion");
6956 result
= size_zero_node
;
6961 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
6965 /* Return a constructor for the pointer-to-member-function TYPE using
6966 the other components as specified. */
6969 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
6974 VEC(constructor_elt
, gc
) *v
;
6976 /* Pull the FIELD_DECLs out of the type. */
6977 pfn_field
= TYPE_FIELDS (type
);
6978 delta_field
= DECL_CHAIN (pfn_field
);
6980 /* Make sure DELTA has the type we want. */
6981 delta
= convert_and_check (delta_type_node
, delta
);
6983 /* Convert to the correct target type if necessary. */
6984 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
6986 /* Finish creating the initializer. */
6987 v
= VEC_alloc(constructor_elt
, gc
, 2);
6988 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
6989 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
6990 u
= build_constructor (type
, v
);
6991 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
6992 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
6993 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
6995 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
7000 /* Build a constructor for a pointer to member function. It can be
7001 used to initialize global variables, local variable, or used
7002 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
7005 If FORCE is nonzero, then force this conversion, even if
7006 we would rather not do it. Usually set when using an explicit
7007 cast. A C-style cast is being processed iff C_CAST_P is true.
7009 Return error_mark_node, if something goes wrong. */
7012 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
,
7013 tsubst_flags_t complain
)
7019 if (error_operand_p (pfn
))
7020 return error_mark_node
;
7022 pfn_type
= TREE_TYPE (pfn
);
7023 to_type
= build_ptrmemfunc_type (type
);
7025 /* Handle multiple conversions of pointer to member functions. */
7026 if (TYPE_PTRMEMFUNC_P (pfn_type
))
7028 tree delta
= NULL_TREE
;
7029 tree npfn
= NULL_TREE
;
7033 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
7034 error ("invalid conversion to type %qT from type %qT",
7037 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
7038 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
7040 c_cast_p
, complain
);
7041 if (n
== error_mark_node
)
7042 return error_mark_node
;
7044 /* We don't have to do any conversion to convert a
7045 pointer-to-member to its own type. But, we don't want to
7046 just return a PTRMEM_CST if there's an explicit cast; that
7047 cast should make the expression an invalid template argument. */
7048 if (TREE_CODE (pfn
) != PTRMEM_CST
)
7050 if (same_type_p (to_type
, pfn_type
))
7052 else if (integer_zerop (n
))
7053 return build_reinterpret_cast (to_type
, pfn
,
7054 tf_warning_or_error
);
7057 if (TREE_SIDE_EFFECTS (pfn
))
7058 pfn
= save_expr (pfn
);
7060 /* Obtain the function pointer and the current DELTA. */
7061 if (TREE_CODE (pfn
) == PTRMEM_CST
)
7062 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
7065 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
7066 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
7069 /* Just adjust the DELTA field. */
7070 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7071 (TREE_TYPE (delta
), ptrdiff_type_node
));
7072 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
7073 n
= cp_build_binary_op (input_location
,
7074 LSHIFT_EXPR
, n
, integer_one_node
,
7075 tf_warning_or_error
);
7076 delta
= cp_build_binary_op (input_location
,
7077 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
7078 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
7081 /* Handle null pointer to member function conversions. */
7082 if (null_ptr_cst_p (pfn
))
7084 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
7085 return build_ptrmemfunc1 (to_type
,
7090 if (type_unknown_p (pfn
))
7091 return instantiate_type (type
, pfn
, tf_warning_or_error
);
7093 fn
= TREE_OPERAND (pfn
, 0);
7094 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7095 /* In a template, we will have preserved the
7097 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
7098 return make_ptrmem_cst (to_type
, fn
);
7101 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7104 ??? There is no consistency as to the types returned for the above
7105 values. Some code acts as if it were a sizetype and some as if it were
7106 integer_type_node. */
7109 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
7111 tree type
= TREE_TYPE (cst
);
7112 tree fn
= PTRMEM_CST_MEMBER (cst
);
7113 tree ptr_class
, fn_class
;
7115 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7117 /* The class that the function belongs to. */
7118 fn_class
= DECL_CONTEXT (fn
);
7120 /* The class that we're creating a pointer to member of. */
7121 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
7123 /* First, calculate the adjustment to the function's class. */
7124 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
7125 /*c_cast_p=*/0, tf_warning_or_error
);
7127 if (!DECL_VIRTUAL_P (fn
))
7128 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
7131 /* If we're dealing with a virtual function, we have to adjust 'this'
7132 again, to point to the base which provides the vtable entry for
7133 fn; the call will do the opposite adjustment. */
7134 tree orig_class
= DECL_CONTEXT (fn
);
7135 tree binfo
= binfo_or_else (orig_class
, fn_class
);
7136 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7137 *delta
, BINFO_OFFSET (binfo
));
7138 *delta
= fold_if_not_in_template (*delta
);
7140 /* We set PFN to the vtable offset at which the function can be
7141 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7142 case delta is shifted left, and then incremented). */
7143 *pfn
= DECL_VINDEX (fn
);
7144 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
7145 TYPE_SIZE_UNIT (vtable_entry_type
));
7146 *pfn
= fold_if_not_in_template (*pfn
);
7148 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
7150 case ptrmemfunc_vbit_in_pfn
:
7151 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
7153 *pfn
= fold_if_not_in_template (*pfn
);
7156 case ptrmemfunc_vbit_in_delta
:
7157 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
7158 *delta
, integer_one_node
);
7159 *delta
= fold_if_not_in_template (*delta
);
7160 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7161 *delta
, integer_one_node
);
7162 *delta
= fold_if_not_in_template (*delta
);
7169 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
7170 *pfn
= fold_if_not_in_template (*pfn
);
7174 /* Return an expression for PFN from the pointer-to-member function
7178 pfn_from_ptrmemfunc (tree t
)
7180 if (TREE_CODE (t
) == PTRMEM_CST
)
7185 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7190 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
7193 /* Return an expression for DELTA from the pointer-to-member function
7197 delta_from_ptrmemfunc (tree t
)
7199 if (TREE_CODE (t
) == PTRMEM_CST
)
7204 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7209 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7212 /* Convert value RHS to type TYPE as preparation for an assignment to
7213 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
7214 implicit conversion is. If FNDECL is non-NULL, we are doing the
7215 conversion in order to pass the PARMNUMth argument of FNDECL.
7216 If FNDECL is NULL, we are doing the conversion in function pointer
7217 argument passing, conversion in initialization, etc. */
7220 convert_for_assignment (tree type
, tree rhs
,
7221 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7222 tsubst_flags_t complain
, int flags
)
7225 enum tree_code coder
;
7227 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7228 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7229 rhs
= TREE_OPERAND (rhs
, 0);
7231 rhstype
= TREE_TYPE (rhs
);
7232 coder
= TREE_CODE (rhstype
);
7234 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7235 && vector_types_convertible_p (type
, rhstype
, true))
7237 rhs
= mark_rvalue_use (rhs
);
7238 return convert (type
, rhs
);
7241 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7242 return error_mark_node
;
7243 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7244 return error_mark_node
;
7246 /* The RHS of an assignment cannot have void type. */
7247 if (coder
== VOID_TYPE
)
7249 if (complain
& tf_error
)
7250 error ("void value not ignored as it ought to be");
7251 return error_mark_node
;
7254 /* Simplify the RHS if possible. */
7255 if (TREE_CODE (rhs
) == CONST_DECL
)
7256 rhs
= DECL_INITIAL (rhs
);
7258 if (c_dialect_objc ())
7262 tree rname
= fndecl
;
7273 selector
= objc_message_selector ();
7275 if (selector
&& parmno
> 1)
7282 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7284 rhs
= mark_rvalue_use (rhs
);
7285 return convert (type
, rhs
);
7291 The expression is implicitly converted (clause _conv_) to the
7292 cv-unqualified type of the left operand.
7294 We allow bad conversions here because by the time we get to this point
7295 we are committed to doing the conversion. If we end up doing a bad
7296 conversion, convert_like will complain. */
7297 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7299 /* When -Wno-pmf-conversions is use, we just silently allow
7300 conversions from pointers-to-members to plain pointers. If
7301 the conversion doesn't work, cp_convert will complain. */
7303 && TYPE_PTR_P (type
)
7304 && TYPE_PTRMEMFUNC_P (rhstype
))
7305 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7308 if (complain
& tf_error
)
7310 /* If the right-hand side has unknown type, then it is an
7311 overloaded function. Call instantiate_type to get error
7313 if (rhstype
== unknown_type_node
)
7314 instantiate_type (type
, rhs
, tf_warning_or_error
);
7316 error ("cannot convert %qT to %qT for argument %qP to %qD",
7317 rhstype
, type
, parmnum
, fndecl
);
7321 case ICR_DEFAULT_ARGUMENT
:
7322 error ("cannot convert %qT to %qT in default argument",
7326 error ("cannot convert %qT to %qT in argument passing",
7329 case ICR_CONVERTING
:
7330 error ("cannot convert %qT to %qT",
7334 error ("cannot convert %qT to %qT in initialization",
7338 error ("cannot convert %qT to %qT in return",
7342 error ("cannot convert %qT to %qT in assignment",
7349 return error_mark_node
;
7352 if (warn_missing_format_attribute
)
7354 const enum tree_code codel
= TREE_CODE (type
);
7355 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7357 && check_missing_format_attribute (type
, rhstype
)
7358 && (complain
& tf_warning
))
7362 case ICR_DEFAULT_ARGUMENT
:
7364 warning (OPT_Wmissing_format_attribute
,
7365 "parameter %qP of %qD might be a candidate "
7366 "for a format attribute", parmnum
, fndecl
);
7368 warning (OPT_Wmissing_format_attribute
,
7369 "parameter might be a candidate "
7370 "for a format attribute");
7372 case ICR_CONVERTING
:
7373 warning (OPT_Wmissing_format_attribute
,
7374 "target of conversion might be might be a candidate "
7375 "for a format attribute");
7378 warning (OPT_Wmissing_format_attribute
,
7379 "target of initialization might be a candidate "
7380 "for a format attribute");
7383 warning (OPT_Wmissing_format_attribute
,
7384 "return type might be a candidate "
7385 "for a format attribute");
7388 warning (OPT_Wmissing_format_attribute
,
7389 "left-hand side of assignment might be a candidate "
7390 "for a format attribute");
7397 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7399 if (warn_parentheses
7400 && TREE_CODE (type
) == BOOLEAN_TYPE
7401 && TREE_CODE (rhs
) == MODIFY_EXPR
7402 && !TREE_NO_WARNING (rhs
)
7403 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7404 && (complain
& tf_warning
))
7406 location_t loc
= EXPR_LOC_OR_HERE (rhs
);
7408 warning_at (loc
, OPT_Wparentheses
,
7409 "suggest parentheses around assignment used as truth value");
7410 TREE_NO_WARNING (rhs
) = 1;
7413 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7417 /* Convert RHS to be of type TYPE.
7418 If EXP is nonzero, it is the target of the initialization.
7419 ERRTYPE indicates what kind of error the implicit conversion is.
7421 Two major differences between the behavior of
7422 `convert_for_assignment' and `convert_for_initialization'
7423 are that references are bashed in the former, while
7424 copied in the latter, and aggregates are assigned in
7425 the former (operator=) while initialized in the
7428 If using constructor make sure no conversion operator exists, if one does
7429 exist, an ambiguity exists.
7431 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7434 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7435 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7436 tsubst_flags_t complain
)
7438 enum tree_code codel
= TREE_CODE (type
);
7440 enum tree_code coder
;
7442 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7443 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7444 if (TREE_CODE (rhs
) == NOP_EXPR
7445 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7446 && codel
!= REFERENCE_TYPE
)
7447 rhs
= TREE_OPERAND (rhs
, 0);
7449 if (type
== error_mark_node
7450 || rhs
== error_mark_node
7451 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7452 return error_mark_node
;
7454 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7455 && TREE_CODE (type
) != ARRAY_TYPE
7456 && (TREE_CODE (type
) != REFERENCE_TYPE
7457 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7458 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7459 && (TREE_CODE (type
) != REFERENCE_TYPE
7460 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7461 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7462 rhs
= decay_conversion (rhs
);
7464 rhstype
= TREE_TYPE (rhs
);
7465 coder
= TREE_CODE (rhstype
);
7467 if (coder
== ERROR_MARK
)
7468 return error_mark_node
;
7470 /* We accept references to incomplete types, so we can
7471 return here before checking if RHS is of complete type. */
7473 if (codel
== REFERENCE_TYPE
)
7475 /* This should eventually happen in convert_arguments. */
7476 int savew
= 0, savee
= 0;
7479 savew
= warningcount
, savee
= errorcount
;
7480 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7481 /*cleanup=*/NULL
, complain
);
7484 if (warningcount
> savew
)
7485 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7486 else if (errorcount
> savee
)
7487 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7493 exp
= require_complete_type_sfinae (exp
, complain
);
7494 if (exp
== error_mark_node
)
7495 return error_mark_node
;
7497 rhstype
= non_reference (rhstype
);
7499 type
= complete_type (type
);
7501 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7502 /* Don't try to do copy-initialization if we already have
7503 direct-initialization. */
7506 if (MAYBE_CLASS_TYPE_P (type
))
7507 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
7509 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7513 /* If RETVAL is the address of, or a reference to, a local variable or
7514 temporary give an appropriate warning. */
7517 maybe_warn_about_returning_address_of_local (tree retval
)
7519 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7520 tree whats_returned
= retval
;
7524 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7525 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7526 else if (CONVERT_EXPR_P (whats_returned
)
7527 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7528 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7533 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7535 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7537 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7539 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7540 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7542 warning (0, "returning reference to temporary");
7545 if (TREE_CODE (whats_returned
) == VAR_DECL
7546 && DECL_NAME (whats_returned
)
7547 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7549 warning (0, "reference to non-lvalue returned");
7554 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7555 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7556 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7558 if (DECL_P (whats_returned
)
7559 && DECL_NAME (whats_returned
)
7560 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7561 && !(TREE_STATIC (whats_returned
)
7562 || TREE_PUBLIC (whats_returned
)))
7564 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7565 warning (0, "reference to local variable %q+D returned",
7568 warning (0, "address of local variable %q+D returned",
7574 /* Check that returning RETVAL from the current function is valid.
7575 Return an expression explicitly showing all conversions required to
7576 change RETVAL into the function return type, and to assign it to
7577 the DECL_RESULT for the function. Set *NO_WARNING to true if
7578 code reaches end of non-void function warning shouldn't be issued
7579 on this RETURN_EXPR. */
7582 check_return_expr (tree retval
, bool *no_warning
)
7585 /* The type actually returned by the function, after any
7588 int fn_returns_value_p
;
7589 bool named_return_value_okay_p
;
7591 *no_warning
= false;
7593 /* A `volatile' function is one that isn't supposed to return, ever.
7594 (This is a G++ extension, used to get better code for functions
7595 that call the `volatile' function.) */
7596 if (TREE_THIS_VOLATILE (current_function_decl
))
7597 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7599 /* Check for various simple errors. */
7600 if (DECL_DESTRUCTOR_P (current_function_decl
))
7603 error ("returning a value from a destructor");
7606 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7608 if (in_function_try_handler
)
7609 /* If a return statement appears in a handler of the
7610 function-try-block of a constructor, the program is ill-formed. */
7611 error ("cannot return from a handler of a function-try-block of a constructor");
7613 /* You can't return a value from a constructor. */
7614 error ("returning a value from a constructor");
7618 /* As an extension, deduce lambda return type from a return statement
7619 anywhere in the body. */
7620 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7622 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7623 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7625 tree type
= lambda_return_type (retval
);
7626 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7628 if (VOID_TYPE_P (type
))
7630 else if (oldtype
== NULL_TREE
)
7632 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7633 "can only be deduced when the return statement is "
7634 "the only statement in the function body");
7635 apply_lambda_return_type (lambda
, type
);
7637 else if (!same_type_p (type
, oldtype
))
7638 error ("inconsistent types %qT and %qT deduced for "
7639 "lambda return type", type
, oldtype
);
7643 if (processing_template_decl
)
7645 current_function_returns_value
= 1;
7646 if (check_for_bare_parameter_packs (retval
))
7647 retval
= error_mark_node
;
7651 /* When no explicit return-value is given in a function with a named
7652 return value, the named return value is used. */
7653 result
= DECL_RESULT (current_function_decl
);
7654 valtype
= TREE_TYPE (result
);
7655 gcc_assert (valtype
!= NULL_TREE
);
7656 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7657 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7660 /* Check for a return statement with no return value in a function
7661 that's supposed to return a value. */
7662 if (!retval
&& fn_returns_value_p
)
7664 permerror (input_location
, "return-statement with no value, in function returning %qT",
7666 /* Clear this, so finish_function won't say that we reach the
7667 end of a non-void function (which we don't, we gave a
7669 current_function_returns_null
= 0;
7670 /* And signal caller that TREE_NO_WARNING should be set on the
7671 RETURN_EXPR to avoid control reaches end of non-void function
7672 warnings in tree-cfg.c. */
7675 /* Check for a return statement with a value in a function that
7676 isn't supposed to return a value. */
7677 else if (retval
&& !fn_returns_value_p
)
7679 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7680 /* You can return a `void' value from a function of `void'
7681 type. In that case, we have to evaluate the expression for
7682 its side-effects. */
7683 finish_expr_stmt (retval
);
7685 permerror (input_location
, "return-statement with a value, in function "
7686 "returning 'void'");
7687 current_function_returns_null
= 1;
7689 /* There's really no value to return, after all. */
7693 /* Remember that this function can sometimes return without a
7695 current_function_returns_null
= 1;
7697 /* Remember that this function did return a value. */
7698 current_function_returns_value
= 1;
7700 /* Check for erroneous operands -- but after giving ourselves a
7701 chance to provide an error about returning a value from a void
7703 if (error_operand_p (retval
))
7705 current_function_return_value
= error_mark_node
;
7706 return error_mark_node
;
7709 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7710 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7711 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7712 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7714 && retval
&& null_ptr_cst_p (retval
))
7715 warning (0, "%<operator new%> must not return NULL unless it is "
7716 "declared %<throw()%> (or -fcheck-new is in effect)");
7718 /* Effective C++ rule 15. See also start_function. */
7720 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7724 /* The function return type must be a reference to the current
7726 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7727 && same_type_ignoring_top_level_qualifiers_p
7728 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7730 /* Returning '*this' is obviously OK. */
7731 if (retval
== current_class_ref
)
7733 /* If we are calling a function whose return type is the same of
7734 the current class reference, it is ok. */
7735 else if (TREE_CODE (retval
) == INDIRECT_REF
7736 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7741 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7744 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7746 [...] For a function with a class return type, if the expression
7747 in the return statement is the name of a local object, and the cv-
7748 unqualified type of the local object is the same as the function
7749 return type, an implementation is permitted to omit creating the tem-
7750 porary object to hold the function return value [...]
7752 So, if this is a value-returning function that always returns the same
7753 local variable, remember it.
7755 It might be nice to be more flexible, and choose the first suitable
7756 variable even if the function sometimes returns something else, but
7757 then we run the risk of clobbering the variable we chose if the other
7758 returned expression uses the chosen variable somehow. And people expect
7759 this restriction, anyway. (jason 2000-11-19)
7761 See finish_function and finalize_nrv for the rest of this optimization. */
7763 named_return_value_okay_p
=
7764 (retval
!= NULL_TREE
7765 /* Must be a local, automatic variable. */
7766 && TREE_CODE (retval
) == VAR_DECL
7767 && DECL_CONTEXT (retval
) == current_function_decl
7768 && ! TREE_STATIC (retval
)
7769 && ! DECL_ANON_UNION_VAR_P (retval
)
7770 && (DECL_ALIGN (retval
)
7771 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7772 /* The cv-unqualified type of the returned value must be the
7773 same as the cv-unqualified return type of the
7775 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7777 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7778 /* And the returned value must be non-volatile. */
7779 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7781 if (fn_returns_value_p
&& flag_elide_constructors
)
7783 if (named_return_value_okay_p
7784 && (current_function_return_value
== NULL_TREE
7785 || current_function_return_value
== retval
))
7786 current_function_return_value
= retval
;
7788 current_function_return_value
= error_mark_node
;
7791 /* We don't need to do any conversions when there's nothing being
7796 /* Do any required conversions. */
7797 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7798 /* No conversions are required. */
7802 /* The type the function is declared to return. */
7803 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7804 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7806 /* The functype's return type will have been set to void, if it
7807 was an incomplete type. Just treat this as 'return;' */
7808 if (VOID_TYPE_P (functype
))
7809 return error_mark_node
;
7811 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7812 treated as an rvalue for the purposes of overload resolution to
7813 favor move constructors over copy constructors. */
7814 if ((cxx_dialect
!= cxx98
)
7815 && named_return_value_okay_p
7816 /* The variable must not have the `volatile' qualifier. */
7817 && !CP_TYPE_VOLATILE_P (TREE_TYPE (retval
))
7818 /* The return type must be a class type. */
7819 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7820 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7822 /* First convert the value to the function's return type, then
7823 to the type of return value's location to handle the
7824 case that functype is smaller than the valtype. */
7825 retval
= convert_for_initialization
7826 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
7827 tf_warning_or_error
);
7828 retval
= convert (valtype
, retval
);
7830 /* If the conversion failed, treat this just like `return;'. */
7831 if (retval
== error_mark_node
)
7833 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7834 else if (! cfun
->returns_struct
7835 && TREE_CODE (retval
) == TARGET_EXPR
7836 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7837 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7838 TREE_OPERAND (retval
, 0));
7840 maybe_warn_about_returning_address_of_local (retval
);
7843 /* Actually copy the value returned into the appropriate location. */
7844 if (retval
&& retval
!= result
)
7845 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7851 /* Returns nonzero if the pointer-type FROM can be converted to the
7852 pointer-type TO via a qualification conversion. If CONSTP is -1,
7853 then we return nonzero if the pointers are similar, and the
7854 cv-qualification signature of FROM is a proper subset of that of TO.
7856 If CONSTP is positive, then all outer pointers have been
7860 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7862 bool to_more_cv_qualified
= false;
7863 bool is_opaque_pointer
= false;
7865 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7867 if (TREE_CODE (to
) != TREE_CODE (from
))
7870 if (TREE_CODE (from
) == OFFSET_TYPE
7871 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7872 TYPE_OFFSET_BASETYPE (to
)))
7875 /* Const and volatile mean something different for function types,
7876 so the usual checks are not appropriate. */
7877 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7879 /* In Objective-C++, some types may have been 'volatilized' by
7880 the compiler for EH; when comparing them here, the volatile
7881 qualification must be ignored. */
7882 tree nv_to
= objc_non_volatilized_type (to
);
7883 tree nv_from
= objc_non_volatilized_type (from
);
7885 if (!at_least_as_qualified_p (nv_to
, nv_from
))
7888 if (!at_least_as_qualified_p (nv_from
, nv_to
))
7892 to_more_cv_qualified
= true;
7896 constp
&= TYPE_READONLY (nv_to
);
7899 if (TREE_CODE (to
) == VECTOR_TYPE
)
7900 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7902 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
7903 return ((constp
>= 0 || to_more_cv_qualified
)
7904 && (is_opaque_pointer
7905 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
7909 /* When comparing, say, char ** to char const **, this function takes
7910 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7911 types to this function. */
7914 comp_ptr_ttypes (tree to
, tree from
)
7916 return comp_ptr_ttypes_real (to
, from
, 1);
7919 /* Returns true iff FNTYPE is a non-class type that involves
7920 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7921 if a parameter type is ill-formed. */
7924 error_type_p (const_tree type
)
7928 switch (TREE_CODE (type
))
7934 case REFERENCE_TYPE
:
7936 return error_type_p (TREE_TYPE (type
));
7940 if (error_type_p (TREE_TYPE (type
)))
7942 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7943 if (error_type_p (TREE_VALUE (t
)))
7948 if (TYPE_PTRMEMFUNC_P (type
))
7949 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
7957 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7958 type or inheritance-related types, regardless of cv-quals. */
7961 ptr_reasonably_similar (const_tree to
, const_tree from
)
7963 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7965 /* Any target type is similar enough to void. */
7966 if (TREE_CODE (to
) == VOID_TYPE
)
7967 return !error_type_p (from
);
7968 if (TREE_CODE (from
) == VOID_TYPE
)
7969 return !error_type_p (to
);
7971 if (TREE_CODE (to
) != TREE_CODE (from
))
7974 if (TREE_CODE (from
) == OFFSET_TYPE
7975 && comptypes (TYPE_OFFSET_BASETYPE (to
),
7976 TYPE_OFFSET_BASETYPE (from
),
7977 COMPARE_BASE
| COMPARE_DERIVED
))
7980 if (TREE_CODE (to
) == VECTOR_TYPE
7981 && vector_types_convertible_p (to
, from
, false))
7984 if (TREE_CODE (to
) == INTEGER_TYPE
7985 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
7988 if (TREE_CODE (to
) == FUNCTION_TYPE
)
7989 return !error_type_p (to
) && !error_type_p (from
);
7991 if (TREE_CODE (to
) != POINTER_TYPE
)
7993 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
7994 COMPARE_BASE
| COMPARE_DERIVED
);
7998 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
7999 pointer-to-member types) are the same, ignoring cv-qualification at
8003 comp_ptr_ttypes_const (tree to
, tree from
)
8005 bool is_opaque_pointer
= false;
8007 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
8009 if (TREE_CODE (to
) != TREE_CODE (from
))
8012 if (TREE_CODE (from
) == OFFSET_TYPE
8013 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
8014 TYPE_OFFSET_BASETYPE (to
)))
8017 if (TREE_CODE (to
) == VECTOR_TYPE
)
8018 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
8020 if (TREE_CODE (to
) != POINTER_TYPE
)
8021 return (is_opaque_pointer
8022 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
8026 /* Returns the type qualifiers for this type, including the qualifiers on the
8027 elements for an array type. */
8030 cp_type_quals (const_tree type
)
8033 /* This CONST_CAST is okay because strip_array_types returns its
8034 argument unmodified and we assign it to a const_tree. */
8035 type
= strip_array_types (CONST_CAST_TREE (type
));
8036 if (type
== error_mark_node
8037 /* Quals on a FUNCTION_TYPE are memfn quals. */
8038 || TREE_CODE (type
) == FUNCTION_TYPE
)
8039 return TYPE_UNQUALIFIED
;
8040 quals
= TYPE_QUALS (type
);
8041 /* METHOD and REFERENCE_TYPEs should never have quals. */
8042 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
8043 && TREE_CODE (type
) != REFERENCE_TYPE
)
8044 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
8045 == TYPE_UNQUALIFIED
));
8049 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
8053 type_memfn_quals (const_tree type
)
8055 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8056 return TYPE_QUALS (type
);
8057 else if (TREE_CODE (type
) == METHOD_TYPE
)
8058 return cp_type_quals (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))));
8063 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
8067 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
)
8069 /* Could handle METHOD_TYPE here if necessary. */
8070 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8071 if (TYPE_QUALS (type
) == memfn_quals
)
8073 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
8075 return build_qualified_type (type
, memfn_quals
);
8078 /* Returns nonzero if TYPE is const or volatile. */
8081 cv_qualified_p (const_tree type
)
8083 int quals
= cp_type_quals (type
);
8084 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
8087 /* Returns nonzero if the TYPE contains a mutable member. */
8090 cp_has_mutable_p (const_tree type
)
8092 /* This CONST_CAST is okay because strip_array_types returns its
8093 argument unmodified and we assign it to a const_tree. */
8094 type
= strip_array_types (CONST_CAST_TREE(type
));
8096 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
8099 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
8100 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
8101 approximation. In particular, consider:
8104 struct S { int i; };
8105 const S s = { f(); }
8107 Here, we will make "s" as TREE_READONLY (because it is declared
8108 "const") -- only to reverse ourselves upon seeing that the
8109 initializer is non-constant. */
8112 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
8114 tree type
= TREE_TYPE (decl
);
8116 if (type
== error_mark_node
)
8119 if (TREE_CODE (decl
) == TYPE_DECL
)
8122 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
8123 && type_quals
!= TYPE_UNQUALIFIED
));
8125 /* Avoid setting TREE_READONLY incorrectly. */
8126 if (/* If the object has a constructor, the constructor may modify
8128 TYPE_NEEDS_CONSTRUCTING (type
)
8129 /* If the type isn't complete, we don't know yet if it will need
8131 || !COMPLETE_TYPE_P (type
)
8132 /* If the type has a mutable component, that component might be
8134 || TYPE_HAS_MUTABLE_P (type
))
8135 type_quals
&= ~TYPE_QUAL_CONST
;
8137 c_apply_type_quals_to_decl (type_quals
, decl
);
8140 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8141 exemplar types such that casting T1 to T2 is casting away constness
8142 if and only if there is no implicit conversion from T1 to T2. */
8145 casts_away_constness_r (tree
*t1
, tree
*t2
)
8150 /* [expr.const.cast]
8152 For multi-level pointer to members and multi-level mixed pointers
8153 and pointers to members (conv.qual), the "member" aspect of a
8154 pointer to member level is ignored when determining if a const
8155 cv-qualifier has been cast away. */
8156 /* [expr.const.cast]
8158 For two pointer types:
8160 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8161 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8164 casting from X1 to X2 casts away constness if, for a non-pointer
8165 type T there does not exist an implicit conversion (clause
8168 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8172 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8173 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
8174 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
8176 *t1
= cp_build_qualified_type (void_type_node
,
8177 cp_type_quals (*t1
));
8178 *t2
= cp_build_qualified_type (void_type_node
,
8179 cp_type_quals (*t2
));
8183 quals1
= cp_type_quals (*t1
);
8184 quals2
= cp_type_quals (*t2
);
8186 if (TYPE_PTRMEM_P (*t1
))
8187 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
8189 *t1
= TREE_TYPE (*t1
);
8190 if (TYPE_PTRMEM_P (*t2
))
8191 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
8193 *t2
= TREE_TYPE (*t2
);
8195 casts_away_constness_r (t1
, t2
);
8196 *t1
= build_pointer_type (*t1
);
8197 *t2
= build_pointer_type (*t2
);
8198 *t1
= cp_build_qualified_type (*t1
, quals1
);
8199 *t2
= cp_build_qualified_type (*t2
, quals2
);
8202 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8205 ??? This function returns non-zero if casting away qualifiers not
8206 just const. We would like to return to the caller exactly which
8207 qualifiers are casted away to give more accurate diagnostics.
8211 casts_away_constness (tree t1
, tree t2
)
8213 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
8215 /* [expr.const.cast]
8217 Casting from an lvalue of type T1 to an lvalue of type T2
8218 using a reference cast casts away constness if a cast from an
8219 rvalue of type "pointer to T1" to the type "pointer to T2"
8220 casts away constness. */
8221 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
8222 return casts_away_constness (build_pointer_type (t1
),
8223 build_pointer_type (TREE_TYPE (t2
)));
8226 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
8227 /* [expr.const.cast]
8229 Casting from an rvalue of type "pointer to data member of X
8230 of type T1" to the type "pointer to data member of Y of type
8231 T2" casts away constness if a cast from an rvalue of type
8232 "pointer to T1" to the type "pointer to T2" casts away
8234 return casts_away_constness
8235 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
8236 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
8238 /* Casting away constness is only something that makes sense for
8239 pointer or reference types. */
8240 if (TREE_CODE (t1
) != POINTER_TYPE
8241 || TREE_CODE (t2
) != POINTER_TYPE
)
8244 /* Top-level qualifiers don't matter. */
8245 t1
= TYPE_MAIN_VARIANT (t1
);
8246 t2
= TYPE_MAIN_VARIANT (t2
);
8247 casts_away_constness_r (&t1
, &t2
);
8248 if (!can_convert (t2
, t1
))
8254 /* If T is a REFERENCE_TYPE return the type to which T refers.
8255 Otherwise, return T itself. */
8258 non_reference (tree t
)
8260 if (TREE_CODE (t
) == REFERENCE_TYPE
)
8266 /* Return nonzero if REF is an lvalue valid for this language;
8267 otherwise, print an error message and return zero. USE says
8268 how the lvalue is being used and so selects the error message. */
8271 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
8273 cp_lvalue_kind kind
= lvalue_kind (ref
);
8275 if (kind
== clk_none
)
8277 if (complain
& tf_error
)
8281 else if (kind
& (clk_rvalueref
|clk_class
))
8283 if (!(complain
& tf_error
))
8285 if (kind
& clk_class
)
8286 /* Make this a permerror because we used to accept it. */
8287 permerror (input_location
, "using temporary as lvalue");
8289 error ("using xvalue (rvalue reference) as lvalue");