1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
5 Hacked by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
24 /* This file is part of the C++ front end.
25 It contains routines to build C++ expressions given their operands,
26 including computing the types of the result, C and C++ specific error
27 checks, and some optimization. */
31 #include "coretypes.h"
38 #include "diagnostic.h"
42 #include "c-family/c-common.h"
45 static tree
pfn_from_ptrmemfunc (tree
);
46 static tree
delta_from_ptrmemfunc (tree
);
47 static tree
convert_for_assignment (tree
, tree
, impl_conv_rhs
, tree
, int,
49 static tree
cp_pointer_int_sum (enum tree_code
, tree
, tree
);
50 static tree
rationalize_conditional_expr (enum tree_code
, tree
,
52 static int comp_ptr_ttypes_real (tree
, tree
, int);
53 static bool comp_except_types (tree
, tree
, bool);
54 static bool comp_array_types (const_tree
, const_tree
, bool);
55 static tree
pointer_diff (tree
, tree
, tree
);
56 static tree
get_delta_difference (tree
, tree
, bool, bool, tsubst_flags_t
);
57 static void casts_away_constness_r (tree
*, tree
*);
58 static bool casts_away_constness (tree
, tree
);
59 static void maybe_warn_about_returning_address_of_local (tree
);
60 static tree
lookup_destructor (tree
, tree
, tree
);
61 static void warn_args_num (location_t
, tree
, bool);
62 static int convert_arguments (tree
, VEC(tree
,gc
) **, tree
, int,
65 /* Do `exp = require_complete_type (exp);' to make sure exp
66 does not have an incomplete type. (That includes void types.)
67 Returns error_mark_node if the VALUE does not have
68 complete type when this function returns. */
71 require_complete_type_sfinae (tree value
, tsubst_flags_t complain
)
75 if (processing_template_decl
|| value
== error_mark_node
)
78 if (TREE_CODE (value
) == OVERLOAD
)
79 type
= unknown_type_node
;
81 type
= TREE_TYPE (value
);
83 if (type
== error_mark_node
)
84 return error_mark_node
;
86 /* First, detect a valid value with a complete type. */
87 if (COMPLETE_TYPE_P (type
))
90 if (complete_type_or_maybe_complain (type
, value
, complain
))
93 return error_mark_node
;
97 require_complete_type (tree value
)
99 return require_complete_type_sfinae (value
, tf_warning_or_error
);
102 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
103 a template instantiation, do the instantiation. Returns TYPE,
104 whether or not it could be completed, unless something goes
105 horribly wrong, in which case the error_mark_node is returned. */
108 complete_type (tree type
)
110 if (type
== NULL_TREE
)
111 /* Rather than crash, we return something sure to cause an error
113 return error_mark_node
;
115 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
117 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
119 tree t
= complete_type (TREE_TYPE (type
));
120 unsigned int needs_constructing
, has_nontrivial_dtor
;
121 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
124 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
126 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
127 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
129 TYPE_NEEDS_CONSTRUCTING (t
) = needs_constructing
;
130 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = has_nontrivial_dtor
;
133 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
134 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
139 /* Like complete_type, but issue an error if the TYPE cannot be completed.
140 VALUE is used for informative diagnostics.
141 Returns NULL_TREE if the type cannot be made complete. */
144 complete_type_or_maybe_complain (tree type
, tree value
, tsubst_flags_t complain
)
146 type
= complete_type (type
);
147 if (type
== error_mark_node
)
148 /* We already issued an error. */
150 else if (!COMPLETE_TYPE_P (type
))
152 if (complain
& tf_error
)
153 cxx_incomplete_type_diagnostic (value
, type
, DK_ERROR
);
161 complete_type_or_else (tree type
, tree value
)
163 return complete_type_or_maybe_complain (type
, value
, tf_warning_or_error
);
166 /* Return truthvalue of whether type of EXP is instantiated. */
169 type_unknown_p (const_tree exp
)
171 return (TREE_CODE (exp
) == TREE_LIST
172 || TREE_TYPE (exp
) == unknown_type_node
);
176 /* Return the common type of two parameter lists.
177 We assume that comptypes has already been done and returned 1;
178 if that isn't so, this may crash.
180 As an optimization, free the space we allocate if the parameter
181 lists are already common. */
184 commonparms (tree p1
, tree p2
)
186 tree oldargs
= p1
, newargs
, n
;
190 len
= list_length (p1
);
191 newargs
= tree_last (p1
);
193 if (newargs
== void_list_node
)
202 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
207 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
209 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
211 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
214 else if (! TREE_PURPOSE (p1
))
216 if (TREE_PURPOSE (p2
))
218 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
224 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
226 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
228 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
231 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
234 TREE_VALUE (n
) = TREE_VALUE (p1
);
242 /* Given a type, perhaps copied for a typedef,
243 find the "original" version of it. */
245 original_type (tree t
)
247 int quals
= cp_type_quals (t
);
248 while (t
!= error_mark_node
249 && TYPE_NAME (t
) != NULL_TREE
)
251 tree x
= TYPE_NAME (t
);
252 if (TREE_CODE (x
) != TYPE_DECL
)
254 x
= DECL_ORIGINAL_TYPE (x
);
259 return cp_build_qualified_type (t
, quals
);
262 /* Return the common type for two arithmetic types T1 and T2 under the
263 usual arithmetic conversions. The default conversions have already
264 been applied, and enumerated types converted to their compatible
268 cp_common_type (tree t1
, tree t2
)
270 enum tree_code code1
= TREE_CODE (t1
);
271 enum tree_code code2
= TREE_CODE (t2
);
275 /* In what follows, we slightly generalize the rules given in [expr] so
276 as to deal with `long long' and `complex'. First, merge the
278 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
280 if (SCOPED_ENUM_P (t1
) || SCOPED_ENUM_P (t2
))
282 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
283 return build_type_attribute_variant (t1
, attributes
);
288 /* FIXME: Attributes. */
289 gcc_assert (ARITHMETIC_TYPE_P (t1
)
290 || TREE_CODE (t1
) == VECTOR_TYPE
291 || UNSCOPED_ENUM_P (t1
));
292 gcc_assert (ARITHMETIC_TYPE_P (t2
)
293 || TREE_CODE (t2
) == VECTOR_TYPE
294 || UNSCOPED_ENUM_P (t2
));
296 /* If one type is complex, form the common type of the non-complex
297 components, then make that complex. Use T1 or T2 if it is the
299 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
301 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
302 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
304 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
306 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
307 return build_type_attribute_variant (t1
, attributes
);
308 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
309 return build_type_attribute_variant (t2
, attributes
);
311 return build_type_attribute_variant (build_complex_type (subtype
),
315 if (code1
== VECTOR_TYPE
)
317 /* When we get here we should have two vectors of the same size.
318 Just prefer the unsigned one if present. */
319 if (TYPE_UNSIGNED (t1
))
320 return build_type_attribute_variant (t1
, attributes
);
322 return build_type_attribute_variant (t2
, attributes
);
325 /* If only one is real, use it as the result. */
326 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
327 return build_type_attribute_variant (t1
, attributes
);
328 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
329 return build_type_attribute_variant (t2
, attributes
);
331 /* Both real or both integers; use the one with greater precision. */
332 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
333 return build_type_attribute_variant (t1
, attributes
);
334 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
335 return build_type_attribute_variant (t2
, attributes
);
337 /* The types are the same; no need to do anything fancy. */
338 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
339 return build_type_attribute_variant (t1
, attributes
);
341 if (code1
!= REAL_TYPE
)
343 /* If one is unsigned long long, then convert the other to unsigned
345 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
346 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
347 return build_type_attribute_variant (long_long_unsigned_type_node
,
349 /* If one is a long long, and the other is an unsigned long, and
350 long long can represent all the values of an unsigned long, then
351 convert to a long long. Otherwise, convert to an unsigned long
352 long. Otherwise, if either operand is long long, convert the
355 Since we're here, we know the TYPE_PRECISION is the same;
356 therefore converting to long long cannot represent all the values
357 of an unsigned long, so we choose unsigned long long in that
359 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
360 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
362 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
363 ? long_long_unsigned_type_node
364 : long_long_integer_type_node
);
365 return build_type_attribute_variant (t
, attributes
);
367 if (int128_integer_type_node
!= NULL_TREE
368 && (same_type_p (TYPE_MAIN_VARIANT (t1
),
369 int128_integer_type_node
)
370 || same_type_p (TYPE_MAIN_VARIANT (t2
),
371 int128_integer_type_node
)))
373 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
374 ? int128_unsigned_type_node
375 : int128_integer_type_node
);
376 return build_type_attribute_variant (t
, attributes
);
379 /* Go through the same procedure, but for longs. */
380 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
381 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
382 return build_type_attribute_variant (long_unsigned_type_node
,
384 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
385 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
387 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
388 ? long_unsigned_type_node
: long_integer_type_node
);
389 return build_type_attribute_variant (t
, attributes
);
391 /* Otherwise prefer the unsigned one. */
392 if (TYPE_UNSIGNED (t1
))
393 return build_type_attribute_variant (t1
, attributes
);
395 return build_type_attribute_variant (t2
, attributes
);
399 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
400 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
401 return build_type_attribute_variant (long_double_type_node
,
403 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
404 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
405 return build_type_attribute_variant (double_type_node
,
407 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
408 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
409 return build_type_attribute_variant (float_type_node
,
412 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
413 the standard C++ floating-point types. Logic earlier in this
414 function has already eliminated the possibility that
415 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
416 compelling reason to choose one or the other. */
417 return build_type_attribute_variant (t1
, attributes
);
421 /* T1 and T2 are arithmetic or enumeration types. Return the type
422 that will result from the "usual arithmetic conversions" on T1 and
423 T2 as described in [expr]. */
426 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
428 gcc_assert (ARITHMETIC_TYPE_P (t1
)
429 || TREE_CODE (t1
) == VECTOR_TYPE
430 || UNSCOPED_ENUM_P (t1
));
431 gcc_assert (ARITHMETIC_TYPE_P (t2
)
432 || TREE_CODE (t2
) == VECTOR_TYPE
433 || UNSCOPED_ENUM_P (t2
));
435 /* Perform the integral promotions. We do not promote real types here. */
436 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1
)
437 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2
))
439 t1
= type_promotes_to (t1
);
440 t2
= type_promotes_to (t2
);
443 return cp_common_type (t1
, t2
);
446 /* Subroutine of composite_pointer_type to implement the recursive
447 case. See that function for documentation of the parameters. */
450 composite_pointer_type_r (tree t1
, tree t2
,
451 composite_pointer_operation operation
,
452 tsubst_flags_t complain
)
459 /* Determine the types pointed to by T1 and T2. */
460 if (TREE_CODE (t1
) == POINTER_TYPE
)
462 pointee1
= TREE_TYPE (t1
);
463 pointee2
= TREE_TYPE (t2
);
467 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
468 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
473 Otherwise, the composite pointer type is a pointer type
474 similar (_conv.qual_) to the type of one of the operands,
475 with a cv-qualification signature (_conv.qual_) that is the
476 union of the cv-qualification signatures of the operand
478 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
479 result_type
= pointee1
;
480 else if ((TREE_CODE (pointee1
) == POINTER_TYPE
481 && TREE_CODE (pointee2
) == POINTER_TYPE
)
482 || (TYPE_PTR_TO_MEMBER_P (pointee1
)
483 && TYPE_PTR_TO_MEMBER_P (pointee2
)))
484 result_type
= composite_pointer_type_r (pointee1
, pointee2
, operation
,
488 if (complain
& tf_error
)
493 permerror (input_location
, "comparison between "
494 "distinct pointer types %qT and %qT lacks a cast",
498 permerror (input_location
, "conversion between "
499 "distinct pointer types %qT and %qT lacks a cast",
502 case CPO_CONDITIONAL_EXPR
:
503 permerror (input_location
, "conditional expression between "
504 "distinct pointer types %qT and %qT lacks a cast",
511 result_type
= void_type_node
;
513 result_type
= cp_build_qualified_type (result_type
,
514 (cp_type_quals (pointee1
)
515 | cp_type_quals (pointee2
)));
516 /* If the original types were pointers to members, so is the
518 if (TYPE_PTR_TO_MEMBER_P (t1
))
520 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
521 TYPE_PTRMEM_CLASS_TYPE (t2
))
522 && (complain
& tf_error
))
527 permerror (input_location
, "comparison between "
528 "distinct pointer types %qT and %qT lacks a cast",
532 permerror (input_location
, "conversion between "
533 "distinct pointer types %qT and %qT lacks a cast",
536 case CPO_CONDITIONAL_EXPR
:
537 permerror (input_location
, "conditional expression between "
538 "distinct pointer types %qT and %qT lacks a cast",
545 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
549 result_type
= build_pointer_type (result_type
);
551 /* Merge the attributes. */
552 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
553 return build_type_attribute_variant (result_type
, attributes
);
556 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
557 ARG1 and ARG2 are the values with those types. The OPERATION is to
558 describe the operation between the pointer types,
559 in case an error occurs.
561 This routine also implements the computation of a common type for
562 pointers-to-members as per [expr.eq]. */
565 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
566 composite_pointer_operation operation
,
567 tsubst_flags_t complain
)
574 If one operand is a null pointer constant, the composite pointer
575 type is the type of the other operand. */
576 if (null_ptr_cst_p (arg1
))
578 if (null_ptr_cst_p (arg2
))
585 If one of the operands has type "pointer to cv1 void*", then
586 the other has type "pointer to cv2T", and the composite pointer
587 type is "pointer to cv12 void", where cv12 is the union of cv1
590 If either type is a pointer to void, make sure it is T1. */
591 if (TREE_CODE (t2
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t2
)))
599 /* Now, if T1 is a pointer to void, merge the qualifiers. */
600 if (TREE_CODE (t1
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t1
)))
605 if (TYPE_PTRFN_P (t2
) && (complain
& tf_error
))
610 pedwarn (input_location
, OPT_pedantic
,
611 "ISO C++ forbids comparison between "
612 "pointer of type %<void *%> and pointer-to-function");
615 pedwarn (input_location
, OPT_pedantic
,
616 "ISO C++ forbids conversion between "
617 "pointer of type %<void *%> and pointer-to-function");
619 case CPO_CONDITIONAL_EXPR
:
620 pedwarn (input_location
, OPT_pedantic
,
621 "ISO C++ forbids conditional expression between "
622 "pointer of type %<void *%> and pointer-to-function");
629 = cp_build_qualified_type (void_type_node
,
630 (cp_type_quals (TREE_TYPE (t1
))
631 | cp_type_quals (TREE_TYPE (t2
))));
632 result_type
= build_pointer_type (result_type
);
633 /* Merge the attributes. */
634 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
635 return build_type_attribute_variant (result_type
, attributes
);
638 if (c_dialect_objc () && TREE_CODE (t1
) == POINTER_TYPE
639 && TREE_CODE (t2
) == POINTER_TYPE
)
641 if (objc_have_common_type (t1
, t2
, -3, NULL_TREE
))
642 return objc_common_type (t1
, t2
);
645 /* [expr.eq] permits the application of a pointer conversion to
646 bring the pointers to a common type. */
647 if (TREE_CODE (t1
) == POINTER_TYPE
&& TREE_CODE (t2
) == POINTER_TYPE
648 && CLASS_TYPE_P (TREE_TYPE (t1
))
649 && CLASS_TYPE_P (TREE_TYPE (t2
))
650 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
653 class1
= TREE_TYPE (t1
);
654 class2
= TREE_TYPE (t2
);
656 if (DERIVED_FROM_P (class1
, class2
))
657 t2
= (build_pointer_type
658 (cp_build_qualified_type (class1
, cp_type_quals (class2
))));
659 else if (DERIVED_FROM_P (class2
, class1
))
660 t1
= (build_pointer_type
661 (cp_build_qualified_type (class2
, cp_type_quals (class1
))));
664 if (complain
& tf_error
)
668 error ("comparison between distinct "
669 "pointer types %qT and %qT lacks a cast", t1
, t2
);
672 error ("conversion between distinct "
673 "pointer types %qT and %qT lacks a cast", t1
, t2
);
675 case CPO_CONDITIONAL_EXPR
:
676 error ("conditional expression between distinct "
677 "pointer types %qT and %qT lacks a cast", t1
, t2
);
682 return error_mark_node
;
685 /* [expr.eq] permits the application of a pointer-to-member
686 conversion to change the class type of one of the types. */
687 else if (TYPE_PTR_TO_MEMBER_P (t1
)
688 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
689 TYPE_PTRMEM_CLASS_TYPE (t2
)))
691 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
692 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
694 if (DERIVED_FROM_P (class1
, class2
))
695 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
696 else if (DERIVED_FROM_P (class2
, class1
))
697 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
700 if (complain
& tf_error
)
704 error ("comparison between distinct "
705 "pointer-to-member types %qT and %qT lacks a cast",
709 error ("conversion between distinct "
710 "pointer-to-member types %qT and %qT lacks a cast",
713 case CPO_CONDITIONAL_EXPR
:
714 error ("conditional expression between distinct "
715 "pointer-to-member types %qT and %qT lacks a cast",
721 return error_mark_node
;
725 return composite_pointer_type_r (t1
, t2
, operation
, complain
);
728 /* Return the merged type of two types.
729 We assume that comptypes has already been done and returned 1;
730 if that isn't so, this may crash.
732 This just combines attributes and default arguments; any other
733 differences would cause the two types to compare unalike. */
736 merge_types (tree t1
, tree t2
)
738 enum tree_code code1
;
739 enum tree_code code2
;
742 /* Save time if the two types are the same. */
745 if (original_type (t1
) == original_type (t2
))
748 /* If one type is nonsense, use the other. */
749 if (t1
== error_mark_node
)
751 if (t2
== error_mark_node
)
754 /* Merge the attributes. */
755 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
757 if (TYPE_PTRMEMFUNC_P (t1
))
758 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
759 if (TYPE_PTRMEMFUNC_P (t2
))
760 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
762 code1
= TREE_CODE (t1
);
763 code2
= TREE_CODE (t2
);
766 gcc_assert (code1
== TYPENAME_TYPE
|| code2
== TYPENAME_TYPE
);
767 if (code1
== TYPENAME_TYPE
)
769 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
770 code1
= TREE_CODE (t1
);
774 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
775 code2
= TREE_CODE (t2
);
783 /* For two pointers, do this recursively on the target type. */
785 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
786 int quals
= cp_type_quals (t1
);
788 if (code1
== POINTER_TYPE
)
789 t1
= build_pointer_type (target
);
791 t1
= cp_build_reference_type (target
, TYPE_REF_IS_RVALUE (t1
));
792 t1
= build_type_attribute_variant (t1
, attributes
);
793 t1
= cp_build_qualified_type (t1
, quals
);
795 if (TREE_CODE (target
) == METHOD_TYPE
)
796 t1
= build_ptrmemfunc_type (t1
);
805 quals
= cp_type_quals (t1
);
806 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
807 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
808 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
810 t1
= cp_build_qualified_type (t1
, quals
);
816 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
817 /* Save space: see if the result is identical to one of the args. */
818 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
819 return build_type_attribute_variant (t1
, attributes
);
820 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
821 return build_type_attribute_variant (t2
, attributes
);
822 /* Merge the element types, and have a size if either arg has one. */
823 t1
= build_cplus_array_type
824 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
829 /* Function types: prefer the one that specified arg types.
830 If both do, merge the arg types. Also merge the return types. */
832 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
833 tree p1
= TYPE_ARG_TYPES (t1
);
834 tree p2
= TYPE_ARG_TYPES (t2
);
838 /* Save space: see if the result is identical to one of the args. */
839 if (valtype
== TREE_TYPE (t1
) && ! p2
)
840 return cp_build_type_attribute_variant (t1
, attributes
);
841 if (valtype
== TREE_TYPE (t2
) && ! p1
)
842 return cp_build_type_attribute_variant (t2
, attributes
);
844 /* Simple way if one arg fails to specify argument types. */
845 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
847 else if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
850 parms
= commonparms (p1
, p2
);
852 rval
= build_function_type (valtype
, parms
);
853 gcc_assert (type_memfn_quals (t1
) == type_memfn_quals (t2
));
854 rval
= apply_memfn_quals (rval
, type_memfn_quals (t1
));
855 raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
856 TYPE_RAISES_EXCEPTIONS (t2
));
857 t1
= build_exception_variant (rval
, raises
);
863 /* Get this value the long way, since TYPE_METHOD_BASETYPE
864 is just the main variant of this. */
865 tree basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2
)));
866 tree raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
867 TYPE_RAISES_EXCEPTIONS (t2
));
870 /* If this was a member function type, get back to the
871 original type of type member function (i.e., without
872 the class instance variable up front. */
873 t1
= build_function_type (TREE_TYPE (t1
),
874 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
875 t2
= build_function_type (TREE_TYPE (t2
),
876 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
877 t3
= merge_types (t1
, t2
);
878 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
879 TYPE_ARG_TYPES (t3
));
880 t1
= build_exception_variant (t3
, raises
);
885 /* There is no need to merge attributes into a TYPENAME_TYPE.
886 When the type is instantiated it will have whatever
887 attributes result from the instantiation. */
893 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
895 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
898 return cp_build_type_attribute_variant (t1
, attributes
);
901 /* Return the ARRAY_TYPE type without its domain. */
904 strip_array_domain (tree type
)
907 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
908 if (TYPE_DOMAIN (type
) == NULL_TREE
)
910 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
911 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
914 /* Wrapper around cp_common_type that is used by c-common.c and other
915 front end optimizations that remove promotions.
917 Return the common type for two arithmetic types T1 and T2 under the
918 usual arithmetic conversions. The default conversions have already
919 been applied, and enumerated types converted to their compatible
923 common_type (tree t1
, tree t2
)
925 /* If one type is nonsense, use the other */
926 if (t1
== error_mark_node
)
928 if (t2
== error_mark_node
)
931 return cp_common_type (t1
, t2
);
934 /* Return the common type of two pointer types T1 and T2. This is the
935 type for the result of most arithmetic operations if the operands
936 have the given two types.
938 We assume that comp_target_types has already been done and returned
939 nonzero; if that isn't so, this may crash. */
942 common_pointer_type (tree t1
, tree t2
)
944 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
945 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
946 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
948 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
949 CPO_CONVERSION
, tf_warning_or_error
);
952 /* Compare two exception specifier types for exactness or subsetness, if
953 allowed. Returns false for mismatch, true for match (same, or
956 [except.spec] "If a class X ... objects of class X or any class publicly
957 and unambiguously derived from X. Similarly, if a pointer type Y * ...
958 exceptions of type Y * or that are pointers to any type publicly and
959 unambiguously derived from Y. Otherwise a function only allows exceptions
960 that have the same type ..."
961 This does not mention cv qualifiers and is different to what throw
962 [except.throw] and catch [except.catch] will do. They will ignore the
963 top level cv qualifiers, and allow qualifiers in the pointer to class
966 We implement the letter of the standard. */
969 comp_except_types (tree a
, tree b
, bool exact
)
971 if (same_type_p (a
, b
))
975 if (cp_type_quals (a
) || cp_type_quals (b
))
978 if (TREE_CODE (a
) == POINTER_TYPE
979 && TREE_CODE (b
) == POINTER_TYPE
)
983 if (cp_type_quals (a
) || cp_type_quals (b
))
987 if (TREE_CODE (a
) != RECORD_TYPE
988 || TREE_CODE (b
) != RECORD_TYPE
)
991 if (PUBLICLY_UNIQUELY_DERIVED_P (a
, b
))
997 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
998 If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
999 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
1000 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
1001 are unordered, but we've already filtered out duplicates. Most lists will
1002 be in order, we should try to make use of that. */
1005 comp_except_specs (const_tree t1
, const_tree t2
, int exact
)
1014 /* First handle noexcept. */
1015 if (exact
< ce_exact
)
1017 /* noexcept(false) is compatible with any throwing dynamic-exc-spec
1018 and stricter than any spec. */
1019 if (t1
== noexcept_false_spec
)
1020 return !nothrow_spec_p (t2
) || exact
== ce_derived
;
1021 /* Even a derived noexcept(false) is compatible with a throwing
1023 if (t2
== noexcept_false_spec
)
1024 return !nothrow_spec_p (t1
);
1026 /* Otherwise, if we aren't looking for an exact match, noexcept is
1027 equivalent to throw(). */
1028 if (t1
== noexcept_true_spec
)
1029 t1
= empty_except_spec
;
1030 if (t2
== noexcept_true_spec
)
1031 t2
= empty_except_spec
;
1034 /* If any noexcept is left, it is only comparable to itself;
1035 either we're looking for an exact match or we're redeclaring a
1036 template with dependent noexcept. */
1037 if ((t1
&& TREE_PURPOSE (t1
))
1038 || (t2
&& TREE_PURPOSE (t2
)))
1040 && cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)));
1042 if (t1
== NULL_TREE
) /* T1 is ... */
1043 return t2
== NULL_TREE
|| exact
== ce_derived
;
1044 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1045 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1046 if (t2
== NULL_TREE
) /* T2 is ... */
1048 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1049 return exact
== ce_derived
;
1051 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1052 Count how many we find, to determine exactness. For exact matching and
1053 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1055 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1057 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1059 tree a
= TREE_VALUE (probe
);
1060 tree b
= TREE_VALUE (t2
);
1062 if (comp_except_types (a
, b
, exact
))
1064 if (probe
== base
&& exact
> ce_derived
)
1065 base
= TREE_CHAIN (probe
);
1070 if (probe
== NULL_TREE
)
1073 return exact
== ce_derived
|| base
== NULL_TREE
|| length
== list_length (t1
);
1076 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1077 [] can match [size]. */
1080 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1089 /* The type of the array elements must be the same. */
1090 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1093 d1
= TYPE_DOMAIN (t1
);
1094 d2
= TYPE_DOMAIN (t2
);
1099 /* If one of the arrays is dimensionless, and the other has a
1100 dimension, they are of different types. However, it is valid to
1108 declarations for an array object can specify
1109 array types that differ by the presence or absence of a major
1110 array bound (_dcl.array_). */
1112 return allow_redeclaration
;
1114 /* Check that the dimensions are the same. */
1116 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1118 max1
= TYPE_MAX_VALUE (d1
);
1119 max2
= TYPE_MAX_VALUE (d2
);
1120 if (processing_template_decl
&& !abi_version_at_least (2)
1121 && !value_dependent_expression_p (max1
)
1122 && !value_dependent_expression_p (max2
))
1124 /* With abi-1 we do not fold non-dependent array bounds, (and
1125 consequently mangle them incorrectly). We must therefore
1126 fold them here, to verify the domains have the same
1132 if (!cp_tree_equal (max1
, max2
))
1138 /* Compare the relative position of T1 and T2 into their respective
1139 template parameter list.
1140 T1 and T2 must be template parameter types.
1141 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1144 comp_template_parms_position (tree t1
, tree t2
)
1146 gcc_assert (t1
&& t2
1147 && TREE_CODE (t1
) == TREE_CODE (t2
)
1148 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1149 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1150 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1152 if (TEMPLATE_TYPE_IDX (t1
) != TEMPLATE_TYPE_IDX (t2
)
1153 || TEMPLATE_TYPE_LEVEL (t1
) != TEMPLATE_TYPE_LEVEL (t2
)
1154 || (TEMPLATE_TYPE_PARAMETER_PACK (t1
)
1155 != TEMPLATE_TYPE_PARAMETER_PACK (t2
)))
1161 /* Subroutine of incompatible_dependent_types_p.
1162 Return the template parameter of the dependent type T.
1163 If T is a typedef, return the template parameters of
1164 the _decl_ of the typedef. T must be a dependent type. */
1167 get_template_parms_of_dependent_type (tree t
)
1169 tree tinfo
= NULL_TREE
, tparms
= NULL_TREE
;
1171 /* First, try the obvious case of getting the
1172 template info from T itself. */
1173 if ((tinfo
= get_template_info (t
)))
1175 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
1176 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (t
);
1177 else if (typedef_variant_p (t
)
1178 && !NAMESPACE_SCOPE_P (TYPE_NAME (t
)))
1179 tinfo
= get_template_info (DECL_CONTEXT (TYPE_NAME (t
)));
1180 /* If T is a TYPENAME_TYPE which context is a template type
1181 parameter, get the template parameters from that context. */
1182 else if (TYPE_CONTEXT (t
)
1183 && TREE_CODE (TYPE_CONTEXT (t
)) == TEMPLATE_TYPE_PARM
)
1184 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (TYPE_CONTEXT (t
));
1185 else if (TYPE_CONTEXT (t
)
1186 && !NAMESPACE_SCOPE_P (t
))
1187 tinfo
= get_template_info (TYPE_CONTEXT (t
));
1190 tparms
= DECL_TEMPLATE_PARMS (TI_TEMPLATE (tinfo
));
1195 /* Subroutine of structural_comptypes.
1196 Compare the dependent types T1 and T2.
1197 Return TRUE if we are sure they can't be equal, FALSE otherwise.
1198 The whole point of this function is to support cases where either T1 or
1199 T2 is a typedef. In those cases, we need to compare the template parameters
1200 of the _decl_ of the typedef. If those don't match then we know T1
1201 and T2 cannot be equal. */
1204 incompatible_dependent_types_p (tree t1
, tree t2
)
1206 tree tparms1
= NULL_TREE
, tparms2
= NULL_TREE
;
1207 bool t1_typedef_variant_p
, t2_typedef_variant_p
;
1209 if (!uses_template_parms (t1
) || !uses_template_parms (t2
))
1212 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
)
1214 /* If T1 and T2 don't have the same relative position in their
1215 template parameters set, they can't be equal. */
1216 if (!comp_template_parms_position (t1
, t2
))
1220 t1_typedef_variant_p
= typedef_variant_p (t1
);
1221 t2_typedef_variant_p
= typedef_variant_p (t2
);
1223 /* Either T1 or T2 must be a typedef. */
1224 if (!t1_typedef_variant_p
&& !t2_typedef_variant_p
)
1227 if (!t1_typedef_variant_p
|| !t2_typedef_variant_p
)
1228 /* Either T1 or T2 is not a typedef so we cannot compare the
1229 template parms of the typedefs of T1 and T2.
1230 At this point, if the main variant type of T1 and T2 are equal
1231 it means the two types can't be incompatible, from the perspective
1232 of this function. */
1233 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1236 /* So if we reach this point, it means either T1 or T2 is a typedef variant.
1237 Let's compare their template parameters. */
1239 tparms1
= get_template_parms_of_dependent_type (t1
);
1240 tparms2
= get_template_parms_of_dependent_type (t2
);
1242 /* If T2 is a template type parm and if we could not get the template
1243 parms it belongs to, that means we have not finished parsing the
1244 full set of template parameters of the template declaration it
1245 belongs to yet. If we could get the template parms T1 belongs to,
1246 that mostly means T1 and T2 belongs to templates that are
1247 different and incompatible. */
1248 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
1249 && (tparms1
== NULL_TREE
|| tparms2
== NULL_TREE
)
1250 && tparms1
!= tparms2
)
1253 if (tparms1
== NULL_TREE
1254 || tparms2
== NULL_TREE
1255 || tparms1
== tparms2
)
1258 /* And now compare the mighty template parms! */
1259 return !comp_template_parms (tparms1
, tparms2
);
1262 /* Subroutine in comptypes. */
1265 structural_comptypes (tree t1
, tree t2
, int strict
)
1270 /* Suppress errors caused by previously reported errors. */
1271 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1274 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1276 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1277 current instantiation. */
1278 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1279 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1281 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1282 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1284 if (TYPE_PTRMEMFUNC_P (t1
))
1285 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1286 if (TYPE_PTRMEMFUNC_P (t2
))
1287 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1289 /* Different classes of types can't be compatible. */
1290 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1293 /* Qualifiers must match. For array types, we will check when we
1294 recur on the array element types. */
1295 if (TREE_CODE (t1
) != ARRAY_TYPE
1296 && cp_type_quals (t1
) != cp_type_quals (t2
))
1298 if (TREE_CODE (t1
) == FUNCTION_TYPE
1299 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1301 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1304 /* If T1 and T2 are dependent typedefs then check upfront that
1305 the template parameters of their typedef DECLs match before
1306 going down checking their subtypes. */
1307 if (incompatible_dependent_types_p (t1
, t2
))
1310 /* Allow for two different type nodes which have essentially the same
1311 definition. Note that we already checked for equality of the type
1312 qualifiers (just above). */
1314 if (TREE_CODE (t1
) != ARRAY_TYPE
1315 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1319 /* Compare the types. Break out if they could be the same. */
1320 switch (TREE_CODE (t1
))
1324 /* All void and bool types are the same. */
1328 case FIXED_POINT_TYPE
:
1330 /* With these nodes, we can't determine type equivalence by
1331 looking at what is stored in the nodes themselves, because
1332 two nodes might have different TYPE_MAIN_VARIANTs but still
1333 represent the same type. For example, wchar_t and int could
1334 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1335 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1336 and are distinct types. On the other hand, int and the
1339 typedef int INT __attribute((may_alias));
1341 have identical properties, different TYPE_MAIN_VARIANTs, but
1342 represent the same type. The canonical type system keeps
1343 track of equivalence in this case, so we fall back on it. */
1344 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1346 case TEMPLATE_TEMPLATE_PARM
:
1347 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1348 if (!comp_template_parms_position (t1
, t2
))
1350 if (!comp_template_parms
1351 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1352 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1354 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1356 /* Don't check inheritance. */
1357 strict
= COMPARE_STRICT
;
1362 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1363 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1364 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1365 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1368 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1370 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1376 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1377 strict
& ~COMPARE_REDECLARATION
))
1379 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1383 case REFERENCE_TYPE
:
1384 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1386 /* fall through to checks for pointer types */
1389 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1390 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
)
1391 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1397 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1399 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1404 /* Target types must match incl. qualifiers. */
1405 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1409 case TEMPLATE_TYPE_PARM
:
1410 /* If incompatible_dependent_types_p called earlier didn't decide
1411 T1 and T2 were different, they might be equal. */
1415 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1416 TYPENAME_TYPE_FULLNAME (t2
)))
1418 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1422 case UNBOUND_CLASS_TEMPLATE
:
1423 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1425 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1430 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1435 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1436 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1440 case TYPE_PACK_EXPANSION
:
1441 return same_type_p (PACK_EXPANSION_PATTERN (t1
),
1442 PACK_EXPANSION_PATTERN (t2
));
1445 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1446 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1447 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1448 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1449 || (DECLTYPE_FOR_LAMBDA_RETURN (t1
)
1450 != DECLTYPE_FOR_LAMBDA_RETURN (t2
))
1451 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1452 DECLTYPE_TYPE_EXPR (t2
)))
1460 /* If we get here, we know that from a target independent POV the
1461 types are the same. Make sure the target attributes are also
1463 return targetm
.comp_type_attributes (t1
, t2
);
1466 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1467 is a bitwise-or of the COMPARE_* flags. */
1470 comptypes (tree t1
, tree t2
, int strict
)
1472 if (strict
== COMPARE_STRICT
)
1477 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1480 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1481 /* At least one of the types requires structural equality, so
1482 perform a deep check. */
1483 return structural_comptypes (t1
, t2
, strict
);
1485 #ifdef ENABLE_CHECKING
1486 if (USE_CANONICAL_TYPES
)
1488 bool result
= structural_comptypes (t1
, t2
, strict
);
1490 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1491 /* The two types are structurally equivalent, but their
1492 canonical types were different. This is a failure of the
1493 canonical type propagation code.*/
1495 ("canonical types differ for identical types %T and %T",
1497 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1498 /* Two types are structurally different, but the canonical
1499 types are the same. This means we were over-eager in
1500 assigning canonical types. */
1502 ("same canonical type node for different types %T and %T",
1508 if (USE_CANONICAL_TYPES
)
1509 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1512 return structural_comptypes (t1
, t2
, strict
);
1514 else if (strict
== COMPARE_STRUCTURAL
)
1515 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1517 return structural_comptypes (t1
, t2
, strict
);
1520 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1521 top-level qualifiers. */
1524 same_type_ignoring_top_level_qualifiers_p (tree type1
, tree type2
)
1526 if (type1
== error_mark_node
|| type2
== error_mark_node
)
1529 return same_type_p (TYPE_MAIN_VARIANT (type1
), TYPE_MAIN_VARIANT (type2
));
1532 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1535 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1537 int q1
= cp_type_quals (type1
);
1538 int q2
= cp_type_quals (type2
);
1540 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1541 return (q1
& q2
) == q2
;
1544 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1545 more cv-qualified that TYPE1, and 0 otherwise. */
1548 comp_cv_qualification (const_tree type1
, const_tree type2
)
1550 int q1
= cp_type_quals (type1
);
1551 int q2
= cp_type_quals (type2
);
1556 if ((q1
& q2
) == q2
)
1558 else if ((q1
& q2
) == q1
)
1564 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1565 subset of the cv-qualification signature of TYPE2, and the types
1566 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1569 comp_cv_qual_signature (tree type1
, tree type2
)
1571 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1573 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1579 /* Subroutines of `comptypes'. */
1581 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1582 equivalent in the sense that functions with those parameter types
1583 can have equivalent types. The two lists must be equivalent,
1584 element by element. */
1587 compparms (const_tree parms1
, const_tree parms2
)
1591 /* An unspecified parmlist matches any specified parmlist
1592 whose argument types don't need default promotions. */
1594 for (t1
= parms1
, t2
= parms2
;
1596 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1598 /* If one parmlist is shorter than the other,
1599 they fail to match. */
1602 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1609 /* Process a sizeof or alignof expression where the operand is a
1613 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1618 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1619 if (type
== error_mark_node
)
1620 return error_mark_node
;
1622 type
= non_reference (type
);
1623 if (TREE_CODE (type
) == METHOD_TYPE
)
1626 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
1627 "invalid application of %qs to a member function",
1628 operator_name_info
[(int) op
].name
);
1629 value
= size_one_node
;
1632 dependent_p
= dependent_type_p (type
);
1634 complete_type (type
);
1636 /* VLA types will have a non-constant size. In the body of an
1637 uninstantiated template, we don't need to try to compute the
1638 value, because the sizeof expression is not an integral
1639 constant expression in that case. And, if we do try to
1640 compute the value, we'll likely end up with SAVE_EXPRs, which
1641 the template substitution machinery does not expect to see. */
1642 || (processing_template_decl
1643 && COMPLETE_TYPE_P (type
)
1644 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1646 value
= build_min (op
, size_type_node
, type
);
1647 TREE_READONLY (value
) = 1;
1651 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1656 /* Return the size of the type, without producing any warnings for
1657 types whose size cannot be taken. This routine should be used only
1658 in some other routine that has already produced a diagnostic about
1659 using the size of such a type. */
1661 cxx_sizeof_nowarn (tree type
)
1663 if (TREE_CODE (type
) == FUNCTION_TYPE
1664 || TREE_CODE (type
) == VOID_TYPE
1665 || TREE_CODE (type
) == ERROR_MARK
)
1666 return size_one_node
;
1667 else if (!COMPLETE_TYPE_P (type
))
1668 return size_zero_node
;
1670 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1673 /* Process a sizeof expression where the operand is an expression. */
1676 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1678 if (e
== error_mark_node
)
1679 return error_mark_node
;
1681 if (processing_template_decl
)
1683 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1684 TREE_SIDE_EFFECTS (e
) = 0;
1685 TREE_READONLY (e
) = 1;
1690 /* To get the size of a static data member declared as an array of
1691 unknown bound, we need to instantiate it. */
1692 if (TREE_CODE (e
) == VAR_DECL
1693 && VAR_HAD_UNKNOWN_BOUND (e
)
1694 && DECL_TEMPLATE_INSTANTIATION (e
))
1695 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1697 e
= mark_type_use (e
);
1699 if (TREE_CODE (e
) == COMPONENT_REF
1700 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1701 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1703 if (complain
& tf_error
)
1704 error ("invalid application of %<sizeof%> to a bit-field");
1706 return error_mark_node
;
1709 else if (is_overloaded_fn (e
))
1711 if (complain
& tf_error
)
1712 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1715 return error_mark_node
;
1718 else if (type_unknown_p (e
))
1720 if (complain
& tf_error
)
1721 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1723 return error_mark_node
;
1729 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1732 /* Implement the __alignof keyword: Return the minimum required
1733 alignment of E, measured in bytes. For VAR_DECL's and
1734 FIELD_DECL's return DECL_ALIGN (which can be set from an
1735 "aligned" __attribute__ specification). */
1738 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1742 if (e
== error_mark_node
)
1743 return error_mark_node
;
1745 if (processing_template_decl
)
1747 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1748 TREE_SIDE_EFFECTS (e
) = 0;
1749 TREE_READONLY (e
) = 1;
1754 e
= mark_type_use (e
);
1756 if (TREE_CODE (e
) == VAR_DECL
)
1757 t
= size_int (DECL_ALIGN_UNIT (e
));
1758 else if (TREE_CODE (e
) == COMPONENT_REF
1759 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1760 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1762 if (complain
& tf_error
)
1763 error ("invalid application of %<__alignof%> to a bit-field");
1765 return error_mark_node
;
1768 else if (TREE_CODE (e
) == COMPONENT_REF
1769 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1770 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1771 else if (is_overloaded_fn (e
))
1773 if (complain
& tf_error
)
1774 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1777 return error_mark_node
;
1778 if (TREE_CODE (e
) == FUNCTION_DECL
)
1779 t
= size_int (DECL_ALIGN_UNIT (e
));
1783 else if (type_unknown_p (e
))
1785 if (complain
& tf_error
)
1786 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1788 return error_mark_node
;
1792 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1793 complain
& tf_error
);
1795 return fold_convert (size_type_node
, t
);
1798 /* Process a sizeof or alignof expression E with code OP where the operand
1799 is an expression. */
1802 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1804 if (op
== SIZEOF_EXPR
)
1805 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1807 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1810 /* EXPR is being used in a context that is not a function call.
1815 The expression can be used only as the left-hand operand of a
1816 member function call.
1818 [expr.mptr.operator]
1820 If the result of .* or ->* is a function, then that result can be
1821 used only as the operand for the function call operator ().
1823 by issuing an error message if appropriate. Returns true iff EXPR
1824 violates these rules. */
1827 invalid_nonstatic_memfn_p (const_tree expr
, tsubst_flags_t complain
)
1829 if (expr
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1831 if (complain
& tf_error
)
1832 error ("invalid use of non-static member function");
1838 /* If EXP is a reference to a bitfield, and the type of EXP does not
1839 match the declared type of the bitfield, return the declared type
1840 of the bitfield. Otherwise, return NULL_TREE. */
1843 is_bitfield_expr_with_lowered_type (const_tree exp
)
1845 switch (TREE_CODE (exp
))
1848 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1849 ? TREE_OPERAND (exp
, 1)
1850 : TREE_OPERAND (exp
, 0)))
1852 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1855 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1859 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1865 field
= TREE_OPERAND (exp
, 1);
1866 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1868 if (same_type_ignoring_top_level_qualifiers_p
1869 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1871 return DECL_BIT_FIELD_TYPE (field
);
1875 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1876 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1877 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1885 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1886 bitfield with a lowered type, the type of EXP is returned, rather
1890 unlowered_expr_type (const_tree exp
)
1894 type
= is_bitfield_expr_with_lowered_type (exp
);
1896 type
= TREE_TYPE (exp
);
1901 /* Perform the conversions in [expr] that apply when an lvalue appears
1902 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1903 function-to-pointer conversions. In addition, manifest constants
1904 are replaced by their values, and bitfield references are converted
1905 to their declared types. Note that this function does not perform the
1906 lvalue-to-rvalue conversion for class types. If you need that conversion
1907 to for class types, then you probably need to use force_rvalue.
1909 Although the returned value is being used as an rvalue, this
1910 function does not wrap the returned expression in a
1911 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1912 that the return value is no longer an lvalue. */
1915 decay_conversion (tree exp
)
1918 enum tree_code code
;
1920 type
= TREE_TYPE (exp
);
1921 if (type
== error_mark_node
)
1922 return error_mark_node
;
1924 exp
= mark_rvalue_use (exp
);
1926 exp
= resolve_nondeduced_context (exp
);
1927 if (type_unknown_p (exp
))
1929 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1930 return error_mark_node
;
1933 /* FIXME remove? at least need to remember that this isn't really a
1934 constant expression if EXP isn't decl_constant_var_p, like with
1935 C_MAYBE_CONST_EXPR. */
1936 exp
= decl_constant_value (exp
);
1937 if (error_operand_p (exp
))
1938 return error_mark_node
;
1940 if (NULLPTR_TYPE_P (type
))
1941 return nullptr_node
;
1943 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1944 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1945 code
= TREE_CODE (type
);
1946 if (code
== VOID_TYPE
)
1948 error ("void value not ignored as it ought to be");
1949 return error_mark_node
;
1951 if (invalid_nonstatic_memfn_p (exp
, tf_warning_or_error
))
1952 return error_mark_node
;
1953 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1954 return cp_build_addr_expr (exp
, tf_warning_or_error
);
1955 if (code
== ARRAY_TYPE
)
1960 if (TREE_CODE (exp
) == INDIRECT_REF
)
1961 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1962 TREE_OPERAND (exp
, 0));
1964 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1966 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1967 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1968 TREE_OPERAND (exp
, 0), op1
);
1972 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1974 error ("invalid use of non-lvalue array");
1975 return error_mark_node
;
1978 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1980 if (TREE_CODE (exp
) == VAR_DECL
)
1982 if (!cxx_mark_addressable (exp
))
1983 return error_mark_node
;
1984 adr
= build_nop (ptrtype
, build_address (exp
));
1987 /* This way is better for a COMPONENT_REF since it can
1988 simplify the offset for a component. */
1989 adr
= cp_build_addr_expr (exp
, tf_warning_or_error
);
1990 return cp_convert (ptrtype
, adr
);
1993 /* If a bitfield is used in a context where integral promotion
1994 applies, then the caller is expected to have used
1995 default_conversion. That function promotes bitfields correctly
1996 before calling this function. At this point, if we have a
1997 bitfield referenced, we may assume that is not subject to
1998 promotion, and that, therefore, the type of the resulting rvalue
1999 is the declared type of the bitfield. */
2000 exp
= convert_bitfield_to_declared_type (exp
);
2002 /* We do not call rvalue() here because we do not want to wrap EXP
2003 in a NON_LVALUE_EXPR. */
2007 Non-class rvalues always have cv-unqualified types. */
2008 type
= TREE_TYPE (exp
);
2009 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
2010 exp
= build_nop (cv_unqualified (type
), exp
);
2015 /* Perform preparatory conversions, as part of the "usual arithmetic
2016 conversions". In particular, as per [expr]:
2018 Whenever an lvalue expression appears as an operand of an
2019 operator that expects the rvalue for that operand, the
2020 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
2021 standard conversions are applied to convert the expression to an
2024 In addition, we perform integral promotions here, as those are
2025 applied to both operands to a binary operator before determining
2026 what additional conversions should apply. */
2029 default_conversion (tree exp
)
2031 /* Check for target-specific promotions. */
2032 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
2034 exp
= cp_convert (promoted_type
, exp
);
2035 /* Perform the integral promotions first so that bitfield
2036 expressions (which may promote to "int", even if the bitfield is
2037 declared "unsigned") are promoted correctly. */
2038 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
2039 exp
= perform_integral_promotions (exp
);
2040 /* Perform the other conversions. */
2041 exp
= decay_conversion (exp
);
2046 /* EXPR is an expression with an integral or enumeration type.
2047 Perform the integral promotions in [conv.prom], and return the
2051 perform_integral_promotions (tree expr
)
2056 expr
= mark_rvalue_use (expr
);
2060 If the bitfield has an enumerated type, it is treated as any
2061 other value of that type for promotion purposes. */
2062 type
= is_bitfield_expr_with_lowered_type (expr
);
2063 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
2064 type
= TREE_TYPE (expr
);
2065 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
2066 promoted_type
= type_promotes_to (type
);
2067 if (type
!= promoted_type
)
2068 expr
= cp_convert (promoted_type
, expr
);
2072 /* Returns nonzero iff exp is a STRING_CST or the result of applying
2073 decay_conversion to one. */
2076 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
2080 if (TREE_CODE (totype
) != POINTER_TYPE
)
2083 t
= TREE_TYPE (totype
);
2084 if (!same_type_p (t
, char_type_node
)
2085 && !same_type_p (t
, char16_type_node
)
2086 && !same_type_p (t
, char32_type_node
)
2087 && !same_type_p (t
, wchar_type_node
))
2090 if (TREE_CODE (exp
) == STRING_CST
)
2092 /* Make sure that we don't try to convert between char and wide chars. */
2093 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
2098 /* Is this a string constant which has decayed to 'const char *'? */
2099 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
2100 if (!same_type_p (TREE_TYPE (exp
), t
))
2103 if (TREE_CODE (exp
) != ADDR_EXPR
2104 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2108 /* This warning is not very useful, as it complains about printf. */
2110 warning (OPT_Wwrite_strings
,
2111 "deprecated conversion from string constant to %qT",
2117 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2118 can, for example, use as an lvalue. This code used to be in
2119 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2120 expressions, where we're dealing with aggregates. But now it's again only
2121 called from unary_complex_lvalue. The case (in particular) that led to
2122 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2126 rationalize_conditional_expr (enum tree_code code
, tree t
,
2127 tsubst_flags_t complain
)
2129 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2130 the first operand is always the one to be used if both operands
2131 are equal, so we know what conditional expression this used to be. */
2132 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2134 tree op0
= TREE_OPERAND (t
, 0);
2135 tree op1
= TREE_OPERAND (t
, 1);
2137 /* The following code is incorrect if either operand side-effects. */
2138 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2139 && !TREE_SIDE_EFFECTS (op1
));
2141 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
2142 ? LE_EXPR
: GE_EXPR
),
2143 op0
, TREE_CODE (op0
),
2144 op1
, TREE_CODE (op1
),
2145 /*overloaded_p=*/NULL
,
2147 cp_build_unary_op (code
, op0
, 0, complain
),
2148 cp_build_unary_op (code
, op1
, 0, complain
),
2153 build_conditional_expr (TREE_OPERAND (t
, 0),
2154 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2156 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2161 /* Given the TYPE of an anonymous union field inside T, return the
2162 FIELD_DECL for the field. If not found return NULL_TREE. Because
2163 anonymous unions can nest, we must also search all anonymous unions
2164 that are directly reachable. */
2167 lookup_anon_field (tree t
, tree type
)
2171 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2173 if (TREE_STATIC (field
))
2175 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2178 /* If we find it directly, return the field. */
2179 if (DECL_NAME (field
) == NULL_TREE
2180 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2185 /* Otherwise, it could be nested, search harder. */
2186 if (DECL_NAME (field
) == NULL_TREE
2187 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2189 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2197 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2198 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2199 non-NULL, it indicates the path to the base used to name MEMBER.
2200 If PRESERVE_REFERENCE is true, the expression returned will have
2201 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2202 returned will have the type referred to by the reference.
2204 This function does not perform access control; that is either done
2205 earlier by the parser when the name of MEMBER is resolved to MEMBER
2206 itself, or later when overload resolution selects one of the
2207 functions indicated by MEMBER. */
2210 build_class_member_access_expr (tree object
, tree member
,
2211 tree access_path
, bool preserve_reference
,
2212 tsubst_flags_t complain
)
2216 tree result
= NULL_TREE
;
2218 if (error_operand_p (object
) || error_operand_p (member
))
2219 return error_mark_node
;
2221 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2225 The type of the first expression shall be "class object" (of a
2227 object_type
= TREE_TYPE (object
);
2228 if (!currently_open_class (object_type
)
2229 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2230 return error_mark_node
;
2231 if (!CLASS_TYPE_P (object_type
))
2233 if (complain
& tf_error
)
2234 error ("request for member %qD in %qE, which is of non-class type %qT",
2235 member
, object
, object_type
);
2236 return error_mark_node
;
2239 /* The standard does not seem to actually say that MEMBER must be a
2240 member of OBJECT_TYPE. However, that is clearly what is
2242 if (DECL_P (member
))
2244 member_scope
= DECL_CLASS_CONTEXT (member
);
2246 if (TREE_DEPRECATED (member
))
2247 warn_deprecated_use (member
, NULL_TREE
);
2250 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2251 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2252 presently be the anonymous union. Go outwards until we find a
2253 type related to OBJECT_TYPE. */
2254 while (ANON_AGGR_TYPE_P (member_scope
)
2255 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2257 member_scope
= TYPE_CONTEXT (member_scope
);
2258 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2260 if (complain
& tf_error
)
2262 if (TREE_CODE (member
) == FIELD_DECL
)
2263 error ("invalid use of nonstatic data member %qE", member
);
2265 error ("%qD is not a member of %qT", member
, object_type
);
2267 return error_mark_node
;
2270 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2271 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2272 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2274 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2276 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2279 /* In [expr.ref], there is an explicit list of the valid choices for
2280 MEMBER. We check for each of those cases here. */
2281 if (TREE_CODE (member
) == VAR_DECL
)
2283 /* A static data member. */
2285 mark_exp_read (object
);
2286 /* If OBJECT has side-effects, they are supposed to occur. */
2287 if (TREE_SIDE_EFFECTS (object
))
2288 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2290 else if (TREE_CODE (member
) == FIELD_DECL
)
2292 /* A non-static data member. */
2297 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
2298 && integer_zerop (TREE_OPERAND (object
, 0)));
2300 /* Convert OBJECT to the type of MEMBER. */
2301 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2302 TYPE_MAIN_VARIANT (member_scope
)))
2307 binfo
= lookup_base (access_path
? access_path
: object_type
,
2308 member_scope
, ba_unique
, &kind
);
2309 if (binfo
== error_mark_node
)
2310 return error_mark_node
;
2312 /* It is invalid to try to get to a virtual base of a
2313 NULL object. The most common cause is invalid use of
2315 if (null_object_p
&& kind
== bk_via_virtual
)
2317 if (complain
& tf_error
)
2319 error ("invalid access to non-static data member %qD of "
2322 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2324 return error_mark_node
;
2327 /* Convert to the base. */
2328 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2330 /* If we found the base successfully then we should be able
2331 to convert to it successfully. */
2332 gcc_assert (object
!= error_mark_node
);
2335 /* Complain about other invalid uses of offsetof, even though they will
2336 give the right answer. Note that we complain whether or not they
2337 actually used the offsetof macro, since there's no way to know at this
2338 point. So we just give a warning, instead of a pedwarn. */
2339 /* Do not produce this warning for base class field references, because
2340 we know for a fact that didn't come from offsetof. This does occur
2341 in various testsuite cases where a null object is passed where a
2342 vtable access is required. */
2343 if (null_object_p
&& warn_invalid_offsetof
2344 && CLASSTYPE_NON_STD_LAYOUT (object_type
)
2345 && !DECL_FIELD_IS_BASE (member
)
2346 && cp_unevaluated_operand
== 0
2347 && (complain
& tf_warning
))
2349 warning (OPT_Winvalid_offsetof
,
2350 "invalid access to non-static data member %qD "
2351 " of NULL object", member
);
2352 warning (OPT_Winvalid_offsetof
,
2353 "(perhaps the %<offsetof%> macro was used incorrectly)");
2356 /* If MEMBER is from an anonymous aggregate, we have converted
2357 OBJECT so that it refers to the class containing the
2358 anonymous union. Generate a reference to the anonymous union
2359 itself, and recur to find MEMBER. */
2360 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2361 /* When this code is called from build_field_call, the
2362 object already has the type of the anonymous union.
2363 That is because the COMPONENT_REF was already
2364 constructed, and was then disassembled before calling
2365 build_field_call. After the function-call code is
2366 cleaned up, this waste can be eliminated. */
2367 && (!same_type_ignoring_top_level_qualifiers_p
2368 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2370 tree anonymous_union
;
2372 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2373 DECL_CONTEXT (member
));
2374 object
= build_class_member_access_expr (object
,
2376 /*access_path=*/NULL_TREE
,
2381 /* Compute the type of the field, as described in [expr.ref]. */
2382 type_quals
= TYPE_UNQUALIFIED
;
2383 member_type
= TREE_TYPE (member
);
2384 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2386 type_quals
= (cp_type_quals (member_type
)
2387 | cp_type_quals (object_type
));
2389 /* A field is const (volatile) if the enclosing object, or the
2390 field itself, is const (volatile). But, a mutable field is
2391 not const, even within a const object. */
2392 if (DECL_MUTABLE_P (member
))
2393 type_quals
&= ~TYPE_QUAL_CONST
;
2394 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2397 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
2399 result
= fold_if_not_in_template (result
);
2401 /* Mark the expression const or volatile, as appropriate. Even
2402 though we've dealt with the type above, we still have to mark the
2403 expression itself. */
2404 if (type_quals
& TYPE_QUAL_CONST
)
2405 TREE_READONLY (result
) = 1;
2406 if (type_quals
& TYPE_QUAL_VOLATILE
)
2407 TREE_THIS_VOLATILE (result
) = 1;
2409 else if (BASELINK_P (member
))
2411 /* The member is a (possibly overloaded) member function. */
2415 /* If the MEMBER is exactly one static member function, then we
2416 know the type of the expression. Otherwise, we must wait
2417 until overload resolution has been performed. */
2418 functions
= BASELINK_FUNCTIONS (member
);
2419 if (TREE_CODE (functions
) == FUNCTION_DECL
2420 && DECL_STATIC_FUNCTION_P (functions
))
2421 type
= TREE_TYPE (functions
);
2423 type
= unknown_type_node
;
2424 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2425 base. That will happen when the function is called. */
2426 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2428 else if (TREE_CODE (member
) == CONST_DECL
)
2430 /* The member is an enumerator. */
2432 /* If OBJECT has side-effects, they are supposed to occur. */
2433 if (TREE_SIDE_EFFECTS (object
))
2434 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2439 if (complain
& tf_error
)
2440 error ("invalid use of %qD", member
);
2441 return error_mark_node
;
2444 if (!preserve_reference
)
2447 If E2 is declared to have type "reference to T", then ... the
2448 type of E1.E2 is T. */
2449 result
= convert_from_reference (result
);
2454 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2455 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2458 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2460 tree object_type
= TREE_TYPE (object
);
2461 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2464 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2466 error ("qualified type %qT does not match destructor name ~%qT",
2468 return error_mark_node
;
2470 if (TREE_CODE (dtor_type
) == IDENTIFIER_NODE
)
2472 /* In a template, names we can't find a match for are still accepted
2473 destructor names, and we check them here. */
2474 if (check_dtor_name (object_type
, dtor_type
))
2475 dtor_type
= object_type
;
2478 error ("object type %qT does not match destructor name ~%qT",
2479 object_type
, dtor_type
);
2480 return error_mark_node
;
2484 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2486 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2487 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2488 return error_mark_node
;
2490 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2491 /*protect=*/1, /*want_type=*/false);
2492 expr
= (adjust_result_of_qualified_name_lookup
2493 (expr
, dtor_type
, object_type
));
2497 /* An expression of the form "A::template B" has been resolved to
2498 DECL. Issue a diagnostic if B is not a template or template
2502 check_template_keyword (tree decl
)
2504 /* The standard says:
2508 If a name prefixed by the keyword template is not a member
2509 template, the program is ill-formed.
2511 DR 228 removed the restriction that the template be a member
2514 DR 96, if accepted would add the further restriction that explicit
2515 template arguments must be provided if the template keyword is
2516 used, but, as of 2005-10-16, that DR is still in "drafting". If
2517 this DR is accepted, then the semantic checks here can be
2518 simplified, as the entity named must in fact be a template
2519 specialization, rather than, as at present, a set of overloaded
2520 functions containing at least one template function. */
2521 if (TREE_CODE (decl
) != TEMPLATE_DECL
2522 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2524 if (!is_overloaded_fn (decl
))
2525 permerror (input_location
, "%qD is not a template", decl
);
2530 if (BASELINK_P (fns
))
2531 fns
= BASELINK_FUNCTIONS (fns
);
2534 tree fn
= OVL_CURRENT (fns
);
2535 if (TREE_CODE (fn
) == TEMPLATE_DECL
2536 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2538 if (TREE_CODE (fn
) == FUNCTION_DECL
2539 && DECL_USE_TEMPLATE (fn
)
2540 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2542 fns
= OVL_NEXT (fns
);
2545 permerror (input_location
, "%qD is not a template", decl
);
2550 /* This function is called by the parser to process a class member
2551 access expression of the form OBJECT.NAME. NAME is a node used by
2552 the parser to represent a name; it is not yet a DECL. It may,
2553 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2554 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2555 there is no reason to do the lookup twice, so the parser keeps the
2556 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2557 be a template via the use of the "A::template B" syntax. */
2560 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2561 tsubst_flags_t complain
)
2566 tree access_path
= NULL_TREE
;
2567 tree orig_object
= object
;
2568 tree orig_name
= name
;
2570 if (object
== error_mark_node
|| name
== error_mark_node
)
2571 return error_mark_node
;
2573 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2574 if (!objc_is_public (object
, name
))
2575 return error_mark_node
;
2577 object_type
= TREE_TYPE (object
);
2579 if (processing_template_decl
)
2581 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2582 dependent_type_p (object_type
)
2583 /* If NAME is just an IDENTIFIER_NODE, then the expression
2585 || TREE_CODE (object
) == IDENTIFIER_NODE
2586 /* If NAME is "f<args>", where either 'f' or 'args' is
2587 dependent, then the expression is dependent. */
2588 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2589 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2590 TREE_OPERAND (name
, 1)))
2591 /* If NAME is "T::X" where "T" is dependent, then the
2592 expression is dependent. */
2593 || (TREE_CODE (name
) == SCOPE_REF
2594 && TYPE_P (TREE_OPERAND (name
, 0))
2595 && dependent_type_p (TREE_OPERAND (name
, 0))))
2596 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2597 object
= build_non_dependent_expr (object
);
2599 else if (c_dialect_objc ()
2600 && TREE_CODE (name
) == IDENTIFIER_NODE
2601 && (expr
= objc_maybe_build_component_ref (object
, name
)))
2606 The type of the first expression shall be "class object" (of a
2608 if (!currently_open_class (object_type
)
2609 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2610 return error_mark_node
;
2611 if (!CLASS_TYPE_P (object_type
))
2613 if (complain
& tf_error
)
2614 error ("request for member %qD in %qE, which is of non-class type %qT",
2615 name
, object
, object_type
);
2616 return error_mark_node
;
2619 if (BASELINK_P (name
))
2620 /* A member function that has already been looked up. */
2624 bool is_template_id
= false;
2625 tree template_args
= NULL_TREE
;
2628 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2630 is_template_id
= true;
2631 template_args
= TREE_OPERAND (name
, 1);
2632 name
= TREE_OPERAND (name
, 0);
2634 if (TREE_CODE (name
) == OVERLOAD
)
2635 name
= DECL_NAME (get_first_fn (name
));
2636 else if (DECL_P (name
))
2637 name
= DECL_NAME (name
);
2640 if (TREE_CODE (name
) == SCOPE_REF
)
2642 /* A qualified name. The qualifying class or namespace `S'
2643 has already been looked up; it is either a TYPE or a
2645 scope
= TREE_OPERAND (name
, 0);
2646 name
= TREE_OPERAND (name
, 1);
2648 /* If SCOPE is a namespace, then the qualified name does not
2649 name a member of OBJECT_TYPE. */
2650 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2652 if (complain
& tf_error
)
2653 error ("%<%D::%D%> is not a member of %qT",
2654 scope
, name
, object_type
);
2655 return error_mark_node
;
2658 gcc_assert (CLASS_TYPE_P (scope
));
2659 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2660 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2662 if (constructor_name_p (name
, scope
))
2664 if (complain
& tf_error
)
2665 error ("cannot call constructor %<%T::%D%> directly",
2667 return error_mark_node
;
2670 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2671 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2672 if (access_path
== error_mark_node
)
2673 return error_mark_node
;
2676 if (complain
& tf_error
)
2677 error ("%qT is not a base of %qT", scope
, object_type
);
2678 return error_mark_node
;
2684 access_path
= object_type
;
2687 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2688 member
= lookup_destructor (object
, scope
, name
);
2691 /* Look up the member. */
2692 member
= lookup_member (access_path
, name
, /*protect=*/1,
2693 /*want_type=*/false);
2694 if (member
== NULL_TREE
)
2696 if (complain
& tf_error
)
2697 error ("%qD has no member named %qE", object_type
, name
);
2698 return error_mark_node
;
2700 if (member
== error_mark_node
)
2701 return error_mark_node
;
2706 tree templ
= member
;
2708 if (BASELINK_P (templ
))
2709 templ
= lookup_template_function (templ
, template_args
);
2712 if (complain
& tf_error
)
2713 error ("%qD is not a member template function", name
);
2714 return error_mark_node
;
2719 if (TREE_DEPRECATED (member
))
2720 warn_deprecated_use (member
, NULL_TREE
);
2723 check_template_keyword (member
);
2725 expr
= build_class_member_access_expr (object
, member
, access_path
,
2726 /*preserve_reference=*/false,
2728 if (processing_template_decl
&& expr
!= error_mark_node
)
2730 if (BASELINK_P (member
))
2732 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2733 BASELINK_QUALIFIED_P (member
) = 1;
2736 return build_min_non_dep (COMPONENT_REF
, expr
,
2737 orig_object
, orig_name
,
2744 /* Return an expression for the MEMBER_NAME field in the internal
2745 representation of PTRMEM, a pointer-to-member function. (Each
2746 pointer-to-member function type gets its own RECORD_TYPE so it is
2747 more convenient to access the fields by name than by FIELD_DECL.)
2748 This routine converts the NAME to a FIELD_DECL and then creates the
2749 node for the complete expression. */
2752 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2758 /* This code is a stripped down version of
2759 build_class_member_access_expr. It does not work to use that
2760 routine directly because it expects the object to be of class
2762 ptrmem_type
= TREE_TYPE (ptrmem
);
2763 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2764 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2765 /*want_type=*/false);
2766 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2767 cp_type_quals (ptrmem_type
));
2768 return fold_build3_loc (input_location
,
2769 COMPONENT_REF
, member_type
,
2770 ptrmem
, member
, NULL_TREE
);
2773 /* Given an expression PTR for a pointer, return an expression
2774 for the value pointed to.
2775 ERRORSTRING is the name of the operator to appear in error messages.
2777 This function may need to overload OPERATOR_FNNAME.
2778 Must also handle REFERENCE_TYPEs for C++. */
2781 build_x_indirect_ref (tree expr
, ref_operator errorstring
,
2782 tsubst_flags_t complain
)
2784 tree orig_expr
= expr
;
2787 if (processing_template_decl
)
2789 /* Retain the type if we know the operand is a pointer so that
2790 describable_type doesn't make auto deduction break. */
2791 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2792 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2793 if (type_dependent_expression_p (expr
))
2794 return build_min_nt (INDIRECT_REF
, expr
);
2795 expr
= build_non_dependent_expr (expr
);
2798 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2799 NULL_TREE
, /*overloaded_p=*/NULL
, complain
);
2801 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2803 if (processing_template_decl
&& rval
!= error_mark_node
)
2804 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2809 /* Helper function called from c-common. */
2811 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2812 tree ptr
, ref_operator errorstring
)
2814 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2818 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2819 tsubst_flags_t complain
)
2823 if (ptr
== error_mark_node
)
2824 return error_mark_node
;
2826 if (ptr
== current_class_ptr
)
2827 return current_class_ref
;
2829 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2830 ? ptr
: decay_conversion (ptr
));
2831 type
= TREE_TYPE (pointer
);
2833 if (POINTER_TYPE_P (type
))
2837 If the type of the expression is "pointer to T," the type
2838 of the result is "T." */
2839 tree t
= TREE_TYPE (type
);
2841 if (CONVERT_EXPR_P (ptr
)
2842 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2844 /* If a warning is issued, mark it to avoid duplicates from
2845 the backend. This only needs to be done at
2846 warn_strict_aliasing > 2. */
2847 if (warn_strict_aliasing
> 2)
2848 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2849 type
, TREE_OPERAND (ptr
, 0)))
2850 TREE_NO_WARNING (ptr
) = 1;
2853 if (VOID_TYPE_P (t
))
2855 /* A pointer to incomplete type (other than cv void) can be
2856 dereferenced [expr.unary.op]/1 */
2857 if (complain
& tf_error
)
2858 error ("%qT is not a pointer-to-object type", type
);
2859 return error_mark_node
;
2861 else if (TREE_CODE (pointer
) == ADDR_EXPR
2862 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2863 /* The POINTER was something like `&x'. We simplify `*&x' to
2865 return TREE_OPERAND (pointer
, 0);
2868 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2870 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2871 so that we get the proper error message if the result is used
2872 to assign to. Also, &* is supposed to be a no-op. */
2873 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2874 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2875 TREE_SIDE_EFFECTS (ref
)
2876 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2880 else if (!(complain
& tf_error
))
2881 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2883 /* `pointer' won't be an error_mark_node if we were given a
2884 pointer to member, so it's cool to check for this here. */
2885 else if (TYPE_PTR_TO_MEMBER_P (type
))
2886 switch (errorstring
)
2888 case RO_ARRAY_INDEXING
:
2889 error ("invalid use of array indexing on pointer to member");
2892 error ("invalid use of unary %<*%> on pointer to member");
2894 case RO_IMPLICIT_CONVERSION
:
2895 error ("invalid use of implicit conversion on pointer to member");
2900 else if (pointer
!= error_mark_node
)
2901 switch (errorstring
)
2904 error ("invalid type argument");
2906 case RO_ARRAY_INDEXING
:
2907 error ("invalid type argument of array indexing");
2910 error ("invalid type argument of unary %<*%>");
2912 case RO_IMPLICIT_CONVERSION
:
2913 error ("invalid type argument of implicit conversion");
2918 return error_mark_node
;
2921 /* This handles expressions of the form "a[i]", which denotes
2924 This is logically equivalent in C to *(a+i), but we may do it differently.
2925 If A is a variable or a member, we generate a primitive ARRAY_REF.
2926 This avoids forcing the array out of registers, and can work on
2927 arrays that are not lvalues (for example, members of structures returned
2930 If INDEX is of some user-defined type, it must be converted to
2931 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2932 will inherit the type of the array, which will be some pointer type.
2934 LOC is the location to use in building the array reference. */
2937 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
2938 tsubst_flags_t complain
)
2944 if (complain
& tf_error
)
2945 error_at (loc
, "subscript missing in array reference");
2946 return error_mark_node
;
2949 if (TREE_TYPE (array
) == error_mark_node
2950 || TREE_TYPE (idx
) == error_mark_node
)
2951 return error_mark_node
;
2953 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2955 switch (TREE_CODE (array
))
2959 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2961 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2962 TREE_OPERAND (array
, 0), value
);
2963 SET_EXPR_LOCATION (ret
, loc
);
2968 ret
= build_conditional_expr
2969 (TREE_OPERAND (array
, 0),
2970 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2972 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
2974 tf_warning_or_error
);
2975 protected_set_expr_location (ret
, loc
);
2982 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2986 warn_array_subscript_with_type_char (idx
);
2988 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2990 if (complain
& tf_error
)
2991 error_at (loc
, "array subscript is not an integer");
2992 return error_mark_node
;
2995 /* Apply integral promotions *after* noticing character types.
2996 (It is unclear why we do these promotions -- the standard
2997 does not say that we should. In fact, the natural thing would
2998 seem to be to convert IDX to ptrdiff_t; we're performing
2999 pointer arithmetic.) */
3000 idx
= perform_integral_promotions (idx
);
3002 /* An array that is indexed by a non-constant
3003 cannot be stored in a register; we must be able to do
3004 address arithmetic on its address.
3005 Likewise an array of elements of variable size. */
3006 if (TREE_CODE (idx
) != INTEGER_CST
3007 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
3008 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
3011 if (!cxx_mark_addressable (array
))
3012 return error_mark_node
;
3015 /* An array that is indexed by a constant value which is not within
3016 the array bounds cannot be stored in a register either; because we
3017 would get a crash in store_bit_field/extract_bit_field when trying
3018 to access a non-existent part of the register. */
3019 if (TREE_CODE (idx
) == INTEGER_CST
3020 && TYPE_DOMAIN (TREE_TYPE (array
))
3021 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
3023 if (!cxx_mark_addressable (array
))
3024 return error_mark_node
;
3027 if (!lvalue_p (array
) && (complain
& tf_error
))
3028 pedwarn (loc
, OPT_pedantic
,
3029 "ISO C++ forbids subscripting non-lvalue array");
3031 /* Note in C++ it is valid to subscript a `register' array, since
3032 it is valid to take the address of something with that
3033 storage specification. */
3037 while (TREE_CODE (foo
) == COMPONENT_REF
)
3038 foo
= TREE_OPERAND (foo
, 0);
3039 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
)
3040 && (complain
& tf_warning
))
3041 warning_at (loc
, OPT_Wextra
,
3042 "subscripting array declared %<register%>");
3045 type
= TREE_TYPE (TREE_TYPE (array
));
3046 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
3047 /* Array ref is const/volatile if the array elements are
3048 or if the array is.. */
3049 TREE_READONLY (rval
)
3050 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
3051 TREE_SIDE_EFFECTS (rval
)
3052 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
3053 TREE_THIS_VOLATILE (rval
)
3054 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
3055 ret
= require_complete_type_sfinae (fold_if_not_in_template (rval
),
3057 protected_set_expr_location (ret
, loc
);
3062 tree ar
= default_conversion (array
);
3063 tree ind
= default_conversion (idx
);
3065 /* Put the integer in IND to simplify error checking. */
3066 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
3073 if (ar
== error_mark_node
)
3076 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
3078 if (complain
& tf_error
)
3079 error_at (loc
, "subscripted value is neither array nor pointer");
3080 return error_mark_node
;
3082 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
3084 if (complain
& tf_error
)
3085 error_at (loc
, "array subscript is not an integer");
3086 return error_mark_node
;
3089 warn_array_subscript_with_type_char (idx
);
3091 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
3096 protected_set_expr_location (ret
, loc
);
3101 /* Entry point for Obj-C++. */
3104 build_array_ref (location_t loc
, tree array
, tree idx
)
3106 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
3109 /* Resolve a pointer to member function. INSTANCE is the object
3110 instance to use, if the member points to a virtual member.
3112 This used to avoid checking for virtual functions if basetype
3113 has no virtual functions, according to an earlier ANSI draft.
3114 With the final ISO C++ rules, such an optimization is
3115 incorrect: A pointer to a derived member can be static_cast
3116 to pointer-to-base-member, as long as the dynamic object
3117 later has the right member. */
3120 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
3122 if (TREE_CODE (function
) == OFFSET_REF
)
3123 function
= TREE_OPERAND (function
, 1);
3125 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3127 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
3128 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3130 tree instance_ptr
= *instance_ptrptr
;
3131 tree instance_save_expr
= 0;
3132 if (instance_ptr
== error_mark_node
)
3134 if (TREE_CODE (function
) == PTRMEM_CST
)
3136 /* Extracting the function address from a pmf is only
3137 allowed with -Wno-pmf-conversions. It only works for
3139 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
3140 e1
= convert (fntype
, e1
);
3145 error ("object missing in use of %qE", function
);
3146 return error_mark_node
;
3150 if (TREE_SIDE_EFFECTS (instance_ptr
))
3151 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3153 if (TREE_SIDE_EFFECTS (function
))
3154 function
= save_expr (function
);
3156 /* Start by extracting all the information from the PMF itself. */
3157 e3
= pfn_from_ptrmemfunc (function
);
3158 delta
= delta_from_ptrmemfunc (function
);
3159 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3160 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3162 case ptrmemfunc_vbit_in_pfn
:
3163 e1
= cp_build_binary_op (input_location
,
3164 BIT_AND_EXPR
, idx
, integer_one_node
,
3165 tf_warning_or_error
);
3166 idx
= cp_build_binary_op (input_location
,
3167 MINUS_EXPR
, idx
, integer_one_node
,
3168 tf_warning_or_error
);
3171 case ptrmemfunc_vbit_in_delta
:
3172 e1
= cp_build_binary_op (input_location
,
3173 BIT_AND_EXPR
, delta
, integer_one_node
,
3174 tf_warning_or_error
);
3175 delta
= cp_build_binary_op (input_location
,
3176 RSHIFT_EXPR
, delta
, integer_one_node
,
3177 tf_warning_or_error
);
3184 /* Convert down to the right base before using the instance. A
3185 special case is that in a pointer to member of class C, C may
3186 be incomplete. In that case, the function will of course be
3187 a member of C, and no conversion is required. In fact,
3188 lookup_base will fail in that case, because incomplete
3189 classes do not have BINFOs. */
3190 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3191 if (!same_type_ignoring_top_level_qualifiers_p
3192 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3194 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3195 basetype
, ba_check
, NULL
);
3196 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3198 if (instance_ptr
== error_mark_node
)
3199 return error_mark_node
;
3201 /* ...and then the delta in the PMF. */
3202 instance_ptr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (instance_ptr
),
3203 instance_ptr
, fold_convert (sizetype
, delta
));
3205 /* Hand back the adjusted 'this' argument to our caller. */
3206 *instance_ptrptr
= instance_ptr
;
3208 /* Next extract the vtable pointer from the object. */
3209 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3211 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, tf_warning_or_error
);
3212 /* If the object is not dynamic the access invokes undefined
3213 behavior. As it is not executed in this case silence the
3214 spurious warnings it may provoke. */
3215 TREE_NO_WARNING (vtbl
) = 1;
3217 /* Finally, extract the function pointer from the vtable. */
3218 e2
= fold_build2_loc (input_location
,
3219 POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
,
3220 fold_convert (sizetype
, idx
));
3221 e2
= cp_build_indirect_ref (e2
, RO_NULL
, tf_warning_or_error
);
3222 TREE_CONSTANT (e2
) = 1;
3224 /* When using function descriptors, the address of the
3225 vtable entry is treated as a function pointer. */
3226 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3227 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3228 cp_build_addr_expr (e2
, tf_warning_or_error
));
3230 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3231 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
3233 /* Make sure this doesn't get evaluated first inside one of the
3234 branches of the COND_EXPR. */
3235 if (instance_save_expr
)
3236 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3237 instance_save_expr
, e1
);
3244 /* Used by the C-common bits. */
3246 build_function_call (location_t loc ATTRIBUTE_UNUSED
,
3247 tree function
, tree params
)
3249 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3252 /* Used by the C-common bits. */
3254 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED
,
3255 tree function
, VEC(tree
,gc
) *params
,
3256 VEC(tree
,gc
) *origtypes ATTRIBUTE_UNUSED
)
3258 VEC(tree
,gc
) *orig_params
= params
;
3259 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3260 tf_warning_or_error
);
3262 /* cp_build_function_call_vec can reallocate PARAMS by adding
3263 default arguments. That should never happen here. Verify
3265 gcc_assert (params
== orig_params
);
3270 /* Build a function call using a tree list of arguments. */
3273 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3278 vec
= make_tree_vector ();
3279 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3280 VEC_safe_push (tree
, gc
, vec
, TREE_VALUE (params
));
3281 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3282 release_tree_vector (vec
);
3286 /* Build a function call using varargs. */
3289 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3295 vec
= make_tree_vector ();
3296 va_start (args
, complain
);
3297 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3298 VEC_safe_push (tree
, gc
, vec
, t
);
3300 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3301 release_tree_vector (vec
);
3305 /* Build a function call using a vector of arguments. PARAMS may be
3306 NULL if there are no parameters. This changes the contents of
3310 cp_build_function_call_vec (tree function
, VEC(tree
,gc
) **params
,
3311 tsubst_flags_t complain
)
3313 tree fntype
, fndecl
;
3315 tree original
= function
;
3319 VEC(tree
,gc
) *allocated
= NULL
;
3322 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3323 expressions, like those used for ObjC messenger dispatches. */
3324 if (params
!= NULL
&& !VEC_empty (tree
, *params
))
3325 function
= objc_rewrite_function_call (function
,
3326 VEC_index (tree
, *params
, 0));
3328 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3329 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3330 if (TREE_CODE (function
) == NOP_EXPR
3331 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3332 function
= TREE_OPERAND (function
, 0);
3334 if (TREE_CODE (function
) == FUNCTION_DECL
)
3336 mark_used (function
);
3339 /* Convert anything with function type to a pointer-to-function. */
3340 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
3341 pedwarn (input_location
, OPT_pedantic
,
3342 "ISO C++ forbids calling %<::main%> from within program");
3344 function
= build_addr_func (function
);
3350 function
= build_addr_func (function
);
3353 if (function
== error_mark_node
)
3354 return error_mark_node
;
3356 fntype
= TREE_TYPE (function
);
3358 if (TYPE_PTRMEMFUNC_P (fntype
))
3360 if (complain
& tf_error
)
3361 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3362 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3363 original
, original
);
3364 return error_mark_node
;
3367 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
3368 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3370 if (!((TREE_CODE (fntype
) == POINTER_TYPE
3371 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
3373 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3375 if (complain
& tf_error
)
3376 error ("%qE cannot be used as a function", original
);
3377 return error_mark_node
;
3380 /* fntype now gets the type of function pointed to. */
3381 fntype
= TREE_TYPE (fntype
);
3382 parm_types
= TYPE_ARG_TYPES (fntype
);
3386 allocated
= make_tree_vector ();
3387 params
= &allocated
;
3390 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3393 return error_mark_node
;
3395 argarray
= VEC_address (tree
, *params
);
3397 /* Check for errors in format strings and inappropriately
3399 check_function_arguments (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
,
3402 ret
= build_cxx_call (function
, nargs
, argarray
);
3404 if (allocated
!= NULL
)
3405 release_tree_vector (allocated
);
3410 /* Subroutine of convert_arguments.
3411 Warn about wrong number of args are genereted. */
3414 warn_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3418 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3420 if (DECL_NAME (fndecl
) == NULL_TREE
3421 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3424 ? G_("too many arguments to constructor %q#D")
3425 : G_("too few arguments to constructor %q#D"),
3430 ? G_("too many arguments to member function %q#D")
3431 : G_("too few arguments to member function %q#D"),
3437 ? G_("too many arguments to function %q#D")
3438 : G_("too few arguments to function %q#D"),
3440 inform (DECL_SOURCE_LOCATION (fndecl
),
3445 if (c_dialect_objc () && objc_message_selector ())
3448 ? G_("too many arguments to method %q#D")
3449 : G_("too few arguments to method %q#D"),
3450 objc_message_selector ());
3452 error_at (loc
, too_many_p
? G_("too many arguments to function")
3453 : G_("too few arguments to function"));
3457 /* Convert the actual parameter expressions in the list VALUES to the
3458 types in the list TYPELIST. The converted expressions are stored
3459 back in the VALUES vector.
3460 If parmdecls is exhausted, or when an element has NULL as its type,
3461 perform the default conversions.
3463 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3465 This is also where warnings about wrong number of args are generated.
3467 Returns the actual number of arguments processed (which might be less
3468 than the length of the vector), or -1 on error.
3470 In C++, unspecified trailing parameters can be filled in with their
3471 default arguments, if such were specified. Do so here. */
3474 convert_arguments (tree typelist
, VEC(tree
,gc
) **values
, tree fndecl
,
3475 int flags
, tsubst_flags_t complain
)
3480 /* Argument passing is always copy-initialization. */
3481 flags
|= LOOKUP_ONLYCONVERTING
;
3483 for (i
= 0, typetail
= typelist
;
3484 i
< VEC_length (tree
, *values
);
3487 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3488 tree val
= VEC_index (tree
, *values
, i
);
3490 if (val
== error_mark_node
|| type
== error_mark_node
)
3493 if (type
== void_type_node
)
3495 if (complain
& tf_error
)
3497 warn_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3504 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3505 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3506 if (TREE_CODE (val
) == NOP_EXPR
3507 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3508 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3509 val
= TREE_OPERAND (val
, 0);
3511 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3513 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3514 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3515 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3516 val
= decay_conversion (val
);
3519 if (val
== error_mark_node
)
3524 /* Formal parm type is specified by a function prototype. */
3527 if (!COMPLETE_TYPE_P (complete_type (type
)))
3529 if (complain
& tf_error
)
3532 error ("parameter %P of %qD has incomplete type %qT",
3535 error ("parameter %P has incomplete type %qT", i
, type
);
3537 parmval
= error_mark_node
;
3541 parmval
= convert_for_initialization
3542 (NULL_TREE
, type
, val
, flags
,
3543 ICR_ARGPASS
, fndecl
, i
, complain
);
3544 parmval
= convert_for_arg_passing (type
, parmval
);
3547 if (parmval
== error_mark_node
)
3550 VEC_replace (tree
, *values
, i
, parmval
);
3554 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3555 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3556 /* Don't do ellipsis conversion for __built_in_constant_p
3557 as this will result in spurious errors for non-trivial
3559 val
= require_complete_type_sfinae (val
, complain
);
3561 val
= convert_arg_to_ellipsis (val
);
3563 VEC_replace (tree
, *values
, i
, val
);
3567 typetail
= TREE_CHAIN (typetail
);
3570 if (typetail
!= 0 && typetail
!= void_list_node
)
3572 /* See if there are default arguments that can be used. Because
3573 we hold default arguments in the FUNCTION_TYPE (which is so
3574 wrong), we can see default parameters here from deduced
3575 contexts (and via typeof) for indirect function calls.
3576 Fortunately we know whether we have a function decl to
3577 provide default arguments in a language conformant
3579 if (fndecl
&& TREE_PURPOSE (typetail
)
3580 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3582 for (; typetail
!= void_list_node
; ++i
)
3585 = convert_default_arg (TREE_VALUE (typetail
),
3586 TREE_PURPOSE (typetail
),
3589 if (parmval
== error_mark_node
)
3592 VEC_safe_push (tree
, gc
, *values
, parmval
);
3593 typetail
= TREE_CHAIN (typetail
);
3594 /* ends with `...'. */
3595 if (typetail
== NULL_TREE
)
3601 if (complain
& tf_error
)
3602 warn_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3610 /* Build a binary-operation expression, after performing default
3611 conversions on the operands. CODE is the kind of expression to
3612 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3613 are the tree codes which correspond to ARG1 and ARG2 when issuing
3614 warnings about possibly misplaced parentheses. They may differ
3615 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3616 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3617 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3618 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3619 ARG2_CODE as ERROR_MARK. */
3622 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3623 tree arg2
, enum tree_code arg2_code
, bool *overloaded_p
,
3624 tsubst_flags_t complain
)
3633 if (processing_template_decl
)
3635 if (type_dependent_expression_p (arg1
)
3636 || type_dependent_expression_p (arg2
))
3637 return build_min_nt (code
, arg1
, arg2
);
3638 arg1
= build_non_dependent_expr (arg1
);
3639 arg2
= build_non_dependent_expr (arg2
);
3642 if (code
== DOTSTAR_EXPR
)
3643 expr
= build_m_component_ref (arg1
, arg2
);
3645 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3646 overloaded_p
, complain
);
3648 /* Check for cases such as x+y<<z which users are likely to
3649 misinterpret. But don't warn about obj << x + y, since that is a
3650 common idiom for I/O. */
3651 if (warn_parentheses
3652 && (complain
& tf_warning
)
3653 && !processing_template_decl
3654 && !error_operand_p (arg1
)
3655 && !error_operand_p (arg2
)
3656 && (code
!= LSHIFT_EXPR
3657 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3658 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3660 if (processing_template_decl
&& expr
!= error_mark_node
)
3661 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3666 /* Build and return an ARRAY_REF expression. */
3669 build_x_array_ref (tree arg1
, tree arg2
, tsubst_flags_t complain
)
3671 tree orig_arg1
= arg1
;
3672 tree orig_arg2
= arg2
;
3675 if (processing_template_decl
)
3677 if (type_dependent_expression_p (arg1
)
3678 || type_dependent_expression_p (arg2
))
3679 return build_min_nt (ARRAY_REF
, arg1
, arg2
,
3680 NULL_TREE
, NULL_TREE
);
3681 arg1
= build_non_dependent_expr (arg1
);
3682 arg2
= build_non_dependent_expr (arg2
);
3685 expr
= build_new_op (ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3686 /*overloaded_p=*/NULL
, complain
);
3688 if (processing_template_decl
&& expr
!= error_mark_node
)
3689 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3690 NULL_TREE
, NULL_TREE
);
3694 /* For the c-common bits. */
3696 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3697 int convert_p ATTRIBUTE_UNUSED
)
3699 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3703 /* Build a binary-operation expression without default conversions.
3704 CODE is the kind of expression to build.
3705 LOCATION is the location_t of the operator in the source code.
3706 This function differs from `build' in several ways:
3707 the data type of the result is computed and recorded in it,
3708 warnings are generated if arg data types are invalid,
3709 special handling for addition and subtraction of pointers is known,
3710 and some optimization is done (operations on narrow ints
3711 are done in the narrower type when that gives the same result).
3712 Constant folding is also done before the result is returned.
3714 Note that the operands will never have enumeral types
3715 because either they have just had the default conversions performed
3716 or they have both just been converted to some other type in which
3717 the arithmetic is to be done.
3719 C++: must do special pointer arithmetic when implementing
3720 multiple inheritance, and deal with pointer to member functions. */
3723 cp_build_binary_op (location_t location
,
3724 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3725 tsubst_flags_t complain
)
3728 enum tree_code code0
, code1
;
3730 const char *invalid_op_diag
;
3732 /* Expression code to give to the expression when it is built.
3733 Normally this is CODE, which is what the caller asked for,
3734 but in some special cases we change it. */
3735 enum tree_code resultcode
= code
;
3737 /* Data type in which the computation is to be performed.
3738 In the simplest cases this is the common type of the arguments. */
3739 tree result_type
= NULL
;
3741 /* Nonzero means operands have already been type-converted
3742 in whatever way is necessary.
3743 Zero means they need to be converted to RESULT_TYPE. */
3746 /* Nonzero means create the expression with this type, rather than
3748 tree build_type
= 0;
3750 /* Nonzero means after finally constructing the expression
3751 convert it to this type. */
3752 tree final_type
= 0;
3756 /* Nonzero if this is an operation like MIN or MAX which can
3757 safely be computed in short if both args are promoted shorts.
3758 Also implies COMMON.
3759 -1 indicates a bitwise operation; this makes a difference
3760 in the exact conditions for when it is safe to do the operation
3761 in a narrower mode. */
3764 /* Nonzero if this is a comparison operation;
3765 if both args are promoted shorts, compare the original shorts.
3766 Also implies COMMON. */
3767 int short_compare
= 0;
3769 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3772 /* True if both operands have arithmetic type. */
3773 bool arithmetic_types_p
;
3775 /* Apply default conversions. */
3779 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3780 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3781 || code
== TRUTH_XOR_EXPR
)
3783 if (!really_overloaded_fn (op0
))
3784 op0
= decay_conversion (op0
);
3785 if (!really_overloaded_fn (op1
))
3786 op1
= decay_conversion (op1
);
3790 if (!really_overloaded_fn (op0
))
3791 op0
= default_conversion (op0
);
3792 if (!really_overloaded_fn (op1
))
3793 op1
= default_conversion (op1
);
3796 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3797 STRIP_TYPE_NOPS (op0
);
3798 STRIP_TYPE_NOPS (op1
);
3800 /* DTRT if one side is an overloaded function, but complain about it. */
3801 if (type_unknown_p (op0
))
3803 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3804 if (t
!= error_mark_node
)
3806 if (complain
& tf_error
)
3807 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3812 if (type_unknown_p (op1
))
3814 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3815 if (t
!= error_mark_node
)
3817 if (complain
& tf_error
)
3818 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3824 type0
= TREE_TYPE (op0
);
3825 type1
= TREE_TYPE (op1
);
3827 /* The expression codes of the data types of the arguments tell us
3828 whether the arguments are integers, floating, pointers, etc. */
3829 code0
= TREE_CODE (type0
);
3830 code1
= TREE_CODE (type1
);
3832 /* If an error was already reported for one of the arguments,
3833 avoid reporting another error. */
3834 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3835 return error_mark_node
;
3837 if ((invalid_op_diag
3838 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3840 error (invalid_op_diag
);
3841 return error_mark_node
;
3844 /* Issue warnings about peculiar, but valid, uses of NULL. */
3845 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3846 /* It's reasonable to use pointer values as operands of &&
3847 and ||, so NULL is no exception. */
3848 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3849 && ( /* Both are NULL (or 0) and the operation was not a
3850 comparison or a pointer subtraction. */
3851 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3852 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
3853 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3854 || (!null_ptr_cst_p (orig_op0
)
3855 && !TYPE_PTR_P (type0
) && !TYPE_PTR_TO_MEMBER_P (type0
))
3856 || (!null_ptr_cst_p (orig_op1
)
3857 && !TYPE_PTR_P (type1
) && !TYPE_PTR_TO_MEMBER_P (type1
)))
3858 && (complain
& tf_warning
))
3859 /* Some sort of arithmetic operation involving NULL was
3861 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3866 /* Subtraction of two similar pointers.
3867 We must subtract them as integers, then divide by object size. */
3868 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3869 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3871 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3872 /* In all other cases except pointer - int, the usual arithmetic
3874 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3879 /* The pointer - int case is just like pointer + int; fall
3882 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3883 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3887 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3888 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3889 if (processing_template_decl
)
3891 result_type
= TREE_TYPE (ptr_operand
);
3894 return cp_pointer_int_sum (code
,
3905 case TRUNC_DIV_EXPR
:
3907 case FLOOR_DIV_EXPR
:
3908 case ROUND_DIV_EXPR
:
3909 case EXACT_DIV_EXPR
:
3910 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3911 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3912 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3913 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3915 enum tree_code tcode0
= code0
, tcode1
= code1
;
3917 warn_for_div_by_zero (location
, op1
);
3919 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3920 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3921 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3922 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3924 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3925 resultcode
= RDIV_EXPR
;
3927 /* When dividing two signed integers, we have to promote to int.
3928 unless we divide by a constant != -1. Note that default
3929 conversion will have been performed on the operands at this
3930 point, so we have to dig out the original type to find out if
3932 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3933 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3934 || (TREE_CODE (op1
) == INTEGER_CST
3935 && ! integer_all_onesp (op1
)));
3944 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3945 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3946 && !VECTOR_FLOAT_TYPE_P (type0
)
3947 && !VECTOR_FLOAT_TYPE_P (type1
)))
3951 case TRUNC_MOD_EXPR
:
3952 case FLOOR_MOD_EXPR
:
3953 warn_for_div_by_zero (location
, op1
);
3955 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3956 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
3957 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
3959 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3961 /* Although it would be tempting to shorten always here, that loses
3962 on some targets, since the modulo instruction is undefined if the
3963 quotient can't be represented in the computation mode. We shorten
3964 only if unsigned or if dividing by something we know != -1. */
3965 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3966 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3967 || (TREE_CODE (op1
) == INTEGER_CST
3968 && ! integer_all_onesp (op1
)));
3973 case TRUTH_ANDIF_EXPR
:
3974 case TRUTH_ORIF_EXPR
:
3975 case TRUTH_AND_EXPR
:
3977 result_type
= boolean_type_node
;
3980 /* Shift operations: result has same type as first operand;
3981 always convert second operand to int.
3982 Also set SHORT_SHIFT if shifting rightward. */
3985 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3987 result_type
= type0
;
3988 if (TREE_CODE (op1
) == INTEGER_CST
)
3990 if (tree_int_cst_lt (op1
, integer_zero_node
))
3992 if ((complain
& tf_warning
)
3993 && c_inhibit_evaluation_warnings
== 0)
3994 warning (0, "right shift count is negative");
3998 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3999 && (complain
& tf_warning
)
4000 && c_inhibit_evaluation_warnings
== 0)
4001 warning (0, "right shift count >= width of type");
4004 /* Convert the shift-count to an integer, regardless of
4005 size of value being shifted. */
4006 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
4007 op1
= cp_convert (integer_type_node
, op1
);
4008 /* Avoid converting op1 to result_type later. */
4014 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4016 result_type
= type0
;
4017 if (TREE_CODE (op1
) == INTEGER_CST
)
4019 if (tree_int_cst_lt (op1
, integer_zero_node
))
4021 if ((complain
& tf_warning
)
4022 && c_inhibit_evaluation_warnings
== 0)
4023 warning (0, "left shift count is negative");
4025 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
4027 if ((complain
& tf_warning
)
4028 && c_inhibit_evaluation_warnings
== 0)
4029 warning (0, "left shift count >= width of type");
4032 /* Convert the shift-count to an integer, regardless of
4033 size of value being shifted. */
4034 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
4035 op1
= cp_convert (integer_type_node
, op1
);
4036 /* Avoid converting op1 to result_type later. */
4043 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4045 result_type
= type0
;
4046 if (TREE_CODE (op1
) == INTEGER_CST
)
4048 if (tree_int_cst_lt (op1
, integer_zero_node
))
4050 if (complain
& tf_warning
)
4051 warning (0, (code
== LROTATE_EXPR
)
4052 ? G_("left rotate count is negative")
4053 : G_("right rotate count is negative"));
4055 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
4057 if (complain
& tf_warning
)
4058 warning (0, (code
== LROTATE_EXPR
)
4059 ? G_("left rotate count >= width of type")
4060 : G_("right rotate count >= width of type"));
4063 /* Convert the shift-count to an integer, regardless of
4064 size of value being shifted. */
4065 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
4066 op1
= cp_convert (integer_type_node
, op1
);
4072 if ((complain
& tf_warning
)
4073 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
4074 warning (OPT_Wfloat_equal
,
4075 "comparing floating point with == or != is unsafe");
4076 if ((complain
& tf_warning
)
4077 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
4078 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
4079 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4081 build_type
= boolean_type_node
;
4082 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4083 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
4084 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4085 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
4087 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4088 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
4089 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4090 CPO_COMPARISON
, complain
);
4091 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
4092 && null_ptr_cst_p (op1
))
4094 if (TREE_CODE (op0
) == ADDR_EXPR
4095 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
4097 if (complain
& tf_warning
)
4098 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4099 TREE_OPERAND (op0
, 0));
4101 result_type
= type0
;
4103 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
4104 && null_ptr_cst_p (op0
))
4106 if (TREE_CODE (op1
) == ADDR_EXPR
4107 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
4109 if (complain
& tf_warning
)
4110 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4111 TREE_OPERAND (op1
, 0));
4113 result_type
= type1
;
4115 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4116 /* One of the operands must be of nullptr_t type. */
4117 result_type
= TREE_TYPE (nullptr_node
);
4118 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4120 result_type
= type0
;
4121 if (complain
& tf_error
)
4122 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4124 return error_mark_node
;
4126 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4128 result_type
= type1
;
4129 if (complain
& tf_error
)
4130 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4132 return error_mark_node
;
4134 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
4136 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4137 == ptrmemfunc_vbit_in_delta
)
4139 tree pfn0
= pfn_from_ptrmemfunc (op0
);
4140 tree delta0
= delta_from_ptrmemfunc (op0
);
4141 tree e1
= cp_build_binary_op (location
,
4144 fold_convert (TREE_TYPE (pfn0
),
4147 tree e2
= cp_build_binary_op (location
,
4152 e2
= cp_build_binary_op (location
,
4153 EQ_EXPR
, e2
, integer_zero_node
,
4155 op0
= cp_build_binary_op (location
,
4156 TRUTH_ANDIF_EXPR
, e1
, e2
,
4158 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
4162 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4163 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
4165 result_type
= TREE_TYPE (op0
);
4167 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4168 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4169 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4172 /* E will be the final comparison. */
4174 /* E1 and E2 are for scratch. */
4182 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4183 CPO_COMPARISON
, complain
);
4185 if (!same_type_p (TREE_TYPE (op0
), type
))
4186 op0
= cp_convert_and_check (type
, op0
);
4187 if (!same_type_p (TREE_TYPE (op1
), type
))
4188 op1
= cp_convert_and_check (type
, op1
);
4190 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4191 return error_mark_node
;
4193 if (TREE_SIDE_EFFECTS (op0
))
4194 op0
= save_expr (op0
);
4195 if (TREE_SIDE_EFFECTS (op1
))
4196 op1
= save_expr (op1
);
4198 pfn0
= pfn_from_ptrmemfunc (op0
);
4199 pfn1
= pfn_from_ptrmemfunc (op1
);
4200 delta0
= delta_from_ptrmemfunc (op0
);
4201 delta1
= delta_from_ptrmemfunc (op1
);
4202 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4203 == ptrmemfunc_vbit_in_delta
)
4208 && ((op0.delta == op1.delta)
4209 || (!op0.pfn && op0.delta & 1 == 0
4210 && op1.delta & 1 == 0))
4212 The reason for the `!op0.pfn' bit is that a NULL
4213 pointer-to-member is any member with a zero PFN and
4214 LSB of the DELTA field is 0. */
4216 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4220 e1
= cp_build_binary_op (location
,
4221 EQ_EXPR
, e1
, integer_zero_node
,
4223 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4227 e2
= cp_build_binary_op (location
,
4228 EQ_EXPR
, e2
, integer_zero_node
,
4230 e1
= cp_build_binary_op (location
,
4231 TRUTH_ANDIF_EXPR
, e2
, e1
,
4233 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4235 fold_convert (TREE_TYPE (pfn0
),
4238 e2
= cp_build_binary_op (location
,
4239 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4240 e1
= cp_build_binary_op (location
,
4241 EQ_EXPR
, delta0
, delta1
, complain
);
4242 e1
= cp_build_binary_op (location
,
4243 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4250 && (!op0.pfn || op0.delta == op1.delta))
4252 The reason for the `!op0.pfn' bit is that a NULL
4253 pointer-to-member is any member with a zero PFN; the
4254 DELTA field is unspecified. */
4256 e1
= cp_build_binary_op (location
,
4257 EQ_EXPR
, delta0
, delta1
, complain
);
4258 e2
= cp_build_binary_op (location
,
4261 fold_convert (TREE_TYPE (pfn0
),
4264 e1
= cp_build_binary_op (location
,
4265 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4267 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4268 e
= cp_build_binary_op (location
,
4269 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4270 if (code
== EQ_EXPR
)
4272 return cp_build_binary_op (location
,
4273 EQ_EXPR
, e
, integer_zero_node
, complain
);
4277 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4278 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4280 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4281 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4289 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4290 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4292 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4293 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4294 CPO_COMPARISON
, complain
);
4301 if (TREE_CODE (orig_op0
) == STRING_CST
4302 || TREE_CODE (orig_op1
) == STRING_CST
)
4304 if (complain
& tf_warning
)
4305 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4308 build_type
= boolean_type_node
;
4309 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4310 || code0
== ENUMERAL_TYPE
)
4311 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4312 || code1
== ENUMERAL_TYPE
))
4314 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4315 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4316 CPO_COMPARISON
, complain
);
4317 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4318 result_type
= type0
;
4319 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4320 result_type
= type1
;
4321 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4322 /* One of the operands must be of nullptr_t type. */
4323 result_type
= TREE_TYPE (nullptr_node
);
4324 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4326 result_type
= type0
;
4327 if (complain
& tf_error
)
4328 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4330 return error_mark_node
;
4332 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4334 result_type
= type1
;
4335 if (complain
& tf_error
)
4336 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4338 return error_mark_node
;
4342 case UNORDERED_EXPR
:
4349 build_type
= integer_type_node
;
4350 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4352 if (complain
& tf_error
)
4353 error ("unordered comparison on non-floating point argument");
4354 return error_mark_node
;
4363 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4364 || code0
== ENUMERAL_TYPE
)
4365 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4366 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4367 arithmetic_types_p
= 1;
4370 arithmetic_types_p
= 0;
4371 /* Vector arithmetic is only allowed when both sides are vectors. */
4372 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4374 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4375 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4378 binary_op_error (location
, code
, type0
, type1
);
4379 return error_mark_node
;
4381 arithmetic_types_p
= 1;
4384 /* Determine the RESULT_TYPE, if it is not already known. */
4386 && arithmetic_types_p
4387 && (shorten
|| common
|| short_compare
))
4389 result_type
= cp_common_type (type0
, type1
);
4390 do_warn_double_promotion (result_type
, type0
, type1
,
4391 "implicit conversion from %qT to %qT "
4392 "to match other operand of binary "
4399 if (complain
& tf_error
)
4400 error ("invalid operands of types %qT and %qT to binary %qO",
4401 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4402 return error_mark_node
;
4405 /* If we're in a template, the only thing we need to know is the
4407 if (processing_template_decl
)
4409 /* Since the middle-end checks the type when doing a build2, we
4410 need to build the tree in pieces. This built tree will never
4411 get out of the front-end as we replace it when instantiating
4413 tree tmp
= build2 (resultcode
,
4414 build_type
? build_type
: result_type
,
4416 TREE_OPERAND (tmp
, 0) = op0
;
4420 if (arithmetic_types_p
)
4422 bool first_complex
= (code0
== COMPLEX_TYPE
);
4423 bool second_complex
= (code1
== COMPLEX_TYPE
);
4424 int none_complex
= (!first_complex
&& !second_complex
);
4426 /* Adapted from patch for c/24581. */
4427 if (first_complex
!= second_complex
4428 && (code
== PLUS_EXPR
4429 || code
== MINUS_EXPR
4430 || code
== MULT_EXPR
4431 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4432 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4433 && flag_signed_zeros
)
4435 /* An operation on mixed real/complex operands must be
4436 handled specially, but the language-independent code can
4437 more easily optimize the plain complex arithmetic if
4438 -fno-signed-zeros. */
4439 tree real_type
= TREE_TYPE (result_type
);
4443 if (TREE_TYPE (op0
) != result_type
)
4444 op0
= cp_convert_and_check (result_type
, op0
);
4445 if (TREE_TYPE (op1
) != real_type
)
4446 op1
= cp_convert_and_check (real_type
, op1
);
4450 if (TREE_TYPE (op0
) != real_type
)
4451 op0
= cp_convert_and_check (real_type
, op0
);
4452 if (TREE_TYPE (op1
) != result_type
)
4453 op1
= cp_convert_and_check (result_type
, op1
);
4455 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4456 return error_mark_node
;
4459 op0
= save_expr (op0
);
4460 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4461 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4465 case TRUNC_DIV_EXPR
:
4466 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4470 real
= build2 (resultcode
, real_type
, real
, op1
);
4478 op1
= save_expr (op1
);
4479 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4480 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4484 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4487 real
= build2 (resultcode
, real_type
, op0
, real
);
4490 real
= build2 (resultcode
, real_type
, op0
, real
);
4491 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4497 return build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4500 /* For certain operations (which identify themselves by shorten != 0)
4501 if both args were extended from the same smaller type,
4502 do the arithmetic in that type and then extend.
4504 shorten !=0 and !=1 indicates a bitwise operation.
4505 For them, this optimization is safe only if
4506 both args are zero-extended or both are sign-extended.
4507 Otherwise, we might change the result.
4508 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4509 but calculated in (unsigned short) it would be (unsigned short)-1. */
4511 if (shorten
&& none_complex
)
4513 final_type
= result_type
;
4514 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4518 /* Comparison operations are shortened too but differently.
4519 They identify themselves by setting short_compare = 1. */
4523 /* Don't write &op0, etc., because that would prevent op0
4524 from being kept in a register.
4525 Instead, make copies of the our local variables and
4526 pass the copies by reference, then copy them back afterward. */
4527 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4528 enum tree_code xresultcode
= resultcode
;
4530 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4532 return cp_convert (boolean_type_node
, val
);
4533 op0
= xop0
, op1
= xop1
;
4535 resultcode
= xresultcode
;
4538 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4539 && warn_sign_compare
4540 && !TREE_NO_WARNING (orig_op0
)
4541 && !TREE_NO_WARNING (orig_op1
)
4542 /* Do not warn until the template is instantiated; we cannot
4543 bound the ranges of the arguments until that point. */
4544 && !processing_template_decl
4545 && (complain
& tf_warning
)
4546 && c_inhibit_evaluation_warnings
== 0)
4548 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4549 result_type
, resultcode
);
4553 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4554 Then the expression will be built.
4555 It will be given type FINAL_TYPE if that is nonzero;
4556 otherwise, it will be given type RESULT_TYPE. */
4559 if (TREE_TYPE (op0
) != result_type
)
4560 op0
= cp_convert_and_check (result_type
, op0
);
4561 if (TREE_TYPE (op1
) != result_type
)
4562 op1
= cp_convert_and_check (result_type
, op1
);
4564 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4565 return error_mark_node
;
4568 if (build_type
== NULL_TREE
)
4569 build_type
= result_type
;
4571 result
= build2 (resultcode
, build_type
, op0
, op1
);
4572 result
= fold_if_not_in_template (result
);
4573 if (final_type
!= 0)
4574 result
= cp_convert (final_type
, result
);
4576 if (TREE_OVERFLOW_P (result
)
4577 && !TREE_OVERFLOW_P (op0
)
4578 && !TREE_OVERFLOW_P (op1
))
4579 overflow_warning (location
, result
);
4584 /* Return a tree for the sum or difference (RESULTCODE says which)
4585 of pointer PTROP and integer INTOP. */
4588 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4590 tree res_type
= TREE_TYPE (ptrop
);
4592 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4593 in certain circumstance (when it's valid to do so). So we need
4594 to make sure it's complete. We don't need to check here, if we
4595 can actually complete it at all, as those checks will be done in
4596 pointer_int_sum() anyway. */
4597 complete_type (TREE_TYPE (res_type
));
4599 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4600 fold_if_not_in_template (intop
));
4603 /* Return a tree for the difference of pointers OP0 and OP1.
4604 The resulting tree has type int. */
4607 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4610 tree restype
= ptrdiff_type_node
;
4611 tree target_type
= TREE_TYPE (ptrtype
);
4613 if (!complete_type_or_else (target_type
, NULL_TREE
))
4614 return error_mark_node
;
4616 if (TREE_CODE (target_type
) == VOID_TYPE
)
4617 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4618 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4619 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4620 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4621 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4623 /* First do the subtraction as integers;
4624 then drop through to build the divide operator. */
4626 op0
= cp_build_binary_op (input_location
,
4628 cp_convert (restype
, op0
),
4629 cp_convert (restype
, op1
),
4630 tf_warning_or_error
);
4632 /* This generates an error if op1 is a pointer to an incomplete type. */
4633 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4634 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4636 op1
= (TYPE_PTROB_P (ptrtype
)
4637 ? size_in_bytes (target_type
)
4638 : integer_one_node
);
4640 /* Do the division. */
4642 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4643 return fold_if_not_in_template (result
);
4646 /* Construct and perhaps optimize a tree representation
4647 for a unary operation. CODE, a tree_code, specifies the operation
4648 and XARG is the operand. */
4651 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4653 tree orig_expr
= xarg
;
4657 if (processing_template_decl
)
4659 if (type_dependent_expression_p (xarg
))
4660 return build_min_nt (code
, xarg
, NULL_TREE
);
4662 xarg
= build_non_dependent_expr (xarg
);
4667 /* [expr.unary.op] says:
4669 The address of an object of incomplete type can be taken.
4671 (And is just the ordinary address operator, not an overloaded
4672 "operator &".) However, if the type is a template
4673 specialization, we must complete the type at this point so that
4674 an overloaded "operator &" will be available if required. */
4675 if (code
== ADDR_EXPR
4676 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4677 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4678 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4679 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4680 /* Don't look for a function. */;
4682 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4683 /*overloaded_p=*/NULL
, complain
);
4684 if (!exp
&& code
== ADDR_EXPR
)
4686 if (is_overloaded_fn (xarg
))
4688 tree fn
= get_first_fn (xarg
);
4689 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4691 error (DECL_CONSTRUCTOR_P (fn
)
4692 ? G_("taking address of constructor %qE")
4693 : G_("taking address of destructor %qE"),
4695 return error_mark_node
;
4699 /* A pointer to member-function can be formed only by saying
4701 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4702 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4704 if (TREE_CODE (xarg
) != OFFSET_REF
4705 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4707 error ("invalid use of %qE to form a pointer-to-member-function",
4709 if (TREE_CODE (xarg
) != OFFSET_REF
)
4710 inform (input_location
, " a qualified-id is required");
4711 return error_mark_node
;
4715 error ("parentheses around %qE cannot be used to form a"
4716 " pointer-to-member-function",
4718 PTRMEM_OK_P (xarg
) = 1;
4722 if (TREE_CODE (xarg
) == OFFSET_REF
)
4724 ptrmem
= PTRMEM_OK_P (xarg
);
4726 if (!ptrmem
&& !flag_ms_extensions
4727 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4729 /* A single non-static member, make sure we don't allow a
4730 pointer-to-member. */
4731 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4732 TREE_OPERAND (xarg
, 0),
4733 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4734 PTRMEM_OK_P (xarg
) = ptrmem
;
4738 exp
= cp_build_addr_expr_strict (xarg
, complain
);
4741 if (processing_template_decl
&& exp
!= error_mark_node
)
4742 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4743 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4744 if (TREE_CODE (exp
) == ADDR_EXPR
)
4745 PTRMEM_OK_P (exp
) = ptrmem
;
4749 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4750 constants, where a null value is represented by an INTEGER_CST of
4754 cp_truthvalue_conversion (tree expr
)
4756 tree type
= TREE_TYPE (expr
);
4757 if (TYPE_PTRMEM_P (type
))
4758 return build_binary_op (EXPR_LOCATION (expr
),
4759 NE_EXPR
, expr
, integer_zero_node
, 1);
4761 return c_common_truthvalue_conversion (input_location
, expr
);
4764 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4767 condition_conversion (tree expr
)
4770 if (processing_template_decl
)
4772 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4773 tf_warning_or_error
, LOOKUP_NORMAL
);
4774 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4778 /* Returns the address of T. This function will fold away
4779 ADDR_EXPR of INDIRECT_REF. */
4782 build_address (tree t
)
4784 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4785 return error_mark_node
;
4786 t
= build_fold_addr_expr (t
);
4787 if (TREE_CODE (t
) != ADDR_EXPR
)
4792 /* Returns the address of T with type TYPE. */
4795 build_typed_address (tree t
, tree type
)
4797 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4798 return error_mark_node
;
4799 t
= build_fold_addr_expr_with_type (t
, type
);
4800 if (TREE_CODE (t
) != ADDR_EXPR
)
4805 /* Return a NOP_EXPR converting EXPR to TYPE. */
4808 build_nop (tree type
, tree expr
)
4810 if (type
== error_mark_node
|| error_operand_p (expr
))
4812 return build1 (NOP_EXPR
, type
, expr
);
4815 /* Take the address of ARG, whatever that means under C++ semantics.
4816 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
4817 and class rvalues as well.
4819 Nothing should call this function directly; instead, callers should use
4820 cp_build_addr_expr or cp_build_addr_expr_strict. */
4823 cp_build_addr_expr_1 (tree arg
, bool strict_lvalue
, tsubst_flags_t complain
)
4828 if (!arg
|| error_operand_p (arg
))
4829 return error_mark_node
;
4831 arg
= mark_lvalue_use (arg
);
4832 argtype
= lvalue_type (arg
);
4834 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
4835 || !IDENTIFIER_OPNAME_P (arg
));
4837 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
4838 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
4840 /* They're trying to take the address of a unique non-static
4841 member function. This is ill-formed (except in MS-land),
4842 but let's try to DTRT.
4843 Note: We only handle unique functions here because we don't
4844 want to complain if there's a static overload; non-unique
4845 cases will be handled by instantiate_type. But we need to
4846 handle this case here to allow casts on the resulting PMF.
4847 We could defer this in non-MS mode, but it's easier to give
4848 a useful error here. */
4850 /* Inside constant member functions, the `this' pointer
4851 contains an extra const qualifier. TYPE_MAIN_VARIANT
4852 is used here to remove this const from the diagnostics
4853 and the created OFFSET_REF. */
4854 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
4855 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
4858 if (! flag_ms_extensions
)
4860 tree name
= DECL_NAME (fn
);
4861 if (!(complain
& tf_error
))
4862 return error_mark_node
;
4863 else if (current_class_type
4864 && TREE_OPERAND (arg
, 0) == current_class_ref
)
4865 /* An expression like &memfn. */
4866 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
4867 " or parenthesized non-static member function to form"
4868 " a pointer to member function. Say %<&%T::%D%>",
4871 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
4872 " function to form a pointer to member function."
4876 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
4879 /* Uninstantiated types are all functions. Taking the
4880 address of a function is a no-op, so just return the
4882 if (type_unknown_p (arg
))
4883 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4885 if (TREE_CODE (arg
) == OFFSET_REF
)
4886 /* We want a pointer to member; bypass all the code for actually taking
4887 the address of something. */
4890 /* Anything not already handled and not a true memory reference
4892 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4893 && TREE_CODE (argtype
) != METHOD_TYPE
)
4895 cp_lvalue_kind kind
= lvalue_kind (arg
);
4896 if (kind
== clk_none
)
4898 if (complain
& tf_error
)
4899 lvalue_error (lv_addressof
);
4900 return error_mark_node
;
4902 if (strict_lvalue
&& (kind
& (clk_rvalueref
|clk_class
)))
4904 if (!(complain
& tf_error
))
4905 return error_mark_node
;
4906 if (kind
& clk_class
)
4907 /* Make this a permerror because we used to accept it. */
4908 permerror (input_location
, "taking address of temporary");
4910 error ("taking address of xvalue (rvalue reference)");
4914 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4916 tree type
= build_pointer_type (TREE_TYPE (argtype
));
4917 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4920 else if (pedantic
&& DECL_MAIN_P (arg
))
4923 /* Apparently a lot of autoconf scripts for C++ packages do this,
4924 so only complain if -pedantic. */
4925 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
4926 pedwarn (input_location
, OPT_pedantic
,
4927 "ISO C++ forbids taking address of function %<::main%>");
4928 else if (flag_pedantic_errors
)
4929 return error_mark_node
;
4932 /* Let &* cancel out to simplify resulting code. */
4933 if (TREE_CODE (arg
) == INDIRECT_REF
)
4935 /* We don't need to have `current_class_ptr' wrapped in a
4936 NON_LVALUE_EXPR node. */
4937 if (arg
== current_class_ref
)
4938 return current_class_ptr
;
4940 arg
= TREE_OPERAND (arg
, 0);
4941 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
4943 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
4944 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4947 /* Don't let this be an lvalue. */
4952 /* ??? Cope with user tricks that amount to offsetof. */
4953 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4954 && TREE_CODE (argtype
) != METHOD_TYPE
4955 && argtype
!= unknown_type_node
4956 && (val
= get_base_address (arg
))
4957 && COMPLETE_TYPE_P (TREE_TYPE (val
))
4958 && TREE_CODE (val
) == INDIRECT_REF
4959 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
4961 tree type
= build_pointer_type (argtype
);
4962 tree op0
= fold_convert (type
, TREE_OPERAND (val
, 0));
4963 tree op1
= fold_convert (sizetype
, fold_offsetof (arg
, val
));
4964 return fold_build2 (POINTER_PLUS_EXPR
, type
, op0
, op1
);
4967 /* Handle complex lvalues (when permitted)
4968 by reduction to simpler cases. */
4969 val
= unary_complex_lvalue (ADDR_EXPR
, arg
);
4973 switch (TREE_CODE (arg
))
4977 case FIX_TRUNC_EXPR
:
4978 /* Even if we're not being pedantic, we cannot allow this
4979 extension when we're instantiating in a SFINAE
4981 if (! lvalue_p (arg
) && complain
== tf_none
)
4983 if (complain
& tf_error
)
4984 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4986 return error_mark_node
;
4991 arg
= BASELINK_FUNCTIONS (arg
);
4995 arg
= OVL_CURRENT (arg
);
5000 /* Turn a reference to a non-static data member into a
5001 pointer-to-member. */
5006 gcc_assert (PTRMEM_OK_P (arg
));
5008 t
= TREE_OPERAND (arg
, 1);
5009 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
5011 if (complain
& tf_error
)
5012 error ("cannot create pointer to reference member %qD", t
);
5013 return error_mark_node
;
5016 type
= build_ptrmem_type (context_for_name_lookup (t
),
5018 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
5026 if (argtype
!= error_mark_node
)
5027 argtype
= build_pointer_type (argtype
);
5029 /* In a template, we are processing a non-dependent expression
5030 so we can just form an ADDR_EXPR with the correct type. */
5031 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
5033 val
= build_address (arg
);
5034 if (TREE_CODE (arg
) == OFFSET_REF
)
5035 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
5037 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
5039 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
5041 /* We can only get here with a single static member
5043 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
5044 && DECL_STATIC_FUNCTION_P (fn
));
5046 val
= build_address (fn
);
5047 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
5048 /* Do not lose object's side effects. */
5049 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
5050 TREE_OPERAND (arg
, 0), val
);
5052 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
5054 if (complain
& tf_error
)
5055 error ("attempt to take address of bit-field structure member %qD",
5056 TREE_OPERAND (arg
, 1));
5057 return error_mark_node
;
5061 tree object
= TREE_OPERAND (arg
, 0);
5062 tree field
= TREE_OPERAND (arg
, 1);
5063 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5064 (TREE_TYPE (object
), decl_type_context (field
)));
5065 val
= build_address (arg
);
5068 if (TREE_CODE (argtype
) == POINTER_TYPE
5069 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
5071 build_ptrmemfunc_type (argtype
);
5072 val
= build_ptrmemfunc (argtype
, val
, 0,
5074 tf_warning_or_error
);
5080 /* Take the address of ARG if it has one, even if it's an rvalue. */
5083 cp_build_addr_expr (tree arg
, tsubst_flags_t complain
)
5085 return cp_build_addr_expr_1 (arg
, 0, complain
);
5088 /* Take the address of ARG, but only if it's an lvalue. */
5091 cp_build_addr_expr_strict (tree arg
, tsubst_flags_t complain
)
5093 return cp_build_addr_expr_1 (arg
, 1, complain
);
5096 /* C++: Must handle pointers to members.
5098 Perhaps type instantiation should be extended to handle conversion
5099 from aggregates to types we don't yet know we want? (Or are those
5100 cases typically errors which should be reported?)
5102 NOCONVERT nonzero suppresses the default promotions
5103 (such as from short to int). */
5106 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
5107 tsubst_flags_t complain
)
5109 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
5112 const char *errstring
= NULL
;
5114 const char *invalid_op_diag
;
5116 if (!arg
|| error_operand_p (arg
))
5117 return error_mark_node
;
5119 if ((invalid_op_diag
5120 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
5125 error (invalid_op_diag
);
5126 return error_mark_node
;
5131 case UNARY_PLUS_EXPR
:
5134 int flags
= WANT_ARITH
| WANT_ENUM
;
5135 /* Unary plus (but not unary minus) is allowed on pointers. */
5136 if (code
== UNARY_PLUS_EXPR
)
5137 flags
|= WANT_POINTER
;
5138 arg
= build_expr_type_conversion (flags
, arg
, true);
5140 errstring
= (code
== NEGATE_EXPR
5141 ? _("wrong type argument to unary minus")
5142 : _("wrong type argument to unary plus"));
5145 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5146 arg
= perform_integral_promotions (arg
);
5148 /* Make sure the result is not an lvalue: a unary plus or minus
5149 expression is always a rvalue. */
5156 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5160 arg
= default_conversion (arg
);
5162 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
5163 | WANT_VECTOR_OR_COMPLEX
,
5165 errstring
= _("wrong type argument to bit-complement");
5166 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5167 arg
= perform_integral_promotions (arg
);
5171 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5172 errstring
= _("wrong type argument to abs");
5173 else if (!noconvert
)
5174 arg
= default_conversion (arg
);
5178 /* Conjugating a real value is a no-op, but allow it anyway. */
5179 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5180 errstring
= _("wrong type argument to conjugation");
5181 else if (!noconvert
)
5182 arg
= default_conversion (arg
);
5185 case TRUTH_NOT_EXPR
:
5186 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
5188 val
= invert_truthvalue_loc (input_location
, arg
);
5189 if (arg
!= error_mark_node
)
5191 errstring
= _("in argument to unary !");
5198 if (TREE_CODE (arg
) == COMPLEX_CST
)
5199 return TREE_REALPART (arg
);
5200 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5202 arg
= build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
5203 return fold_if_not_in_template (arg
);
5209 if (TREE_CODE (arg
) == COMPLEX_CST
)
5210 return TREE_IMAGPART (arg
);
5211 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5213 arg
= build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
5214 return fold_if_not_in_template (arg
);
5217 return cp_convert (TREE_TYPE (arg
), integer_zero_node
);
5219 case PREINCREMENT_EXPR
:
5220 case POSTINCREMENT_EXPR
:
5221 case PREDECREMENT_EXPR
:
5222 case POSTDECREMENT_EXPR
:
5223 /* Handle complex lvalues (when permitted)
5224 by reduction to simpler cases. */
5226 val
= unary_complex_lvalue (code
, arg
);
5230 arg
= mark_lvalue_use (arg
);
5232 /* Increment or decrement the real part of the value,
5233 and don't change the imaginary part. */
5234 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5238 arg
= stabilize_reference (arg
);
5239 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
5240 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
5241 real
= cp_build_unary_op (code
, real
, 1, complain
);
5242 if (real
== error_mark_node
|| imag
== error_mark_node
)
5243 return error_mark_node
;
5244 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
5248 /* Report invalid types. */
5250 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
5253 if (code
== PREINCREMENT_EXPR
)
5254 errstring
= _("no pre-increment operator for type");
5255 else if (code
== POSTINCREMENT_EXPR
)
5256 errstring
= _("no post-increment operator for type");
5257 else if (code
== PREDECREMENT_EXPR
)
5258 errstring
= _("no pre-decrement operator for type");
5260 errstring
= _("no post-decrement operator for type");
5263 else if (arg
== error_mark_node
)
5264 return error_mark_node
;
5266 /* Report something read-only. */
5268 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
5269 || TREE_READONLY (arg
))
5271 if (complain
& tf_error
)
5272 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
5273 || code
== POSTINCREMENT_EXPR
)
5274 ? REK_INCREMENT
: REK_DECREMENT
));
5276 return error_mark_node
;
5281 tree declared_type
= unlowered_expr_type (arg
);
5283 argtype
= TREE_TYPE (arg
);
5285 /* ARM $5.2.5 last annotation says this should be forbidden. */
5286 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
5288 if (complain
& tf_error
)
5289 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
5290 ? G_("ISO C++ forbids incrementing an enum")
5291 : G_("ISO C++ forbids decrementing an enum"));
5293 return error_mark_node
;
5296 /* Compute the increment. */
5298 if (TREE_CODE (argtype
) == POINTER_TYPE
)
5300 tree type
= complete_type (TREE_TYPE (argtype
));
5302 if (!COMPLETE_OR_VOID_TYPE_P (type
))
5304 if (complain
& tf_error
)
5305 error (((code
== PREINCREMENT_EXPR
5306 || code
== POSTINCREMENT_EXPR
))
5307 ? G_("cannot increment a pointer to incomplete type %qT")
5308 : G_("cannot decrement a pointer to incomplete type %qT"),
5309 TREE_TYPE (argtype
));
5311 return error_mark_node
;
5313 else if ((pedantic
|| warn_pointer_arith
)
5314 && !TYPE_PTROB_P (argtype
))
5316 if (complain
& tf_error
)
5317 permerror (input_location
, (code
== PREINCREMENT_EXPR
5318 || code
== POSTINCREMENT_EXPR
)
5319 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
5320 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
5323 return error_mark_node
;
5326 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
5329 inc
= integer_one_node
;
5331 inc
= cp_convert (argtype
, inc
);
5333 /* Complain about anything else that is not a true lvalue. */
5334 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
5335 || code
== POSTINCREMENT_EXPR
)
5336 ? lv_increment
: lv_decrement
),
5338 return error_mark_node
;
5340 /* Forbid using -- on `bool'. */
5341 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
5343 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
5345 if (complain
& tf_error
)
5346 error ("invalid use of Boolean expression as operand "
5347 "to %<operator--%>");
5348 return error_mark_node
;
5350 val
= boolean_increment (code
, arg
);
5353 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
5355 TREE_SIDE_EFFECTS (val
) = 1;
5360 /* Note that this operation never does default_conversion
5361 regardless of NOCONVERT. */
5362 return cp_build_addr_expr (arg
, complain
);
5371 argtype
= TREE_TYPE (arg
);
5372 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5375 if (complain
& tf_error
)
5376 error ("%s", errstring
);
5377 return error_mark_node
;
5380 /* Hook for the c-common bits that build a unary op. */
5382 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5383 enum tree_code code
, tree xarg
, int noconvert
)
5385 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5388 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5389 for certain kinds of expressions which are not really lvalues
5390 but which we can accept as lvalues.
5392 If ARG is not a kind of expression we can handle, return
5396 unary_complex_lvalue (enum tree_code code
, tree arg
)
5398 /* Inside a template, making these kinds of adjustments is
5399 pointless; we are only concerned with the type of the
5401 if (processing_template_decl
)
5404 /* Handle (a, b) used as an "lvalue". */
5405 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5407 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5408 tf_warning_or_error
);
5409 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5410 TREE_OPERAND (arg
, 0), real_result
);
5413 /* Handle (a ? b : c) used as an "lvalue". */
5414 if (TREE_CODE (arg
) == COND_EXPR
5415 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5416 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5418 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5419 if (TREE_CODE (arg
) == MODIFY_EXPR
5420 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5421 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5423 tree lvalue
= TREE_OPERAND (arg
, 0);
5424 if (TREE_SIDE_EFFECTS (lvalue
))
5426 lvalue
= stabilize_reference (lvalue
);
5427 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5428 lvalue
, TREE_OPERAND (arg
, 1));
5430 return unary_complex_lvalue
5431 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5434 if (code
!= ADDR_EXPR
)
5437 /* Handle (a = b) used as an "lvalue" for `&'. */
5438 if (TREE_CODE (arg
) == MODIFY_EXPR
5439 || TREE_CODE (arg
) == INIT_EXPR
)
5441 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5442 tf_warning_or_error
);
5443 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5445 TREE_NO_WARNING (arg
) = 1;
5449 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5450 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5451 || TREE_CODE (arg
) == OFFSET_REF
)
5454 /* We permit compiler to make function calls returning
5455 objects of aggregate type look like lvalues. */
5459 if (TREE_CODE (targ
) == SAVE_EXPR
)
5460 targ
= TREE_OPERAND (targ
, 0);
5462 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5464 if (TREE_CODE (arg
) == SAVE_EXPR
)
5467 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
5468 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5471 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5472 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5473 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5476 /* Don't let anything else be handled specially. */
5480 /* Mark EXP saying that we need to be able to take the
5481 address of it; it should not be allocated in a register.
5482 Value is true if successful.
5484 C++: we do not allow `current_class_ptr' to be addressable. */
5487 cxx_mark_addressable (tree exp
)
5492 switch (TREE_CODE (x
))
5499 x
= TREE_OPERAND (x
, 0);
5503 if (x
== current_class_ptr
)
5505 error ("cannot take the address of %<this%>, which is an rvalue expression");
5506 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5512 /* Caller should not be trying to mark initialized
5513 constant fields addressable. */
5514 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5515 || DECL_IN_AGGR_P (x
) == 0
5517 || DECL_EXTERNAL (x
));
5522 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5523 && !DECL_ARTIFICIAL (x
))
5525 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5528 ("address of explicit register variable %qD requested", x
);
5531 else if (extra_warnings
)
5533 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5535 TREE_ADDRESSABLE (x
) = 1;
5539 TREE_ADDRESSABLE (x
) = 1;
5543 TREE_ADDRESSABLE (x
) = 1;
5547 TREE_ADDRESSABLE (x
) = 1;
5548 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5556 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5559 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5560 tsubst_flags_t complain
)
5562 tree orig_ifexp
= ifexp
;
5563 tree orig_op1
= op1
;
5564 tree orig_op2
= op2
;
5567 if (processing_template_decl
)
5569 /* The standard says that the expression is type-dependent if
5570 IFEXP is type-dependent, even though the eventual type of the
5571 expression doesn't dependent on IFEXP. */
5572 if (type_dependent_expression_p (ifexp
)
5573 /* As a GNU extension, the middle operand may be omitted. */
5574 || (op1
&& type_dependent_expression_p (op1
))
5575 || type_dependent_expression_p (op2
))
5576 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5577 ifexp
= build_non_dependent_expr (ifexp
);
5579 op1
= build_non_dependent_expr (op1
);
5580 op2
= build_non_dependent_expr (op2
);
5583 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5584 if (processing_template_decl
&& expr
!= error_mark_node
)
5585 return build_min_non_dep (COND_EXPR
, expr
,
5586 orig_ifexp
, orig_op1
, orig_op2
);
5590 /* Given a list of expressions, return a compound expression
5591 that performs them all and returns the value of the last of them. */
5594 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
,
5595 tsubst_flags_t complain
)
5597 tree expr
= TREE_VALUE (list
);
5599 if (TREE_CHAIN (list
))
5601 if (complain
& tf_error
)
5605 permerror (input_location
, "expression list treated as compound "
5606 "expression in initializer");
5609 permerror (input_location
, "expression list treated as compound "
5610 "expression in mem-initializer");
5613 permerror (input_location
, "expression list treated as compound "
5614 "expression in functional cast");
5620 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5621 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5628 /* Like build_x_compound_expr_from_list, but using a VEC. */
5631 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5633 if (VEC_empty (tree
, vec
))
5635 else if (VEC_length (tree
, vec
) == 1)
5636 return VEC_index (tree
, vec
, 0);
5644 permerror (input_location
,
5645 "%s expression list treated as compound expression",
5648 expr
= VEC_index (tree
, vec
, 0);
5649 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5650 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5656 /* Handle overloading of the ',' operator when needed. */
5659 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5662 tree orig_op1
= op1
;
5663 tree orig_op2
= op2
;
5665 if (processing_template_decl
)
5667 if (type_dependent_expression_p (op1
)
5668 || type_dependent_expression_p (op2
))
5669 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5670 op1
= build_non_dependent_expr (op1
);
5671 op2
= build_non_dependent_expr (op2
);
5674 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5675 /*overloaded_p=*/NULL
, complain
);
5677 result
= cp_build_compound_expr (op1
, op2
, complain
);
5679 if (processing_template_decl
&& result
!= error_mark_node
)
5680 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5685 /* Like cp_build_compound_expr, but for the c-common bits. */
5688 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5690 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5693 /* Build a compound expression. */
5696 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5698 lhs
= convert_to_void (lhs
, ICV_LEFT_OF_COMMA
, complain
);
5700 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5701 return error_mark_node
;
5703 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5705 /* If the rhs is a TARGET_EXPR, then build the compound
5706 expression inside the target_expr's initializer. This
5707 helps the compiler to eliminate unnecessary temporaries. */
5708 tree init
= TREE_OPERAND (rhs
, 1);
5710 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5711 TREE_OPERAND (rhs
, 1) = init
;
5716 if (type_unknown_p (rhs
))
5718 error ("no context to resolve type of %qE", rhs
);
5719 return error_mark_node
;
5722 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5725 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5726 casts away constness. CAST gives the type of cast.
5728 ??? This function warns for casting away any qualifier not just
5729 const. We would like to specify exactly what qualifiers are casted
5734 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5735 enum tree_code cast
)
5737 /* C-style casts are allowed to cast away constness. With
5738 WARN_CAST_QUAL, we still want to issue a warning. */
5739 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5742 if (!casts_away_constness (src_type
, dest_type
))
5748 warning (OPT_Wcast_qual
,
5749 "cast from type %qT to type %qT casts away qualifiers",
5750 src_type
, dest_type
);
5753 case STATIC_CAST_EXPR
:
5754 error ("static_cast from type %qT to type %qT casts away qualifiers",
5755 src_type
, dest_type
);
5758 case REINTERPRET_CAST_EXPR
:
5759 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5760 src_type
, dest_type
);
5767 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5768 (another pointer-to-member type in the same hierarchy) and return
5769 the converted expression. If ALLOW_INVERSE_P is permitted, a
5770 pointer-to-derived may be converted to pointer-to-base; otherwise,
5771 only the other direction is permitted. If C_CAST_P is true, this
5772 conversion is taking place as part of a C-style cast. */
5775 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5776 bool c_cast_p
, tsubst_flags_t complain
)
5778 if (TYPE_PTRMEM_P (type
))
5782 if (TREE_CODE (expr
) == PTRMEM_CST
)
5783 expr
= cplus_expand_constant (expr
);
5784 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5785 TYPE_PTRMEM_CLASS_TYPE (type
),
5787 c_cast_p
, complain
);
5788 if (delta
== error_mark_node
)
5789 return error_mark_node
;
5791 if (!integer_zerop (delta
))
5793 tree cond
, op1
, op2
;
5795 cond
= cp_build_binary_op (input_location
,
5798 build_int_cst (TREE_TYPE (expr
), -1),
5799 tf_warning_or_error
);
5800 op1
= build_nop (ptrdiff_type_node
, expr
);
5801 op2
= cp_build_binary_op (input_location
,
5802 PLUS_EXPR
, op1
, delta
,
5803 tf_warning_or_error
);
5805 expr
= fold_build3_loc (input_location
,
5806 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5810 return build_nop (type
, expr
);
5813 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5814 allow_inverse_p
, c_cast_p
, complain
);
5817 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
5818 a version of EXPR that has TREE_OVERFLOW set if it is set in ORIG.
5819 Otherwise, return EXPR unchanged. */
5822 ignore_overflows (tree expr
, tree orig
)
5824 if (TREE_CODE (expr
) == INTEGER_CST
5825 && CONSTANT_CLASS_P (orig
)
5826 && TREE_CODE (orig
) != STRING_CST
5827 && TREE_OVERFLOW (expr
) != TREE_OVERFLOW (orig
))
5829 if (!TREE_OVERFLOW (orig
))
5830 /* Ensure constant sharing. */
5831 expr
= build_int_cst_wide (TREE_TYPE (expr
),
5832 TREE_INT_CST_LOW (expr
),
5833 TREE_INT_CST_HIGH (expr
));
5836 /* Avoid clobbering a shared constant. */
5837 expr
= copy_node (expr
);
5838 TREE_OVERFLOW (expr
) = TREE_OVERFLOW (orig
);
5844 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5845 this static_cast is being attempted as one of the possible casts
5846 allowed by a C-style cast. (In that case, accessibility of base
5847 classes is not considered, and it is OK to cast away
5848 constness.) Return the result of the cast. *VALID_P is set to
5849 indicate whether or not the cast was valid. */
5852 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5853 bool *valid_p
, tsubst_flags_t complain
)
5859 /* Assume the cast is valid. */
5862 intype
= TREE_TYPE (expr
);
5864 /* Save casted types in the function's used types hash table. */
5865 used_types_insert (type
);
5867 /* [expr.static.cast]
5869 An lvalue of type "cv1 B", where B is a class type, can be cast
5870 to type "reference to cv2 D", where D is a class derived (clause
5871 _class.derived_) from B, if a valid standard conversion from
5872 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5873 same cv-qualification as, or greater cv-qualification than, cv1,
5874 and B is not a virtual base class of D. */
5875 /* We check this case before checking the validity of "TYPE t =
5876 EXPR;" below because for this case:
5879 struct D : public B { D(const B&); };
5881 void f() { static_cast<const D&>(b); }
5883 we want to avoid constructing a new D. The standard is not
5884 completely clear about this issue, but our interpretation is
5885 consistent with other compilers. */
5886 if (TREE_CODE (type
) == REFERENCE_TYPE
5887 && CLASS_TYPE_P (TREE_TYPE (type
))
5888 && CLASS_TYPE_P (intype
)
5889 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5890 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5891 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5892 build_pointer_type (TYPE_MAIN_VARIANT
5893 (TREE_TYPE (type
))))
5895 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5899 /* There is a standard conversion from "D*" to "B*" even if "B"
5900 is ambiguous or inaccessible. If this is really a
5901 static_cast, then we check both for inaccessibility and
5902 ambiguity. However, if this is a static_cast being performed
5903 because the user wrote a C-style cast, then accessibility is
5905 base
= lookup_base (TREE_TYPE (type
), intype
,
5906 c_cast_p
? ba_unique
: ba_check
,
5909 /* Convert from "B*" to "D*". This function will check that "B"
5910 is not a virtual base of "D". */
5911 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5912 base
, /*nonnull=*/false);
5913 /* Convert the pointer to a reference -- but then remember that
5914 there are no expressions with reference type in C++. */
5915 return convert_from_reference (cp_fold_convert (type
, expr
));
5918 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5919 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5920 if (TREE_CODE (type
) == REFERENCE_TYPE
5921 && TYPE_REF_IS_RVALUE (type
)
5922 && real_lvalue_p (expr
)
5923 && reference_related_p (TREE_TYPE (type
), intype
)
5924 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5926 expr
= build_typed_address (expr
, type
);
5927 return convert_from_reference (expr
);
5932 /* Resolve overloaded address here rather than once in
5933 implicit_conversion and again in the inverse code below. */
5934 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5936 expr
= instantiate_type (type
, expr
, complain
);
5937 intype
= TREE_TYPE (expr
);
5940 /* [expr.static.cast]
5942 An expression e can be explicitly converted to a type T using a
5943 static_cast of the form static_cast<T>(e) if the declaration T
5944 t(e);" is well-formed, for some invented temporary variable
5946 result
= perform_direct_initialization_if_possible (type
, expr
,
5947 c_cast_p
, complain
);
5950 result
= convert_from_reference (result
);
5952 /* Ignore any integer overflow caused by the cast. */
5953 result
= ignore_overflows (result
, orig
);
5955 /* [expr.static.cast]
5957 If T is a reference type, the result is an lvalue; otherwise,
5958 the result is an rvalue. */
5959 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5960 result
= rvalue (result
);
5964 /* [expr.static.cast]
5966 Any expression can be explicitly converted to type cv void. */
5967 if (TREE_CODE (type
) == VOID_TYPE
)
5968 return convert_to_void (expr
, ICV_CAST
, complain
);
5970 /* [expr.static.cast]
5972 The inverse of any standard conversion sequence (clause _conv_),
5973 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5974 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5975 (_conv.bool_) conversions, can be performed explicitly using
5976 static_cast subject to the restriction that the explicit
5977 conversion does not cast away constness (_expr.const.cast_), and
5978 the following additional rules for specific cases: */
5979 /* For reference, the conversions not excluded are: integral
5980 promotions, floating point promotion, integral conversions,
5981 floating point conversions, floating-integral conversions,
5982 pointer conversions, and pointer to member conversions. */
5985 A value of integral _or enumeration_ type can be explicitly
5986 converted to an enumeration type. */
5987 /* The effect of all that is that any conversion between any two
5988 types which are integral, floating, or enumeration types can be
5990 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5991 || SCALAR_FLOAT_TYPE_P (type
))
5992 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5993 || SCALAR_FLOAT_TYPE_P (intype
)))
5995 expr
= ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5997 /* Ignore any integer overflow caused by the cast. */
5998 expr
= ignore_overflows (expr
, orig
);
6002 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
6003 && CLASS_TYPE_P (TREE_TYPE (type
))
6004 && CLASS_TYPE_P (TREE_TYPE (intype
))
6005 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
6006 (TREE_TYPE (intype
))),
6007 build_pointer_type (TYPE_MAIN_VARIANT
6008 (TREE_TYPE (type
)))))
6013 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
6014 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
6015 c_cast_p
? ba_unique
: ba_check
,
6017 return build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
6020 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6021 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6028 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
6029 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
6031 if (TYPE_PTRMEM_P (type
))
6033 t1
= (build_ptrmem_type
6035 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
6036 t2
= (build_ptrmem_type
6038 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
6045 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
6048 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
6049 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
6050 c_cast_p
, tf_warning_or_error
);
6054 /* [expr.static.cast]
6056 An rvalue of type "pointer to cv void" can be explicitly
6057 converted to a pointer to object type. A value of type pointer
6058 to object converted to "pointer to cv void" and back to the
6059 original pointer type will have its original value. */
6060 if (TREE_CODE (intype
) == POINTER_TYPE
6061 && VOID_TYPE_P (TREE_TYPE (intype
))
6062 && TYPE_PTROB_P (type
))
6065 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
6066 return build_nop (type
, expr
);
6070 return error_mark_node
;
6073 /* Return an expression representing static_cast<TYPE>(EXPR). */
6076 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6081 if (type
== error_mark_node
|| expr
== error_mark_node
)
6082 return error_mark_node
;
6084 if (processing_template_decl
)
6086 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
6087 /* We don't know if it will or will not have side effects. */
6088 TREE_SIDE_EFFECTS (expr
) = 1;
6089 return convert_from_reference (expr
);
6092 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6093 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6094 if (TREE_CODE (type
) != REFERENCE_TYPE
6095 && TREE_CODE (expr
) == NOP_EXPR
6096 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6097 expr
= TREE_OPERAND (expr
, 0);
6099 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
6104 if (complain
& tf_error
)
6105 error ("invalid static_cast from type %qT to type %qT",
6106 TREE_TYPE (expr
), type
);
6107 return error_mark_node
;
6110 /* EXPR is an expression with member function or pointer-to-member
6111 function type. TYPE is a pointer type. Converting EXPR to TYPE is
6112 not permitted by ISO C++, but we accept it in some modes. If we
6113 are not in one of those modes, issue a diagnostic. Return the
6114 converted expression. */
6117 convert_member_func_to_ptr (tree type
, tree expr
)
6122 intype
= TREE_TYPE (expr
);
6123 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
6124 || TREE_CODE (intype
) == METHOD_TYPE
);
6126 if (pedantic
|| warn_pmf2ptr
)
6127 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
6128 "converting from %qT to %qT", intype
, type
);
6130 if (TREE_CODE (intype
) == METHOD_TYPE
)
6131 expr
= build_addr_func (expr
);
6132 else if (TREE_CODE (expr
) == PTRMEM_CST
)
6133 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
6136 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
6137 decl
= build_address (decl
);
6138 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
6141 return build_nop (type
, expr
);
6144 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
6145 If C_CAST_P is true, this reinterpret cast is being done as part of
6146 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
6147 indicate whether or not reinterpret_cast was valid. */
6150 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6151 bool *valid_p
, tsubst_flags_t complain
)
6155 /* Assume the cast is invalid. */
6159 if (type
== error_mark_node
|| error_operand_p (expr
))
6160 return error_mark_node
;
6162 intype
= TREE_TYPE (expr
);
6164 /* Save casted types in the function's used types hash table. */
6165 used_types_insert (type
);
6167 /* [expr.reinterpret.cast]
6168 An lvalue expression of type T1 can be cast to the type
6169 "reference to T2" if an expression of type "pointer to T1" can be
6170 explicitly converted to the type "pointer to T2" using a
6171 reinterpret_cast. */
6172 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6174 if (! real_lvalue_p (expr
))
6176 if (complain
& tf_error
)
6177 error ("invalid cast of an rvalue expression of type "
6180 return error_mark_node
;
6183 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6184 "B" are related class types; the reinterpret_cast does not
6185 adjust the pointer. */
6186 if (TYPE_PTR_P (intype
)
6187 && (complain
& tf_warning
)
6188 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
6189 COMPARE_BASE
| COMPARE_DERIVED
)))
6190 warning (0, "casting %qT to %qT does not dereference pointer",
6193 expr
= cp_build_addr_expr (expr
, complain
);
6195 if (warn_strict_aliasing
> 2)
6196 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
6198 if (expr
!= error_mark_node
)
6199 expr
= build_reinterpret_cast_1
6200 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
6202 if (expr
!= error_mark_node
)
6203 /* cp_build_indirect_ref isn't right for rvalue refs. */
6204 expr
= convert_from_reference (fold_convert (type
, expr
));
6208 /* As a G++ extension, we consider conversions from member
6209 functions, and pointers to member functions to
6210 pointer-to-function and pointer-to-void types. If
6211 -Wno-pmf-conversions has not been specified,
6212 convert_member_func_to_ptr will issue an error message. */
6213 if ((TYPE_PTRMEMFUNC_P (intype
)
6214 || TREE_CODE (intype
) == METHOD_TYPE
)
6215 && TYPE_PTR_P (type
)
6216 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6217 || VOID_TYPE_P (TREE_TYPE (type
))))
6218 return convert_member_func_to_ptr (type
, expr
);
6220 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6221 array-to-pointer, and function-to-pointer conversions are
6223 expr
= decay_conversion (expr
);
6225 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6226 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6227 if (TREE_CODE (expr
) == NOP_EXPR
6228 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6229 expr
= TREE_OPERAND (expr
, 0);
6231 if (error_operand_p (expr
))
6232 return error_mark_node
;
6234 intype
= TREE_TYPE (expr
);
6236 /* [expr.reinterpret.cast]
6237 A pointer can be converted to any integral type large enough to
6238 hold it. ... A value of type std::nullptr_t can be converted to
6239 an integral type; the conversion has the same meaning and
6240 validity as a conversion of (void*)0 to the integral type. */
6241 if (CP_INTEGRAL_TYPE_P (type
)
6242 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
6244 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
6246 if (complain
& tf_error
)
6247 permerror (input_location
, "cast from %qT to %qT loses precision",
6250 return error_mark_node
;
6252 if (NULLPTR_TYPE_P (intype
))
6253 return build_int_cst (type
, 0);
6255 /* [expr.reinterpret.cast]
6256 A value of integral or enumeration type can be explicitly
6257 converted to a pointer. */
6258 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6261 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6262 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6263 return fold_if_not_in_template (build_nop (type
, expr
));
6264 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6265 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6270 check_for_casting_away_constness (intype
, type
, REINTERPRET_CAST_EXPR
);
6271 /* Warn about possible alignment problems. */
6272 if (STRICT_ALIGNMENT
&& warn_cast_align
6273 && (complain
& tf_warning
)
6274 && !VOID_TYPE_P (type
)
6275 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6276 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6277 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6278 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6279 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6280 "increases required alignment of target type", intype
, type
);
6282 /* We need to strip nops here, because the front end likes to
6283 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6285 if (warn_strict_aliasing
<= 2)
6286 strict_aliasing_warning (intype
, type
, sexpr
);
6288 return fold_if_not_in_template (build_nop (type
, expr
));
6290 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6291 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6293 if (pedantic
&& (complain
& tf_warning
))
6294 /* Only issue a warning, as we have always supported this
6295 where possible, and it is necessary in some cases. DR 195
6296 addresses this issue, but as of 2004/10/26 is still in
6298 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6299 return fold_if_not_in_template (build_nop (type
, expr
));
6301 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6302 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6303 else if (TREE_CODE (intype
) == VECTOR_TYPE
6304 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6305 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6310 if (complain
& tf_error
)
6311 error ("invalid cast from type %qT to type %qT", intype
, type
);
6312 return error_mark_node
;
6315 return cp_convert (type
, expr
);
6319 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6321 if (type
== error_mark_node
|| expr
== error_mark_node
)
6322 return error_mark_node
;
6324 if (processing_template_decl
)
6326 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6328 if (!TREE_SIDE_EFFECTS (t
)
6329 && type_dependent_expression_p (expr
))
6330 /* There might turn out to be side effects inside expr. */
6331 TREE_SIDE_EFFECTS (t
) = 1;
6332 return convert_from_reference (t
);
6335 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6336 /*valid_p=*/NULL
, complain
);
6339 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6340 return an appropriate expression. Otherwise, return
6341 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6342 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6343 performing a C-style cast, its value upon return will indicate
6344 whether or not the conversion succeeded. */
6347 build_const_cast_1 (tree dst_type
, tree expr
, bool complain
,
6351 tree reference_type
;
6353 /* Callers are responsible for handling error_mark_node as a
6354 destination type. */
6355 gcc_assert (dst_type
!= error_mark_node
);
6356 /* In a template, callers should be building syntactic
6357 representations of casts, not using this machinery. */
6358 gcc_assert (!processing_template_decl
);
6360 /* Assume the conversion is invalid. */
6364 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6367 error ("invalid use of const_cast with type %qT, "
6368 "which is not a pointer, "
6369 "reference, nor a pointer-to-data-member type", dst_type
);
6370 return error_mark_node
;
6373 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6376 error ("invalid use of const_cast with type %qT, which is a pointer "
6377 "or reference to a function type", dst_type
);
6378 return error_mark_node
;
6381 /* Save casted types in the function's used types hash table. */
6382 used_types_insert (dst_type
);
6384 src_type
= TREE_TYPE (expr
);
6385 /* Expressions do not really have reference types. */
6386 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6387 src_type
= TREE_TYPE (src_type
);
6389 /* [expr.const.cast]
6391 An lvalue of type T1 can be explicitly converted to an lvalue of
6392 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6393 types) if a pointer to T1 can be explicitly converted to the type
6394 pointer to T2 using a const_cast. */
6395 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6397 reference_type
= dst_type
;
6398 if (! real_lvalue_p (expr
))
6401 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6402 src_type
, dst_type
);
6403 return error_mark_node
;
6405 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6406 src_type
= build_pointer_type (src_type
);
6410 reference_type
= NULL_TREE
;
6411 /* If the destination type is not a reference type, the
6412 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6413 conversions are performed. */
6414 src_type
= type_decays_to (src_type
);
6415 if (src_type
== error_mark_node
)
6416 return error_mark_node
;
6419 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6420 && comp_ptr_ttypes_const (dst_type
, src_type
))
6425 /* This cast is actually a C-style cast. Issue a warning if
6426 the user is making a potentially unsafe cast. */
6427 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
);
6431 expr
= cp_build_addr_expr (expr
,
6432 complain
? tf_warning_or_error
: tf_none
);
6433 expr
= build_nop (reference_type
, expr
);
6434 return convert_from_reference (expr
);
6438 expr
= decay_conversion (expr
);
6439 /* build_c_cast puts on a NOP_EXPR to make the result not an
6440 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6441 non-lvalue context. */
6442 if (TREE_CODE (expr
) == NOP_EXPR
6443 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6444 expr
= TREE_OPERAND (expr
, 0);
6445 return build_nop (dst_type
, expr
);
6450 error ("invalid const_cast from type %qT to type %qT",
6451 src_type
, dst_type
);
6452 return error_mark_node
;
6456 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6458 if (type
== error_mark_node
|| error_operand_p (expr
))
6459 return error_mark_node
;
6461 if (processing_template_decl
)
6463 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6465 if (!TREE_SIDE_EFFECTS (t
)
6466 && type_dependent_expression_p (expr
))
6467 /* There might turn out to be side effects inside expr. */
6468 TREE_SIDE_EFFECTS (t
) = 1;
6469 return convert_from_reference (t
);
6472 return build_const_cast_1 (type
, expr
, complain
& tf_error
,
6476 /* Like cp_build_c_cast, but for the c-common bits. */
6479 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6481 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6484 /* Build an expression representing an explicit C-style cast to type
6485 TYPE of expression EXPR. */
6488 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6494 if (type
== error_mark_node
|| error_operand_p (expr
))
6495 return error_mark_node
;
6497 if (processing_template_decl
)
6499 tree t
= build_min (CAST_EXPR
, type
,
6500 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6501 /* We don't know if it will or will not have side effects. */
6502 TREE_SIDE_EFFECTS (t
) = 1;
6503 return convert_from_reference (t
);
6506 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6507 'Class') should always be retained, because this information aids
6508 in method lookup. */
6509 if (objc_is_object_ptr (type
)
6510 && objc_is_object_ptr (TREE_TYPE (expr
)))
6511 return build_nop (type
, expr
);
6513 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6514 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6515 if (TREE_CODE (type
) != REFERENCE_TYPE
6516 && TREE_CODE (value
) == NOP_EXPR
6517 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6518 value
= TREE_OPERAND (value
, 0);
6520 if (TREE_CODE (type
) == ARRAY_TYPE
)
6522 /* Allow casting from T1* to T2[] because Cfront allows it.
6523 NIHCL uses it. It is not valid ISO C++ however. */
6524 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6526 if (complain
& tf_error
)
6527 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6529 return error_mark_node
;
6530 type
= build_pointer_type (TREE_TYPE (type
));
6534 if (complain
& tf_error
)
6535 error ("ISO C++ forbids casting to an array type %qT", type
);
6536 return error_mark_node
;
6540 if (TREE_CODE (type
) == FUNCTION_TYPE
6541 || TREE_CODE (type
) == METHOD_TYPE
)
6543 if (complain
& tf_error
)
6544 error ("invalid cast to function type %qT", type
);
6545 return error_mark_node
;
6548 if (TREE_CODE (type
) == POINTER_TYPE
6549 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
6550 /* Casting to an integer of smaller size is an error detected elsewhere. */
6551 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
6552 /* Don't warn about converting any constant. */
6553 && !TREE_CONSTANT (value
))
6554 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
6555 "cast to pointer from integer of different size");
6557 /* A C-style cast can be a const_cast. */
6558 result
= build_const_cast_1 (type
, value
, /*complain=*/false,
6563 /* Or a static cast. */
6564 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6565 &valid_p
, complain
);
6566 /* Or a reinterpret_cast. */
6568 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6569 &valid_p
, complain
);
6570 /* The static_cast or reinterpret_cast may be followed by a
6573 /* A valid cast may result in errors if, for example, a
6574 conversion to am ambiguous base class is required. */
6575 && !error_operand_p (result
))
6579 /* Non-class rvalues always have cv-unqualified type. */
6580 if (!CLASS_TYPE_P (type
))
6581 type
= TYPE_MAIN_VARIANT (type
);
6582 result_type
= TREE_TYPE (result
);
6583 if (!CLASS_TYPE_P (result_type
))
6584 result_type
= TYPE_MAIN_VARIANT (result_type
);
6585 /* If the type of RESULT does not match TYPE, perform a
6586 const_cast to make it match. If the static_cast or
6587 reinterpret_cast succeeded, we will differ by at most
6588 cv-qualification, so the follow-on const_cast is guaranteed
6590 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6592 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6593 gcc_assert (valid_p
);
6598 return error_mark_node
;
6601 /* For use from the C common bits. */
6603 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6604 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6605 enum tree_code modifycode
,
6606 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6607 tree rhs_origtype ATTRIBUTE_UNUSED
)
6609 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6612 /* Build an assignment expression of lvalue LHS from value RHS.
6613 MODIFYCODE is the code for a binary operator that we use
6614 to combine the old value of LHS with RHS to get the new value.
6615 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6617 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6620 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6621 tsubst_flags_t complain
)
6625 tree lhstype
= TREE_TYPE (lhs
);
6626 tree olhstype
= lhstype
;
6627 bool plain_assign
= (modifycode
== NOP_EXPR
);
6629 /* Avoid duplicate error messages from operands that had errors. */
6630 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6631 return error_mark_node
;
6633 /* Handle control structure constructs used as "lvalues". */
6634 switch (TREE_CODE (lhs
))
6636 /* Handle --foo = 5; as these are valid constructs in C++. */
6637 case PREDECREMENT_EXPR
:
6638 case PREINCREMENT_EXPR
:
6639 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6640 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6641 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6642 TREE_OPERAND (lhs
, 1));
6643 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6644 modifycode
, rhs
, complain
);
6645 if (newrhs
== error_mark_node
)
6646 return error_mark_node
;
6647 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6649 /* Handle (a, b) used as an "lvalue". */
6651 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6652 modifycode
, rhs
, complain
);
6653 if (newrhs
== error_mark_node
)
6654 return error_mark_node
;
6655 return build2 (COMPOUND_EXPR
, lhstype
,
6656 TREE_OPERAND (lhs
, 0), newrhs
);
6659 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6660 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6661 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6662 TREE_OPERAND (lhs
, 1));
6663 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6665 if (newrhs
== error_mark_node
)
6666 return error_mark_node
;
6667 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6671 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6672 when neither operand has side-effects. */
6673 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6674 return error_mark_node
;
6676 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6677 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6679 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6680 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6682 TREE_OPERAND (lhs
, 0),
6683 TREE_OPERAND (lhs
, 1)),
6684 TREE_OPERAND (lhs
, 0),
6685 TREE_OPERAND (lhs
, 1));
6688 /* Handle (a ? b : c) used as an "lvalue". */
6691 /* Produce (a ? (b = rhs) : (c = rhs))
6692 except that the RHS goes through a save-expr
6693 so the code to compute it is only emitted once. */
6695 tree preeval
= NULL_TREE
;
6697 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6699 if (complain
& tf_error
)
6700 error ("void value not ignored as it ought to be");
6701 return error_mark_node
;
6704 rhs
= stabilize_expr (rhs
, &preeval
);
6706 /* Check this here to avoid odd errors when trying to convert
6707 a throw to the type of the COND_EXPR. */
6708 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6709 return error_mark_node
;
6711 cond
= build_conditional_expr
6712 (TREE_OPERAND (lhs
, 0),
6713 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6714 modifycode
, rhs
, complain
),
6715 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6716 modifycode
, rhs
, complain
),
6719 if (cond
== error_mark_node
)
6721 /* Make sure the code to compute the rhs comes out
6722 before the split. */
6724 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6732 if (modifycode
== INIT_EXPR
)
6734 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6735 /* Do the default thing. */;
6736 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6738 /* Compound literal. */
6739 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6740 /* Call convert to generate an error; see PR 11063. */
6741 rhs
= convert (lhstype
, rhs
);
6742 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6743 TREE_SIDE_EFFECTS (result
) = 1;
6746 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6747 /* Do the default thing. */;
6750 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6751 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6752 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6754 release_tree_vector (rhs_vec
);
6755 if (result
== NULL_TREE
)
6756 return error_mark_node
;
6762 lhs
= require_complete_type_sfinae (lhs
, complain
);
6763 if (lhs
== error_mark_node
)
6764 return error_mark_node
;
6766 if (modifycode
== NOP_EXPR
)
6768 if (c_dialect_objc ())
6770 result
= objc_maybe_build_modify_expr (lhs
, rhs
);
6775 /* `operator=' is not an inheritable operator. */
6776 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6777 /* Do the default thing. */;
6780 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6781 lhs
, rhs
, make_node (NOP_EXPR
),
6782 /*overloaded_p=*/NULL
,
6784 if (result
== NULL_TREE
)
6785 return error_mark_node
;
6792 /* A binary op has been requested. Combine the old LHS
6793 value with the RHS producing the value we should actually
6794 store into the LHS. */
6795 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6796 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6797 || MAYBE_CLASS_TYPE_P (lhstype
)));
6799 lhs
= stabilize_reference (lhs
);
6800 newrhs
= cp_build_binary_op (input_location
,
6801 modifycode
, lhs
, rhs
,
6803 if (newrhs
== error_mark_node
)
6805 if (complain
& tf_error
)
6806 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6807 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6808 return error_mark_node
;
6811 /* Now it looks like a plain assignment. */
6812 modifycode
= NOP_EXPR
;
6813 if (c_dialect_objc ())
6815 result
= objc_maybe_build_modify_expr (lhs
, newrhs
);
6820 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6821 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6824 /* The left-hand side must be an lvalue. */
6825 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6826 return error_mark_node
;
6828 /* Warn about modifying something that is `const'. Don't warn if
6829 this is initialization. */
6830 if (modifycode
!= INIT_EXPR
6831 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6832 /* Functions are not modifiable, even though they are
6834 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6835 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6836 /* If it's an aggregate and any field is const, then it is
6837 effectively const. */
6838 || (CLASS_TYPE_P (lhstype
)
6839 && C_TYPE_FIELDS_READONLY (lhstype
))))
6841 if (complain
& tf_error
)
6842 readonly_error (lhs
, REK_ASSIGNMENT
);
6844 return error_mark_node
;
6847 /* If storing into a structure or union member, it may have been given a
6848 lowered bitfield type. We need to convert to the declared type first,
6849 so retrieve it now. */
6851 olhstype
= unlowered_expr_type (lhs
);
6853 /* Convert new value to destination type. */
6855 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6859 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6861 if (modifycode
!= INIT_EXPR
)
6863 if (complain
& tf_error
)
6864 error ("assigning to an array from an initializer list");
6865 return error_mark_node
;
6867 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6868 return error_mark_node
;
6869 newrhs
= digest_init (lhstype
, newrhs
);
6872 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6873 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6875 if (complain
& tf_error
)
6876 error ("incompatible types in assignment of %qT to %qT",
6877 TREE_TYPE (rhs
), lhstype
);
6878 return error_mark_node
;
6881 /* Allow array assignment in compiler-generated code. */
6882 else if (!current_function_decl
6883 || !DECL_ARTIFICIAL (current_function_decl
))
6885 /* This routine is used for both initialization and assignment.
6886 Make sure the diagnostic message differentiates the context. */
6887 if (complain
& tf_error
)
6889 if (modifycode
== INIT_EXPR
)
6890 error ("array used as initializer");
6892 error ("invalid array assignment");
6894 return error_mark_node
;
6897 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6898 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6899 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6900 /*explicit_value_init_p=*/false,
6901 from_array
, complain
);
6904 if (modifycode
== INIT_EXPR
)
6905 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6906 LOOKUP_ONLYCONVERTING. */
6907 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6908 ICR_INIT
, NULL_TREE
, 0,
6911 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
6912 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6914 if (!same_type_p (lhstype
, olhstype
))
6915 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6917 if (modifycode
!= INIT_EXPR
)
6919 if (TREE_CODE (newrhs
) == CALL_EXPR
6920 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6921 newrhs
= build_cplus_new (lhstype
, newrhs
);
6923 /* Can't initialize directly from a TARGET_EXPR, since that would
6924 cause the lhs to be constructed twice, and possibly result in
6925 accidental self-initialization. So we force the TARGET_EXPR to be
6926 expanded without a target. */
6927 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6928 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6929 TREE_OPERAND (newrhs
, 0));
6932 if (newrhs
== error_mark_node
)
6933 return error_mark_node
;
6935 if (c_dialect_objc () && flag_objc_gc
)
6937 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6943 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6944 lhstype
, lhs
, newrhs
);
6946 TREE_SIDE_EFFECTS (result
) = 1;
6948 TREE_NO_WARNING (result
) = 1;
6954 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6955 tsubst_flags_t complain
)
6957 if (processing_template_decl
)
6958 return build_min_nt (MODOP_EXPR
, lhs
,
6959 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6961 if (modifycode
!= NOP_EXPR
)
6963 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6964 make_node (modifycode
),
6965 /*overloaded_p=*/NULL
,
6969 TREE_NO_WARNING (rval
) = 1;
6973 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6976 /* Helper function for get_delta_difference which assumes FROM is a base
6977 class of TO. Returns a delta for the conversion of pointer-to-member
6978 of FROM to pointer-to-member of TO. If the conversion is invalid and
6979 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
6980 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6981 If C_CAST_P is true, this conversion is taking place as part of a
6985 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
,
6986 tsubst_flags_t complain
)
6990 base_access access
= c_cast_p
? ba_unique
: ba_check
;
6992 /* Note: ba_quiet does not distinguish between access control and
6994 if (!(complain
& tf_error
))
6997 binfo
= lookup_base (to
, from
, access
, &kind
);
6999 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
7001 if (!(complain
& tf_error
))
7002 return error_mark_node
;
7004 error (" in pointer to member function conversion");
7005 return size_zero_node
;
7009 if (kind
!= bk_via_virtual
)
7010 return BINFO_OFFSET (binfo
);
7012 /* FROM is a virtual base class of TO. Issue an error or warning
7013 depending on whether or not this is a reinterpret cast. */
7015 if (!(complain
& tf_error
))
7016 return error_mark_node
;
7018 error ("pointer to member conversion via virtual base %qT",
7019 BINFO_TYPE (binfo_from_vbase (binfo
)));
7021 return size_zero_node
;
7028 /* Get difference in deltas for different pointer to member function
7029 types. If the conversion is invalid and tf_error is not set in
7030 COMPLAIN, returns error_mark_node, otherwise returns an integer
7031 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
7032 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
7033 conversions as well. If C_CAST_P is true this conversion is taking
7034 place as part of a C-style cast.
7036 Note that the naming of FROM and TO is kind of backwards; the return
7037 value is what we add to a TO in order to get a FROM. They are named
7038 this way because we call this function to find out how to convert from
7039 a pointer to member of FROM to a pointer to member of TO. */
7042 get_delta_difference (tree from
, tree to
,
7043 bool allow_inverse_p
,
7044 bool c_cast_p
, tsubst_flags_t complain
)
7048 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
7049 /* Pointer to member of incomplete class is permitted*/
7050 result
= size_zero_node
;
7052 result
= get_delta_difference_1 (from
, to
, c_cast_p
, complain
);
7054 if (result
== error_mark_node
)
7055 return error_mark_node
;
7059 if (!allow_inverse_p
)
7061 if (!(complain
& tf_error
))
7062 return error_mark_node
;
7064 error_not_base_type (from
, to
);
7065 error (" in pointer to member conversion");
7066 result
= size_zero_node
;
7070 result
= get_delta_difference_1 (to
, from
, c_cast_p
, complain
);
7072 if (result
== error_mark_node
)
7073 return error_mark_node
;
7076 result
= size_diffop_loc (input_location
,
7077 size_zero_node
, result
);
7080 if (!(complain
& tf_error
))
7081 return error_mark_node
;
7083 error_not_base_type (from
, to
);
7084 error (" in pointer to member conversion");
7085 result
= size_zero_node
;
7090 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
7094 /* Return a constructor for the pointer-to-member-function TYPE using
7095 the other components as specified. */
7098 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
7103 VEC(constructor_elt
, gc
) *v
;
7105 /* Pull the FIELD_DECLs out of the type. */
7106 pfn_field
= TYPE_FIELDS (type
);
7107 delta_field
= DECL_CHAIN (pfn_field
);
7109 /* Make sure DELTA has the type we want. */
7110 delta
= convert_and_check (delta_type_node
, delta
);
7112 /* Convert to the correct target type if necessary. */
7113 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
7115 /* Finish creating the initializer. */
7116 v
= VEC_alloc(constructor_elt
, gc
, 2);
7117 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
7118 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
7119 u
= build_constructor (type
, v
);
7120 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
7121 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
7122 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
7124 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
7129 /* Build a constructor for a pointer to member function. It can be
7130 used to initialize global variables, local variable, or used
7131 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
7134 If FORCE is nonzero, then force this conversion, even if
7135 we would rather not do it. Usually set when using an explicit
7136 cast. A C-style cast is being processed iff C_CAST_P is true.
7138 Return error_mark_node, if something goes wrong. */
7141 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
,
7142 tsubst_flags_t complain
)
7148 if (error_operand_p (pfn
))
7149 return error_mark_node
;
7151 pfn_type
= TREE_TYPE (pfn
);
7152 to_type
= build_ptrmemfunc_type (type
);
7154 /* Handle multiple conversions of pointer to member functions. */
7155 if (TYPE_PTRMEMFUNC_P (pfn_type
))
7157 tree delta
= NULL_TREE
;
7158 tree npfn
= NULL_TREE
;
7162 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
7163 error ("invalid conversion to type %qT from type %qT",
7166 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
7167 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
7169 c_cast_p
, complain
);
7170 if (n
== error_mark_node
)
7171 return error_mark_node
;
7173 /* We don't have to do any conversion to convert a
7174 pointer-to-member to its own type. But, we don't want to
7175 just return a PTRMEM_CST if there's an explicit cast; that
7176 cast should make the expression an invalid template argument. */
7177 if (TREE_CODE (pfn
) != PTRMEM_CST
)
7179 if (same_type_p (to_type
, pfn_type
))
7181 else if (integer_zerop (n
))
7182 return build_reinterpret_cast (to_type
, pfn
,
7183 tf_warning_or_error
);
7186 if (TREE_SIDE_EFFECTS (pfn
))
7187 pfn
= save_expr (pfn
);
7189 /* Obtain the function pointer and the current DELTA. */
7190 if (TREE_CODE (pfn
) == PTRMEM_CST
)
7191 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
7194 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
7195 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
7198 /* Just adjust the DELTA field. */
7199 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7200 (TREE_TYPE (delta
), ptrdiff_type_node
));
7201 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
7202 n
= cp_build_binary_op (input_location
,
7203 LSHIFT_EXPR
, n
, integer_one_node
,
7204 tf_warning_or_error
);
7205 delta
= cp_build_binary_op (input_location
,
7206 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
7207 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
7210 /* Handle null pointer to member function conversions. */
7211 if (null_ptr_cst_p (pfn
))
7213 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
7214 return build_ptrmemfunc1 (to_type
,
7219 if (type_unknown_p (pfn
))
7220 return instantiate_type (type
, pfn
, tf_warning_or_error
);
7222 fn
= TREE_OPERAND (pfn
, 0);
7223 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7224 /* In a template, we will have preserved the
7226 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
7227 return make_ptrmem_cst (to_type
, fn
);
7230 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7233 ??? There is no consistency as to the types returned for the above
7234 values. Some code acts as if it were a sizetype and some as if it were
7235 integer_type_node. */
7238 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
7240 tree type
= TREE_TYPE (cst
);
7241 tree fn
= PTRMEM_CST_MEMBER (cst
);
7242 tree ptr_class
, fn_class
;
7244 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7246 /* The class that the function belongs to. */
7247 fn_class
= DECL_CONTEXT (fn
);
7249 /* The class that we're creating a pointer to member of. */
7250 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
7252 /* First, calculate the adjustment to the function's class. */
7253 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
7254 /*c_cast_p=*/0, tf_warning_or_error
);
7256 if (!DECL_VIRTUAL_P (fn
))
7257 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
7260 /* If we're dealing with a virtual function, we have to adjust 'this'
7261 again, to point to the base which provides the vtable entry for
7262 fn; the call will do the opposite adjustment. */
7263 tree orig_class
= DECL_CONTEXT (fn
);
7264 tree binfo
= binfo_or_else (orig_class
, fn_class
);
7265 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7266 *delta
, BINFO_OFFSET (binfo
));
7267 *delta
= fold_if_not_in_template (*delta
);
7269 /* We set PFN to the vtable offset at which the function can be
7270 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7271 case delta is shifted left, and then incremented). */
7272 *pfn
= DECL_VINDEX (fn
);
7273 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
7274 TYPE_SIZE_UNIT (vtable_entry_type
));
7275 *pfn
= fold_if_not_in_template (*pfn
);
7277 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
7279 case ptrmemfunc_vbit_in_pfn
:
7280 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
7282 *pfn
= fold_if_not_in_template (*pfn
);
7285 case ptrmemfunc_vbit_in_delta
:
7286 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
7287 *delta
, integer_one_node
);
7288 *delta
= fold_if_not_in_template (*delta
);
7289 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7290 *delta
, integer_one_node
);
7291 *delta
= fold_if_not_in_template (*delta
);
7298 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
7299 *pfn
= fold_if_not_in_template (*pfn
);
7303 /* Return an expression for PFN from the pointer-to-member function
7307 pfn_from_ptrmemfunc (tree t
)
7309 if (TREE_CODE (t
) == PTRMEM_CST
)
7314 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7319 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
7322 /* Return an expression for DELTA from the pointer-to-member function
7326 delta_from_ptrmemfunc (tree t
)
7328 if (TREE_CODE (t
) == PTRMEM_CST
)
7333 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7338 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7341 /* Convert value RHS to type TYPE as preparation for an assignment to
7342 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
7343 implicit conversion is. If FNDECL is non-NULL, we are doing the
7344 conversion in order to pass the PARMNUMth argument of FNDECL.
7345 If FNDECL is NULL, we are doing the conversion in function pointer
7346 argument passing, conversion in initialization, etc. */
7349 convert_for_assignment (tree type
, tree rhs
,
7350 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7351 tsubst_flags_t complain
, int flags
)
7354 enum tree_code coder
;
7356 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7357 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7358 rhs
= TREE_OPERAND (rhs
, 0);
7360 rhstype
= TREE_TYPE (rhs
);
7361 coder
= TREE_CODE (rhstype
);
7363 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7364 && vector_types_convertible_p (type
, rhstype
, true))
7366 rhs
= mark_rvalue_use (rhs
);
7367 return convert (type
, rhs
);
7370 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7371 return error_mark_node
;
7372 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7373 return error_mark_node
;
7375 /* The RHS of an assignment cannot have void type. */
7376 if (coder
== VOID_TYPE
)
7378 if (complain
& tf_error
)
7379 error ("void value not ignored as it ought to be");
7380 return error_mark_node
;
7383 /* Simplify the RHS if possible. */
7384 if (TREE_CODE (rhs
) == CONST_DECL
)
7385 rhs
= DECL_INITIAL (rhs
);
7387 if (c_dialect_objc ())
7391 tree rname
= fndecl
;
7402 selector
= objc_message_selector ();
7404 if (selector
&& parmno
> 1)
7411 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7413 rhs
= mark_rvalue_use (rhs
);
7414 return convert (type
, rhs
);
7420 The expression is implicitly converted (clause _conv_) to the
7421 cv-unqualified type of the left operand.
7423 We allow bad conversions here because by the time we get to this point
7424 we are committed to doing the conversion. If we end up doing a bad
7425 conversion, convert_like will complain. */
7426 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7428 /* When -Wno-pmf-conversions is use, we just silently allow
7429 conversions from pointers-to-members to plain pointers. If
7430 the conversion doesn't work, cp_convert will complain. */
7432 && TYPE_PTR_P (type
)
7433 && TYPE_PTRMEMFUNC_P (rhstype
))
7434 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7437 if (complain
& tf_error
)
7439 /* If the right-hand side has unknown type, then it is an
7440 overloaded function. Call instantiate_type to get error
7442 if (rhstype
== unknown_type_node
)
7443 instantiate_type (type
, rhs
, tf_warning_or_error
);
7445 error ("cannot convert %qT to %qT for argument %qP to %qD",
7446 rhstype
, type
, parmnum
, fndecl
);
7450 case ICR_DEFAULT_ARGUMENT
:
7451 error ("cannot convert %qT to %qT in default argument",
7455 error ("cannot convert %qT to %qT in argument passing",
7458 case ICR_CONVERTING
:
7459 error ("cannot convert %qT to %qT",
7463 error ("cannot convert %qT to %qT in initialization",
7467 error ("cannot convert %qT to %qT in return",
7471 error ("cannot convert %qT to %qT in assignment",
7478 return error_mark_node
;
7481 if (warn_missing_format_attribute
)
7483 const enum tree_code codel
= TREE_CODE (type
);
7484 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7486 && check_missing_format_attribute (type
, rhstype
)
7487 && (complain
& tf_warning
))
7491 case ICR_DEFAULT_ARGUMENT
:
7493 warning (OPT_Wmissing_format_attribute
,
7494 "parameter %qP of %qD might be a candidate "
7495 "for a format attribute", parmnum
, fndecl
);
7497 warning (OPT_Wmissing_format_attribute
,
7498 "parameter might be a candidate "
7499 "for a format attribute");
7501 case ICR_CONVERTING
:
7502 warning (OPT_Wmissing_format_attribute
,
7503 "target of conversion might be might be a candidate "
7504 "for a format attribute");
7507 warning (OPT_Wmissing_format_attribute
,
7508 "target of initialization might be a candidate "
7509 "for a format attribute");
7512 warning (OPT_Wmissing_format_attribute
,
7513 "return type might be a candidate "
7514 "for a format attribute");
7517 warning (OPT_Wmissing_format_attribute
,
7518 "left-hand side of assignment might be a candidate "
7519 "for a format attribute");
7526 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7528 if (warn_parentheses
7529 && TREE_CODE (type
) == BOOLEAN_TYPE
7530 && TREE_CODE (rhs
) == MODIFY_EXPR
7531 && !TREE_NO_WARNING (rhs
)
7532 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7533 && (complain
& tf_warning
))
7535 location_t loc
= EXPR_LOC_OR_HERE (rhs
);
7537 warning_at (loc
, OPT_Wparentheses
,
7538 "suggest parentheses around assignment used as truth value");
7539 TREE_NO_WARNING (rhs
) = 1;
7542 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7546 /* Convert RHS to be of type TYPE.
7547 If EXP is nonzero, it is the target of the initialization.
7548 ERRTYPE indicates what kind of error the implicit conversion is.
7550 Two major differences between the behavior of
7551 `convert_for_assignment' and `convert_for_initialization'
7552 are that references are bashed in the former, while
7553 copied in the latter, and aggregates are assigned in
7554 the former (operator=) while initialized in the
7557 If using constructor make sure no conversion operator exists, if one does
7558 exist, an ambiguity exists.
7560 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7563 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7564 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7565 tsubst_flags_t complain
)
7567 enum tree_code codel
= TREE_CODE (type
);
7569 enum tree_code coder
;
7571 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7572 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7573 if (TREE_CODE (rhs
) == NOP_EXPR
7574 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7575 && codel
!= REFERENCE_TYPE
)
7576 rhs
= TREE_OPERAND (rhs
, 0);
7578 if (type
== error_mark_node
7579 || rhs
== error_mark_node
7580 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7581 return error_mark_node
;
7583 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7584 && TREE_CODE (type
) != ARRAY_TYPE
7585 && (TREE_CODE (type
) != REFERENCE_TYPE
7586 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7587 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7588 && (TREE_CODE (type
) != REFERENCE_TYPE
7589 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7590 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7591 rhs
= decay_conversion (rhs
);
7593 rhstype
= TREE_TYPE (rhs
);
7594 coder
= TREE_CODE (rhstype
);
7596 if (coder
== ERROR_MARK
)
7597 return error_mark_node
;
7599 /* We accept references to incomplete types, so we can
7600 return here before checking if RHS is of complete type. */
7602 if (codel
== REFERENCE_TYPE
)
7604 /* This should eventually happen in convert_arguments. */
7605 int savew
= 0, savee
= 0;
7608 savew
= warningcount
, savee
= errorcount
;
7609 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7610 /*cleanup=*/NULL
, complain
);
7613 if (warningcount
> savew
)
7614 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7615 else if (errorcount
> savee
)
7616 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7622 exp
= require_complete_type_sfinae (exp
, complain
);
7623 if (exp
== error_mark_node
)
7624 return error_mark_node
;
7626 rhstype
= non_reference (rhstype
);
7628 type
= complete_type (type
);
7630 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7631 /* Don't try to do copy-initialization if we already have
7632 direct-initialization. */
7635 if (MAYBE_CLASS_TYPE_P (type
))
7636 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
7638 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7642 /* If RETVAL is the address of, or a reference to, a local variable or
7643 temporary give an appropriate warning. */
7646 maybe_warn_about_returning_address_of_local (tree retval
)
7648 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7649 tree whats_returned
= retval
;
7653 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7654 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7655 else if (CONVERT_EXPR_P (whats_returned
)
7656 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7657 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7662 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7664 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7666 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7668 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7669 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7671 warning (0, "returning reference to temporary");
7674 if (TREE_CODE (whats_returned
) == VAR_DECL
7675 && DECL_NAME (whats_returned
)
7676 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7678 warning (0, "reference to non-lvalue returned");
7683 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7684 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7685 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7687 if (DECL_P (whats_returned
)
7688 && DECL_NAME (whats_returned
)
7689 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7690 && !(TREE_STATIC (whats_returned
)
7691 || TREE_PUBLIC (whats_returned
)))
7693 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7694 warning (0, "reference to local variable %q+D returned",
7697 warning (0, "address of local variable %q+D returned",
7703 /* Check that returning RETVAL from the current function is valid.
7704 Return an expression explicitly showing all conversions required to
7705 change RETVAL into the function return type, and to assign it to
7706 the DECL_RESULT for the function. Set *NO_WARNING to true if
7707 code reaches end of non-void function warning shouldn't be issued
7708 on this RETURN_EXPR. */
7711 check_return_expr (tree retval
, bool *no_warning
)
7714 /* The type actually returned by the function, after any
7717 int fn_returns_value_p
;
7718 bool named_return_value_okay_p
;
7720 *no_warning
= false;
7722 /* A `volatile' function is one that isn't supposed to return, ever.
7723 (This is a G++ extension, used to get better code for functions
7724 that call the `volatile' function.) */
7725 if (TREE_THIS_VOLATILE (current_function_decl
))
7726 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7728 /* Check for various simple errors. */
7729 if (DECL_DESTRUCTOR_P (current_function_decl
))
7732 error ("returning a value from a destructor");
7735 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7737 if (in_function_try_handler
)
7738 /* If a return statement appears in a handler of the
7739 function-try-block of a constructor, the program is ill-formed. */
7740 error ("cannot return from a handler of a function-try-block of a constructor");
7742 /* You can't return a value from a constructor. */
7743 error ("returning a value from a constructor");
7747 /* As an extension, deduce lambda return type from a return statement
7748 anywhere in the body. */
7749 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7751 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7752 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7754 tree type
= lambda_return_type (retval
);
7755 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7757 if (VOID_TYPE_P (type
))
7759 else if (oldtype
== NULL_TREE
)
7761 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7762 "can only be deduced when the return statement is "
7763 "the only statement in the function body");
7764 apply_lambda_return_type (lambda
, type
);
7766 else if (!same_type_p (type
, oldtype
))
7767 error ("inconsistent types %qT and %qT deduced for "
7768 "lambda return type", type
, oldtype
);
7772 if (processing_template_decl
)
7774 current_function_returns_value
= 1;
7775 if (check_for_bare_parameter_packs (retval
))
7776 retval
= error_mark_node
;
7780 /* When no explicit return-value is given in a function with a named
7781 return value, the named return value is used. */
7782 result
= DECL_RESULT (current_function_decl
);
7783 valtype
= TREE_TYPE (result
);
7784 gcc_assert (valtype
!= NULL_TREE
);
7785 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7786 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7789 /* Check for a return statement with no return value in a function
7790 that's supposed to return a value. */
7791 if (!retval
&& fn_returns_value_p
)
7793 permerror (input_location
, "return-statement with no value, in function returning %qT",
7795 /* Clear this, so finish_function won't say that we reach the
7796 end of a non-void function (which we don't, we gave a
7798 current_function_returns_null
= 0;
7799 /* And signal caller that TREE_NO_WARNING should be set on the
7800 RETURN_EXPR to avoid control reaches end of non-void function
7801 warnings in tree-cfg.c. */
7804 /* Check for a return statement with a value in a function that
7805 isn't supposed to return a value. */
7806 else if (retval
&& !fn_returns_value_p
)
7808 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7809 /* You can return a `void' value from a function of `void'
7810 type. In that case, we have to evaluate the expression for
7811 its side-effects. */
7812 finish_expr_stmt (retval
);
7814 permerror (input_location
, "return-statement with a value, in function "
7815 "returning 'void'");
7816 current_function_returns_null
= 1;
7818 /* There's really no value to return, after all. */
7822 /* Remember that this function can sometimes return without a
7824 current_function_returns_null
= 1;
7826 /* Remember that this function did return a value. */
7827 current_function_returns_value
= 1;
7829 /* Check for erroneous operands -- but after giving ourselves a
7830 chance to provide an error about returning a value from a void
7832 if (error_operand_p (retval
))
7834 current_function_return_value
= error_mark_node
;
7835 return error_mark_node
;
7838 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7839 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7840 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7841 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7843 && retval
&& null_ptr_cst_p (retval
))
7844 warning (0, "%<operator new%> must not return NULL unless it is "
7845 "declared %<throw()%> (or -fcheck-new is in effect)");
7847 /* Effective C++ rule 15. See also start_function. */
7849 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7853 /* The function return type must be a reference to the current
7855 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7856 && same_type_ignoring_top_level_qualifiers_p
7857 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7859 /* Returning '*this' is obviously OK. */
7860 if (retval
== current_class_ref
)
7862 /* If we are calling a function whose return type is the same of
7863 the current class reference, it is ok. */
7864 else if (TREE_CODE (retval
) == INDIRECT_REF
7865 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7870 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7873 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7875 [...] For a function with a class return type, if the expression
7876 in the return statement is the name of a local object, and the cv-
7877 unqualified type of the local object is the same as the function
7878 return type, an implementation is permitted to omit creating the tem-
7879 porary object to hold the function return value [...]
7881 So, if this is a value-returning function that always returns the same
7882 local variable, remember it.
7884 It might be nice to be more flexible, and choose the first suitable
7885 variable even if the function sometimes returns something else, but
7886 then we run the risk of clobbering the variable we chose if the other
7887 returned expression uses the chosen variable somehow. And people expect
7888 this restriction, anyway. (jason 2000-11-19)
7890 See finish_function and finalize_nrv for the rest of this optimization. */
7892 named_return_value_okay_p
=
7893 (retval
!= NULL_TREE
7894 /* Must be a local, automatic variable. */
7895 && TREE_CODE (retval
) == VAR_DECL
7896 && DECL_CONTEXT (retval
) == current_function_decl
7897 && ! TREE_STATIC (retval
)
7898 && ! DECL_ANON_UNION_VAR_P (retval
)
7899 && (DECL_ALIGN (retval
)
7900 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7901 /* The cv-unqualified type of the returned value must be the
7902 same as the cv-unqualified return type of the
7904 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7906 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7907 /* And the returned value must be non-volatile. */
7908 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7910 if (fn_returns_value_p
&& flag_elide_constructors
)
7912 if (named_return_value_okay_p
7913 && (current_function_return_value
== NULL_TREE
7914 || current_function_return_value
== retval
))
7915 current_function_return_value
= retval
;
7917 current_function_return_value
= error_mark_node
;
7920 /* We don't need to do any conversions when there's nothing being
7925 /* Do any required conversions. */
7926 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7927 /* No conversions are required. */
7931 /* The type the function is declared to return. */
7932 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7933 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7935 /* The functype's return type will have been set to void, if it
7936 was an incomplete type. Just treat this as 'return;' */
7937 if (VOID_TYPE_P (functype
))
7938 return error_mark_node
;
7940 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7941 treated as an rvalue for the purposes of overload resolution to
7942 favor move constructors over copy constructors. */
7943 if ((cxx_dialect
!= cxx98
)
7944 && named_return_value_okay_p
7945 /* The variable must not have the `volatile' qualifier. */
7946 && !CP_TYPE_VOLATILE_P (TREE_TYPE (retval
))
7947 /* The return type must be a class type. */
7948 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7949 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7951 /* First convert the value to the function's return type, then
7952 to the type of return value's location to handle the
7953 case that functype is smaller than the valtype. */
7954 retval
= convert_for_initialization
7955 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
7956 tf_warning_or_error
);
7957 retval
= convert (valtype
, retval
);
7959 /* If the conversion failed, treat this just like `return;'. */
7960 if (retval
== error_mark_node
)
7962 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7963 else if (! cfun
->returns_struct
7964 && TREE_CODE (retval
) == TARGET_EXPR
7965 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7966 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7967 TREE_OPERAND (retval
, 0));
7969 maybe_warn_about_returning_address_of_local (retval
);
7972 /* Actually copy the value returned into the appropriate location. */
7973 if (retval
&& retval
!= result
)
7974 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7980 /* Returns nonzero if the pointer-type FROM can be converted to the
7981 pointer-type TO via a qualification conversion. If CONSTP is -1,
7982 then we return nonzero if the pointers are similar, and the
7983 cv-qualification signature of FROM is a proper subset of that of TO.
7985 If CONSTP is positive, then all outer pointers have been
7989 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7991 bool to_more_cv_qualified
= false;
7992 bool is_opaque_pointer
= false;
7994 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7996 if (TREE_CODE (to
) != TREE_CODE (from
))
7999 if (TREE_CODE (from
) == OFFSET_TYPE
8000 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
8001 TYPE_OFFSET_BASETYPE (to
)))
8004 /* Const and volatile mean something different for function types,
8005 so the usual checks are not appropriate. */
8006 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
8008 /* In Objective-C++, some types may have been 'volatilized' by
8009 the compiler for EH; when comparing them here, the volatile
8010 qualification must be ignored. */
8011 tree nv_to
= objc_non_volatilized_type (to
);
8012 tree nv_from
= objc_non_volatilized_type (from
);
8014 if (!at_least_as_qualified_p (nv_to
, nv_from
))
8017 if (!at_least_as_qualified_p (nv_from
, nv_to
))
8021 to_more_cv_qualified
= true;
8025 constp
&= TYPE_READONLY (nv_to
);
8028 if (TREE_CODE (to
) == VECTOR_TYPE
)
8029 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
8031 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
8032 return ((constp
>= 0 || to_more_cv_qualified
)
8033 && (is_opaque_pointer
8034 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
8038 /* When comparing, say, char ** to char const **, this function takes
8039 the 'char *' and 'char const *'. Do not pass non-pointer/reference
8040 types to this function. */
8043 comp_ptr_ttypes (tree to
, tree from
)
8045 return comp_ptr_ttypes_real (to
, from
, 1);
8048 /* Returns true iff FNTYPE is a non-class type that involves
8049 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
8050 if a parameter type is ill-formed. */
8053 error_type_p (const_tree type
)
8057 switch (TREE_CODE (type
))
8063 case REFERENCE_TYPE
:
8065 return error_type_p (TREE_TYPE (type
));
8069 if (error_type_p (TREE_TYPE (type
)))
8071 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
8072 if (error_type_p (TREE_VALUE (t
)))
8077 if (TYPE_PTRMEMFUNC_P (type
))
8078 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
8086 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
8087 type or inheritance-related types, regardless of cv-quals. */
8090 ptr_reasonably_similar (const_tree to
, const_tree from
)
8092 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
8094 /* Any target type is similar enough to void. */
8095 if (TREE_CODE (to
) == VOID_TYPE
)
8096 return !error_type_p (from
);
8097 if (TREE_CODE (from
) == VOID_TYPE
)
8098 return !error_type_p (to
);
8100 if (TREE_CODE (to
) != TREE_CODE (from
))
8103 if (TREE_CODE (from
) == OFFSET_TYPE
8104 && comptypes (TYPE_OFFSET_BASETYPE (to
),
8105 TYPE_OFFSET_BASETYPE (from
),
8106 COMPARE_BASE
| COMPARE_DERIVED
))
8109 if (TREE_CODE (to
) == VECTOR_TYPE
8110 && vector_types_convertible_p (to
, from
, false))
8113 if (TREE_CODE (to
) == INTEGER_TYPE
8114 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
8117 if (TREE_CODE (to
) == FUNCTION_TYPE
)
8118 return !error_type_p (to
) && !error_type_p (from
);
8120 if (TREE_CODE (to
) != POINTER_TYPE
)
8122 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
8123 COMPARE_BASE
| COMPARE_DERIVED
);
8127 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
8128 pointer-to-member types) are the same, ignoring cv-qualification at
8132 comp_ptr_ttypes_const (tree to
, tree from
)
8134 bool is_opaque_pointer
= false;
8136 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
8138 if (TREE_CODE (to
) != TREE_CODE (from
))
8141 if (TREE_CODE (from
) == OFFSET_TYPE
8142 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
8143 TYPE_OFFSET_BASETYPE (to
)))
8146 if (TREE_CODE (to
) == VECTOR_TYPE
)
8147 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
8149 if (TREE_CODE (to
) != POINTER_TYPE
)
8150 return (is_opaque_pointer
8151 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
8155 /* Returns the type qualifiers for this type, including the qualifiers on the
8156 elements for an array type. */
8159 cp_type_quals (const_tree type
)
8162 /* This CONST_CAST is okay because strip_array_types returns its
8163 argument unmodified and we assign it to a const_tree. */
8164 type
= strip_array_types (CONST_CAST_TREE (type
));
8165 if (type
== error_mark_node
8166 /* Quals on a FUNCTION_TYPE are memfn quals. */
8167 || TREE_CODE (type
) == FUNCTION_TYPE
)
8168 return TYPE_UNQUALIFIED
;
8169 quals
= TYPE_QUALS (type
);
8170 /* METHOD and REFERENCE_TYPEs should never have quals. */
8171 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
8172 && TREE_CODE (type
) != REFERENCE_TYPE
)
8173 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
8174 == TYPE_UNQUALIFIED
));
8178 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
8182 type_memfn_quals (const_tree type
)
8184 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8185 return TYPE_QUALS (type
);
8186 else if (TREE_CODE (type
) == METHOD_TYPE
)
8187 return cp_type_quals (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))));
8192 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
8196 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
)
8198 /* Could handle METHOD_TYPE here if necessary. */
8199 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8200 if (TYPE_QUALS (type
) == memfn_quals
)
8202 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
8204 return build_qualified_type (type
, memfn_quals
);
8207 /* Returns nonzero if TYPE is const or volatile. */
8210 cv_qualified_p (const_tree type
)
8212 int quals
= cp_type_quals (type
);
8213 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
8216 /* Returns nonzero if the TYPE contains a mutable member. */
8219 cp_has_mutable_p (const_tree type
)
8221 /* This CONST_CAST is okay because strip_array_types returns its
8222 argument unmodified and we assign it to a const_tree. */
8223 type
= strip_array_types (CONST_CAST_TREE(type
));
8225 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
8228 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
8229 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
8230 approximation. In particular, consider:
8233 struct S { int i; };
8234 const S s = { f(); }
8236 Here, we will make "s" as TREE_READONLY (because it is declared
8237 "const") -- only to reverse ourselves upon seeing that the
8238 initializer is non-constant. */
8241 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
8243 tree type
= TREE_TYPE (decl
);
8245 if (type
== error_mark_node
)
8248 if (TREE_CODE (decl
) == TYPE_DECL
)
8251 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
8252 && type_quals
!= TYPE_UNQUALIFIED
));
8254 /* Avoid setting TREE_READONLY incorrectly. */
8255 if (/* If the object has a constructor, the constructor may modify
8257 TYPE_NEEDS_CONSTRUCTING (type
)
8258 /* If the type isn't complete, we don't know yet if it will need
8260 || !COMPLETE_TYPE_P (type
)
8261 /* If the type has a mutable component, that component might be
8263 || TYPE_HAS_MUTABLE_P (type
))
8264 type_quals
&= ~TYPE_QUAL_CONST
;
8266 c_apply_type_quals_to_decl (type_quals
, decl
);
8269 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8270 exemplar types such that casting T1 to T2 is casting away constness
8271 if and only if there is no implicit conversion from T1 to T2. */
8274 casts_away_constness_r (tree
*t1
, tree
*t2
)
8279 /* [expr.const.cast]
8281 For multi-level pointer to members and multi-level mixed pointers
8282 and pointers to members (conv.qual), the "member" aspect of a
8283 pointer to member level is ignored when determining if a const
8284 cv-qualifier has been cast away. */
8285 /* [expr.const.cast]
8287 For two pointer types:
8289 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8290 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8293 casting from X1 to X2 casts away constness if, for a non-pointer
8294 type T there does not exist an implicit conversion (clause
8297 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8301 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8302 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
8303 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
8305 *t1
= cp_build_qualified_type (void_type_node
,
8306 cp_type_quals (*t1
));
8307 *t2
= cp_build_qualified_type (void_type_node
,
8308 cp_type_quals (*t2
));
8312 quals1
= cp_type_quals (*t1
);
8313 quals2
= cp_type_quals (*t2
);
8315 if (TYPE_PTRMEM_P (*t1
))
8316 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
8318 *t1
= TREE_TYPE (*t1
);
8319 if (TYPE_PTRMEM_P (*t2
))
8320 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
8322 *t2
= TREE_TYPE (*t2
);
8324 casts_away_constness_r (t1
, t2
);
8325 *t1
= build_pointer_type (*t1
);
8326 *t2
= build_pointer_type (*t2
);
8327 *t1
= cp_build_qualified_type (*t1
, quals1
);
8328 *t2
= cp_build_qualified_type (*t2
, quals2
);
8331 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8334 ??? This function returns non-zero if casting away qualifiers not
8335 just const. We would like to return to the caller exactly which
8336 qualifiers are casted away to give more accurate diagnostics.
8340 casts_away_constness (tree t1
, tree t2
)
8342 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
8344 /* [expr.const.cast]
8346 Casting from an lvalue of type T1 to an lvalue of type T2
8347 using a reference cast casts away constness if a cast from an
8348 rvalue of type "pointer to T1" to the type "pointer to T2"
8349 casts away constness. */
8350 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
8351 return casts_away_constness (build_pointer_type (t1
),
8352 build_pointer_type (TREE_TYPE (t2
)));
8355 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
8356 /* [expr.const.cast]
8358 Casting from an rvalue of type "pointer to data member of X
8359 of type T1" to the type "pointer to data member of Y of type
8360 T2" casts away constness if a cast from an rvalue of type
8361 "pointer to T1" to the type "pointer to T2" casts away
8363 return casts_away_constness
8364 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
8365 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
8367 /* Casting away constness is only something that makes sense for
8368 pointer or reference types. */
8369 if (TREE_CODE (t1
) != POINTER_TYPE
8370 || TREE_CODE (t2
) != POINTER_TYPE
)
8373 /* Top-level qualifiers don't matter. */
8374 t1
= TYPE_MAIN_VARIANT (t1
);
8375 t2
= TYPE_MAIN_VARIANT (t2
);
8376 casts_away_constness_r (&t1
, &t2
);
8377 if (!can_convert (t2
, t1
))
8383 /* If T is a REFERENCE_TYPE return the type to which T refers.
8384 Otherwise, return T itself. */
8387 non_reference (tree t
)
8389 if (TREE_CODE (t
) == REFERENCE_TYPE
)
8395 /* Return nonzero if REF is an lvalue valid for this language;
8396 otherwise, print an error message and return zero. USE says
8397 how the lvalue is being used and so selects the error message. */
8400 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
8402 cp_lvalue_kind kind
= lvalue_kind (ref
);
8404 if (kind
== clk_none
)
8406 if (complain
& tf_error
)
8410 else if (kind
& (clk_rvalueref
|clk_class
))
8412 if (!(complain
& tf_error
))
8414 if (kind
& clk_class
)
8415 /* Make this a permerror because we used to accept it. */
8416 permerror (input_location
, "using temporary as lvalue");
8418 error ("using xvalue (rvalue reference) as lvalue");