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 the error_mark_node if the VALUE does not have
68 complete type when this function returns. */
71 require_complete_type (tree value
)
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_else (type
, value
))
93 return error_mark_node
;
96 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
97 a template instantiation, do the instantiation. Returns TYPE,
98 whether or not it could be completed, unless something goes
99 horribly wrong, in which case the error_mark_node is returned. */
102 complete_type (tree type
)
104 if (type
== NULL_TREE
)
105 /* Rather than crash, we return something sure to cause an error
107 return error_mark_node
;
109 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
111 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
113 tree t
= complete_type (TREE_TYPE (type
));
114 unsigned int needs_constructing
, has_nontrivial_dtor
;
115 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
118 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
120 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
121 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
123 TYPE_NEEDS_CONSTRUCTING (t
) = needs_constructing
;
124 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = has_nontrivial_dtor
;
127 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
128 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
133 /* Like complete_type, but issue an error if the TYPE cannot be completed.
134 VALUE is used for informative diagnostics.
135 Returns NULL_TREE if the type cannot be made complete. */
138 complete_type_or_maybe_complain (tree type
, tree value
, tsubst_flags_t complain
)
140 type
= complete_type (type
);
141 if (type
== error_mark_node
)
142 /* We already issued an error. */
144 else if (!COMPLETE_TYPE_P (type
))
146 if (complain
& tf_error
)
147 cxx_incomplete_type_diagnostic (value
, type
, DK_ERROR
);
155 complete_type_or_else (tree type
, tree value
)
157 return complete_type_or_maybe_complain (type
, value
, tf_warning_or_error
);
160 /* Return truthvalue of whether type of EXP is instantiated. */
163 type_unknown_p (const_tree exp
)
165 return (TREE_CODE (exp
) == TREE_LIST
166 || TREE_TYPE (exp
) == unknown_type_node
);
170 /* Return the common type of two parameter lists.
171 We assume that comptypes has already been done and returned 1;
172 if that isn't so, this may crash.
174 As an optimization, free the space we allocate if the parameter
175 lists are already common. */
178 commonparms (tree p1
, tree p2
)
180 tree oldargs
= p1
, newargs
, n
;
184 len
= list_length (p1
);
185 newargs
= tree_last (p1
);
187 if (newargs
== void_list_node
)
196 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
201 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
203 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
205 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
208 else if (! TREE_PURPOSE (p1
))
210 if (TREE_PURPOSE (p2
))
212 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
218 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
220 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
222 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
225 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
228 TREE_VALUE (n
) = TREE_VALUE (p1
);
236 /* Given a type, perhaps copied for a typedef,
237 find the "original" version of it. */
239 original_type (tree t
)
241 int quals
= cp_type_quals (t
);
242 while (t
!= error_mark_node
243 && TYPE_NAME (t
) != NULL_TREE
)
245 tree x
= TYPE_NAME (t
);
246 if (TREE_CODE (x
) != TYPE_DECL
)
248 x
= DECL_ORIGINAL_TYPE (x
);
253 return cp_build_qualified_type (t
, quals
);
256 /* Return the common type for two arithmetic types T1 and T2 under the
257 usual arithmetic conversions. The default conversions have already
258 been applied, and enumerated types converted to their compatible
262 cp_common_type (tree t1
, tree t2
)
264 enum tree_code code1
= TREE_CODE (t1
);
265 enum tree_code code2
= TREE_CODE (t2
);
269 /* In what follows, we slightly generalize the rules given in [expr] so
270 as to deal with `long long' and `complex'. First, merge the
272 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
274 if (SCOPED_ENUM_P (t1
) || SCOPED_ENUM_P (t2
))
276 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
277 return build_type_attribute_variant (t1
, attributes
);
282 /* FIXME: Attributes. */
283 gcc_assert (ARITHMETIC_TYPE_P (t1
)
284 || TREE_CODE (t1
) == VECTOR_TYPE
285 || UNSCOPED_ENUM_P (t1
));
286 gcc_assert (ARITHMETIC_TYPE_P (t2
)
287 || TREE_CODE (t2
) == VECTOR_TYPE
288 || UNSCOPED_ENUM_P (t2
));
290 /* If one type is complex, form the common type of the non-complex
291 components, then make that complex. Use T1 or T2 if it is the
293 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
295 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
296 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
298 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
300 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
301 return build_type_attribute_variant (t1
, attributes
);
302 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
303 return build_type_attribute_variant (t2
, attributes
);
305 return build_type_attribute_variant (build_complex_type (subtype
),
309 if (code1
== VECTOR_TYPE
)
311 /* When we get here we should have two vectors of the same size.
312 Just prefer the unsigned one if present. */
313 if (TYPE_UNSIGNED (t1
))
314 return build_type_attribute_variant (t1
, attributes
);
316 return build_type_attribute_variant (t2
, attributes
);
319 /* If only one is real, use it as the result. */
320 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
321 return build_type_attribute_variant (t1
, attributes
);
322 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
323 return build_type_attribute_variant (t2
, attributes
);
325 /* Both real or both integers; use the one with greater precision. */
326 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
327 return build_type_attribute_variant (t1
, attributes
);
328 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
329 return build_type_attribute_variant (t2
, attributes
);
331 /* The types are the same; no need to do anything fancy. */
332 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
333 return build_type_attribute_variant (t1
, attributes
);
335 if (code1
!= REAL_TYPE
)
337 /* If one is unsigned long long, then convert the other to unsigned
339 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
340 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
341 return build_type_attribute_variant (long_long_unsigned_type_node
,
343 /* If one is a long long, and the other is an unsigned long, and
344 long long can represent all the values of an unsigned long, then
345 convert to a long long. Otherwise, convert to an unsigned long
346 long. Otherwise, if either operand is long long, convert the
349 Since we're here, we know the TYPE_PRECISION is the same;
350 therefore converting to long long cannot represent all the values
351 of an unsigned long, so we choose unsigned long long in that
353 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
354 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
356 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
357 ? long_long_unsigned_type_node
358 : long_long_integer_type_node
);
359 return build_type_attribute_variant (t
, attributes
);
361 if (int128_integer_type_node
!= NULL_TREE
362 && (same_type_p (TYPE_MAIN_VARIANT (t1
),
363 int128_integer_type_node
)
364 || same_type_p (TYPE_MAIN_VARIANT (t2
),
365 int128_integer_type_node
)))
367 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
368 ? int128_unsigned_type_node
369 : int128_integer_type_node
);
370 return build_type_attribute_variant (t
, attributes
);
373 /* Go through the same procedure, but for longs. */
374 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
375 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
376 return build_type_attribute_variant (long_unsigned_type_node
,
378 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
379 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
381 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
382 ? long_unsigned_type_node
: long_integer_type_node
);
383 return build_type_attribute_variant (t
, attributes
);
385 /* Otherwise prefer the unsigned one. */
386 if (TYPE_UNSIGNED (t1
))
387 return build_type_attribute_variant (t1
, attributes
);
389 return build_type_attribute_variant (t2
, attributes
);
393 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
394 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
395 return build_type_attribute_variant (long_double_type_node
,
397 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
398 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
399 return build_type_attribute_variant (double_type_node
,
401 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
402 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
403 return build_type_attribute_variant (float_type_node
,
406 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
407 the standard C++ floating-point types. Logic earlier in this
408 function has already eliminated the possibility that
409 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
410 compelling reason to choose one or the other. */
411 return build_type_attribute_variant (t1
, attributes
);
415 /* T1 and T2 are arithmetic or enumeration types. Return the type
416 that will result from the "usual arithmetic conversions" on T1 and
417 T2 as described in [expr]. */
420 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
422 gcc_assert (ARITHMETIC_TYPE_P (t1
)
423 || TREE_CODE (t1
) == VECTOR_TYPE
424 || UNSCOPED_ENUM_P (t1
));
425 gcc_assert (ARITHMETIC_TYPE_P (t2
)
426 || TREE_CODE (t2
) == VECTOR_TYPE
427 || UNSCOPED_ENUM_P (t2
));
429 /* Perform the integral promotions. We do not promote real types here. */
430 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1
)
431 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2
))
433 t1
= type_promotes_to (t1
);
434 t2
= type_promotes_to (t2
);
437 return cp_common_type (t1
, t2
);
440 /* Subroutine of composite_pointer_type to implement the recursive
441 case. See that function for documentation of the parameters. */
444 composite_pointer_type_r (tree t1
, tree t2
,
445 composite_pointer_operation operation
,
446 tsubst_flags_t complain
)
453 /* Determine the types pointed to by T1 and T2. */
454 if (TREE_CODE (t1
) == POINTER_TYPE
)
456 pointee1
= TREE_TYPE (t1
);
457 pointee2
= TREE_TYPE (t2
);
461 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
462 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
467 Otherwise, the composite pointer type is a pointer type
468 similar (_conv.qual_) to the type of one of the operands,
469 with a cv-qualification signature (_conv.qual_) that is the
470 union of the cv-qualification signatures of the operand
472 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
473 result_type
= pointee1
;
474 else if ((TREE_CODE (pointee1
) == POINTER_TYPE
475 && TREE_CODE (pointee2
) == POINTER_TYPE
)
476 || (TYPE_PTR_TO_MEMBER_P (pointee1
)
477 && TYPE_PTR_TO_MEMBER_P (pointee2
)))
478 result_type
= composite_pointer_type_r (pointee1
, pointee2
, operation
,
482 if (complain
& tf_error
)
487 permerror (input_location
, "comparison between "
488 "distinct pointer types %qT and %qT lacks a cast",
492 permerror (input_location
, "conversion between "
493 "distinct pointer types %qT and %qT lacks a cast",
496 case CPO_CONDITIONAL_EXPR
:
497 permerror (input_location
, "conditional expression between "
498 "distinct pointer types %qT and %qT lacks a cast",
505 result_type
= void_type_node
;
507 result_type
= cp_build_qualified_type (result_type
,
508 (cp_type_quals (pointee1
)
509 | cp_type_quals (pointee2
)));
510 /* If the original types were pointers to members, so is the
512 if (TYPE_PTR_TO_MEMBER_P (t1
))
514 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
515 TYPE_PTRMEM_CLASS_TYPE (t2
))
516 && (complain
& tf_error
))
521 permerror (input_location
, "comparison between "
522 "distinct pointer types %qT and %qT lacks a cast",
526 permerror (input_location
, "conversion between "
527 "distinct pointer types %qT and %qT lacks a cast",
530 case CPO_CONDITIONAL_EXPR
:
531 permerror (input_location
, "conditional expression between "
532 "distinct pointer types %qT and %qT lacks a cast",
539 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
543 result_type
= build_pointer_type (result_type
);
545 /* Merge the attributes. */
546 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
547 return build_type_attribute_variant (result_type
, attributes
);
550 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
551 ARG1 and ARG2 are the values with those types. The OPERATION is to
552 describe the operation between the pointer types,
553 in case an error occurs.
555 This routine also implements the computation of a common type for
556 pointers-to-members as per [expr.eq]. */
559 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
560 composite_pointer_operation operation
,
561 tsubst_flags_t complain
)
568 If one operand is a null pointer constant, the composite pointer
569 type is the type of the other operand. */
570 if (null_ptr_cst_p (arg1
))
572 if (null_ptr_cst_p (arg2
))
579 If one of the operands has type "pointer to cv1 void*", then
580 the other has type "pointer to cv2T", and the composite pointer
581 type is "pointer to cv12 void", where cv12 is the union of cv1
584 If either type is a pointer to void, make sure it is T1. */
585 if (TREE_CODE (t2
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t2
)))
593 /* Now, if T1 is a pointer to void, merge the qualifiers. */
594 if (TREE_CODE (t1
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t1
)))
599 if (TYPE_PTRFN_P (t2
) && (complain
& tf_error
))
604 pedwarn (input_location
, OPT_pedantic
,
605 "ISO C++ forbids comparison between "
606 "pointer of type %<void *%> and pointer-to-function");
609 pedwarn (input_location
, OPT_pedantic
,
610 "ISO C++ forbids conversion between "
611 "pointer of type %<void *%> and pointer-to-function");
613 case CPO_CONDITIONAL_EXPR
:
614 pedwarn (input_location
, OPT_pedantic
,
615 "ISO C++ forbids conditional expression between "
616 "pointer of type %<void *%> and pointer-to-function");
623 = cp_build_qualified_type (void_type_node
,
624 (cp_type_quals (TREE_TYPE (t1
))
625 | cp_type_quals (TREE_TYPE (t2
))));
626 result_type
= build_pointer_type (result_type
);
627 /* Merge the attributes. */
628 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
629 return build_type_attribute_variant (result_type
, attributes
);
632 if (c_dialect_objc () && TREE_CODE (t1
) == POINTER_TYPE
633 && TREE_CODE (t2
) == POINTER_TYPE
)
635 if (objc_compare_types (t1
, t2
, -3, NULL_TREE
))
639 /* [expr.eq] permits the application of a pointer conversion to
640 bring the pointers to a common type. */
641 if (TREE_CODE (t1
) == POINTER_TYPE
&& TREE_CODE (t2
) == POINTER_TYPE
642 && CLASS_TYPE_P (TREE_TYPE (t1
))
643 && CLASS_TYPE_P (TREE_TYPE (t2
))
644 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
647 class1
= TREE_TYPE (t1
);
648 class2
= TREE_TYPE (t2
);
650 if (DERIVED_FROM_P (class1
, class2
))
651 t2
= (build_pointer_type
652 (cp_build_qualified_type (class1
, cp_type_quals (class2
))));
653 else if (DERIVED_FROM_P (class2
, class1
))
654 t1
= (build_pointer_type
655 (cp_build_qualified_type (class2
, cp_type_quals (class1
))));
658 if (complain
& tf_error
)
662 error ("comparison between distinct "
663 "pointer types %qT and %qT lacks a cast", t1
, t2
);
666 error ("conversion between distinct "
667 "pointer types %qT and %qT lacks a cast", t1
, t2
);
669 case CPO_CONDITIONAL_EXPR
:
670 error ("conditional expression between distinct "
671 "pointer types %qT and %qT lacks a cast", t1
, t2
);
676 return error_mark_node
;
679 /* [expr.eq] permits the application of a pointer-to-member
680 conversion to change the class type of one of the types. */
681 else if (TYPE_PTR_TO_MEMBER_P (t1
)
682 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
683 TYPE_PTRMEM_CLASS_TYPE (t2
)))
685 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
686 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
688 if (DERIVED_FROM_P (class1
, class2
))
689 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
690 else if (DERIVED_FROM_P (class2
, class1
))
691 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
694 if (complain
& tf_error
)
698 error ("comparison between distinct "
699 "pointer-to-member types %qT and %qT lacks a cast",
703 error ("conversion between distinct "
704 "pointer-to-member types %qT and %qT lacks a cast",
707 case CPO_CONDITIONAL_EXPR
:
708 error ("conditional expression between distinct "
709 "pointer-to-member types %qT and %qT lacks a cast",
715 return error_mark_node
;
719 return composite_pointer_type_r (t1
, t2
, operation
, complain
);
722 /* Return the merged type of two types.
723 We assume that comptypes has already been done and returned 1;
724 if that isn't so, this may crash.
726 This just combines attributes and default arguments; any other
727 differences would cause the two types to compare unalike. */
730 merge_types (tree t1
, tree t2
)
732 enum tree_code code1
;
733 enum tree_code code2
;
736 /* Save time if the two types are the same. */
739 if (original_type (t1
) == original_type (t2
))
742 /* If one type is nonsense, use the other. */
743 if (t1
== error_mark_node
)
745 if (t2
== error_mark_node
)
748 /* Merge the attributes. */
749 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
751 if (TYPE_PTRMEMFUNC_P (t1
))
752 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
753 if (TYPE_PTRMEMFUNC_P (t2
))
754 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
756 code1
= TREE_CODE (t1
);
757 code2
= TREE_CODE (t2
);
760 gcc_assert (code1
== TYPENAME_TYPE
|| code2
== TYPENAME_TYPE
);
761 if (code1
== TYPENAME_TYPE
)
763 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
764 code1
= TREE_CODE (t1
);
768 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
769 code2
= TREE_CODE (t2
);
777 /* For two pointers, do this recursively on the target type. */
779 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
780 int quals
= cp_type_quals (t1
);
782 if (code1
== POINTER_TYPE
)
783 t1
= build_pointer_type (target
);
785 t1
= cp_build_reference_type (target
, TYPE_REF_IS_RVALUE (t1
));
786 t1
= build_type_attribute_variant (t1
, attributes
);
787 t1
= cp_build_qualified_type (t1
, quals
);
789 if (TREE_CODE (target
) == METHOD_TYPE
)
790 t1
= build_ptrmemfunc_type (t1
);
799 quals
= cp_type_quals (t1
);
800 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
801 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
802 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
804 t1
= cp_build_qualified_type (t1
, quals
);
810 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
811 /* Save space: see if the result is identical to one of the args. */
812 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
813 return build_type_attribute_variant (t1
, attributes
);
814 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
815 return build_type_attribute_variant (t2
, attributes
);
816 /* Merge the element types, and have a size if either arg has one. */
817 t1
= build_cplus_array_type
818 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
823 /* Function types: prefer the one that specified arg types.
824 If both do, merge the arg types. Also merge the return types. */
826 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
827 tree p1
= TYPE_ARG_TYPES (t1
);
828 tree p2
= TYPE_ARG_TYPES (t2
);
832 /* Save space: see if the result is identical to one of the args. */
833 if (valtype
== TREE_TYPE (t1
) && ! p2
)
834 return cp_build_type_attribute_variant (t1
, attributes
);
835 if (valtype
== TREE_TYPE (t2
) && ! p1
)
836 return cp_build_type_attribute_variant (t2
, attributes
);
838 /* Simple way if one arg fails to specify argument types. */
839 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
841 else if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
844 parms
= commonparms (p1
, p2
);
846 rval
= build_function_type (valtype
, parms
);
847 gcc_assert (type_memfn_quals (t1
) == type_memfn_quals (t2
));
848 rval
= apply_memfn_quals (rval
, type_memfn_quals (t1
));
849 raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
850 TYPE_RAISES_EXCEPTIONS (t2
));
851 t1
= build_exception_variant (rval
, raises
);
857 /* Get this value the long way, since TYPE_METHOD_BASETYPE
858 is just the main variant of this. */
859 tree basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2
)));
860 tree raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
861 TYPE_RAISES_EXCEPTIONS (t2
));
864 /* If this was a member function type, get back to the
865 original type of type member function (i.e., without
866 the class instance variable up front. */
867 t1
= build_function_type (TREE_TYPE (t1
),
868 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
869 t2
= build_function_type (TREE_TYPE (t2
),
870 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
871 t3
= merge_types (t1
, t2
);
872 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
873 TYPE_ARG_TYPES (t3
));
874 t1
= build_exception_variant (t3
, raises
);
879 /* There is no need to merge attributes into a TYPENAME_TYPE.
880 When the type is instantiated it will have whatever
881 attributes result from the instantiation. */
887 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
889 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
892 return cp_build_type_attribute_variant (t1
, attributes
);
895 /* Return the ARRAY_TYPE type without its domain. */
898 strip_array_domain (tree type
)
901 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
902 if (TYPE_DOMAIN (type
) == NULL_TREE
)
904 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
905 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
908 /* Wrapper around cp_common_type that is used by c-common.c and other
909 front end optimizations that remove promotions.
911 Return the common type for two arithmetic types T1 and T2 under the
912 usual arithmetic conversions. The default conversions have already
913 been applied, and enumerated types converted to their compatible
917 common_type (tree t1
, tree t2
)
919 /* If one type is nonsense, use the other */
920 if (t1
== error_mark_node
)
922 if (t2
== error_mark_node
)
925 return cp_common_type (t1
, t2
);
928 /* Return the common type of two pointer types T1 and T2. This is the
929 type for the result of most arithmetic operations if the operands
930 have the given two types.
932 We assume that comp_target_types has already been done and returned
933 nonzero; if that isn't so, this may crash. */
936 common_pointer_type (tree t1
, tree t2
)
938 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
939 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
940 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
942 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
943 CPO_CONVERSION
, tf_warning_or_error
);
946 /* Compare two exception specifier types for exactness or subsetness, if
947 allowed. Returns false for mismatch, true for match (same, or
950 [except.spec] "If a class X ... objects of class X or any class publicly
951 and unambiguously derived from X. Similarly, if a pointer type Y * ...
952 exceptions of type Y * or that are pointers to any type publicly and
953 unambiguously derived from Y. Otherwise a function only allows exceptions
954 that have the same type ..."
955 This does not mention cv qualifiers and is different to what throw
956 [except.throw] and catch [except.catch] will do. They will ignore the
957 top level cv qualifiers, and allow qualifiers in the pointer to class
960 We implement the letter of the standard. */
963 comp_except_types (tree a
, tree b
, bool exact
)
965 if (same_type_p (a
, b
))
969 if (cp_type_quals (a
) || cp_type_quals (b
))
972 if (TREE_CODE (a
) == POINTER_TYPE
973 && TREE_CODE (b
) == POINTER_TYPE
)
977 if (cp_type_quals (a
) || cp_type_quals (b
))
981 if (TREE_CODE (a
) != RECORD_TYPE
982 || TREE_CODE (b
) != RECORD_TYPE
)
985 if (PUBLICLY_UNIQUELY_DERIVED_P (a
, b
))
991 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
992 If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
993 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
994 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
995 are unordered, but we've already filtered out duplicates. Most lists will
996 be in order, we should try to make use of that. */
999 comp_except_specs (const_tree t1
, const_tree t2
, int exact
)
1008 /* First handle noexcept. */
1009 if (exact
< ce_exact
)
1011 /* noexcept(false) is compatible with any throwing dynamic-exc-spec
1012 and stricter than any spec. */
1013 if (t1
== noexcept_false_spec
)
1014 return !nothrow_spec_p (t2
) || exact
== ce_derived
;
1015 /* Even a derived noexcept(false) is compatible with a throwing
1017 if (t2
== noexcept_false_spec
)
1018 return !nothrow_spec_p (t1
);
1020 /* Otherwise, if we aren't looking for an exact match, noexcept is
1021 equivalent to throw(). */
1022 if (t1
== noexcept_true_spec
)
1023 t1
= empty_except_spec
;
1024 if (t2
== noexcept_true_spec
)
1025 t2
= empty_except_spec
;
1028 /* If any noexcept is left, it is only comparable to itself;
1029 either we're looking for an exact match or we're redeclaring a
1030 template with dependent noexcept. */
1031 if ((t1
&& TREE_PURPOSE (t1
))
1032 || (t2
&& TREE_PURPOSE (t2
)))
1034 && cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)));
1036 if (t1
== NULL_TREE
) /* T1 is ... */
1037 return t2
== NULL_TREE
|| exact
== ce_derived
;
1038 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1039 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1040 if (t2
== NULL_TREE
) /* T2 is ... */
1042 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1043 return exact
== ce_derived
;
1045 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1046 Count how many we find, to determine exactness. For exact matching and
1047 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1049 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1051 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1053 tree a
= TREE_VALUE (probe
);
1054 tree b
= TREE_VALUE (t2
);
1056 if (comp_except_types (a
, b
, exact
))
1058 if (probe
== base
&& exact
> ce_derived
)
1059 base
= TREE_CHAIN (probe
);
1064 if (probe
== NULL_TREE
)
1067 return exact
== ce_derived
|| base
== NULL_TREE
|| length
== list_length (t1
);
1070 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1071 [] can match [size]. */
1074 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1083 /* The type of the array elements must be the same. */
1084 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1087 d1
= TYPE_DOMAIN (t1
);
1088 d2
= TYPE_DOMAIN (t2
);
1093 /* If one of the arrays is dimensionless, and the other has a
1094 dimension, they are of different types. However, it is valid to
1102 declarations for an array object can specify
1103 array types that differ by the presence or absence of a major
1104 array bound (_dcl.array_). */
1106 return allow_redeclaration
;
1108 /* Check that the dimensions are the same. */
1110 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1112 max1
= TYPE_MAX_VALUE (d1
);
1113 max2
= TYPE_MAX_VALUE (d2
);
1114 if (processing_template_decl
&& !abi_version_at_least (2)
1115 && !value_dependent_expression_p (max1
)
1116 && !value_dependent_expression_p (max2
))
1118 /* With abi-1 we do not fold non-dependent array bounds, (and
1119 consequently mangle them incorrectly). We must therefore
1120 fold them here, to verify the domains have the same
1126 if (!cp_tree_equal (max1
, max2
))
1132 /* Compare the relative position of T1 and T2 into their respective
1133 template parameter list.
1134 T1 and T2 must be template parameter types.
1135 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1138 comp_template_parms_position (tree t1
, tree t2
)
1140 gcc_assert (t1
&& t2
1141 && TREE_CODE (t1
) == TREE_CODE (t2
)
1142 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1143 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1144 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1146 if (TEMPLATE_TYPE_IDX (t1
) != TEMPLATE_TYPE_IDX (t2
)
1147 || TEMPLATE_TYPE_LEVEL (t1
) != TEMPLATE_TYPE_LEVEL (t2
)
1148 || (TEMPLATE_TYPE_PARAMETER_PACK (t1
)
1149 != TEMPLATE_TYPE_PARAMETER_PACK (t2
)))
1155 /* Subroutine of incompatible_dependent_types_p.
1156 Return the template parameter of the dependent type T.
1157 If T is a typedef, return the template parameters of
1158 the _decl_ of the typedef. T must be a dependent type. */
1161 get_template_parms_of_dependent_type (tree t
)
1163 tree tinfo
= NULL_TREE
, tparms
= NULL_TREE
;
1165 /* First, try the obvious case of getting the
1166 template info from T itself. */
1167 if ((tinfo
= get_template_info (t
)))
1169 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
1170 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (t
);
1171 else if (typedef_variant_p (t
)
1172 && !NAMESPACE_SCOPE_P (TYPE_NAME (t
)))
1173 tinfo
= get_template_info (DECL_CONTEXT (TYPE_NAME (t
)));
1174 /* If T is a TYPENAME_TYPE which context is a template type
1175 parameter, get the template parameters from that context. */
1176 else if (TYPE_CONTEXT (t
)
1177 && TREE_CODE (TYPE_CONTEXT (t
)) == TEMPLATE_TYPE_PARM
)
1178 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (TYPE_CONTEXT (t
));
1179 else if (TYPE_CONTEXT (t
)
1180 && !NAMESPACE_SCOPE_P (t
))
1181 tinfo
= get_template_info (TYPE_CONTEXT (t
));
1184 tparms
= DECL_TEMPLATE_PARMS (TI_TEMPLATE (tinfo
));
1189 /* Subroutine of structural_comptypes.
1190 Compare the dependent types T1 and T2.
1191 Return TRUE if we are sure they can't be equal, FALSE otherwise.
1192 The whole point of this function is to support cases where either T1 or
1193 T2 is a typedef. In those cases, we need to compare the template parameters
1194 of the _decl_ of the typedef. If those don't match then we know T1
1195 and T2 cannot be equal. */
1198 incompatible_dependent_types_p (tree t1
, tree t2
)
1200 tree tparms1
= NULL_TREE
, tparms2
= NULL_TREE
;
1201 bool t1_typedef_variant_p
, t2_typedef_variant_p
;
1203 if (!uses_template_parms (t1
) || !uses_template_parms (t2
))
1206 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
)
1208 /* If T1 and T2 don't have the same relative position in their
1209 template parameters set, they can't be equal. */
1210 if (!comp_template_parms_position (t1
, t2
))
1214 t1_typedef_variant_p
= typedef_variant_p (t1
);
1215 t2_typedef_variant_p
= typedef_variant_p (t2
);
1217 /* Either T1 or T2 must be a typedef. */
1218 if (!t1_typedef_variant_p
&& !t2_typedef_variant_p
)
1221 if (!t1_typedef_variant_p
|| !t2_typedef_variant_p
)
1222 /* Either T1 or T2 is not a typedef so we cannot compare the
1223 template parms of the typedefs of T1 and T2.
1224 At this point, if the main variant type of T1 and T2 are equal
1225 it means the two types can't be incompatible, from the perspective
1226 of this function. */
1227 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1230 /* So if we reach this point, it means either T1 or T2 is a typedef variant.
1231 Let's compare their template parameters. */
1233 tparms1
= get_template_parms_of_dependent_type (t1
);
1234 tparms2
= get_template_parms_of_dependent_type (t2
);
1236 /* If T2 is a template type parm and if we could not get the template
1237 parms it belongs to, that means we have not finished parsing the
1238 full set of template parameters of the template declaration it
1239 belongs to yet. If we could get the template parms T1 belongs to,
1240 that mostly means T1 and T2 belongs to templates that are
1241 different and incompatible. */
1242 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
1243 && (tparms1
== NULL_TREE
|| tparms2
== NULL_TREE
)
1244 && tparms1
!= tparms2
)
1247 if (tparms1
== NULL_TREE
1248 || tparms2
== NULL_TREE
1249 || tparms1
== tparms2
)
1252 /* And now compare the mighty template parms! */
1253 return !comp_template_parms (tparms1
, tparms2
);
1256 /* Subroutine in comptypes. */
1259 structural_comptypes (tree t1
, tree t2
, int strict
)
1264 /* Suppress errors caused by previously reported errors. */
1265 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1268 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1270 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1271 current instantiation. */
1272 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1273 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1275 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1276 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1278 if (TYPE_PTRMEMFUNC_P (t1
))
1279 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1280 if (TYPE_PTRMEMFUNC_P (t2
))
1281 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1283 /* Different classes of types can't be compatible. */
1284 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1287 /* Qualifiers must match. For array types, we will check when we
1288 recur on the array element types. */
1289 if (TREE_CODE (t1
) != ARRAY_TYPE
1290 && cp_type_quals (t1
) != cp_type_quals (t2
))
1292 if (TREE_CODE (t1
) == FUNCTION_TYPE
1293 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1295 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1298 /* If T1 and T2 are dependent typedefs then check upfront that
1299 the template parameters of their typedef DECLs match before
1300 going down checking their subtypes. */
1301 if (incompatible_dependent_types_p (t1
, t2
))
1304 /* Allow for two different type nodes which have essentially the same
1305 definition. Note that we already checked for equality of the type
1306 qualifiers (just above). */
1308 if (TREE_CODE (t1
) != ARRAY_TYPE
1309 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1313 /* Compare the types. Break out if they could be the same. */
1314 switch (TREE_CODE (t1
))
1318 /* All void and bool types are the same. */
1322 case FIXED_POINT_TYPE
:
1324 /* With these nodes, we can't determine type equivalence by
1325 looking at what is stored in the nodes themselves, because
1326 two nodes might have different TYPE_MAIN_VARIANTs but still
1327 represent the same type. For example, wchar_t and int could
1328 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1329 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1330 and are distinct types. On the other hand, int and the
1333 typedef int INT __attribute((may_alias));
1335 have identical properties, different TYPE_MAIN_VARIANTs, but
1336 represent the same type. The canonical type system keeps
1337 track of equivalence in this case, so we fall back on it. */
1338 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1340 case TEMPLATE_TEMPLATE_PARM
:
1341 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1342 if (!comp_template_parms_position (t1
, t2
))
1344 if (!comp_template_parms
1345 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1346 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1348 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1350 /* Don't check inheritance. */
1351 strict
= COMPARE_STRICT
;
1356 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1357 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1358 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1359 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1362 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1364 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1370 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1371 strict
& ~COMPARE_REDECLARATION
))
1373 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1377 case REFERENCE_TYPE
:
1378 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1380 /* fall through to checks for pointer types */
1383 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1384 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
)
1385 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1391 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1393 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1398 /* Target types must match incl. qualifiers. */
1399 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1403 case TEMPLATE_TYPE_PARM
:
1404 /* If incompatible_dependent_types_p called earlier didn't decide
1405 T1 and T2 were different, they might be equal. */
1409 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1410 TYPENAME_TYPE_FULLNAME (t2
)))
1412 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1416 case UNBOUND_CLASS_TEMPLATE
:
1417 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1419 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1424 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1429 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1430 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1434 case TYPE_PACK_EXPANSION
:
1435 return same_type_p (PACK_EXPANSION_PATTERN (t1
),
1436 PACK_EXPANSION_PATTERN (t2
));
1439 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1440 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1441 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1442 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1443 || (DECLTYPE_FOR_LAMBDA_RETURN (t1
)
1444 != DECLTYPE_FOR_LAMBDA_RETURN (t2
))
1445 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1446 DECLTYPE_TYPE_EXPR (t2
)))
1454 /* If we get here, we know that from a target independent POV the
1455 types are the same. Make sure the target attributes are also
1457 return targetm
.comp_type_attributes (t1
, t2
);
1460 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1461 is a bitwise-or of the COMPARE_* flags. */
1464 comptypes (tree t1
, tree t2
, int strict
)
1466 if (strict
== COMPARE_STRICT
)
1471 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1474 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1475 /* At least one of the types requires structural equality, so
1476 perform a deep check. */
1477 return structural_comptypes (t1
, t2
, strict
);
1479 #ifdef ENABLE_CHECKING
1480 if (USE_CANONICAL_TYPES
)
1482 bool result
= structural_comptypes (t1
, t2
, strict
);
1484 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1485 /* The two types are structurally equivalent, but their
1486 canonical types were different. This is a failure of the
1487 canonical type propagation code.*/
1489 ("canonical types differ for identical types %T and %T",
1491 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1492 /* Two types are structurally different, but the canonical
1493 types are the same. This means we were over-eager in
1494 assigning canonical types. */
1496 ("same canonical type node for different types %T and %T",
1502 if (USE_CANONICAL_TYPES
)
1503 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1506 return structural_comptypes (t1
, t2
, strict
);
1508 else if (strict
== COMPARE_STRUCTURAL
)
1509 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1511 return structural_comptypes (t1
, t2
, strict
);
1514 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1515 top-level qualifiers. */
1518 same_type_ignoring_top_level_qualifiers_p (tree type1
, tree type2
)
1520 if (type1
== error_mark_node
|| type2
== error_mark_node
)
1523 return same_type_p (TYPE_MAIN_VARIANT (type1
), TYPE_MAIN_VARIANT (type2
));
1526 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1529 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1531 int q1
= cp_type_quals (type1
);
1532 int q2
= cp_type_quals (type2
);
1534 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1535 return (q1
& q2
) == q2
;
1538 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1539 more cv-qualified that TYPE1, and 0 otherwise. */
1542 comp_cv_qualification (const_tree type1
, const_tree type2
)
1544 int q1
= cp_type_quals (type1
);
1545 int q2
= cp_type_quals (type2
);
1550 if ((q1
& q2
) == q2
)
1552 else if ((q1
& q2
) == q1
)
1558 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1559 subset of the cv-qualification signature of TYPE2, and the types
1560 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1563 comp_cv_qual_signature (tree type1
, tree type2
)
1565 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1567 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1573 /* Subroutines of `comptypes'. */
1575 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1576 equivalent in the sense that functions with those parameter types
1577 can have equivalent types. The two lists must be equivalent,
1578 element by element. */
1581 compparms (const_tree parms1
, const_tree parms2
)
1585 /* An unspecified parmlist matches any specified parmlist
1586 whose argument types don't need default promotions. */
1588 for (t1
= parms1
, t2
= parms2
;
1590 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1592 /* If one parmlist is shorter than the other,
1593 they fail to match. */
1596 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1603 /* Process a sizeof or alignof expression where the operand is a
1607 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1612 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1613 if (type
== error_mark_node
)
1614 return error_mark_node
;
1616 type
= non_reference (type
);
1617 if (TREE_CODE (type
) == METHOD_TYPE
)
1620 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
1621 "invalid application of %qs to a member function",
1622 operator_name_info
[(int) op
].name
);
1623 value
= size_one_node
;
1626 dependent_p
= dependent_type_p (type
);
1628 complete_type (type
);
1630 /* VLA types will have a non-constant size. In the body of an
1631 uninstantiated template, we don't need to try to compute the
1632 value, because the sizeof expression is not an integral
1633 constant expression in that case. And, if we do try to
1634 compute the value, we'll likely end up with SAVE_EXPRs, which
1635 the template substitution machinery does not expect to see. */
1636 || (processing_template_decl
1637 && COMPLETE_TYPE_P (type
)
1638 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1640 value
= build_min (op
, size_type_node
, type
);
1641 TREE_READONLY (value
) = 1;
1645 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1650 /* Return the size of the type, without producing any warnings for
1651 types whose size cannot be taken. This routine should be used only
1652 in some other routine that has already produced a diagnostic about
1653 using the size of such a type. */
1655 cxx_sizeof_nowarn (tree type
)
1657 if (TREE_CODE (type
) == FUNCTION_TYPE
1658 || TREE_CODE (type
) == VOID_TYPE
1659 || TREE_CODE (type
) == ERROR_MARK
)
1660 return size_one_node
;
1661 else if (!COMPLETE_TYPE_P (type
))
1662 return size_zero_node
;
1664 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1667 /* Process a sizeof expression where the operand is an expression. */
1670 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1672 if (e
== error_mark_node
)
1673 return error_mark_node
;
1675 if (processing_template_decl
)
1677 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1678 TREE_SIDE_EFFECTS (e
) = 0;
1679 TREE_READONLY (e
) = 1;
1684 /* To get the size of a static data member declared as an array of
1685 unknown bound, we need to instantiate it. */
1686 if (TREE_CODE (e
) == VAR_DECL
1687 && VAR_HAD_UNKNOWN_BOUND (e
)
1688 && DECL_TEMPLATE_INSTANTIATION (e
))
1689 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1691 e
= mark_type_use (e
);
1693 if (TREE_CODE (e
) == COMPONENT_REF
1694 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1695 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1697 if (complain
& tf_error
)
1698 error ("invalid application of %<sizeof%> to a bit-field");
1700 return error_mark_node
;
1703 else if (is_overloaded_fn (e
))
1705 if (complain
& tf_error
)
1706 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1709 return error_mark_node
;
1712 else if (type_unknown_p (e
))
1714 if (complain
& tf_error
)
1715 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1717 return error_mark_node
;
1723 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1726 /* Implement the __alignof keyword: Return the minimum required
1727 alignment of E, measured in bytes. For VAR_DECL's and
1728 FIELD_DECL's return DECL_ALIGN (which can be set from an
1729 "aligned" __attribute__ specification). */
1732 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1736 if (e
== error_mark_node
)
1737 return error_mark_node
;
1739 if (processing_template_decl
)
1741 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1742 TREE_SIDE_EFFECTS (e
) = 0;
1743 TREE_READONLY (e
) = 1;
1748 e
= mark_type_use (e
);
1750 if (TREE_CODE (e
) == VAR_DECL
)
1751 t
= size_int (DECL_ALIGN_UNIT (e
));
1752 else if (TREE_CODE (e
) == COMPONENT_REF
1753 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1754 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1756 if (complain
& tf_error
)
1757 error ("invalid application of %<__alignof%> to a bit-field");
1759 return error_mark_node
;
1762 else if (TREE_CODE (e
) == COMPONENT_REF
1763 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1764 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1765 else if (is_overloaded_fn (e
))
1767 if (complain
& tf_error
)
1768 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1771 return error_mark_node
;
1772 if (TREE_CODE (e
) == FUNCTION_DECL
)
1773 t
= size_int (DECL_ALIGN_UNIT (e
));
1777 else if (type_unknown_p (e
))
1779 if (complain
& tf_error
)
1780 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1782 return error_mark_node
;
1786 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1787 complain
& tf_error
);
1789 return fold_convert (size_type_node
, t
);
1792 /* Process a sizeof or alignof expression E with code OP where the operand
1793 is an expression. */
1796 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1798 if (op
== SIZEOF_EXPR
)
1799 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1801 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1804 /* EXPR is being used in a context that is not a function call.
1809 The expression can be used only as the left-hand operand of a
1810 member function call.
1812 [expr.mptr.operator]
1814 If the result of .* or ->* is a function, then that result can be
1815 used only as the operand for the function call operator ().
1817 by issuing an error message if appropriate. Returns true iff EXPR
1818 violates these rules. */
1821 invalid_nonstatic_memfn_p (const_tree expr
, tsubst_flags_t complain
)
1823 if (expr
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1825 if (complain
& tf_error
)
1826 error ("invalid use of non-static member function");
1832 /* If EXP is a reference to a bitfield, and the type of EXP does not
1833 match the declared type of the bitfield, return the declared type
1834 of the bitfield. Otherwise, return NULL_TREE. */
1837 is_bitfield_expr_with_lowered_type (const_tree exp
)
1839 switch (TREE_CODE (exp
))
1842 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1843 ? TREE_OPERAND (exp
, 1)
1844 : TREE_OPERAND (exp
, 0)))
1846 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1849 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1853 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1859 field
= TREE_OPERAND (exp
, 1);
1860 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1862 if (same_type_ignoring_top_level_qualifiers_p
1863 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1865 return DECL_BIT_FIELD_TYPE (field
);
1869 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1870 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1871 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1879 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1880 bitfield with a lowered type, the type of EXP is returned, rather
1884 unlowered_expr_type (const_tree exp
)
1888 type
= is_bitfield_expr_with_lowered_type (exp
);
1890 type
= TREE_TYPE (exp
);
1895 /* Perform the conversions in [expr] that apply when an lvalue appears
1896 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1897 function-to-pointer conversions. In addition, manifest constants
1898 are replaced by their values, and bitfield references are converted
1899 to their declared types. Note that this function does not perform the
1900 lvalue-to-rvalue conversion for class types. If you need that conversion
1901 to for class types, then you probably need to use force_rvalue.
1903 Although the returned value is being used as an rvalue, this
1904 function does not wrap the returned expression in a
1905 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1906 that the return value is no longer an lvalue. */
1909 decay_conversion (tree exp
)
1912 enum tree_code code
;
1914 type
= TREE_TYPE (exp
);
1915 if (type
== error_mark_node
)
1916 return error_mark_node
;
1918 exp
= mark_rvalue_use (exp
);
1920 exp
= resolve_nondeduced_context (exp
);
1921 if (type_unknown_p (exp
))
1923 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1924 return error_mark_node
;
1927 exp
= decl_constant_value (exp
);
1928 if (error_operand_p (exp
))
1929 return error_mark_node
;
1931 if (NULLPTR_TYPE_P (type
))
1932 return nullptr_node
;
1934 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1935 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1936 code
= TREE_CODE (type
);
1937 if (code
== VOID_TYPE
)
1939 error ("void value not ignored as it ought to be");
1940 return error_mark_node
;
1942 if (invalid_nonstatic_memfn_p (exp
, tf_warning_or_error
))
1943 return error_mark_node
;
1944 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1945 return cp_build_unary_op (ADDR_EXPR
, exp
, 0, tf_warning_or_error
);
1946 if (code
== ARRAY_TYPE
)
1951 if (TREE_CODE (exp
) == INDIRECT_REF
)
1952 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1953 TREE_OPERAND (exp
, 0));
1955 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1957 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1958 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1959 TREE_OPERAND (exp
, 0), op1
);
1963 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1965 error ("invalid use of non-lvalue array");
1966 return error_mark_node
;
1969 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1971 if (TREE_CODE (exp
) == VAR_DECL
)
1973 if (!cxx_mark_addressable (exp
))
1974 return error_mark_node
;
1975 adr
= build_nop (ptrtype
, build_address (exp
));
1978 /* This way is better for a COMPONENT_REF since it can
1979 simplify the offset for a component. */
1980 adr
= cp_build_unary_op (ADDR_EXPR
, exp
, 1, tf_warning_or_error
);
1981 return cp_convert (ptrtype
, adr
);
1984 /* If a bitfield is used in a context where integral promotion
1985 applies, then the caller is expected to have used
1986 default_conversion. That function promotes bitfields correctly
1987 before calling this function. At this point, if we have a
1988 bitfield referenced, we may assume that is not subject to
1989 promotion, and that, therefore, the type of the resulting rvalue
1990 is the declared type of the bitfield. */
1991 exp
= convert_bitfield_to_declared_type (exp
);
1993 /* We do not call rvalue() here because we do not want to wrap EXP
1994 in a NON_LVALUE_EXPR. */
1998 Non-class rvalues always have cv-unqualified types. */
1999 type
= TREE_TYPE (exp
);
2000 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
2001 exp
= build_nop (cv_unqualified (type
), exp
);
2006 /* Perform preparatory conversions, as part of the "usual arithmetic
2007 conversions". In particular, as per [expr]:
2009 Whenever an lvalue expression appears as an operand of an
2010 operator that expects the rvalue for that operand, the
2011 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
2012 standard conversions are applied to convert the expression to an
2015 In addition, we perform integral promotions here, as those are
2016 applied to both operands to a binary operator before determining
2017 what additional conversions should apply. */
2020 default_conversion (tree exp
)
2022 /* Check for target-specific promotions. */
2023 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
2025 exp
= cp_convert (promoted_type
, exp
);
2026 /* Perform the integral promotions first so that bitfield
2027 expressions (which may promote to "int", even if the bitfield is
2028 declared "unsigned") are promoted correctly. */
2029 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
2030 exp
= perform_integral_promotions (exp
);
2031 /* Perform the other conversions. */
2032 exp
= decay_conversion (exp
);
2037 /* EXPR is an expression with an integral or enumeration type.
2038 Perform the integral promotions in [conv.prom], and return the
2042 perform_integral_promotions (tree expr
)
2047 expr
= mark_rvalue_use (expr
);
2051 If the bitfield has an enumerated type, it is treated as any
2052 other value of that type for promotion purposes. */
2053 type
= is_bitfield_expr_with_lowered_type (expr
);
2054 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
2055 type
= TREE_TYPE (expr
);
2056 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
2057 promoted_type
= type_promotes_to (type
);
2058 if (type
!= promoted_type
)
2059 expr
= cp_convert (promoted_type
, expr
);
2063 /* Returns nonzero iff exp is a STRING_CST or the result of applying
2064 decay_conversion to one. */
2067 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
2071 if (TREE_CODE (totype
) != POINTER_TYPE
)
2074 t
= TREE_TYPE (totype
);
2075 if (!same_type_p (t
, char_type_node
)
2076 && !same_type_p (t
, char16_type_node
)
2077 && !same_type_p (t
, char32_type_node
)
2078 && !same_type_p (t
, wchar_type_node
))
2081 if (TREE_CODE (exp
) == STRING_CST
)
2083 /* Make sure that we don't try to convert between char and wide chars. */
2084 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
2089 /* Is this a string constant which has decayed to 'const char *'? */
2090 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
2091 if (!same_type_p (TREE_TYPE (exp
), t
))
2094 if (TREE_CODE (exp
) != ADDR_EXPR
2095 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2099 /* This warning is not very useful, as it complains about printf. */
2101 warning (OPT_Wwrite_strings
,
2102 "deprecated conversion from string constant to %qT",
2108 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2109 can, for example, use as an lvalue. This code used to be in
2110 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2111 expressions, where we're dealing with aggregates. But now it's again only
2112 called from unary_complex_lvalue. The case (in particular) that led to
2113 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2117 rationalize_conditional_expr (enum tree_code code
, tree t
,
2118 tsubst_flags_t complain
)
2120 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2121 the first operand is always the one to be used if both operands
2122 are equal, so we know what conditional expression this used to be. */
2123 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2125 tree op0
= TREE_OPERAND (t
, 0);
2126 tree op1
= TREE_OPERAND (t
, 1);
2128 /* The following code is incorrect if either operand side-effects. */
2129 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2130 && !TREE_SIDE_EFFECTS (op1
));
2132 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
2133 ? LE_EXPR
: GE_EXPR
),
2134 op0
, TREE_CODE (op0
),
2135 op1
, TREE_CODE (op1
),
2136 /*overloaded_p=*/NULL
,
2138 cp_build_unary_op (code
, op0
, 0, complain
),
2139 cp_build_unary_op (code
, op1
, 0, complain
),
2144 build_conditional_expr (TREE_OPERAND (t
, 0),
2145 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2147 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2152 /* Given the TYPE of an anonymous union field inside T, return the
2153 FIELD_DECL for the field. If not found return NULL_TREE. Because
2154 anonymous unions can nest, we must also search all anonymous unions
2155 that are directly reachable. */
2158 lookup_anon_field (tree t
, tree type
)
2162 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2164 if (TREE_STATIC (field
))
2166 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2169 /* If we find it directly, return the field. */
2170 if (DECL_NAME (field
) == NULL_TREE
2171 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2176 /* Otherwise, it could be nested, search harder. */
2177 if (DECL_NAME (field
) == NULL_TREE
2178 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2180 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2188 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2189 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2190 non-NULL, it indicates the path to the base used to name MEMBER.
2191 If PRESERVE_REFERENCE is true, the expression returned will have
2192 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2193 returned will have the type referred to by the reference.
2195 This function does not perform access control; that is either done
2196 earlier by the parser when the name of MEMBER is resolved to MEMBER
2197 itself, or later when overload resolution selects one of the
2198 functions indicated by MEMBER. */
2201 build_class_member_access_expr (tree object
, tree member
,
2202 tree access_path
, bool preserve_reference
,
2203 tsubst_flags_t complain
)
2207 tree result
= NULL_TREE
;
2209 if (error_operand_p (object
) || error_operand_p (member
))
2210 return error_mark_node
;
2212 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2216 The type of the first expression shall be "class object" (of a
2218 object_type
= TREE_TYPE (object
);
2219 if (!currently_open_class (object_type
)
2220 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2221 return error_mark_node
;
2222 if (!CLASS_TYPE_P (object_type
))
2224 if (complain
& tf_error
)
2225 error ("request for member %qD in %qE, which is of non-class type %qT",
2226 member
, object
, object_type
);
2227 return error_mark_node
;
2230 /* The standard does not seem to actually say that MEMBER must be a
2231 member of OBJECT_TYPE. However, that is clearly what is
2233 if (DECL_P (member
))
2235 member_scope
= DECL_CLASS_CONTEXT (member
);
2237 if (TREE_DEPRECATED (member
))
2238 warn_deprecated_use (member
, NULL_TREE
);
2241 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2242 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2243 presently be the anonymous union. Go outwards until we find a
2244 type related to OBJECT_TYPE. */
2245 while (ANON_AGGR_TYPE_P (member_scope
)
2246 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2248 member_scope
= TYPE_CONTEXT (member_scope
);
2249 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2251 if (complain
& tf_error
)
2253 if (TREE_CODE (member
) == FIELD_DECL
)
2254 error ("invalid use of nonstatic data member %qE", member
);
2256 error ("%qD is not a member of %qT", member
, object_type
);
2258 return error_mark_node
;
2261 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2262 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2263 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2265 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2267 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2270 /* In [expr.ref], there is an explicit list of the valid choices for
2271 MEMBER. We check for each of those cases here. */
2272 if (TREE_CODE (member
) == VAR_DECL
)
2274 /* A static data member. */
2276 mark_exp_read (object
);
2277 /* If OBJECT has side-effects, they are supposed to occur. */
2278 if (TREE_SIDE_EFFECTS (object
))
2279 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2281 else if (TREE_CODE (member
) == FIELD_DECL
)
2283 /* A non-static data member. */
2288 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
2289 && integer_zerop (TREE_OPERAND (object
, 0)));
2291 /* Convert OBJECT to the type of MEMBER. */
2292 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2293 TYPE_MAIN_VARIANT (member_scope
)))
2298 binfo
= lookup_base (access_path
? access_path
: object_type
,
2299 member_scope
, ba_unique
, &kind
);
2300 if (binfo
== error_mark_node
)
2301 return error_mark_node
;
2303 /* It is invalid to try to get to a virtual base of a
2304 NULL object. The most common cause is invalid use of
2306 if (null_object_p
&& kind
== bk_via_virtual
)
2308 if (complain
& tf_error
)
2310 error ("invalid access to non-static data member %qD of "
2313 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2315 return error_mark_node
;
2318 /* Convert to the base. */
2319 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2321 /* If we found the base successfully then we should be able
2322 to convert to it successfully. */
2323 gcc_assert (object
!= error_mark_node
);
2326 /* Complain about other invalid uses of offsetof, even though they will
2327 give the right answer. Note that we complain whether or not they
2328 actually used the offsetof macro, since there's no way to know at this
2329 point. So we just give a warning, instead of a pedwarn. */
2330 /* Do not produce this warning for base class field references, because
2331 we know for a fact that didn't come from offsetof. This does occur
2332 in various testsuite cases where a null object is passed where a
2333 vtable access is required. */
2334 if (null_object_p
&& warn_invalid_offsetof
2335 && CLASSTYPE_NON_STD_LAYOUT (object_type
)
2336 && !DECL_FIELD_IS_BASE (member
)
2337 && cp_unevaluated_operand
== 0
2338 && (complain
& tf_warning
))
2340 warning (OPT_Winvalid_offsetof
,
2341 "invalid access to non-static data member %qD "
2342 " of NULL object", member
);
2343 warning (OPT_Winvalid_offsetof
,
2344 "(perhaps the %<offsetof%> macro was used incorrectly)");
2347 /* If MEMBER is from an anonymous aggregate, we have converted
2348 OBJECT so that it refers to the class containing the
2349 anonymous union. Generate a reference to the anonymous union
2350 itself, and recur to find MEMBER. */
2351 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2352 /* When this code is called from build_field_call, the
2353 object already has the type of the anonymous union.
2354 That is because the COMPONENT_REF was already
2355 constructed, and was then disassembled before calling
2356 build_field_call. After the function-call code is
2357 cleaned up, this waste can be eliminated. */
2358 && (!same_type_ignoring_top_level_qualifiers_p
2359 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2361 tree anonymous_union
;
2363 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2364 DECL_CONTEXT (member
));
2365 object
= build_class_member_access_expr (object
,
2367 /*access_path=*/NULL_TREE
,
2372 /* Compute the type of the field, as described in [expr.ref]. */
2373 type_quals
= TYPE_UNQUALIFIED
;
2374 member_type
= TREE_TYPE (member
);
2375 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2377 type_quals
= (cp_type_quals (member_type
)
2378 | cp_type_quals (object_type
));
2380 /* A field is const (volatile) if the enclosing object, or the
2381 field itself, is const (volatile). But, a mutable field is
2382 not const, even within a const object. */
2383 if (DECL_MUTABLE_P (member
))
2384 type_quals
&= ~TYPE_QUAL_CONST
;
2385 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2388 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
2390 result
= fold_if_not_in_template (result
);
2392 /* Mark the expression const or volatile, as appropriate. Even
2393 though we've dealt with the type above, we still have to mark the
2394 expression itself. */
2395 if (type_quals
& TYPE_QUAL_CONST
)
2396 TREE_READONLY (result
) = 1;
2397 if (type_quals
& TYPE_QUAL_VOLATILE
)
2398 TREE_THIS_VOLATILE (result
) = 1;
2400 else if (BASELINK_P (member
))
2402 /* The member is a (possibly overloaded) member function. */
2406 /* If the MEMBER is exactly one static member function, then we
2407 know the type of the expression. Otherwise, we must wait
2408 until overload resolution has been performed. */
2409 functions
= BASELINK_FUNCTIONS (member
);
2410 if (TREE_CODE (functions
) == FUNCTION_DECL
2411 && DECL_STATIC_FUNCTION_P (functions
))
2412 type
= TREE_TYPE (functions
);
2414 type
= unknown_type_node
;
2415 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2416 base. That will happen when the function is called. */
2417 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2419 else if (TREE_CODE (member
) == CONST_DECL
)
2421 /* The member is an enumerator. */
2423 /* If OBJECT has side-effects, they are supposed to occur. */
2424 if (TREE_SIDE_EFFECTS (object
))
2425 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2430 if (complain
& tf_error
)
2431 error ("invalid use of %qD", member
);
2432 return error_mark_node
;
2435 if (!preserve_reference
)
2438 If E2 is declared to have type "reference to T", then ... the
2439 type of E1.E2 is T. */
2440 result
= convert_from_reference (result
);
2445 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2446 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2449 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2451 tree object_type
= TREE_TYPE (object
);
2452 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2455 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2457 error ("qualified type %qT does not match destructor name ~%qT",
2459 return error_mark_node
;
2461 if (TREE_CODE (dtor_type
) == IDENTIFIER_NODE
)
2463 /* In a template, names we can't find a match for are still accepted
2464 destructor names, and we check them here. */
2465 if (check_dtor_name (object_type
, dtor_type
))
2466 dtor_type
= object_type
;
2469 error ("object type %qT does not match destructor name ~%qT",
2470 object_type
, dtor_type
);
2471 return error_mark_node
;
2475 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2477 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2478 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2479 return error_mark_node
;
2481 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2482 /*protect=*/1, /*want_type=*/false);
2483 expr
= (adjust_result_of_qualified_name_lookup
2484 (expr
, dtor_type
, object_type
));
2488 /* An expression of the form "A::template B" has been resolved to
2489 DECL. Issue a diagnostic if B is not a template or template
2493 check_template_keyword (tree decl
)
2495 /* The standard says:
2499 If a name prefixed by the keyword template is not a member
2500 template, the program is ill-formed.
2502 DR 228 removed the restriction that the template be a member
2505 DR 96, if accepted would add the further restriction that explicit
2506 template arguments must be provided if the template keyword is
2507 used, but, as of 2005-10-16, that DR is still in "drafting". If
2508 this DR is accepted, then the semantic checks here can be
2509 simplified, as the entity named must in fact be a template
2510 specialization, rather than, as at present, a set of overloaded
2511 functions containing at least one template function. */
2512 if (TREE_CODE (decl
) != TEMPLATE_DECL
2513 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2515 if (!is_overloaded_fn (decl
))
2516 permerror (input_location
, "%qD is not a template", decl
);
2521 if (BASELINK_P (fns
))
2522 fns
= BASELINK_FUNCTIONS (fns
);
2525 tree fn
= OVL_CURRENT (fns
);
2526 if (TREE_CODE (fn
) == TEMPLATE_DECL
2527 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2529 if (TREE_CODE (fn
) == FUNCTION_DECL
2530 && DECL_USE_TEMPLATE (fn
)
2531 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2533 fns
= OVL_NEXT (fns
);
2536 permerror (input_location
, "%qD is not a template", decl
);
2541 /* This function is called by the parser to process a class member
2542 access expression of the form OBJECT.NAME. NAME is a node used by
2543 the parser to represent a name; it is not yet a DECL. It may,
2544 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2545 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2546 there is no reason to do the lookup twice, so the parser keeps the
2547 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2548 be a template via the use of the "A::template B" syntax. */
2551 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2552 tsubst_flags_t complain
)
2557 tree access_path
= NULL_TREE
;
2558 tree orig_object
= object
;
2559 tree orig_name
= name
;
2561 if (object
== error_mark_node
|| name
== error_mark_node
)
2562 return error_mark_node
;
2564 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2565 if (!objc_is_public (object
, name
))
2566 return error_mark_node
;
2568 object_type
= TREE_TYPE (object
);
2570 if (processing_template_decl
)
2572 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2573 dependent_type_p (object_type
)
2574 /* If NAME is just an IDENTIFIER_NODE, then the expression
2576 || TREE_CODE (object
) == IDENTIFIER_NODE
2577 /* If NAME is "f<args>", where either 'f' or 'args' is
2578 dependent, then the expression is dependent. */
2579 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2580 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2581 TREE_OPERAND (name
, 1)))
2582 /* If NAME is "T::X" where "T" is dependent, then the
2583 expression is dependent. */
2584 || (TREE_CODE (name
) == SCOPE_REF
2585 && TYPE_P (TREE_OPERAND (name
, 0))
2586 && dependent_type_p (TREE_OPERAND (name
, 0))))
2587 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2588 object
= build_non_dependent_expr (object
);
2593 The type of the first expression shall be "class object" (of a
2595 if (!currently_open_class (object_type
)
2596 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2597 return error_mark_node
;
2598 if (!CLASS_TYPE_P (object_type
))
2600 if (complain
& tf_error
)
2601 error ("request for member %qD in %qE, which is of non-class type %qT",
2602 name
, object
, object_type
);
2603 return error_mark_node
;
2606 if (BASELINK_P (name
))
2607 /* A member function that has already been looked up. */
2611 bool is_template_id
= false;
2612 tree template_args
= NULL_TREE
;
2615 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2617 is_template_id
= true;
2618 template_args
= TREE_OPERAND (name
, 1);
2619 name
= TREE_OPERAND (name
, 0);
2621 if (TREE_CODE (name
) == OVERLOAD
)
2622 name
= DECL_NAME (get_first_fn (name
));
2623 else if (DECL_P (name
))
2624 name
= DECL_NAME (name
);
2627 if (TREE_CODE (name
) == SCOPE_REF
)
2629 /* A qualified name. The qualifying class or namespace `S'
2630 has already been looked up; it is either a TYPE or a
2632 scope
= TREE_OPERAND (name
, 0);
2633 name
= TREE_OPERAND (name
, 1);
2635 /* If SCOPE is a namespace, then the qualified name does not
2636 name a member of OBJECT_TYPE. */
2637 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2639 if (complain
& tf_error
)
2640 error ("%<%D::%D%> is not a member of %qT",
2641 scope
, name
, object_type
);
2642 return error_mark_node
;
2645 gcc_assert (CLASS_TYPE_P (scope
));
2646 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2647 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2649 if (constructor_name_p (name
, scope
))
2651 if (complain
& tf_error
)
2652 error ("cannot call constructor %<%T::%D%> directly",
2654 return error_mark_node
;
2657 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2658 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2659 if (access_path
== error_mark_node
)
2660 return error_mark_node
;
2663 if (complain
& tf_error
)
2664 error ("%qT is not a base of %qT", scope
, object_type
);
2665 return error_mark_node
;
2671 access_path
= object_type
;
2674 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2675 member
= lookup_destructor (object
, scope
, name
);
2678 /* Look up the member. */
2679 member
= lookup_member (access_path
, name
, /*protect=*/1,
2680 /*want_type=*/false);
2681 if (member
== NULL_TREE
)
2683 if (complain
& tf_error
)
2684 error ("%qD has no member named %qE", object_type
, name
);
2685 return error_mark_node
;
2687 if (member
== error_mark_node
)
2688 return error_mark_node
;
2693 tree templ
= member
;
2695 if (BASELINK_P (templ
))
2696 templ
= lookup_template_function (templ
, template_args
);
2699 if (complain
& tf_error
)
2700 error ("%qD is not a member template function", name
);
2701 return error_mark_node
;
2706 if (TREE_DEPRECATED (member
))
2707 warn_deprecated_use (member
, NULL_TREE
);
2710 check_template_keyword (member
);
2712 expr
= build_class_member_access_expr (object
, member
, access_path
,
2713 /*preserve_reference=*/false,
2715 if (processing_template_decl
&& expr
!= error_mark_node
)
2717 if (BASELINK_P (member
))
2719 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2720 BASELINK_QUALIFIED_P (member
) = 1;
2723 return build_min_non_dep (COMPONENT_REF
, expr
,
2724 orig_object
, orig_name
,
2731 /* Return an expression for the MEMBER_NAME field in the internal
2732 representation of PTRMEM, a pointer-to-member function. (Each
2733 pointer-to-member function type gets its own RECORD_TYPE so it is
2734 more convenient to access the fields by name than by FIELD_DECL.)
2735 This routine converts the NAME to a FIELD_DECL and then creates the
2736 node for the complete expression. */
2739 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2745 /* This code is a stripped down version of
2746 build_class_member_access_expr. It does not work to use that
2747 routine directly because it expects the object to be of class
2749 ptrmem_type
= TREE_TYPE (ptrmem
);
2750 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2751 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2752 /*want_type=*/false);
2753 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2754 cp_type_quals (ptrmem_type
));
2755 return fold_build3_loc (input_location
,
2756 COMPONENT_REF
, member_type
,
2757 ptrmem
, member
, NULL_TREE
);
2760 /* Given an expression PTR for a pointer, return an expression
2761 for the value pointed to.
2762 ERRORSTRING is the name of the operator to appear in error messages.
2764 This function may need to overload OPERATOR_FNNAME.
2765 Must also handle REFERENCE_TYPEs for C++. */
2768 build_x_indirect_ref (tree expr
, ref_operator errorstring
,
2769 tsubst_flags_t complain
)
2771 tree orig_expr
= expr
;
2774 if (processing_template_decl
)
2776 /* Retain the type if we know the operand is a pointer so that
2777 describable_type doesn't make auto deduction break. */
2778 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2779 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2780 if (type_dependent_expression_p (expr
))
2781 return build_min_nt (INDIRECT_REF
, expr
);
2782 expr
= build_non_dependent_expr (expr
);
2785 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2786 NULL_TREE
, /*overloaded_p=*/NULL
, complain
);
2788 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2790 if (processing_template_decl
&& rval
!= error_mark_node
)
2791 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2796 /* Helper function called from c-common. */
2798 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2799 tree ptr
, ref_operator errorstring
)
2801 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2805 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2806 tsubst_flags_t complain
)
2810 if (ptr
== error_mark_node
)
2811 return error_mark_node
;
2813 if (ptr
== current_class_ptr
)
2814 return current_class_ref
;
2816 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2817 ? ptr
: decay_conversion (ptr
));
2818 type
= TREE_TYPE (pointer
);
2820 if (POINTER_TYPE_P (type
))
2824 If the type of the expression is "pointer to T," the type
2825 of the result is "T." */
2826 tree t
= TREE_TYPE (type
);
2828 if (CONVERT_EXPR_P (ptr
)
2829 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2831 /* If a warning is issued, mark it to avoid duplicates from
2832 the backend. This only needs to be done at
2833 warn_strict_aliasing > 2. */
2834 if (warn_strict_aliasing
> 2)
2835 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2836 type
, TREE_OPERAND (ptr
, 0)))
2837 TREE_NO_WARNING (ptr
) = 1;
2840 if (VOID_TYPE_P (t
))
2842 /* A pointer to incomplete type (other than cv void) can be
2843 dereferenced [expr.unary.op]/1 */
2844 if (complain
& tf_error
)
2845 error ("%qT is not a pointer-to-object type", type
);
2846 return error_mark_node
;
2848 else if (TREE_CODE (pointer
) == ADDR_EXPR
2849 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2850 /* The POINTER was something like `&x'. We simplify `*&x' to
2852 return TREE_OPERAND (pointer
, 0);
2855 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2857 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2858 so that we get the proper error message if the result is used
2859 to assign to. Also, &* is supposed to be a no-op. */
2860 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2861 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2862 TREE_SIDE_EFFECTS (ref
)
2863 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2867 else if (!(complain
& tf_error
))
2868 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2870 /* `pointer' won't be an error_mark_node if we were given a
2871 pointer to member, so it's cool to check for this here. */
2872 else if (TYPE_PTR_TO_MEMBER_P (type
))
2873 switch (errorstring
)
2875 case RO_ARRAY_INDEXING
:
2876 error ("invalid use of array indexing on pointer to member");
2879 error ("invalid use of unary %<*%> on pointer to member");
2881 case RO_IMPLICIT_CONVERSION
:
2882 error ("invalid use of implicit conversion on pointer to member");
2887 else if (pointer
!= error_mark_node
)
2888 switch (errorstring
)
2891 error ("invalid type argument");
2893 case RO_ARRAY_INDEXING
:
2894 error ("invalid type argument of array indexing");
2897 error ("invalid type argument of unary %<*%>");
2899 case RO_IMPLICIT_CONVERSION
:
2900 error ("invalid type argument of implicit conversion");
2905 return error_mark_node
;
2908 /* This handles expressions of the form "a[i]", which denotes
2911 This is logically equivalent in C to *(a+i), but we may do it differently.
2912 If A is a variable or a member, we generate a primitive ARRAY_REF.
2913 This avoids forcing the array out of registers, and can work on
2914 arrays that are not lvalues (for example, members of structures returned
2917 If INDEX is of some user-defined type, it must be converted to
2918 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2919 will inherit the type of the array, which will be some pointer type.
2921 LOC is the location to use in building the array reference. */
2924 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
2925 tsubst_flags_t complain
)
2931 if (complain
& tf_error
)
2932 error_at (loc
, "subscript missing in array reference");
2933 return error_mark_node
;
2936 if (TREE_TYPE (array
) == error_mark_node
2937 || TREE_TYPE (idx
) == error_mark_node
)
2938 return error_mark_node
;
2940 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2942 switch (TREE_CODE (array
))
2946 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2948 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2949 TREE_OPERAND (array
, 0), value
);
2950 SET_EXPR_LOCATION (ret
, loc
);
2955 ret
= build_conditional_expr
2956 (TREE_OPERAND (array
, 0),
2957 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2959 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
2961 tf_warning_or_error
);
2962 protected_set_expr_location (ret
, loc
);
2969 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2973 warn_array_subscript_with_type_char (idx
);
2975 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2977 if (complain
& tf_error
)
2978 error_at (loc
, "array subscript is not an integer");
2979 return error_mark_node
;
2982 /* Apply integral promotions *after* noticing character types.
2983 (It is unclear why we do these promotions -- the standard
2984 does not say that we should. In fact, the natural thing would
2985 seem to be to convert IDX to ptrdiff_t; we're performing
2986 pointer arithmetic.) */
2987 idx
= perform_integral_promotions (idx
);
2989 /* An array that is indexed by a non-constant
2990 cannot be stored in a register; we must be able to do
2991 address arithmetic on its address.
2992 Likewise an array of elements of variable size. */
2993 if (TREE_CODE (idx
) != INTEGER_CST
2994 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2995 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2998 if (!cxx_mark_addressable (array
))
2999 return error_mark_node
;
3002 /* An array that is indexed by a constant value which is not within
3003 the array bounds cannot be stored in a register either; because we
3004 would get a crash in store_bit_field/extract_bit_field when trying
3005 to access a non-existent part of the register. */
3006 if (TREE_CODE (idx
) == INTEGER_CST
3007 && TYPE_DOMAIN (TREE_TYPE (array
))
3008 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
3010 if (!cxx_mark_addressable (array
))
3011 return error_mark_node
;
3014 if (!lvalue_p (array
) && (complain
& tf_error
))
3015 pedwarn (loc
, OPT_pedantic
,
3016 "ISO C++ forbids subscripting non-lvalue array");
3018 /* Note in C++ it is valid to subscript a `register' array, since
3019 it is valid to take the address of something with that
3020 storage specification. */
3024 while (TREE_CODE (foo
) == COMPONENT_REF
)
3025 foo
= TREE_OPERAND (foo
, 0);
3026 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
)
3027 && (complain
& tf_warning
))
3028 warning_at (loc
, OPT_Wextra
,
3029 "subscripting array declared %<register%>");
3032 type
= TREE_TYPE (TREE_TYPE (array
));
3033 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
3034 /* Array ref is const/volatile if the array elements are
3035 or if the array is.. */
3036 TREE_READONLY (rval
)
3037 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
3038 TREE_SIDE_EFFECTS (rval
)
3039 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
3040 TREE_THIS_VOLATILE (rval
)
3041 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
3042 ret
= require_complete_type (fold_if_not_in_template (rval
));
3043 protected_set_expr_location (ret
, loc
);
3048 tree ar
= default_conversion (array
);
3049 tree ind
= default_conversion (idx
);
3051 /* Put the integer in IND to simplify error checking. */
3052 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
3059 if (ar
== error_mark_node
)
3062 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
3064 if (complain
& tf_error
)
3065 error_at (loc
, "subscripted value is neither array nor pointer");
3066 return error_mark_node
;
3068 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
3070 if (complain
& tf_error
)
3071 error_at (loc
, "array subscript is not an integer");
3072 return error_mark_node
;
3075 warn_array_subscript_with_type_char (idx
);
3077 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
3082 protected_set_expr_location (ret
, loc
);
3087 /* Entry point for Obj-C++. */
3090 build_array_ref (location_t loc
, tree array
, tree idx
)
3092 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
3095 /* Resolve a pointer to member function. INSTANCE is the object
3096 instance to use, if the member points to a virtual member.
3098 This used to avoid checking for virtual functions if basetype
3099 has no virtual functions, according to an earlier ANSI draft.
3100 With the final ISO C++ rules, such an optimization is
3101 incorrect: A pointer to a derived member can be static_cast
3102 to pointer-to-base-member, as long as the dynamic object
3103 later has the right member. */
3106 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
3108 if (TREE_CODE (function
) == OFFSET_REF
)
3109 function
= TREE_OPERAND (function
, 1);
3111 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3113 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
3114 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3116 tree instance_ptr
= *instance_ptrptr
;
3117 tree instance_save_expr
= 0;
3118 if (instance_ptr
== error_mark_node
)
3120 if (TREE_CODE (function
) == PTRMEM_CST
)
3122 /* Extracting the function address from a pmf is only
3123 allowed with -Wno-pmf-conversions. It only works for
3125 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
3126 e1
= convert (fntype
, e1
);
3131 error ("object missing in use of %qE", function
);
3132 return error_mark_node
;
3136 if (TREE_SIDE_EFFECTS (instance_ptr
))
3137 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3139 if (TREE_SIDE_EFFECTS (function
))
3140 function
= save_expr (function
);
3142 /* Start by extracting all the information from the PMF itself. */
3143 e3
= pfn_from_ptrmemfunc (function
);
3144 delta
= delta_from_ptrmemfunc (function
);
3145 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3146 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3148 case ptrmemfunc_vbit_in_pfn
:
3149 e1
= cp_build_binary_op (input_location
,
3150 BIT_AND_EXPR
, idx
, integer_one_node
,
3151 tf_warning_or_error
);
3152 idx
= cp_build_binary_op (input_location
,
3153 MINUS_EXPR
, idx
, integer_one_node
,
3154 tf_warning_or_error
);
3157 case ptrmemfunc_vbit_in_delta
:
3158 e1
= cp_build_binary_op (input_location
,
3159 BIT_AND_EXPR
, delta
, integer_one_node
,
3160 tf_warning_or_error
);
3161 delta
= cp_build_binary_op (input_location
,
3162 RSHIFT_EXPR
, delta
, integer_one_node
,
3163 tf_warning_or_error
);
3170 /* Convert down to the right base before using the instance. A
3171 special case is that in a pointer to member of class C, C may
3172 be incomplete. In that case, the function will of course be
3173 a member of C, and no conversion is required. In fact,
3174 lookup_base will fail in that case, because incomplete
3175 classes do not have BINFOs. */
3176 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3177 if (!same_type_ignoring_top_level_qualifiers_p
3178 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3180 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3181 basetype
, ba_check
, NULL
);
3182 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3184 if (instance_ptr
== error_mark_node
)
3185 return error_mark_node
;
3187 /* ...and then the delta in the PMF. */
3188 instance_ptr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (instance_ptr
),
3189 instance_ptr
, fold_convert (sizetype
, delta
));
3191 /* Hand back the adjusted 'this' argument to our caller. */
3192 *instance_ptrptr
= instance_ptr
;
3194 /* Next extract the vtable pointer from the object. */
3195 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3197 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, tf_warning_or_error
);
3198 /* If the object is not dynamic the access invokes undefined
3199 behavior. As it is not executed in this case silence the
3200 spurious warnings it may provoke. */
3201 TREE_NO_WARNING (vtbl
) = 1;
3203 /* Finally, extract the function pointer from the vtable. */
3204 e2
= fold_build2_loc (input_location
,
3205 POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
,
3206 fold_convert (sizetype
, idx
));
3207 e2
= cp_build_indirect_ref (e2
, RO_NULL
, tf_warning_or_error
);
3208 TREE_CONSTANT (e2
) = 1;
3210 /* When using function descriptors, the address of the
3211 vtable entry is treated as a function pointer. */
3212 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3213 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3214 cp_build_unary_op (ADDR_EXPR
, e2
, /*noconvert=*/1,
3215 tf_warning_or_error
));
3217 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3218 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
3220 /* Make sure this doesn't get evaluated first inside one of the
3221 branches of the COND_EXPR. */
3222 if (instance_save_expr
)
3223 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3224 instance_save_expr
, e1
);
3231 /* Used by the C-common bits. */
3233 build_function_call (location_t loc ATTRIBUTE_UNUSED
,
3234 tree function
, tree params
)
3236 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3239 /* Used by the C-common bits. */
3241 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED
,
3242 tree function
, VEC(tree
,gc
) *params
,
3243 VEC(tree
,gc
) *origtypes ATTRIBUTE_UNUSED
)
3245 VEC(tree
,gc
) *orig_params
= params
;
3246 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3247 tf_warning_or_error
);
3249 /* cp_build_function_call_vec can reallocate PARAMS by adding
3250 default arguments. That should never happen here. Verify
3252 gcc_assert (params
== orig_params
);
3257 /* Build a function call using a tree list of arguments. */
3260 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3265 vec
= make_tree_vector ();
3266 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3267 VEC_safe_push (tree
, gc
, vec
, TREE_VALUE (params
));
3268 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3269 release_tree_vector (vec
);
3273 /* Build a function call using varargs. */
3276 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3282 vec
= make_tree_vector ();
3283 va_start (args
, complain
);
3284 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3285 VEC_safe_push (tree
, gc
, vec
, t
);
3287 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3288 release_tree_vector (vec
);
3292 /* Build a function call using a vector of arguments. PARAMS may be
3293 NULL if there are no parameters. This changes the contents of
3297 cp_build_function_call_vec (tree function
, VEC(tree
,gc
) **params
,
3298 tsubst_flags_t complain
)
3300 tree fntype
, fndecl
;
3302 tree original
= function
;
3306 VEC(tree
,gc
) *allocated
= NULL
;
3309 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3310 expressions, like those used for ObjC messenger dispatches. */
3311 if (params
!= NULL
&& !VEC_empty (tree
, *params
))
3312 function
= objc_rewrite_function_call (function
,
3313 VEC_index (tree
, *params
, 0));
3315 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3316 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3317 if (TREE_CODE (function
) == NOP_EXPR
3318 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3319 function
= TREE_OPERAND (function
, 0);
3321 if (TREE_CODE (function
) == FUNCTION_DECL
)
3323 mark_used (function
);
3326 /* Convert anything with function type to a pointer-to-function. */
3327 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
3328 pedwarn (input_location
, OPT_pedantic
,
3329 "ISO C++ forbids calling %<::main%> from within program");
3331 function
= build_addr_func (function
);
3337 function
= build_addr_func (function
);
3340 if (function
== error_mark_node
)
3341 return error_mark_node
;
3343 fntype
= TREE_TYPE (function
);
3345 if (TYPE_PTRMEMFUNC_P (fntype
))
3347 if (complain
& tf_error
)
3348 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3349 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3350 original
, original
);
3351 return error_mark_node
;
3354 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
3355 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3357 if (!((TREE_CODE (fntype
) == POINTER_TYPE
3358 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
3360 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3362 if (complain
& tf_error
)
3363 error ("%qE cannot be used as a function", original
);
3364 return error_mark_node
;
3367 /* fntype now gets the type of function pointed to. */
3368 fntype
= TREE_TYPE (fntype
);
3369 parm_types
= TYPE_ARG_TYPES (fntype
);
3373 allocated
= make_tree_vector ();
3374 params
= &allocated
;
3377 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3380 return error_mark_node
;
3382 argarray
= VEC_address (tree
, *params
);
3384 /* Check for errors in format strings and inappropriately
3386 check_function_arguments (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
,
3389 ret
= build_cxx_call (function
, nargs
, argarray
);
3391 if (allocated
!= NULL
)
3392 release_tree_vector (allocated
);
3397 /* Subroutine of convert_arguments.
3398 Warn about wrong number of args are genereted. */
3401 warn_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3405 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3407 if (DECL_NAME (fndecl
) == NULL_TREE
3408 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3411 ? G_("too many arguments to constructor %q#D")
3412 : G_("too few arguments to constructor %q#D"),
3417 ? G_("too many arguments to member function %q#D")
3418 : G_("too few arguments to member function %q#D"),
3424 ? G_("too many arguments to function %q#D")
3425 : G_("too few arguments to function %q#D"),
3427 inform (DECL_SOURCE_LOCATION (fndecl
),
3432 if (c_dialect_objc () && objc_message_selector ())
3435 ? G_("too many arguments to method %q#D")
3436 : G_("too few arguments to method %q#D"),
3437 objc_message_selector ());
3439 error_at (loc
, too_many_p
? G_("too many arguments to function")
3440 : G_("too few arguments to function"));
3444 /* Convert the actual parameter expressions in the list VALUES to the
3445 types in the list TYPELIST. The converted expressions are stored
3446 back in the VALUES vector.
3447 If parmdecls is exhausted, or when an element has NULL as its type,
3448 perform the default conversions.
3450 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3452 This is also where warnings about wrong number of args are generated.
3454 Returns the actual number of arguments processed (which might be less
3455 than the length of the vector), or -1 on error.
3457 In C++, unspecified trailing parameters can be filled in with their
3458 default arguments, if such were specified. Do so here. */
3461 convert_arguments (tree typelist
, VEC(tree
,gc
) **values
, tree fndecl
,
3462 int flags
, tsubst_flags_t complain
)
3467 /* Argument passing is always copy-initialization. */
3468 flags
|= LOOKUP_ONLYCONVERTING
;
3470 for (i
= 0, typetail
= typelist
;
3471 i
< VEC_length (tree
, *values
);
3474 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3475 tree val
= VEC_index (tree
, *values
, i
);
3477 if (val
== error_mark_node
|| type
== error_mark_node
)
3480 if (type
== void_type_node
)
3482 if (complain
& tf_error
)
3484 warn_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3491 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3492 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3493 if (TREE_CODE (val
) == NOP_EXPR
3494 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3495 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3496 val
= TREE_OPERAND (val
, 0);
3498 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3500 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3501 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3502 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3503 val
= decay_conversion (val
);
3506 if (val
== error_mark_node
)
3511 /* Formal parm type is specified by a function prototype. */
3514 if (!COMPLETE_TYPE_P (complete_type (type
)))
3516 if (complain
& tf_error
)
3519 error ("parameter %P of %qD has incomplete type %qT",
3522 error ("parameter %P has incomplete type %qT", i
, type
);
3524 parmval
= error_mark_node
;
3528 parmval
= convert_for_initialization
3529 (NULL_TREE
, type
, val
, flags
,
3530 ICR_ARGPASS
, fndecl
, i
, complain
);
3531 parmval
= convert_for_arg_passing (type
, parmval
);
3534 if (parmval
== error_mark_node
)
3537 VEC_replace (tree
, *values
, i
, parmval
);
3541 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3542 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3543 /* Don't do ellipsis conversion for __built_in_constant_p
3544 as this will result in spurious errors for non-trivial
3546 val
= require_complete_type (val
);
3548 val
= convert_arg_to_ellipsis (val
);
3550 VEC_replace (tree
, *values
, i
, val
);
3554 typetail
= TREE_CHAIN (typetail
);
3557 if (typetail
!= 0 && typetail
!= void_list_node
)
3559 /* See if there are default arguments that can be used. Because
3560 we hold default arguments in the FUNCTION_TYPE (which is so
3561 wrong), we can see default parameters here from deduced
3562 contexts (and via typeof) for indirect function calls.
3563 Fortunately we know whether we have a function decl to
3564 provide default arguments in a language conformant
3566 if (fndecl
&& TREE_PURPOSE (typetail
)
3567 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3569 for (; typetail
!= void_list_node
; ++i
)
3572 = convert_default_arg (TREE_VALUE (typetail
),
3573 TREE_PURPOSE (typetail
),
3576 if (parmval
== error_mark_node
)
3579 VEC_safe_push (tree
, gc
, *values
, parmval
);
3580 typetail
= TREE_CHAIN (typetail
);
3581 /* ends with `...'. */
3582 if (typetail
== NULL_TREE
)
3588 if (complain
& tf_error
)
3589 warn_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3597 /* Build a binary-operation expression, after performing default
3598 conversions on the operands. CODE is the kind of expression to
3599 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3600 are the tree codes which correspond to ARG1 and ARG2 when issuing
3601 warnings about possibly misplaced parentheses. They may differ
3602 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3603 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3604 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3605 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3606 ARG2_CODE as ERROR_MARK. */
3609 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3610 tree arg2
, enum tree_code arg2_code
, bool *overloaded_p
,
3611 tsubst_flags_t complain
)
3620 if (processing_template_decl
)
3622 if (type_dependent_expression_p (arg1
)
3623 || type_dependent_expression_p (arg2
))
3624 return build_min_nt (code
, arg1
, arg2
);
3625 arg1
= build_non_dependent_expr (arg1
);
3626 arg2
= build_non_dependent_expr (arg2
);
3629 if (code
== DOTSTAR_EXPR
)
3630 expr
= build_m_component_ref (arg1
, arg2
);
3632 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3633 overloaded_p
, complain
);
3635 /* Check for cases such as x+y<<z which users are likely to
3636 misinterpret. But don't warn about obj << x + y, since that is a
3637 common idiom for I/O. */
3638 if (warn_parentheses
3639 && (complain
& tf_warning
)
3640 && !processing_template_decl
3641 && !error_operand_p (arg1
)
3642 && !error_operand_p (arg2
)
3643 && (code
!= LSHIFT_EXPR
3644 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3645 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3647 if (processing_template_decl
&& expr
!= error_mark_node
)
3648 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3653 /* Build and return an ARRAY_REF expression. */
3656 build_x_array_ref (tree arg1
, tree arg2
, tsubst_flags_t complain
)
3658 tree orig_arg1
= arg1
;
3659 tree orig_arg2
= arg2
;
3662 if (processing_template_decl
)
3664 if (type_dependent_expression_p (arg1
)
3665 || type_dependent_expression_p (arg2
))
3666 return build_min_nt (ARRAY_REF
, arg1
, arg2
,
3667 NULL_TREE
, NULL_TREE
);
3668 arg1
= build_non_dependent_expr (arg1
);
3669 arg2
= build_non_dependent_expr (arg2
);
3672 expr
= build_new_op (ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3673 /*overloaded_p=*/NULL
, complain
);
3675 if (processing_template_decl
&& expr
!= error_mark_node
)
3676 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3677 NULL_TREE
, NULL_TREE
);
3681 /* For the c-common bits. */
3683 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3684 int convert_p ATTRIBUTE_UNUSED
)
3686 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3690 /* Build a binary-operation expression without default conversions.
3691 CODE is the kind of expression to build.
3692 LOCATION is the location_t of the operator in the source code.
3693 This function differs from `build' in several ways:
3694 the data type of the result is computed and recorded in it,
3695 warnings are generated if arg data types are invalid,
3696 special handling for addition and subtraction of pointers is known,
3697 and some optimization is done (operations on narrow ints
3698 are done in the narrower type when that gives the same result).
3699 Constant folding is also done before the result is returned.
3701 Note that the operands will never have enumeral types
3702 because either they have just had the default conversions performed
3703 or they have both just been converted to some other type in which
3704 the arithmetic is to be done.
3706 C++: must do special pointer arithmetic when implementing
3707 multiple inheritance, and deal with pointer to member functions. */
3710 cp_build_binary_op (location_t location
,
3711 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3712 tsubst_flags_t complain
)
3715 enum tree_code code0
, code1
;
3717 const char *invalid_op_diag
;
3719 /* Expression code to give to the expression when it is built.
3720 Normally this is CODE, which is what the caller asked for,
3721 but in some special cases we change it. */
3722 enum tree_code resultcode
= code
;
3724 /* Data type in which the computation is to be performed.
3725 In the simplest cases this is the common type of the arguments. */
3726 tree result_type
= NULL
;
3728 /* Nonzero means operands have already been type-converted
3729 in whatever way is necessary.
3730 Zero means they need to be converted to RESULT_TYPE. */
3733 /* Nonzero means create the expression with this type, rather than
3735 tree build_type
= 0;
3737 /* Nonzero means after finally constructing the expression
3738 convert it to this type. */
3739 tree final_type
= 0;
3743 /* Nonzero if this is an operation like MIN or MAX which can
3744 safely be computed in short if both args are promoted shorts.
3745 Also implies COMMON.
3746 -1 indicates a bitwise operation; this makes a difference
3747 in the exact conditions for when it is safe to do the operation
3748 in a narrower mode. */
3751 /* Nonzero if this is a comparison operation;
3752 if both args are promoted shorts, compare the original shorts.
3753 Also implies COMMON. */
3754 int short_compare
= 0;
3756 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3759 /* True if both operands have arithmetic type. */
3760 bool arithmetic_types_p
;
3762 /* Apply default conversions. */
3766 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3767 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3768 || code
== TRUTH_XOR_EXPR
)
3770 if (!really_overloaded_fn (op0
))
3771 op0
= decay_conversion (op0
);
3772 if (!really_overloaded_fn (op1
))
3773 op1
= decay_conversion (op1
);
3777 if (!really_overloaded_fn (op0
))
3778 op0
= default_conversion (op0
);
3779 if (!really_overloaded_fn (op1
))
3780 op1
= default_conversion (op1
);
3783 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3784 STRIP_TYPE_NOPS (op0
);
3785 STRIP_TYPE_NOPS (op1
);
3787 /* DTRT if one side is an overloaded function, but complain about it. */
3788 if (type_unknown_p (op0
))
3790 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3791 if (t
!= error_mark_node
)
3793 if (complain
& tf_error
)
3794 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3799 if (type_unknown_p (op1
))
3801 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3802 if (t
!= error_mark_node
)
3804 if (complain
& tf_error
)
3805 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3811 type0
= TREE_TYPE (op0
);
3812 type1
= TREE_TYPE (op1
);
3814 /* The expression codes of the data types of the arguments tell us
3815 whether the arguments are integers, floating, pointers, etc. */
3816 code0
= TREE_CODE (type0
);
3817 code1
= TREE_CODE (type1
);
3819 /* If an error was already reported for one of the arguments,
3820 avoid reporting another error. */
3821 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3822 return error_mark_node
;
3824 if ((invalid_op_diag
3825 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3827 error (invalid_op_diag
);
3828 return error_mark_node
;
3831 /* Issue warnings about peculiar, but valid, uses of NULL. */
3832 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3833 /* It's reasonable to use pointer values as operands of &&
3834 and ||, so NULL is no exception. */
3835 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3836 && ( /* Both are NULL (or 0) and the operation was not a
3837 comparison or a pointer subtraction. */
3838 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3839 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
3840 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3841 || (!null_ptr_cst_p (orig_op0
)
3842 && !TYPE_PTR_P (type0
) && !TYPE_PTR_TO_MEMBER_P (type0
))
3843 || (!null_ptr_cst_p (orig_op1
)
3844 && !TYPE_PTR_P (type1
) && !TYPE_PTR_TO_MEMBER_P (type1
)))
3845 && (complain
& tf_warning
))
3846 /* Some sort of arithmetic operation involving NULL was
3848 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3853 /* Subtraction of two similar pointers.
3854 We must subtract them as integers, then divide by object size. */
3855 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3856 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3858 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3859 /* In all other cases except pointer - int, the usual arithmetic
3861 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3866 /* The pointer - int case is just like pointer + int; fall
3869 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3870 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3874 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3875 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3876 if (processing_template_decl
)
3878 result_type
= TREE_TYPE (ptr_operand
);
3881 return cp_pointer_int_sum (code
,
3892 case TRUNC_DIV_EXPR
:
3894 case FLOOR_DIV_EXPR
:
3895 case ROUND_DIV_EXPR
:
3896 case EXACT_DIV_EXPR
:
3897 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3898 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3899 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3900 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3902 enum tree_code tcode0
= code0
, tcode1
= code1
;
3904 warn_for_div_by_zero (location
, op1
);
3906 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3907 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3908 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3909 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3911 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3912 resultcode
= RDIV_EXPR
;
3914 /* When dividing two signed integers, we have to promote to int.
3915 unless we divide by a constant != -1. Note that default
3916 conversion will have been performed on the operands at this
3917 point, so we have to dig out the original type to find out if
3919 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3920 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3921 || (TREE_CODE (op1
) == INTEGER_CST
3922 && ! integer_all_onesp (op1
)));
3931 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3932 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3933 && !VECTOR_FLOAT_TYPE_P (type0
)
3934 && !VECTOR_FLOAT_TYPE_P (type1
)))
3938 case TRUNC_MOD_EXPR
:
3939 case FLOOR_MOD_EXPR
:
3940 warn_for_div_by_zero (location
, op1
);
3942 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3943 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
3944 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
3946 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3948 /* Although it would be tempting to shorten always here, that loses
3949 on some targets, since the modulo instruction is undefined if the
3950 quotient can't be represented in the computation mode. We shorten
3951 only if unsigned or if dividing by something we know != -1. */
3952 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3953 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3954 || (TREE_CODE (op1
) == INTEGER_CST
3955 && ! integer_all_onesp (op1
)));
3960 case TRUTH_ANDIF_EXPR
:
3961 case TRUTH_ORIF_EXPR
:
3962 case TRUTH_AND_EXPR
:
3964 result_type
= boolean_type_node
;
3967 /* Shift operations: result has same type as first operand;
3968 always convert second operand to int.
3969 Also set SHORT_SHIFT if shifting rightward. */
3972 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3974 result_type
= type0
;
3975 if (TREE_CODE (op1
) == INTEGER_CST
)
3977 if (tree_int_cst_lt (op1
, integer_zero_node
))
3979 if ((complain
& tf_warning
)
3980 && c_inhibit_evaluation_warnings
== 0)
3981 warning (0, "right shift count is negative");
3985 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3986 && (complain
& tf_warning
)
3987 && c_inhibit_evaluation_warnings
== 0)
3988 warning (0, "right shift count >= width of type");
3991 /* Convert the shift-count to an integer, regardless of
3992 size of value being shifted. */
3993 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3994 op1
= cp_convert (integer_type_node
, op1
);
3995 /* Avoid converting op1 to result_type later. */
4001 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4003 result_type
= type0
;
4004 if (TREE_CODE (op1
) == INTEGER_CST
)
4006 if (tree_int_cst_lt (op1
, integer_zero_node
))
4008 if ((complain
& tf_warning
)
4009 && c_inhibit_evaluation_warnings
== 0)
4010 warning (0, "left shift count is negative");
4012 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
4014 if ((complain
& tf_warning
)
4015 && c_inhibit_evaluation_warnings
== 0)
4016 warning (0, "left shift count >= width of type");
4019 /* Convert the shift-count to an integer, regardless of
4020 size of value being shifted. */
4021 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
4022 op1
= cp_convert (integer_type_node
, op1
);
4023 /* Avoid converting op1 to result_type later. */
4030 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4032 result_type
= type0
;
4033 if (TREE_CODE (op1
) == INTEGER_CST
)
4035 if (tree_int_cst_lt (op1
, integer_zero_node
))
4037 if (complain
& tf_warning
)
4038 warning (0, (code
== LROTATE_EXPR
)
4039 ? G_("left rotate count is negative")
4040 : G_("right rotate count is negative"));
4042 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
4044 if (complain
& tf_warning
)
4045 warning (0, (code
== LROTATE_EXPR
)
4046 ? G_("left rotate count >= width of type")
4047 : G_("right rotate count >= width of type"));
4050 /* Convert the shift-count to an integer, regardless of
4051 size of value being shifted. */
4052 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
4053 op1
= cp_convert (integer_type_node
, op1
);
4059 if ((complain
& tf_warning
)
4060 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
4061 warning (OPT_Wfloat_equal
,
4062 "comparing floating point with == or != is unsafe");
4063 if ((complain
& tf_warning
)
4064 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
4065 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
4066 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4068 build_type
= boolean_type_node
;
4069 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4070 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
4071 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4072 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
4074 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4075 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
4076 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4077 CPO_COMPARISON
, complain
);
4078 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
4079 && null_ptr_cst_p (op1
))
4081 if (TREE_CODE (op0
) == ADDR_EXPR
4082 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
4084 if (complain
& tf_warning
)
4085 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4086 TREE_OPERAND (op0
, 0));
4088 result_type
= type0
;
4090 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
4091 && null_ptr_cst_p (op0
))
4093 if (TREE_CODE (op1
) == ADDR_EXPR
4094 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
4096 if (complain
& tf_warning
)
4097 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4098 TREE_OPERAND (op1
, 0));
4100 result_type
= type1
;
4102 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4103 /* One of the operands must be of nullptr_t type. */
4104 result_type
= TREE_TYPE (nullptr_node
);
4105 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4107 result_type
= type0
;
4108 if (complain
& tf_error
)
4109 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4111 return error_mark_node
;
4113 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4115 result_type
= type1
;
4116 if (complain
& tf_error
)
4117 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4119 return error_mark_node
;
4121 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
4123 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4124 == ptrmemfunc_vbit_in_delta
)
4126 tree pfn0
= pfn_from_ptrmemfunc (op0
);
4127 tree delta0
= delta_from_ptrmemfunc (op0
);
4128 tree e1
= cp_build_binary_op (location
,
4131 fold_convert (TREE_TYPE (pfn0
),
4134 tree e2
= cp_build_binary_op (location
,
4139 e2
= cp_build_binary_op (location
,
4140 EQ_EXPR
, e2
, integer_zero_node
,
4142 op0
= cp_build_binary_op (location
,
4143 TRUTH_ANDIF_EXPR
, e1
, e2
,
4145 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
4149 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4150 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
4152 result_type
= TREE_TYPE (op0
);
4154 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4155 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4156 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4159 /* E will be the final comparison. */
4161 /* E1 and E2 are for scratch. */
4169 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4170 CPO_COMPARISON
, complain
);
4172 if (!same_type_p (TREE_TYPE (op0
), type
))
4173 op0
= cp_convert_and_check (type
, op0
);
4174 if (!same_type_p (TREE_TYPE (op1
), type
))
4175 op1
= cp_convert_and_check (type
, op1
);
4177 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4178 return error_mark_node
;
4180 if (TREE_SIDE_EFFECTS (op0
))
4181 op0
= save_expr (op0
);
4182 if (TREE_SIDE_EFFECTS (op1
))
4183 op1
= save_expr (op1
);
4185 pfn0
= pfn_from_ptrmemfunc (op0
);
4186 pfn1
= pfn_from_ptrmemfunc (op1
);
4187 delta0
= delta_from_ptrmemfunc (op0
);
4188 delta1
= delta_from_ptrmemfunc (op1
);
4189 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4190 == ptrmemfunc_vbit_in_delta
)
4195 && ((op0.delta == op1.delta)
4196 || (!op0.pfn && op0.delta & 1 == 0
4197 && op1.delta & 1 == 0))
4199 The reason for the `!op0.pfn' bit is that a NULL
4200 pointer-to-member is any member with a zero PFN and
4201 LSB of the DELTA field is 0. */
4203 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4207 e1
= cp_build_binary_op (location
,
4208 EQ_EXPR
, e1
, integer_zero_node
,
4210 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4214 e2
= cp_build_binary_op (location
,
4215 EQ_EXPR
, e2
, integer_zero_node
,
4217 e1
= cp_build_binary_op (location
,
4218 TRUTH_ANDIF_EXPR
, e2
, e1
,
4220 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4222 fold_convert (TREE_TYPE (pfn0
),
4225 e2
= cp_build_binary_op (location
,
4226 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4227 e1
= cp_build_binary_op (location
,
4228 EQ_EXPR
, delta0
, delta1
, complain
);
4229 e1
= cp_build_binary_op (location
,
4230 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4237 && (!op0.pfn || op0.delta == op1.delta))
4239 The reason for the `!op0.pfn' bit is that a NULL
4240 pointer-to-member is any member with a zero PFN; the
4241 DELTA field is unspecified. */
4243 e1
= cp_build_binary_op (location
,
4244 EQ_EXPR
, delta0
, delta1
, complain
);
4245 e2
= cp_build_binary_op (location
,
4248 fold_convert (TREE_TYPE (pfn0
),
4251 e1
= cp_build_binary_op (location
,
4252 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4254 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4255 e
= cp_build_binary_op (location
,
4256 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4257 if (code
== EQ_EXPR
)
4259 return cp_build_binary_op (location
,
4260 EQ_EXPR
, e
, integer_zero_node
, complain
);
4264 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4265 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4267 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4268 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4276 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4277 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4279 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4280 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4281 CPO_COMPARISON
, complain
);
4288 if (TREE_CODE (orig_op0
) == STRING_CST
4289 || TREE_CODE (orig_op1
) == STRING_CST
)
4291 if (complain
& tf_warning
)
4292 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4295 build_type
= boolean_type_node
;
4296 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4297 || code0
== ENUMERAL_TYPE
)
4298 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4299 || code1
== ENUMERAL_TYPE
))
4301 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4302 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4303 CPO_COMPARISON
, complain
);
4304 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4305 result_type
= type0
;
4306 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4307 result_type
= type1
;
4308 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4309 /* One of the operands must be of nullptr_t type. */
4310 result_type
= TREE_TYPE (nullptr_node
);
4311 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4313 result_type
= type0
;
4314 if (complain
& tf_error
)
4315 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4317 return error_mark_node
;
4319 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4321 result_type
= type1
;
4322 if (complain
& tf_error
)
4323 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4325 return error_mark_node
;
4329 case UNORDERED_EXPR
:
4336 build_type
= integer_type_node
;
4337 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4339 if (complain
& tf_error
)
4340 error ("unordered comparison on non-floating point argument");
4341 return error_mark_node
;
4350 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4351 || code0
== ENUMERAL_TYPE
)
4352 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4353 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4354 arithmetic_types_p
= 1;
4357 arithmetic_types_p
= 0;
4358 /* Vector arithmetic is only allowed when both sides are vectors. */
4359 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4361 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4362 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4365 binary_op_error (location
, code
, type0
, type1
);
4366 return error_mark_node
;
4368 arithmetic_types_p
= 1;
4371 /* Determine the RESULT_TYPE, if it is not already known. */
4373 && arithmetic_types_p
4374 && (shorten
|| common
|| short_compare
))
4376 result_type
= cp_common_type (type0
, type1
);
4377 do_warn_double_promotion (result_type
, type0
, type1
,
4378 "implicit conversion from %qT to %qT "
4379 "to match other operand of binary "
4386 if (complain
& tf_error
)
4387 error ("invalid operands of types %qT and %qT to binary %qO",
4388 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4389 return error_mark_node
;
4392 /* If we're in a template, the only thing we need to know is the
4394 if (processing_template_decl
)
4396 /* Since the middle-end checks the type when doing a build2, we
4397 need to build the tree in pieces. This built tree will never
4398 get out of the front-end as we replace it when instantiating
4400 tree tmp
= build2 (resultcode
,
4401 build_type
? build_type
: result_type
,
4403 TREE_OPERAND (tmp
, 0) = op0
;
4407 if (arithmetic_types_p
)
4409 bool first_complex
= (code0
== COMPLEX_TYPE
);
4410 bool second_complex
= (code1
== COMPLEX_TYPE
);
4411 int none_complex
= (!first_complex
&& !second_complex
);
4413 /* Adapted from patch for c/24581. */
4414 if (first_complex
!= second_complex
4415 && (code
== PLUS_EXPR
4416 || code
== MINUS_EXPR
4417 || code
== MULT_EXPR
4418 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4419 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4420 && flag_signed_zeros
)
4422 /* An operation on mixed real/complex operands must be
4423 handled specially, but the language-independent code can
4424 more easily optimize the plain complex arithmetic if
4425 -fno-signed-zeros. */
4426 tree real_type
= TREE_TYPE (result_type
);
4430 if (TREE_TYPE (op0
) != result_type
)
4431 op0
= cp_convert_and_check (result_type
, op0
);
4432 if (TREE_TYPE (op1
) != real_type
)
4433 op1
= cp_convert_and_check (real_type
, op1
);
4437 if (TREE_TYPE (op0
) != real_type
)
4438 op0
= cp_convert_and_check (real_type
, op0
);
4439 if (TREE_TYPE (op1
) != result_type
)
4440 op1
= cp_convert_and_check (result_type
, op1
);
4442 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4443 return error_mark_node
;
4446 op0
= save_expr (op0
);
4447 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4448 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4452 case TRUNC_DIV_EXPR
:
4453 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4457 real
= build2 (resultcode
, real_type
, real
, op1
);
4465 op1
= save_expr (op1
);
4466 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4467 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4471 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4474 real
= build2 (resultcode
, real_type
, op0
, real
);
4477 real
= build2 (resultcode
, real_type
, op0
, real
);
4478 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4484 return build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4487 /* For certain operations (which identify themselves by shorten != 0)
4488 if both args were extended from the same smaller type,
4489 do the arithmetic in that type and then extend.
4491 shorten !=0 and !=1 indicates a bitwise operation.
4492 For them, this optimization is safe only if
4493 both args are zero-extended or both are sign-extended.
4494 Otherwise, we might change the result.
4495 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4496 but calculated in (unsigned short) it would be (unsigned short)-1. */
4498 if (shorten
&& none_complex
)
4500 final_type
= result_type
;
4501 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4505 /* Comparison operations are shortened too but differently.
4506 They identify themselves by setting short_compare = 1. */
4510 /* Don't write &op0, etc., because that would prevent op0
4511 from being kept in a register.
4512 Instead, make copies of the our local variables and
4513 pass the copies by reference, then copy them back afterward. */
4514 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4515 enum tree_code xresultcode
= resultcode
;
4517 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4519 return cp_convert (boolean_type_node
, val
);
4520 op0
= xop0
, op1
= xop1
;
4522 resultcode
= xresultcode
;
4525 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4526 && warn_sign_compare
4527 && !TREE_NO_WARNING (orig_op0
)
4528 && !TREE_NO_WARNING (orig_op1
)
4529 /* Do not warn until the template is instantiated; we cannot
4530 bound the ranges of the arguments until that point. */
4531 && !processing_template_decl
4532 && (complain
& tf_warning
)
4533 && c_inhibit_evaluation_warnings
== 0)
4535 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4536 result_type
, resultcode
);
4540 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4541 Then the expression will be built.
4542 It will be given type FINAL_TYPE if that is nonzero;
4543 otherwise, it will be given type RESULT_TYPE. */
4546 if (TREE_TYPE (op0
) != result_type
)
4547 op0
= cp_convert_and_check (result_type
, op0
);
4548 if (TREE_TYPE (op1
) != result_type
)
4549 op1
= cp_convert_and_check (result_type
, op1
);
4551 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4552 return error_mark_node
;
4555 if (build_type
== NULL_TREE
)
4556 build_type
= result_type
;
4558 result
= build2 (resultcode
, build_type
, op0
, op1
);
4559 result
= fold_if_not_in_template (result
);
4560 if (final_type
!= 0)
4561 result
= cp_convert (final_type
, result
);
4563 if (TREE_OVERFLOW_P (result
)
4564 && !TREE_OVERFLOW_P (op0
)
4565 && !TREE_OVERFLOW_P (op1
))
4566 overflow_warning (location
, result
);
4571 /* Return a tree for the sum or difference (RESULTCODE says which)
4572 of pointer PTROP and integer INTOP. */
4575 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4577 tree res_type
= TREE_TYPE (ptrop
);
4579 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4580 in certain circumstance (when it's valid to do so). So we need
4581 to make sure it's complete. We don't need to check here, if we
4582 can actually complete it at all, as those checks will be done in
4583 pointer_int_sum() anyway. */
4584 complete_type (TREE_TYPE (res_type
));
4586 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4587 fold_if_not_in_template (intop
));
4590 /* Return a tree for the difference of pointers OP0 and OP1.
4591 The resulting tree has type int. */
4594 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4597 tree restype
= ptrdiff_type_node
;
4598 tree target_type
= TREE_TYPE (ptrtype
);
4600 if (!complete_type_or_else (target_type
, NULL_TREE
))
4601 return error_mark_node
;
4603 if (TREE_CODE (target_type
) == VOID_TYPE
)
4604 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4605 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4606 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4607 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4608 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4610 /* First do the subtraction as integers;
4611 then drop through to build the divide operator. */
4613 op0
= cp_build_binary_op (input_location
,
4615 cp_convert (restype
, op0
),
4616 cp_convert (restype
, op1
),
4617 tf_warning_or_error
);
4619 /* This generates an error if op1 is a pointer to an incomplete type. */
4620 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4621 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4623 op1
= (TYPE_PTROB_P (ptrtype
)
4624 ? size_in_bytes (target_type
)
4625 : integer_one_node
);
4627 /* Do the division. */
4629 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4630 return fold_if_not_in_template (result
);
4633 /* Construct and perhaps optimize a tree representation
4634 for a unary operation. CODE, a tree_code, specifies the operation
4635 and XARG is the operand. */
4638 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4640 tree orig_expr
= xarg
;
4644 if (processing_template_decl
)
4646 if (type_dependent_expression_p (xarg
))
4647 return build_min_nt (code
, xarg
, NULL_TREE
);
4649 xarg
= build_non_dependent_expr (xarg
);
4654 /* [expr.unary.op] says:
4656 The address of an object of incomplete type can be taken.
4658 (And is just the ordinary address operator, not an overloaded
4659 "operator &".) However, if the type is a template
4660 specialization, we must complete the type at this point so that
4661 an overloaded "operator &" will be available if required. */
4662 if (code
== ADDR_EXPR
4663 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4664 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4665 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4666 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4667 /* Don't look for a function. */;
4669 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4670 /*overloaded_p=*/NULL
, complain
);
4671 if (!exp
&& code
== ADDR_EXPR
)
4673 if (is_overloaded_fn (xarg
))
4675 tree fn
= get_first_fn (xarg
);
4676 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4678 error (DECL_CONSTRUCTOR_P (fn
)
4679 ? G_("taking address of constructor %qE")
4680 : G_("taking address of destructor %qE"),
4682 return error_mark_node
;
4686 /* A pointer to member-function can be formed only by saying
4688 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4689 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4691 if (TREE_CODE (xarg
) != OFFSET_REF
4692 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4694 error ("invalid use of %qE to form a pointer-to-member-function",
4696 if (TREE_CODE (xarg
) != OFFSET_REF
)
4697 inform (input_location
, " a qualified-id is required");
4698 return error_mark_node
;
4702 error ("parentheses around %qE cannot be used to form a"
4703 " pointer-to-member-function",
4705 PTRMEM_OK_P (xarg
) = 1;
4709 if (TREE_CODE (xarg
) == OFFSET_REF
)
4711 ptrmem
= PTRMEM_OK_P (xarg
);
4713 if (!ptrmem
&& !flag_ms_extensions
4714 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4716 /* A single non-static member, make sure we don't allow a
4717 pointer-to-member. */
4718 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4719 TREE_OPERAND (xarg
, 0),
4720 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4721 PTRMEM_OK_P (xarg
) = ptrmem
;
4724 else if (TREE_CODE (xarg
) == TARGET_EXPR
&& (complain
& tf_warning
))
4725 warning (0, "taking address of temporary");
4726 exp
= cp_build_unary_op (ADDR_EXPR
, xarg
, 0, complain
);
4729 if (processing_template_decl
&& exp
!= error_mark_node
)
4730 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4731 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4732 if (TREE_CODE (exp
) == ADDR_EXPR
)
4733 PTRMEM_OK_P (exp
) = ptrmem
;
4737 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4738 constants, where a null value is represented by an INTEGER_CST of
4742 cp_truthvalue_conversion (tree expr
)
4744 tree type
= TREE_TYPE (expr
);
4745 if (TYPE_PTRMEM_P (type
))
4746 return build_binary_op (EXPR_LOCATION (expr
),
4747 NE_EXPR
, expr
, integer_zero_node
, 1);
4749 return c_common_truthvalue_conversion (input_location
, expr
);
4752 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4755 condition_conversion (tree expr
)
4758 if (processing_template_decl
)
4760 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4761 tf_warning_or_error
, LOOKUP_NORMAL
);
4762 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4766 /* Returns the address of T. This function will fold away
4767 ADDR_EXPR of INDIRECT_REF. */
4770 build_address (tree t
)
4772 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4773 return error_mark_node
;
4774 t
= build_fold_addr_expr (t
);
4775 if (TREE_CODE (t
) != ADDR_EXPR
)
4780 /* Returns the address of T with type TYPE. */
4783 build_typed_address (tree t
, tree type
)
4785 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4786 return error_mark_node
;
4787 t
= build_fold_addr_expr_with_type (t
, type
);
4788 if (TREE_CODE (t
) != ADDR_EXPR
)
4793 /* Return a NOP_EXPR converting EXPR to TYPE. */
4796 build_nop (tree type
, tree expr
)
4798 if (type
== error_mark_node
|| error_operand_p (expr
))
4800 return build1 (NOP_EXPR
, type
, expr
);
4803 /* C++: Must handle pointers to members.
4805 Perhaps type instantiation should be extended to handle conversion
4806 from aggregates to types we don't yet know we want? (Or are those
4807 cases typically errors which should be reported?)
4809 NOCONVERT nonzero suppresses the default promotions
4810 (such as from short to int). */
4813 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
4814 tsubst_flags_t complain
)
4816 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4819 const char *errstring
= NULL
;
4821 const char *invalid_op_diag
;
4823 if (!arg
|| error_operand_p (arg
))
4824 return error_mark_node
;
4826 if ((invalid_op_diag
4827 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
4832 error (invalid_op_diag
);
4833 return error_mark_node
;
4838 case UNARY_PLUS_EXPR
:
4841 int flags
= WANT_ARITH
| WANT_ENUM
;
4842 /* Unary plus (but not unary minus) is allowed on pointers. */
4843 if (code
== UNARY_PLUS_EXPR
)
4844 flags
|= WANT_POINTER
;
4845 arg
= build_expr_type_conversion (flags
, arg
, true);
4847 errstring
= (code
== NEGATE_EXPR
4848 ? _("wrong type argument to unary minus")
4849 : _("wrong type argument to unary plus"));
4852 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4853 arg
= perform_integral_promotions (arg
);
4855 /* Make sure the result is not an lvalue: a unary plus or minus
4856 expression is always a rvalue. */
4863 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4867 arg
= default_conversion (arg
);
4869 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
4870 | WANT_VECTOR_OR_COMPLEX
,
4872 errstring
= _("wrong type argument to bit-complement");
4873 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4874 arg
= perform_integral_promotions (arg
);
4878 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4879 errstring
= _("wrong type argument to abs");
4880 else if (!noconvert
)
4881 arg
= default_conversion (arg
);
4885 /* Conjugating a real value is a no-op, but allow it anyway. */
4886 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4887 errstring
= _("wrong type argument to conjugation");
4888 else if (!noconvert
)
4889 arg
= default_conversion (arg
);
4892 case TRUTH_NOT_EXPR
:
4893 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
4895 val
= invert_truthvalue_loc (input_location
, arg
);
4896 if (arg
!= error_mark_node
)
4898 errstring
= _("in argument to unary !");
4905 if (TREE_CODE (arg
) == COMPLEX_CST
)
4906 return TREE_REALPART (arg
);
4907 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4909 arg
= build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4910 return fold_if_not_in_template (arg
);
4916 if (TREE_CODE (arg
) == COMPLEX_CST
)
4917 return TREE_IMAGPART (arg
);
4918 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4920 arg
= build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4921 return fold_if_not_in_template (arg
);
4924 return cp_convert (TREE_TYPE (arg
), integer_zero_node
);
4926 case PREINCREMENT_EXPR
:
4927 case POSTINCREMENT_EXPR
:
4928 case PREDECREMENT_EXPR
:
4929 case POSTDECREMENT_EXPR
:
4930 /* Handle complex lvalues (when permitted)
4931 by reduction to simpler cases. */
4933 val
= unary_complex_lvalue (code
, arg
);
4937 arg
= mark_lvalue_use (arg
);
4939 /* Increment or decrement the real part of the value,
4940 and don't change the imaginary part. */
4941 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4945 arg
= stabilize_reference (arg
);
4946 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
4947 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
4948 real
= cp_build_unary_op (code
, real
, 1, complain
);
4949 if (real
== error_mark_node
|| imag
== error_mark_node
)
4950 return error_mark_node
;
4951 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
4955 /* Report invalid types. */
4957 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
4960 if (code
== PREINCREMENT_EXPR
)
4961 errstring
= _("no pre-increment operator for type");
4962 else if (code
== POSTINCREMENT_EXPR
)
4963 errstring
= _("no post-increment operator for type");
4964 else if (code
== PREDECREMENT_EXPR
)
4965 errstring
= _("no pre-decrement operator for type");
4967 errstring
= _("no post-decrement operator for type");
4970 else if (arg
== error_mark_node
)
4971 return error_mark_node
;
4973 /* Report something read-only. */
4975 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
4976 || TREE_READONLY (arg
))
4978 if (complain
& tf_error
)
4979 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
4980 || code
== POSTINCREMENT_EXPR
)
4981 ? REK_INCREMENT
: REK_DECREMENT
));
4983 return error_mark_node
;
4988 tree declared_type
= unlowered_expr_type (arg
);
4990 argtype
= TREE_TYPE (arg
);
4992 /* ARM $5.2.5 last annotation says this should be forbidden. */
4993 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
4995 if (complain
& tf_error
)
4996 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
4997 ? G_("ISO C++ forbids incrementing an enum")
4998 : G_("ISO C++ forbids decrementing an enum"));
5000 return error_mark_node
;
5003 /* Compute the increment. */
5005 if (TREE_CODE (argtype
) == POINTER_TYPE
)
5007 tree type
= complete_type (TREE_TYPE (argtype
));
5009 if (!COMPLETE_OR_VOID_TYPE_P (type
))
5011 if (complain
& tf_error
)
5012 error (((code
== PREINCREMENT_EXPR
5013 || code
== POSTINCREMENT_EXPR
))
5014 ? G_("cannot increment a pointer to incomplete type %qT")
5015 : G_("cannot decrement a pointer to incomplete type %qT"),
5016 TREE_TYPE (argtype
));
5018 return error_mark_node
;
5020 else if ((pedantic
|| warn_pointer_arith
)
5021 && !TYPE_PTROB_P (argtype
))
5023 if (complain
& tf_error
)
5024 permerror (input_location
, (code
== PREINCREMENT_EXPR
5025 || code
== POSTINCREMENT_EXPR
)
5026 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
5027 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
5030 return error_mark_node
;
5033 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
5036 inc
= integer_one_node
;
5038 inc
= cp_convert (argtype
, inc
);
5040 /* Complain about anything else that is not a true lvalue. */
5041 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
5042 || code
== POSTINCREMENT_EXPR
)
5043 ? lv_increment
: lv_decrement
),
5045 return error_mark_node
;
5047 /* Forbid using -- on `bool'. */
5048 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
5050 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
5052 if (complain
& tf_error
)
5053 error ("invalid use of Boolean expression as operand "
5054 "to %<operator--%>");
5055 return error_mark_node
;
5057 val
= boolean_increment (code
, arg
);
5060 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
5062 TREE_SIDE_EFFECTS (val
) = 1;
5067 /* Note that this operation never does default_conversion
5068 regardless of NOCONVERT. */
5070 argtype
= lvalue_type (arg
);
5072 arg
= mark_lvalue_use (arg
);
5074 if (TREE_CODE (arg
) == OFFSET_REF
)
5077 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
5079 tree type
= build_pointer_type (TREE_TYPE (argtype
));
5080 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5083 else if (pedantic
&& DECL_MAIN_P (arg
))
5086 /* Apparently a lot of autoconf scripts for C++ packages do this,
5087 so only complain if -pedantic. */
5088 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
5089 pedwarn (input_location
, OPT_pedantic
,
5090 "ISO C++ forbids taking address of function %<::main%>");
5091 else if (flag_pedantic_errors
)
5092 return error_mark_node
;
5095 /* Let &* cancel out to simplify resulting code. */
5096 if (TREE_CODE (arg
) == INDIRECT_REF
)
5098 /* We don't need to have `current_class_ptr' wrapped in a
5099 NON_LVALUE_EXPR node. */
5100 if (arg
== current_class_ref
)
5101 return current_class_ptr
;
5103 arg
= TREE_OPERAND (arg
, 0);
5104 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
5106 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
5107 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5110 /* Don't let this be an lvalue. */
5115 /* ??? Cope with user tricks that amount to offsetof. */
5116 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5117 && TREE_CODE (argtype
) != METHOD_TYPE
5118 && argtype
!= unknown_type_node
5119 && (val
= get_base_address (arg
))
5120 && TREE_CODE (val
) == INDIRECT_REF
5121 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
5123 tree type
= build_pointer_type (argtype
);
5124 tree op0
= fold_convert (type
, TREE_OPERAND (val
, 0));
5125 tree op1
= fold_convert (sizetype
, fold_offsetof (arg
, val
));
5126 return fold_build2 (POINTER_PLUS_EXPR
, type
, op0
, op1
);
5129 /* Uninstantiated types are all functions. Taking the
5130 address of a function is a no-op, so just return the
5133 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
5134 || !IDENTIFIER_OPNAME_P (arg
));
5136 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
5137 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
5139 /* They're trying to take the address of a unique non-static
5140 member function. This is ill-formed (except in MS-land),
5141 but let's try to DTRT.
5142 Note: We only handle unique functions here because we don't
5143 want to complain if there's a static overload; non-unique
5144 cases will be handled by instantiate_type. But we need to
5145 handle this case here to allow casts on the resulting PMF.
5146 We could defer this in non-MS mode, but it's easier to give
5147 a useful error here. */
5149 /* Inside constant member functions, the `this' pointer
5150 contains an extra const qualifier. TYPE_MAIN_VARIANT
5151 is used here to remove this const from the diagnostics
5152 and the created OFFSET_REF. */
5153 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
5154 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
5157 if (! flag_ms_extensions
)
5159 tree name
= DECL_NAME (fn
);
5160 if (!(complain
& tf_error
))
5161 return error_mark_node
;
5162 else if (current_class_type
5163 && TREE_OPERAND (arg
, 0) == current_class_ref
)
5164 /* An expression like &memfn. */
5165 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
5166 " or parenthesized non-static member function to form"
5167 " a pointer to member function. Say %<&%T::%D%>",
5170 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
5171 " function to form a pointer to member function."
5175 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
5179 if (type_unknown_p (arg
))
5180 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
5182 /* Handle complex lvalues (when permitted)
5183 by reduction to simpler cases. */
5184 val
= unary_complex_lvalue (code
, arg
);
5188 switch (TREE_CODE (arg
))
5192 case FIX_TRUNC_EXPR
:
5193 /* Even if we're not being pedantic, we cannot allow this
5194 extension when we're instantiating in a SFINAE
5196 if (! lvalue_p (arg
) && complain
== tf_none
)
5198 if (complain
& tf_error
)
5199 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
5201 return error_mark_node
;
5206 arg
= BASELINK_FUNCTIONS (arg
);
5210 arg
= OVL_CURRENT (arg
);
5214 /* Turn a reference to a non-static data member into a
5215 pointer-to-member. */
5220 if (!PTRMEM_OK_P (arg
))
5221 return cp_build_unary_op (code
, arg
, 0, complain
);
5223 t
= TREE_OPERAND (arg
, 1);
5224 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
5226 if (complain
& tf_error
)
5227 error ("cannot create pointer to reference member %qD", t
);
5228 return error_mark_node
;
5231 type
= build_ptrmem_type (context_for_name_lookup (t
),
5233 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
5241 /* Anything not already handled and not a true memory reference
5243 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5244 && TREE_CODE (argtype
) != METHOD_TYPE
5245 && TREE_CODE (arg
) != OFFSET_REF
5246 && !lvalue_or_else (arg
, lv_addressof
, complain
))
5247 return error_mark_node
;
5249 if (argtype
!= error_mark_node
)
5250 argtype
= build_pointer_type (argtype
);
5252 /* In a template, we are processing a non-dependent expression
5253 so we can just form an ADDR_EXPR with the correct type. */
5254 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
5256 val
= build_address (arg
);
5257 if (TREE_CODE (arg
) == OFFSET_REF
)
5258 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
5260 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
5262 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
5264 /* We can only get here with a single static member
5266 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
5267 && DECL_STATIC_FUNCTION_P (fn
));
5269 val
= build_address (fn
);
5270 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
5271 /* Do not lose object's side effects. */
5272 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
5273 TREE_OPERAND (arg
, 0), val
);
5275 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
5277 if (complain
& tf_error
)
5278 error ("attempt to take address of bit-field structure member %qD",
5279 TREE_OPERAND (arg
, 1));
5280 return error_mark_node
;
5284 tree object
= TREE_OPERAND (arg
, 0);
5285 tree field
= TREE_OPERAND (arg
, 1);
5286 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5287 (TREE_TYPE (object
), decl_type_context (field
)));
5288 val
= build_address (arg
);
5291 if (TREE_CODE (argtype
) == POINTER_TYPE
5292 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
5294 build_ptrmemfunc_type (argtype
);
5295 val
= build_ptrmemfunc (argtype
, val
, 0,
5297 tf_warning_or_error
);
5309 argtype
= TREE_TYPE (arg
);
5310 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5313 if (complain
& tf_error
)
5314 error ("%s", errstring
);
5315 return error_mark_node
;
5318 /* Hook for the c-common bits that build a unary op. */
5320 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5321 enum tree_code code
, tree xarg
, int noconvert
)
5323 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5326 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5327 for certain kinds of expressions which are not really lvalues
5328 but which we can accept as lvalues.
5330 If ARG is not a kind of expression we can handle, return
5334 unary_complex_lvalue (enum tree_code code
, tree arg
)
5336 /* Inside a template, making these kinds of adjustments is
5337 pointless; we are only concerned with the type of the
5339 if (processing_template_decl
)
5342 /* Handle (a, b) used as an "lvalue". */
5343 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5345 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5346 tf_warning_or_error
);
5347 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5348 TREE_OPERAND (arg
, 0), real_result
);
5351 /* Handle (a ? b : c) used as an "lvalue". */
5352 if (TREE_CODE (arg
) == COND_EXPR
5353 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5354 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5356 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5357 if (TREE_CODE (arg
) == MODIFY_EXPR
5358 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5359 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5361 tree lvalue
= TREE_OPERAND (arg
, 0);
5362 if (TREE_SIDE_EFFECTS (lvalue
))
5364 lvalue
= stabilize_reference (lvalue
);
5365 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5366 lvalue
, TREE_OPERAND (arg
, 1));
5368 return unary_complex_lvalue
5369 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5372 if (code
!= ADDR_EXPR
)
5375 /* Handle (a = b) used as an "lvalue" for `&'. */
5376 if (TREE_CODE (arg
) == MODIFY_EXPR
5377 || TREE_CODE (arg
) == INIT_EXPR
)
5379 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5380 tf_warning_or_error
);
5381 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5383 TREE_NO_WARNING (arg
) = 1;
5387 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5388 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5389 || TREE_CODE (arg
) == OFFSET_REF
)
5392 /* We permit compiler to make function calls returning
5393 objects of aggregate type look like lvalues. */
5397 if (TREE_CODE (targ
) == SAVE_EXPR
)
5398 targ
= TREE_OPERAND (targ
, 0);
5400 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5402 if (TREE_CODE (arg
) == SAVE_EXPR
)
5405 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
5406 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5409 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5410 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5411 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5414 /* Don't let anything else be handled specially. */
5418 /* Mark EXP saying that we need to be able to take the
5419 address of it; it should not be allocated in a register.
5420 Value is true if successful.
5422 C++: we do not allow `current_class_ptr' to be addressable. */
5425 cxx_mark_addressable (tree exp
)
5430 switch (TREE_CODE (x
))
5437 x
= TREE_OPERAND (x
, 0);
5441 if (x
== current_class_ptr
)
5443 error ("cannot take the address of %<this%>, which is an rvalue expression");
5444 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5450 /* Caller should not be trying to mark initialized
5451 constant fields addressable. */
5452 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5453 || DECL_IN_AGGR_P (x
) == 0
5455 || DECL_EXTERNAL (x
));
5460 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5461 && !DECL_ARTIFICIAL (x
))
5463 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5466 ("address of explicit register variable %qD requested", x
);
5469 else if (extra_warnings
)
5471 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5473 TREE_ADDRESSABLE (x
) = 1;
5477 TREE_ADDRESSABLE (x
) = 1;
5481 TREE_ADDRESSABLE (x
) = 1;
5485 TREE_ADDRESSABLE (x
) = 1;
5486 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5494 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5497 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5498 tsubst_flags_t complain
)
5500 tree orig_ifexp
= ifexp
;
5501 tree orig_op1
= op1
;
5502 tree orig_op2
= op2
;
5505 if (processing_template_decl
)
5507 /* The standard says that the expression is type-dependent if
5508 IFEXP is type-dependent, even though the eventual type of the
5509 expression doesn't dependent on IFEXP. */
5510 if (type_dependent_expression_p (ifexp
)
5511 /* As a GNU extension, the middle operand may be omitted. */
5512 || (op1
&& type_dependent_expression_p (op1
))
5513 || type_dependent_expression_p (op2
))
5514 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5515 ifexp
= build_non_dependent_expr (ifexp
);
5517 op1
= build_non_dependent_expr (op1
);
5518 op2
= build_non_dependent_expr (op2
);
5521 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5522 if (processing_template_decl
&& expr
!= error_mark_node
)
5523 return build_min_non_dep (COND_EXPR
, expr
,
5524 orig_ifexp
, orig_op1
, orig_op2
);
5528 /* Given a list of expressions, return a compound expression
5529 that performs them all and returns the value of the last of them. */
5532 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
,
5533 tsubst_flags_t complain
)
5535 tree expr
= TREE_VALUE (list
);
5537 if (TREE_CHAIN (list
))
5539 if (complain
& tf_error
)
5543 permerror (input_location
, "expression list treated as compound "
5544 "expression in initializer");
5547 permerror (input_location
, "expression list treated as compound "
5548 "expression in mem-initializer");
5551 permerror (input_location
, "expression list treated as compound "
5552 "expression in functional cast");
5558 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5559 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5566 /* Like build_x_compound_expr_from_list, but using a VEC. */
5569 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5571 if (VEC_empty (tree
, vec
))
5573 else if (VEC_length (tree
, vec
) == 1)
5574 return VEC_index (tree
, vec
, 0);
5582 permerror (input_location
,
5583 "%s expression list treated as compound expression",
5586 expr
= VEC_index (tree
, vec
, 0);
5587 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5588 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5594 /* Handle overloading of the ',' operator when needed. */
5597 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5600 tree orig_op1
= op1
;
5601 tree orig_op2
= op2
;
5603 if (processing_template_decl
)
5605 if (type_dependent_expression_p (op1
)
5606 || type_dependent_expression_p (op2
))
5607 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5608 op1
= build_non_dependent_expr (op1
);
5609 op2
= build_non_dependent_expr (op2
);
5612 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5613 /*overloaded_p=*/NULL
, complain
);
5615 result
= cp_build_compound_expr (op1
, op2
, complain
);
5617 if (processing_template_decl
&& result
!= error_mark_node
)
5618 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5623 /* Like cp_build_compound_expr, but for the c-common bits. */
5626 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5628 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5631 /* Build a compound expression. */
5634 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5636 lhs
= convert_to_void (lhs
, ICV_LEFT_OF_COMMA
, complain
);
5638 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5639 return error_mark_node
;
5641 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5643 /* If the rhs is a TARGET_EXPR, then build the compound
5644 expression inside the target_expr's initializer. This
5645 helps the compiler to eliminate unnecessary temporaries. */
5646 tree init
= TREE_OPERAND (rhs
, 1);
5648 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5649 TREE_OPERAND (rhs
, 1) = init
;
5654 if (type_unknown_p (rhs
))
5656 error ("no context to resolve type of %qE", rhs
);
5657 return error_mark_node
;
5660 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5663 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5664 casts away constness. CAST gives the type of cast.
5666 ??? This function warns for casting away any qualifier not just
5667 const. We would like to specify exactly what qualifiers are casted
5672 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5673 enum tree_code cast
)
5675 /* C-style casts are allowed to cast away constness. With
5676 WARN_CAST_QUAL, we still want to issue a warning. */
5677 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5680 if (!casts_away_constness (src_type
, dest_type
))
5686 warning (OPT_Wcast_qual
,
5687 "cast from type %qT to type %qT casts away qualifiers",
5688 src_type
, dest_type
);
5691 case STATIC_CAST_EXPR
:
5692 error ("static_cast from type %qT to type %qT casts away qualifiers",
5693 src_type
, dest_type
);
5696 case REINTERPRET_CAST_EXPR
:
5697 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5698 src_type
, dest_type
);
5705 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5706 (another pointer-to-member type in the same hierarchy) and return
5707 the converted expression. If ALLOW_INVERSE_P is permitted, a
5708 pointer-to-derived may be converted to pointer-to-base; otherwise,
5709 only the other direction is permitted. If C_CAST_P is true, this
5710 conversion is taking place as part of a C-style cast. */
5713 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5714 bool c_cast_p
, tsubst_flags_t complain
)
5716 if (TYPE_PTRMEM_P (type
))
5720 if (TREE_CODE (expr
) == PTRMEM_CST
)
5721 expr
= cplus_expand_constant (expr
);
5722 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5723 TYPE_PTRMEM_CLASS_TYPE (type
),
5725 c_cast_p
, complain
);
5726 if (delta
== error_mark_node
)
5727 return error_mark_node
;
5729 if (!integer_zerop (delta
))
5731 tree cond
, op1
, op2
;
5733 cond
= cp_build_binary_op (input_location
,
5736 build_int_cst (TREE_TYPE (expr
), -1),
5737 tf_warning_or_error
);
5738 op1
= build_nop (ptrdiff_type_node
, expr
);
5739 op2
= cp_build_binary_op (input_location
,
5740 PLUS_EXPR
, op1
, delta
,
5741 tf_warning_or_error
);
5743 expr
= fold_build3_loc (input_location
,
5744 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5748 return build_nop (type
, expr
);
5751 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5752 allow_inverse_p
, c_cast_p
, complain
);
5755 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
5756 a version of EXPR that has TREE_OVERFLOW set if it is set in ORIG.
5757 Otherwise, return EXPR unchanged. */
5760 ignore_overflows (tree expr
, tree orig
)
5762 if (TREE_CODE (expr
) == INTEGER_CST
5763 && CONSTANT_CLASS_P (orig
)
5764 && TREE_CODE (orig
) != STRING_CST
5765 && TREE_OVERFLOW (expr
) != TREE_OVERFLOW (orig
))
5767 if (!TREE_OVERFLOW (orig
))
5768 /* Ensure constant sharing. */
5769 expr
= build_int_cst_wide (TREE_TYPE (expr
),
5770 TREE_INT_CST_LOW (expr
),
5771 TREE_INT_CST_HIGH (expr
));
5774 /* Avoid clobbering a shared constant. */
5775 expr
= copy_node (expr
);
5776 TREE_OVERFLOW (expr
) = TREE_OVERFLOW (orig
);
5782 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5783 this static_cast is being attempted as one of the possible casts
5784 allowed by a C-style cast. (In that case, accessibility of base
5785 classes is not considered, and it is OK to cast away
5786 constness.) Return the result of the cast. *VALID_P is set to
5787 indicate whether or not the cast was valid. */
5790 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5791 bool *valid_p
, tsubst_flags_t complain
)
5797 /* Assume the cast is valid. */
5800 intype
= TREE_TYPE (expr
);
5802 /* Save casted types in the function's used types hash table. */
5803 used_types_insert (type
);
5805 /* [expr.static.cast]
5807 An lvalue of type "cv1 B", where B is a class type, can be cast
5808 to type "reference to cv2 D", where D is a class derived (clause
5809 _class.derived_) from B, if a valid standard conversion from
5810 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5811 same cv-qualification as, or greater cv-qualification than, cv1,
5812 and B is not a virtual base class of D. */
5813 /* We check this case before checking the validity of "TYPE t =
5814 EXPR;" below because for this case:
5817 struct D : public B { D(const B&); };
5819 void f() { static_cast<const D&>(b); }
5821 we want to avoid constructing a new D. The standard is not
5822 completely clear about this issue, but our interpretation is
5823 consistent with other compilers. */
5824 if (TREE_CODE (type
) == REFERENCE_TYPE
5825 && CLASS_TYPE_P (TREE_TYPE (type
))
5826 && CLASS_TYPE_P (intype
)
5827 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5828 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5829 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5830 build_pointer_type (TYPE_MAIN_VARIANT
5831 (TREE_TYPE (type
))))
5833 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5837 /* There is a standard conversion from "D*" to "B*" even if "B"
5838 is ambiguous or inaccessible. If this is really a
5839 static_cast, then we check both for inaccessibility and
5840 ambiguity. However, if this is a static_cast being performed
5841 because the user wrote a C-style cast, then accessibility is
5843 base
= lookup_base (TREE_TYPE (type
), intype
,
5844 c_cast_p
? ba_unique
: ba_check
,
5847 /* Convert from "B*" to "D*". This function will check that "B"
5848 is not a virtual base of "D". */
5849 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5850 base
, /*nonnull=*/false);
5851 /* Convert the pointer to a reference -- but then remember that
5852 there are no expressions with reference type in C++. */
5853 return convert_from_reference (cp_fold_convert (type
, expr
));
5856 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5857 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5858 if (TREE_CODE (type
) == REFERENCE_TYPE
5859 && TYPE_REF_IS_RVALUE (type
)
5860 && real_lvalue_p (expr
)
5861 && reference_related_p (TREE_TYPE (type
), intype
)
5862 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5864 expr
= build_typed_address (expr
, type
);
5865 return convert_from_reference (expr
);
5870 /* Resolve overloaded address here rather than once in
5871 implicit_conversion and again in the inverse code below. */
5872 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5874 expr
= instantiate_type (type
, expr
, complain
);
5875 intype
= TREE_TYPE (expr
);
5878 /* [expr.static.cast]
5880 An expression e can be explicitly converted to a type T using a
5881 static_cast of the form static_cast<T>(e) if the declaration T
5882 t(e);" is well-formed, for some invented temporary variable
5884 result
= perform_direct_initialization_if_possible (type
, expr
,
5885 c_cast_p
, complain
);
5888 result
= convert_from_reference (result
);
5890 /* Ignore any integer overflow caused by the cast. */
5891 result
= ignore_overflows (result
, orig
);
5893 /* [expr.static.cast]
5895 If T is a reference type, the result is an lvalue; otherwise,
5896 the result is an rvalue. */
5897 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5898 result
= rvalue (result
);
5902 /* [expr.static.cast]
5904 Any expression can be explicitly converted to type cv void. */
5905 if (TREE_CODE (type
) == VOID_TYPE
)
5906 return convert_to_void (expr
, ICV_CAST
, complain
);
5908 /* [expr.static.cast]
5910 The inverse of any standard conversion sequence (clause _conv_),
5911 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5912 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5913 (_conv.bool_) conversions, can be performed explicitly using
5914 static_cast subject to the restriction that the explicit
5915 conversion does not cast away constness (_expr.const.cast_), and
5916 the following additional rules for specific cases: */
5917 /* For reference, the conversions not excluded are: integral
5918 promotions, floating point promotion, integral conversions,
5919 floating point conversions, floating-integral conversions,
5920 pointer conversions, and pointer to member conversions. */
5923 A value of integral _or enumeration_ type can be explicitly
5924 converted to an enumeration type. */
5925 /* The effect of all that is that any conversion between any two
5926 types which are integral, floating, or enumeration types can be
5928 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5929 || SCALAR_FLOAT_TYPE_P (type
))
5930 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5931 || SCALAR_FLOAT_TYPE_P (intype
)))
5933 expr
= ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5935 /* Ignore any integer overflow caused by the cast. */
5936 expr
= ignore_overflows (expr
, orig
);
5940 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5941 && CLASS_TYPE_P (TREE_TYPE (type
))
5942 && CLASS_TYPE_P (TREE_TYPE (intype
))
5943 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5944 (TREE_TYPE (intype
))),
5945 build_pointer_type (TYPE_MAIN_VARIANT
5946 (TREE_TYPE (type
)))))
5951 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5952 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
5953 c_cast_p
? ba_unique
: ba_check
,
5955 return build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
5958 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5959 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5966 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
5967 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
5969 if (TYPE_PTRMEM_P (type
))
5971 t1
= (build_ptrmem_type
5973 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
5974 t2
= (build_ptrmem_type
5976 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
5983 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
5986 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5987 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
5988 c_cast_p
, tf_warning_or_error
);
5992 /* [expr.static.cast]
5994 An rvalue of type "pointer to cv void" can be explicitly
5995 converted to a pointer to object type. A value of type pointer
5996 to object converted to "pointer to cv void" and back to the
5997 original pointer type will have its original value. */
5998 if (TREE_CODE (intype
) == POINTER_TYPE
5999 && VOID_TYPE_P (TREE_TYPE (intype
))
6000 && TYPE_PTROB_P (type
))
6003 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
6004 return build_nop (type
, expr
);
6008 return error_mark_node
;
6011 /* Return an expression representing static_cast<TYPE>(EXPR). */
6014 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6019 if (type
== error_mark_node
|| expr
== error_mark_node
)
6020 return error_mark_node
;
6022 if (processing_template_decl
)
6024 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
6025 /* We don't know if it will or will not have side effects. */
6026 TREE_SIDE_EFFECTS (expr
) = 1;
6027 return convert_from_reference (expr
);
6030 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6031 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6032 if (TREE_CODE (type
) != REFERENCE_TYPE
6033 && TREE_CODE (expr
) == NOP_EXPR
6034 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6035 expr
= TREE_OPERAND (expr
, 0);
6037 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
6042 if (complain
& tf_error
)
6043 error ("invalid static_cast from type %qT to type %qT",
6044 TREE_TYPE (expr
), type
);
6045 return error_mark_node
;
6048 /* EXPR is an expression with member function or pointer-to-member
6049 function type. TYPE is a pointer type. Converting EXPR to TYPE is
6050 not permitted by ISO C++, but we accept it in some modes. If we
6051 are not in one of those modes, issue a diagnostic. Return the
6052 converted expression. */
6055 convert_member_func_to_ptr (tree type
, tree expr
)
6060 intype
= TREE_TYPE (expr
);
6061 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
6062 || TREE_CODE (intype
) == METHOD_TYPE
);
6064 if (pedantic
|| warn_pmf2ptr
)
6065 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
6066 "converting from %qT to %qT", intype
, type
);
6068 if (TREE_CODE (intype
) == METHOD_TYPE
)
6069 expr
= build_addr_func (expr
);
6070 else if (TREE_CODE (expr
) == PTRMEM_CST
)
6071 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
6074 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
6075 decl
= build_address (decl
);
6076 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
6079 return build_nop (type
, expr
);
6082 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
6083 If C_CAST_P is true, this reinterpret cast is being done as part of
6084 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
6085 indicate whether or not reinterpret_cast was valid. */
6088 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6089 bool *valid_p
, tsubst_flags_t complain
)
6093 /* Assume the cast is invalid. */
6097 if (type
== error_mark_node
|| error_operand_p (expr
))
6098 return error_mark_node
;
6100 intype
= TREE_TYPE (expr
);
6102 /* Save casted types in the function's used types hash table. */
6103 used_types_insert (type
);
6105 /* [expr.reinterpret.cast]
6106 An lvalue expression of type T1 can be cast to the type
6107 "reference to T2" if an expression of type "pointer to T1" can be
6108 explicitly converted to the type "pointer to T2" using a
6109 reinterpret_cast. */
6110 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6112 if (! real_lvalue_p (expr
))
6114 if (complain
& tf_error
)
6115 error ("invalid cast of an rvalue expression of type "
6118 return error_mark_node
;
6121 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6122 "B" are related class types; the reinterpret_cast does not
6123 adjust the pointer. */
6124 if (TYPE_PTR_P (intype
)
6125 && (complain
& tf_warning
)
6126 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
6127 COMPARE_BASE
| COMPARE_DERIVED
)))
6128 warning (0, "casting %qT to %qT does not dereference pointer",
6131 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0, complain
);
6133 if (warn_strict_aliasing
> 2)
6134 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
6136 if (expr
!= error_mark_node
)
6137 expr
= build_reinterpret_cast_1
6138 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
6140 if (expr
!= error_mark_node
)
6141 /* cp_build_indirect_ref isn't right for rvalue refs. */
6142 expr
= convert_from_reference (fold_convert (type
, expr
));
6146 /* As a G++ extension, we consider conversions from member
6147 functions, and pointers to member functions to
6148 pointer-to-function and pointer-to-void types. If
6149 -Wno-pmf-conversions has not been specified,
6150 convert_member_func_to_ptr will issue an error message. */
6151 if ((TYPE_PTRMEMFUNC_P (intype
)
6152 || TREE_CODE (intype
) == METHOD_TYPE
)
6153 && TYPE_PTR_P (type
)
6154 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6155 || VOID_TYPE_P (TREE_TYPE (type
))))
6156 return convert_member_func_to_ptr (type
, expr
);
6158 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6159 array-to-pointer, and function-to-pointer conversions are
6161 expr
= decay_conversion (expr
);
6163 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6164 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6165 if (TREE_CODE (expr
) == NOP_EXPR
6166 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6167 expr
= TREE_OPERAND (expr
, 0);
6169 if (error_operand_p (expr
))
6170 return error_mark_node
;
6172 intype
= TREE_TYPE (expr
);
6174 /* [expr.reinterpret.cast]
6175 A pointer can be converted to any integral type large enough to
6176 hold it. ... A value of type std::nullptr_t can be converted to
6177 an integral type; the conversion has the same meaning and
6178 validity as a conversion of (void*)0 to the integral type. */
6179 if (CP_INTEGRAL_TYPE_P (type
)
6180 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
6182 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
6184 if (complain
& tf_error
)
6185 permerror (input_location
, "cast from %qT to %qT loses precision",
6188 return error_mark_node
;
6190 if (NULLPTR_TYPE_P (intype
))
6191 return build_int_cst (type
, 0);
6193 /* [expr.reinterpret.cast]
6194 A value of integral or enumeration type can be explicitly
6195 converted to a pointer. */
6196 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6199 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6200 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6201 return fold_if_not_in_template (build_nop (type
, expr
));
6202 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6203 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6208 check_for_casting_away_constness (intype
, type
, REINTERPRET_CAST_EXPR
);
6209 /* Warn about possible alignment problems. */
6210 if (STRICT_ALIGNMENT
&& warn_cast_align
6211 && (complain
& tf_warning
)
6212 && !VOID_TYPE_P (type
)
6213 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6214 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6215 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6216 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6217 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6218 "increases required alignment of target type", intype
, type
);
6220 /* We need to strip nops here, because the front end likes to
6221 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6223 if (warn_strict_aliasing
<= 2)
6224 strict_aliasing_warning (intype
, type
, sexpr
);
6226 return fold_if_not_in_template (build_nop (type
, expr
));
6228 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6229 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6231 if (pedantic
&& (complain
& tf_warning
))
6232 /* Only issue a warning, as we have always supported this
6233 where possible, and it is necessary in some cases. DR 195
6234 addresses this issue, but as of 2004/10/26 is still in
6236 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6237 return fold_if_not_in_template (build_nop (type
, expr
));
6239 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6240 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6241 else if (TREE_CODE (intype
) == VECTOR_TYPE
6242 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6243 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6248 if (complain
& tf_error
)
6249 error ("invalid cast from type %qT to type %qT", intype
, type
);
6250 return error_mark_node
;
6253 return cp_convert (type
, expr
);
6257 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6259 if (type
== error_mark_node
|| expr
== error_mark_node
)
6260 return error_mark_node
;
6262 if (processing_template_decl
)
6264 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6266 if (!TREE_SIDE_EFFECTS (t
)
6267 && type_dependent_expression_p (expr
))
6268 /* There might turn out to be side effects inside expr. */
6269 TREE_SIDE_EFFECTS (t
) = 1;
6270 return convert_from_reference (t
);
6273 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6274 /*valid_p=*/NULL
, complain
);
6277 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6278 return an appropriate expression. Otherwise, return
6279 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6280 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6281 performing a C-style cast, its value upon return will indicate
6282 whether or not the conversion succeeded. */
6285 build_const_cast_1 (tree dst_type
, tree expr
, bool complain
,
6289 tree reference_type
;
6291 /* Callers are responsible for handling error_mark_node as a
6292 destination type. */
6293 gcc_assert (dst_type
!= error_mark_node
);
6294 /* In a template, callers should be building syntactic
6295 representations of casts, not using this machinery. */
6296 gcc_assert (!processing_template_decl
);
6298 /* Assume the conversion is invalid. */
6302 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6305 error ("invalid use of const_cast with type %qT, "
6306 "which is not a pointer, "
6307 "reference, nor a pointer-to-data-member type", dst_type
);
6308 return error_mark_node
;
6311 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6314 error ("invalid use of const_cast with type %qT, which is a pointer "
6315 "or reference to a function type", dst_type
);
6316 return error_mark_node
;
6319 /* Save casted types in the function's used types hash table. */
6320 used_types_insert (dst_type
);
6322 src_type
= TREE_TYPE (expr
);
6323 /* Expressions do not really have reference types. */
6324 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6325 src_type
= TREE_TYPE (src_type
);
6327 /* [expr.const.cast]
6329 An lvalue of type T1 can be explicitly converted to an lvalue of
6330 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6331 types) if a pointer to T1 can be explicitly converted to the type
6332 pointer to T2 using a const_cast. */
6333 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6335 reference_type
= dst_type
;
6336 if (! real_lvalue_p (expr
))
6339 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6340 src_type
, dst_type
);
6341 return error_mark_node
;
6343 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6344 src_type
= build_pointer_type (src_type
);
6348 reference_type
= NULL_TREE
;
6349 /* If the destination type is not a reference type, the
6350 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6351 conversions are performed. */
6352 src_type
= type_decays_to (src_type
);
6353 if (src_type
== error_mark_node
)
6354 return error_mark_node
;
6357 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6358 && comp_ptr_ttypes_const (dst_type
, src_type
))
6363 /* This cast is actually a C-style cast. Issue a warning if
6364 the user is making a potentially unsafe cast. */
6365 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
);
6369 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0,
6370 complain
? tf_warning_or_error
: tf_none
);
6371 expr
= build_nop (reference_type
, expr
);
6372 return convert_from_reference (expr
);
6376 expr
= decay_conversion (expr
);
6377 /* build_c_cast puts on a NOP_EXPR to make the result not an
6378 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6379 non-lvalue context. */
6380 if (TREE_CODE (expr
) == NOP_EXPR
6381 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6382 expr
= TREE_OPERAND (expr
, 0);
6383 return build_nop (dst_type
, expr
);
6388 error ("invalid const_cast from type %qT to type %qT",
6389 src_type
, dst_type
);
6390 return error_mark_node
;
6394 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6396 if (type
== error_mark_node
|| error_operand_p (expr
))
6397 return error_mark_node
;
6399 if (processing_template_decl
)
6401 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6403 if (!TREE_SIDE_EFFECTS (t
)
6404 && type_dependent_expression_p (expr
))
6405 /* There might turn out to be side effects inside expr. */
6406 TREE_SIDE_EFFECTS (t
) = 1;
6407 return convert_from_reference (t
);
6410 return build_const_cast_1 (type
, expr
, complain
& tf_error
,
6414 /* Like cp_build_c_cast, but for the c-common bits. */
6417 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6419 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6422 /* Build an expression representing an explicit C-style cast to type
6423 TYPE of expression EXPR. */
6426 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6432 if (type
== error_mark_node
|| error_operand_p (expr
))
6433 return error_mark_node
;
6435 if (processing_template_decl
)
6437 tree t
= build_min (CAST_EXPR
, type
,
6438 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6439 /* We don't know if it will or will not have side effects. */
6440 TREE_SIDE_EFFECTS (t
) = 1;
6441 return convert_from_reference (t
);
6444 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6445 'Class') should always be retained, because this information aids
6446 in method lookup. */
6447 if (objc_is_object_ptr (type
)
6448 && objc_is_object_ptr (TREE_TYPE (expr
)))
6449 return build_nop (type
, expr
);
6451 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6452 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6453 if (TREE_CODE (type
) != REFERENCE_TYPE
6454 && TREE_CODE (value
) == NOP_EXPR
6455 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6456 value
= TREE_OPERAND (value
, 0);
6458 if (TREE_CODE (type
) == ARRAY_TYPE
)
6460 /* Allow casting from T1* to T2[] because Cfront allows it.
6461 NIHCL uses it. It is not valid ISO C++ however. */
6462 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6464 if (complain
& tf_error
)
6465 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6467 return error_mark_node
;
6468 type
= build_pointer_type (TREE_TYPE (type
));
6472 if (complain
& tf_error
)
6473 error ("ISO C++ forbids casting to an array type %qT", type
);
6474 return error_mark_node
;
6478 if (TREE_CODE (type
) == FUNCTION_TYPE
6479 || TREE_CODE (type
) == METHOD_TYPE
)
6481 if (complain
& tf_error
)
6482 error ("invalid cast to function type %qT", type
);
6483 return error_mark_node
;
6486 if (TREE_CODE (type
) == POINTER_TYPE
6487 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
6488 /* Casting to an integer of smaller size is an error detected elsewhere. */
6489 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
6490 /* Don't warn about converting any constant. */
6491 && !TREE_CONSTANT (value
))
6492 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
6493 "cast to pointer from integer of different size");
6495 /* A C-style cast can be a const_cast. */
6496 result
= build_const_cast_1 (type
, value
, /*complain=*/false,
6501 /* Or a static cast. */
6502 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6503 &valid_p
, complain
);
6504 /* Or a reinterpret_cast. */
6506 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6507 &valid_p
, complain
);
6508 /* The static_cast or reinterpret_cast may be followed by a
6511 /* A valid cast may result in errors if, for example, a
6512 conversion to am ambiguous base class is required. */
6513 && !error_operand_p (result
))
6517 /* Non-class rvalues always have cv-unqualified type. */
6518 if (!CLASS_TYPE_P (type
))
6519 type
= TYPE_MAIN_VARIANT (type
);
6520 result_type
= TREE_TYPE (result
);
6521 if (!CLASS_TYPE_P (result_type
))
6522 result_type
= TYPE_MAIN_VARIANT (result_type
);
6523 /* If the type of RESULT does not match TYPE, perform a
6524 const_cast to make it match. If the static_cast or
6525 reinterpret_cast succeeded, we will differ by at most
6526 cv-qualification, so the follow-on const_cast is guaranteed
6528 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6530 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6531 gcc_assert (valid_p
);
6536 return error_mark_node
;
6539 /* For use from the C common bits. */
6541 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6542 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6543 enum tree_code modifycode
,
6544 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6545 tree rhs_origtype ATTRIBUTE_UNUSED
)
6547 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6550 /* Build an assignment expression of lvalue LHS from value RHS.
6551 MODIFYCODE is the code for a binary operator that we use
6552 to combine the old value of LHS with RHS to get the new value.
6553 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6555 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6558 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6559 tsubst_flags_t complain
)
6563 tree lhstype
= TREE_TYPE (lhs
);
6564 tree olhstype
= lhstype
;
6565 bool plain_assign
= (modifycode
== NOP_EXPR
);
6567 /* Avoid duplicate error messages from operands that had errors. */
6568 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6569 return error_mark_node
;
6571 /* Handle control structure constructs used as "lvalues". */
6572 switch (TREE_CODE (lhs
))
6574 /* Handle --foo = 5; as these are valid constructs in C++. */
6575 case PREDECREMENT_EXPR
:
6576 case PREINCREMENT_EXPR
:
6577 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6578 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6579 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6580 TREE_OPERAND (lhs
, 1));
6581 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6582 modifycode
, rhs
, complain
);
6583 if (newrhs
== error_mark_node
)
6584 return error_mark_node
;
6585 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6587 /* Handle (a, b) used as an "lvalue". */
6589 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6590 modifycode
, rhs
, complain
);
6591 if (newrhs
== error_mark_node
)
6592 return error_mark_node
;
6593 return build2 (COMPOUND_EXPR
, lhstype
,
6594 TREE_OPERAND (lhs
, 0), newrhs
);
6597 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6598 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6599 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6600 TREE_OPERAND (lhs
, 1));
6601 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6603 if (newrhs
== error_mark_node
)
6604 return error_mark_node
;
6605 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6609 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6610 when neither operand has side-effects. */
6611 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6612 return error_mark_node
;
6614 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6615 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6617 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6618 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6620 TREE_OPERAND (lhs
, 0),
6621 TREE_OPERAND (lhs
, 1)),
6622 TREE_OPERAND (lhs
, 0),
6623 TREE_OPERAND (lhs
, 1));
6626 /* Handle (a ? b : c) used as an "lvalue". */
6629 /* Produce (a ? (b = rhs) : (c = rhs))
6630 except that the RHS goes through a save-expr
6631 so the code to compute it is only emitted once. */
6633 tree preeval
= NULL_TREE
;
6635 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6637 if (complain
& tf_error
)
6638 error ("void value not ignored as it ought to be");
6639 return error_mark_node
;
6642 rhs
= stabilize_expr (rhs
, &preeval
);
6644 /* Check this here to avoid odd errors when trying to convert
6645 a throw to the type of the COND_EXPR. */
6646 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6647 return error_mark_node
;
6649 cond
= build_conditional_expr
6650 (TREE_OPERAND (lhs
, 0),
6651 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6652 modifycode
, rhs
, complain
),
6653 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6654 modifycode
, rhs
, complain
),
6657 if (cond
== error_mark_node
)
6659 /* Make sure the code to compute the rhs comes out
6660 before the split. */
6662 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6670 if (modifycode
== INIT_EXPR
)
6672 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6673 /* Do the default thing. */;
6674 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6676 /* Compound literal. */
6677 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6678 /* Call convert to generate an error; see PR 11063. */
6679 rhs
= convert (lhstype
, rhs
);
6680 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6681 TREE_SIDE_EFFECTS (result
) = 1;
6684 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6685 /* Do the default thing. */;
6688 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6689 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6690 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6692 release_tree_vector (rhs_vec
);
6693 if (result
== NULL_TREE
)
6694 return error_mark_node
;
6700 lhs
= require_complete_type (lhs
);
6701 if (lhs
== error_mark_node
)
6702 return error_mark_node
;
6704 if (modifycode
== NOP_EXPR
)
6706 /* `operator=' is not an inheritable operator. */
6707 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6708 /* Do the default thing. */;
6711 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6712 lhs
, rhs
, make_node (NOP_EXPR
),
6713 /*overloaded_p=*/NULL
,
6715 if (result
== NULL_TREE
)
6716 return error_mark_node
;
6723 /* A binary op has been requested. Combine the old LHS
6724 value with the RHS producing the value we should actually
6725 store into the LHS. */
6726 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6727 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6728 || MAYBE_CLASS_TYPE_P (lhstype
)));
6730 lhs
= stabilize_reference (lhs
);
6731 newrhs
= cp_build_binary_op (input_location
,
6732 modifycode
, lhs
, rhs
,
6734 if (newrhs
== error_mark_node
)
6736 if (complain
& tf_error
)
6737 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6738 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6739 return error_mark_node
;
6742 /* Now it looks like a plain assignment. */
6743 modifycode
= NOP_EXPR
;
6745 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6746 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6749 /* The left-hand side must be an lvalue. */
6750 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6751 return error_mark_node
;
6753 /* Warn about modifying something that is `const'. Don't warn if
6754 this is initialization. */
6755 if (modifycode
!= INIT_EXPR
6756 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6757 /* Functions are not modifiable, even though they are
6759 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6760 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6761 /* If it's an aggregate and any field is const, then it is
6762 effectively const. */
6763 || (CLASS_TYPE_P (lhstype
)
6764 && C_TYPE_FIELDS_READONLY (lhstype
))))
6766 if (complain
& tf_error
)
6767 readonly_error (lhs
, REK_ASSIGNMENT
);
6769 return error_mark_node
;
6772 /* If storing into a structure or union member, it may have been given a
6773 lowered bitfield type. We need to convert to the declared type first,
6774 so retrieve it now. */
6776 olhstype
= unlowered_expr_type (lhs
);
6778 /* Convert new value to destination type. */
6780 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6784 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6786 if (modifycode
!= INIT_EXPR
)
6788 if (complain
& tf_error
)
6789 error ("assigning to an array from an initializer list");
6790 return error_mark_node
;
6792 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6793 return error_mark_node
;
6794 newrhs
= digest_init (lhstype
, newrhs
);
6797 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6798 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6800 if (complain
& tf_error
)
6801 error ("incompatible types in assignment of %qT to %qT",
6802 TREE_TYPE (rhs
), lhstype
);
6803 return error_mark_node
;
6806 /* Allow array assignment in compiler-generated code. */
6807 else if (!current_function_decl
6808 || !DECL_ARTIFICIAL (current_function_decl
))
6810 /* This routine is used for both initialization and assignment.
6811 Make sure the diagnostic message differentiates the context. */
6812 if (complain
& tf_error
)
6814 if (modifycode
== INIT_EXPR
)
6815 error ("array used as initializer");
6817 error ("invalid array assignment");
6819 return error_mark_node
;
6822 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6823 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6824 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6825 /*explicit_value_init_p=*/false,
6826 from_array
, complain
);
6829 if (modifycode
== INIT_EXPR
)
6830 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6831 LOOKUP_ONLYCONVERTING. */
6832 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6833 ICR_INIT
, NULL_TREE
, 0,
6836 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
6837 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6839 if (!same_type_p (lhstype
, olhstype
))
6840 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6842 if (modifycode
!= INIT_EXPR
)
6844 if (TREE_CODE (newrhs
) == CALL_EXPR
6845 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6846 newrhs
= build_cplus_new (lhstype
, newrhs
);
6848 /* Can't initialize directly from a TARGET_EXPR, since that would
6849 cause the lhs to be constructed twice, and possibly result in
6850 accidental self-initialization. So we force the TARGET_EXPR to be
6851 expanded without a target. */
6852 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6853 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6854 TREE_OPERAND (newrhs
, 0));
6857 if (newrhs
== error_mark_node
)
6858 return error_mark_node
;
6860 if (c_dialect_objc () && flag_objc_gc
)
6862 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6868 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6869 lhstype
, lhs
, newrhs
);
6871 TREE_SIDE_EFFECTS (result
) = 1;
6873 TREE_NO_WARNING (result
) = 1;
6879 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6880 tsubst_flags_t complain
)
6882 if (processing_template_decl
)
6883 return build_min_nt (MODOP_EXPR
, lhs
,
6884 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6886 if (modifycode
!= NOP_EXPR
)
6888 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6889 make_node (modifycode
),
6890 /*overloaded_p=*/NULL
,
6894 TREE_NO_WARNING (rval
) = 1;
6898 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6901 /* Helper function for get_delta_difference which assumes FROM is a base
6902 class of TO. Returns a delta for the conversion of pointer-to-member
6903 of FROM to pointer-to-member of TO. If the conversion is invalid and
6904 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
6905 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6906 If C_CAST_P is true, this conversion is taking place as part of a
6910 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
,
6911 tsubst_flags_t complain
)
6915 base_access access
= c_cast_p
? ba_unique
: ba_check
;
6917 /* Note: ba_quiet does not distinguish between access control and
6919 if (!(complain
& tf_error
))
6922 binfo
= lookup_base (to
, from
, access
, &kind
);
6924 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6926 if (!(complain
& tf_error
))
6927 return error_mark_node
;
6929 error (" in pointer to member function conversion");
6930 return size_zero_node
;
6934 if (kind
!= bk_via_virtual
)
6935 return BINFO_OFFSET (binfo
);
6937 /* FROM is a virtual base class of TO. Issue an error or warning
6938 depending on whether or not this is a reinterpret cast. */
6940 if (!(complain
& tf_error
))
6941 return error_mark_node
;
6943 error ("pointer to member conversion via virtual base %qT",
6944 BINFO_TYPE (binfo_from_vbase (binfo
)));
6946 return size_zero_node
;
6953 /* Get difference in deltas for different pointer to member function
6954 types. If the conversion is invalid and tf_error is not set in
6955 COMPLAIN, returns error_mark_node, otherwise returns an integer
6956 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
6957 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
6958 conversions as well. If C_CAST_P is true this conversion is taking
6959 place as part of a C-style cast.
6961 Note that the naming of FROM and TO is kind of backwards; the return
6962 value is what we add to a TO in order to get a FROM. They are named
6963 this way because we call this function to find out how to convert from
6964 a pointer to member of FROM to a pointer to member of TO. */
6967 get_delta_difference (tree from
, tree to
,
6968 bool allow_inverse_p
,
6969 bool c_cast_p
, tsubst_flags_t complain
)
6973 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
6974 /* Pointer to member of incomplete class is permitted*/
6975 result
= size_zero_node
;
6977 result
= get_delta_difference_1 (from
, to
, c_cast_p
, complain
);
6979 if (result
== error_mark_node
)
6980 return error_mark_node
;
6984 if (!allow_inverse_p
)
6986 if (!(complain
& tf_error
))
6987 return error_mark_node
;
6989 error_not_base_type (from
, to
);
6990 error (" in pointer to member conversion");
6991 result
= size_zero_node
;
6995 result
= get_delta_difference_1 (to
, from
, c_cast_p
, complain
);
6997 if (result
== error_mark_node
)
6998 return error_mark_node
;
7001 result
= size_diffop_loc (input_location
,
7002 size_zero_node
, result
);
7005 if (!(complain
& tf_error
))
7006 return error_mark_node
;
7008 error_not_base_type (from
, to
);
7009 error (" in pointer to member conversion");
7010 result
= size_zero_node
;
7015 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
7019 /* Return a constructor for the pointer-to-member-function TYPE using
7020 the other components as specified. */
7023 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
7028 VEC(constructor_elt
, gc
) *v
;
7030 /* Pull the FIELD_DECLs out of the type. */
7031 pfn_field
= TYPE_FIELDS (type
);
7032 delta_field
= DECL_CHAIN (pfn_field
);
7034 /* Make sure DELTA has the type we want. */
7035 delta
= convert_and_check (delta_type_node
, delta
);
7037 /* Convert to the correct target type if necessary. */
7038 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
7040 /* Finish creating the initializer. */
7041 v
= VEC_alloc(constructor_elt
, gc
, 2);
7042 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
7043 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
7044 u
= build_constructor (type
, v
);
7045 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
7046 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
7047 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
7049 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
7054 /* Build a constructor for a pointer to member function. It can be
7055 used to initialize global variables, local variable, or used
7056 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
7059 If FORCE is nonzero, then force this conversion, even if
7060 we would rather not do it. Usually set when using an explicit
7061 cast. A C-style cast is being processed iff C_CAST_P is true.
7063 Return error_mark_node, if something goes wrong. */
7066 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
,
7067 tsubst_flags_t complain
)
7073 if (error_operand_p (pfn
))
7074 return error_mark_node
;
7076 pfn_type
= TREE_TYPE (pfn
);
7077 to_type
= build_ptrmemfunc_type (type
);
7079 /* Handle multiple conversions of pointer to member functions. */
7080 if (TYPE_PTRMEMFUNC_P (pfn_type
))
7082 tree delta
= NULL_TREE
;
7083 tree npfn
= NULL_TREE
;
7087 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
7088 error ("invalid conversion to type %qT from type %qT",
7091 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
7092 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
7094 c_cast_p
, complain
);
7095 if (n
== error_mark_node
)
7096 return error_mark_node
;
7098 /* We don't have to do any conversion to convert a
7099 pointer-to-member to its own type. But, we don't want to
7100 just return a PTRMEM_CST if there's an explicit cast; that
7101 cast should make the expression an invalid template argument. */
7102 if (TREE_CODE (pfn
) != PTRMEM_CST
)
7104 if (same_type_p (to_type
, pfn_type
))
7106 else if (integer_zerop (n
))
7107 return build_reinterpret_cast (to_type
, pfn
,
7108 tf_warning_or_error
);
7111 if (TREE_SIDE_EFFECTS (pfn
))
7112 pfn
= save_expr (pfn
);
7114 /* Obtain the function pointer and the current DELTA. */
7115 if (TREE_CODE (pfn
) == PTRMEM_CST
)
7116 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
7119 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
7120 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
7123 /* Just adjust the DELTA field. */
7124 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7125 (TREE_TYPE (delta
), ptrdiff_type_node
));
7126 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
7127 n
= cp_build_binary_op (input_location
,
7128 LSHIFT_EXPR
, n
, integer_one_node
,
7129 tf_warning_or_error
);
7130 delta
= cp_build_binary_op (input_location
,
7131 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
7132 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
7135 /* Handle null pointer to member function conversions. */
7136 if (null_ptr_cst_p (pfn
))
7138 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
7139 return build_ptrmemfunc1 (to_type
,
7144 if (type_unknown_p (pfn
))
7145 return instantiate_type (type
, pfn
, tf_warning_or_error
);
7147 fn
= TREE_OPERAND (pfn
, 0);
7148 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7149 /* In a template, we will have preserved the
7151 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
7152 return make_ptrmem_cst (to_type
, fn
);
7155 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7158 ??? There is no consistency as to the types returned for the above
7159 values. Some code acts as if it were a sizetype and some as if it were
7160 integer_type_node. */
7163 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
7165 tree type
= TREE_TYPE (cst
);
7166 tree fn
= PTRMEM_CST_MEMBER (cst
);
7167 tree ptr_class
, fn_class
;
7169 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7171 /* The class that the function belongs to. */
7172 fn_class
= DECL_CONTEXT (fn
);
7174 /* The class that we're creating a pointer to member of. */
7175 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
7177 /* First, calculate the adjustment to the function's class. */
7178 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
7179 /*c_cast_p=*/0, tf_warning_or_error
);
7181 if (!DECL_VIRTUAL_P (fn
))
7182 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
7185 /* If we're dealing with a virtual function, we have to adjust 'this'
7186 again, to point to the base which provides the vtable entry for
7187 fn; the call will do the opposite adjustment. */
7188 tree orig_class
= DECL_CONTEXT (fn
);
7189 tree binfo
= binfo_or_else (orig_class
, fn_class
);
7190 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7191 *delta
, BINFO_OFFSET (binfo
));
7192 *delta
= fold_if_not_in_template (*delta
);
7194 /* We set PFN to the vtable offset at which the function can be
7195 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7196 case delta is shifted left, and then incremented). */
7197 *pfn
= DECL_VINDEX (fn
);
7198 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
7199 TYPE_SIZE_UNIT (vtable_entry_type
));
7200 *pfn
= fold_if_not_in_template (*pfn
);
7202 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
7204 case ptrmemfunc_vbit_in_pfn
:
7205 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
7207 *pfn
= fold_if_not_in_template (*pfn
);
7210 case ptrmemfunc_vbit_in_delta
:
7211 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
7212 *delta
, integer_one_node
);
7213 *delta
= fold_if_not_in_template (*delta
);
7214 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7215 *delta
, integer_one_node
);
7216 *delta
= fold_if_not_in_template (*delta
);
7223 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
7224 *pfn
= fold_if_not_in_template (*pfn
);
7228 /* Return an expression for PFN from the pointer-to-member function
7232 pfn_from_ptrmemfunc (tree t
)
7234 if (TREE_CODE (t
) == PTRMEM_CST
)
7239 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7244 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
7247 /* Return an expression for DELTA from the pointer-to-member function
7251 delta_from_ptrmemfunc (tree t
)
7253 if (TREE_CODE (t
) == PTRMEM_CST
)
7258 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7263 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7266 /* Convert value RHS to type TYPE as preparation for an assignment to
7267 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
7268 implicit conversion is. If FNDECL is non-NULL, we are doing the
7269 conversion in order to pass the PARMNUMth argument of FNDECL.
7270 If FNDECL is NULL, we are doing the conversion in function pointer
7271 argument passing, conversion in initialization, etc. */
7274 convert_for_assignment (tree type
, tree rhs
,
7275 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7276 tsubst_flags_t complain
, int flags
)
7279 enum tree_code coder
;
7281 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7282 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7283 rhs
= TREE_OPERAND (rhs
, 0);
7285 rhstype
= TREE_TYPE (rhs
);
7286 coder
= TREE_CODE (rhstype
);
7288 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7289 && vector_types_convertible_p (type
, rhstype
, true))
7291 rhs
= mark_rvalue_use (rhs
);
7292 return convert (type
, rhs
);
7295 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7296 return error_mark_node
;
7297 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7298 return error_mark_node
;
7300 /* The RHS of an assignment cannot have void type. */
7301 if (coder
== VOID_TYPE
)
7303 if (complain
& tf_error
)
7304 error ("void value not ignored as it ought to be");
7305 return error_mark_node
;
7308 /* Simplify the RHS if possible. */
7309 if (TREE_CODE (rhs
) == CONST_DECL
)
7310 rhs
= DECL_INITIAL (rhs
);
7312 if (c_dialect_objc ())
7316 tree rname
= fndecl
;
7327 selector
= objc_message_selector ();
7329 if (selector
&& parmno
> 1)
7336 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7338 rhs
= mark_rvalue_use (rhs
);
7339 return convert (type
, rhs
);
7345 The expression is implicitly converted (clause _conv_) to the
7346 cv-unqualified type of the left operand.
7348 We allow bad conversions here because by the time we get to this point
7349 we are committed to doing the conversion. If we end up doing a bad
7350 conversion, convert_like will complain. */
7351 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7353 /* When -Wno-pmf-conversions is use, we just silently allow
7354 conversions from pointers-to-members to plain pointers. If
7355 the conversion doesn't work, cp_convert will complain. */
7357 && TYPE_PTR_P (type
)
7358 && TYPE_PTRMEMFUNC_P (rhstype
))
7359 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7362 if (complain
& tf_error
)
7364 /* If the right-hand side has unknown type, then it is an
7365 overloaded function. Call instantiate_type to get error
7367 if (rhstype
== unknown_type_node
)
7368 instantiate_type (type
, rhs
, tf_warning_or_error
);
7370 error ("cannot convert %qT to %qT for argument %qP to %qD",
7371 rhstype
, type
, parmnum
, fndecl
);
7375 case ICR_DEFAULT_ARGUMENT
:
7376 error ("cannot convert %qT to %qT in default argument",
7380 error ("cannot convert %qT to %qT in argument passing",
7383 case ICR_CONVERTING
:
7384 error ("cannot convert %qT to %qT",
7388 error ("cannot convert %qT to %qT in initialization",
7392 error ("cannot convert %qT to %qT in return",
7396 error ("cannot convert %qT to %qT in assignment",
7403 return error_mark_node
;
7406 if (warn_missing_format_attribute
)
7408 const enum tree_code codel
= TREE_CODE (type
);
7409 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7411 && check_missing_format_attribute (type
, rhstype
)
7412 && (complain
& tf_warning
))
7416 case ICR_DEFAULT_ARGUMENT
:
7418 warning (OPT_Wmissing_format_attribute
,
7419 "parameter %qP of %qD might be a candidate "
7420 "for a format attribute", parmnum
, fndecl
);
7422 warning (OPT_Wmissing_format_attribute
,
7423 "parameter might be a candidate "
7424 "for a format attribute");
7426 case ICR_CONVERTING
:
7427 warning (OPT_Wmissing_format_attribute
,
7428 "target of conversion might be might be a candidate "
7429 "for a format attribute");
7432 warning (OPT_Wmissing_format_attribute
,
7433 "target of initialization might be a candidate "
7434 "for a format attribute");
7437 warning (OPT_Wmissing_format_attribute
,
7438 "return type might be a candidate "
7439 "for a format attribute");
7442 warning (OPT_Wmissing_format_attribute
,
7443 "left-hand side of assignment might be a candidate "
7444 "for a format attribute");
7451 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7453 if (warn_parentheses
7454 && TREE_CODE (type
) == BOOLEAN_TYPE
7455 && TREE_CODE (rhs
) == MODIFY_EXPR
7456 && !TREE_NO_WARNING (rhs
)
7457 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7458 && (complain
& tf_warning
))
7460 location_t loc
= EXPR_HAS_LOCATION (rhs
)
7461 ? EXPR_LOCATION (rhs
) : input_location
;
7463 warning_at (loc
, OPT_Wparentheses
,
7464 "suggest parentheses around assignment used as truth value");
7465 TREE_NO_WARNING (rhs
) = 1;
7468 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7472 /* Convert RHS to be of type TYPE.
7473 If EXP is nonzero, it is the target of the initialization.
7474 ERRTYPE indicates what kind of error the implicit conversion is.
7476 Two major differences between the behavior of
7477 `convert_for_assignment' and `convert_for_initialization'
7478 are that references are bashed in the former, while
7479 copied in the latter, and aggregates are assigned in
7480 the former (operator=) while initialized in the
7483 If using constructor make sure no conversion operator exists, if one does
7484 exist, an ambiguity exists.
7486 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7489 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7490 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7491 tsubst_flags_t complain
)
7493 enum tree_code codel
= TREE_CODE (type
);
7495 enum tree_code coder
;
7497 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7498 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7499 if (TREE_CODE (rhs
) == NOP_EXPR
7500 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7501 && codel
!= REFERENCE_TYPE
)
7502 rhs
= TREE_OPERAND (rhs
, 0);
7504 if (type
== error_mark_node
7505 || rhs
== error_mark_node
7506 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7507 return error_mark_node
;
7509 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7510 && TREE_CODE (type
) != ARRAY_TYPE
7511 && (TREE_CODE (type
) != REFERENCE_TYPE
7512 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7513 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7514 && (TREE_CODE (type
) != REFERENCE_TYPE
7515 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7516 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7517 rhs
= decay_conversion (rhs
);
7519 rhstype
= TREE_TYPE (rhs
);
7520 coder
= TREE_CODE (rhstype
);
7522 if (coder
== ERROR_MARK
)
7523 return error_mark_node
;
7525 /* We accept references to incomplete types, so we can
7526 return here before checking if RHS is of complete type. */
7528 if (codel
== REFERENCE_TYPE
)
7530 /* This should eventually happen in convert_arguments. */
7531 int savew
= 0, savee
= 0;
7534 savew
= warningcount
, savee
= errorcount
;
7535 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7536 /*cleanup=*/NULL
, complain
);
7539 if (warningcount
> savew
)
7540 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7541 else if (errorcount
> savee
)
7542 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7548 exp
= require_complete_type (exp
);
7549 if (exp
== error_mark_node
)
7550 return error_mark_node
;
7552 rhstype
= non_reference (rhstype
);
7554 type
= complete_type (type
);
7556 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7557 /* Don't try to do copy-initialization if we already have
7558 direct-initialization. */
7561 if (MAYBE_CLASS_TYPE_P (type
))
7562 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
7564 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7568 /* If RETVAL is the address of, or a reference to, a local variable or
7569 temporary give an appropriate warning. */
7572 maybe_warn_about_returning_address_of_local (tree retval
)
7574 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7575 tree whats_returned
= retval
;
7579 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7580 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7581 else if (CONVERT_EXPR_P (whats_returned
)
7582 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7583 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7588 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7590 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7592 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7594 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7595 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7597 warning (0, "returning reference to temporary");
7600 if (TREE_CODE (whats_returned
) == VAR_DECL
7601 && DECL_NAME (whats_returned
)
7602 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7604 warning (0, "reference to non-lvalue returned");
7609 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7610 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7611 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7613 if (DECL_P (whats_returned
)
7614 && DECL_NAME (whats_returned
)
7615 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7616 && !(TREE_STATIC (whats_returned
)
7617 || TREE_PUBLIC (whats_returned
)))
7619 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7620 warning (0, "reference to local variable %q+D returned",
7623 warning (0, "address of local variable %q+D returned",
7629 /* Check that returning RETVAL from the current function is valid.
7630 Return an expression explicitly showing all conversions required to
7631 change RETVAL into the function return type, and to assign it to
7632 the DECL_RESULT for the function. Set *NO_WARNING to true if
7633 code reaches end of non-void function warning shouldn't be issued
7634 on this RETURN_EXPR. */
7637 check_return_expr (tree retval
, bool *no_warning
)
7640 /* The type actually returned by the function, after any
7643 int fn_returns_value_p
;
7644 bool named_return_value_okay_p
;
7646 *no_warning
= false;
7648 /* A `volatile' function is one that isn't supposed to return, ever.
7649 (This is a G++ extension, used to get better code for functions
7650 that call the `volatile' function.) */
7651 if (TREE_THIS_VOLATILE (current_function_decl
))
7652 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7654 /* Check for various simple errors. */
7655 if (DECL_DESTRUCTOR_P (current_function_decl
))
7658 error ("returning a value from a destructor");
7661 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7663 if (in_function_try_handler
)
7664 /* If a return statement appears in a handler of the
7665 function-try-block of a constructor, the program is ill-formed. */
7666 error ("cannot return from a handler of a function-try-block of a constructor");
7668 /* You can't return a value from a constructor. */
7669 error ("returning a value from a constructor");
7673 /* As an extension, deduce lambda return type from a return statement
7674 anywhere in the body. */
7675 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7677 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7678 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7680 tree type
= lambda_return_type (retval
);
7681 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7683 if (VOID_TYPE_P (type
))
7685 else if (oldtype
== NULL_TREE
)
7687 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7688 "can only be deduced when the return statement is "
7689 "the only statement in the function body");
7690 apply_lambda_return_type (lambda
, type
);
7692 else if (!same_type_p (type
, oldtype
))
7693 error ("inconsistent types %qT and %qT deduced for "
7694 "lambda return type", type
, oldtype
);
7698 if (processing_template_decl
)
7700 current_function_returns_value
= 1;
7701 if (check_for_bare_parameter_packs (retval
))
7702 retval
= error_mark_node
;
7706 /* When no explicit return-value is given in a function with a named
7707 return value, the named return value is used. */
7708 result
= DECL_RESULT (current_function_decl
);
7709 valtype
= TREE_TYPE (result
);
7710 gcc_assert (valtype
!= NULL_TREE
);
7711 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7712 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7715 /* Check for a return statement with no return value in a function
7716 that's supposed to return a value. */
7717 if (!retval
&& fn_returns_value_p
)
7719 permerror (input_location
, "return-statement with no value, in function returning %qT",
7721 /* Clear this, so finish_function won't say that we reach the
7722 end of a non-void function (which we don't, we gave a
7724 current_function_returns_null
= 0;
7725 /* And signal caller that TREE_NO_WARNING should be set on the
7726 RETURN_EXPR to avoid control reaches end of non-void function
7727 warnings in tree-cfg.c. */
7730 /* Check for a return statement with a value in a function that
7731 isn't supposed to return a value. */
7732 else if (retval
&& !fn_returns_value_p
)
7734 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7735 /* You can return a `void' value from a function of `void'
7736 type. In that case, we have to evaluate the expression for
7737 its side-effects. */
7738 finish_expr_stmt (retval
);
7740 permerror (input_location
, "return-statement with a value, in function "
7741 "returning 'void'");
7742 current_function_returns_null
= 1;
7744 /* There's really no value to return, after all. */
7748 /* Remember that this function can sometimes return without a
7750 current_function_returns_null
= 1;
7752 /* Remember that this function did return a value. */
7753 current_function_returns_value
= 1;
7755 /* Check for erroneous operands -- but after giving ourselves a
7756 chance to provide an error about returning a value from a void
7758 if (error_operand_p (retval
))
7760 current_function_return_value
= error_mark_node
;
7761 return error_mark_node
;
7764 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7765 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7766 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7767 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7769 && retval
&& null_ptr_cst_p (retval
))
7770 warning (0, "%<operator new%> must not return NULL unless it is "
7771 "declared %<throw()%> (or -fcheck-new is in effect)");
7773 /* Effective C++ rule 15. See also start_function. */
7775 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7779 /* The function return type must be a reference to the current
7781 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7782 && same_type_ignoring_top_level_qualifiers_p
7783 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7785 /* Returning '*this' is obviously OK. */
7786 if (retval
== current_class_ref
)
7788 /* If we are calling a function whose return type is the same of
7789 the current class reference, it is ok. */
7790 else if (TREE_CODE (retval
) == INDIRECT_REF
7791 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7796 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7799 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7801 [...] For a function with a class return type, if the expression
7802 in the return statement is the name of a local object, and the cv-
7803 unqualified type of the local object is the same as the function
7804 return type, an implementation is permitted to omit creating the tem-
7805 porary object to hold the function return value [...]
7807 So, if this is a value-returning function that always returns the same
7808 local variable, remember it.
7810 It might be nice to be more flexible, and choose the first suitable
7811 variable even if the function sometimes returns something else, but
7812 then we run the risk of clobbering the variable we chose if the other
7813 returned expression uses the chosen variable somehow. And people expect
7814 this restriction, anyway. (jason 2000-11-19)
7816 See finish_function and finalize_nrv for the rest of this optimization. */
7818 named_return_value_okay_p
=
7819 (retval
!= NULL_TREE
7820 /* Must be a local, automatic variable. */
7821 && TREE_CODE (retval
) == VAR_DECL
7822 && DECL_CONTEXT (retval
) == current_function_decl
7823 && ! TREE_STATIC (retval
)
7824 && ! DECL_ANON_UNION_VAR_P (retval
)
7825 && (DECL_ALIGN (retval
)
7826 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7827 /* The cv-unqualified type of the returned value must be the
7828 same as the cv-unqualified return type of the
7830 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7832 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7833 /* And the returned value must be non-volatile. */
7834 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7836 if (fn_returns_value_p
&& flag_elide_constructors
)
7838 if (named_return_value_okay_p
7839 && (current_function_return_value
== NULL_TREE
7840 || current_function_return_value
== retval
))
7841 current_function_return_value
= retval
;
7843 current_function_return_value
= error_mark_node
;
7846 /* We don't need to do any conversions when there's nothing being
7851 /* Do any required conversions. */
7852 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7853 /* No conversions are required. */
7857 /* The type the function is declared to return. */
7858 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7859 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7861 /* The functype's return type will have been set to void, if it
7862 was an incomplete type. Just treat this as 'return;' */
7863 if (VOID_TYPE_P (functype
))
7864 return error_mark_node
;
7866 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7867 treated as an rvalue for the purposes of overload resolution to
7868 favor move constructors over copy constructors. */
7869 if ((cxx_dialect
!= cxx98
)
7870 && named_return_value_okay_p
7871 /* The variable must not have the `volatile' qualifier. */
7872 && !CP_TYPE_VOLATILE_P (TREE_TYPE (retval
))
7873 /* The return type must be a class type. */
7874 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7875 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7877 /* First convert the value to the function's return type, then
7878 to the type of return value's location to handle the
7879 case that functype is smaller than the valtype. */
7880 retval
= convert_for_initialization
7881 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
7882 tf_warning_or_error
);
7883 retval
= convert (valtype
, retval
);
7885 /* If the conversion failed, treat this just like `return;'. */
7886 if (retval
== error_mark_node
)
7888 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7889 else if (! cfun
->returns_struct
7890 && TREE_CODE (retval
) == TARGET_EXPR
7891 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7892 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7893 TREE_OPERAND (retval
, 0));
7895 maybe_warn_about_returning_address_of_local (retval
);
7898 /* Actually copy the value returned into the appropriate location. */
7899 if (retval
&& retval
!= result
)
7900 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7906 /* Returns nonzero if the pointer-type FROM can be converted to the
7907 pointer-type TO via a qualification conversion. If CONSTP is -1,
7908 then we return nonzero if the pointers are similar, and the
7909 cv-qualification signature of FROM is a proper subset of that of TO.
7911 If CONSTP is positive, then all outer pointers have been
7915 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7917 bool to_more_cv_qualified
= false;
7918 bool is_opaque_pointer
= false;
7920 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7922 if (TREE_CODE (to
) != TREE_CODE (from
))
7925 if (TREE_CODE (from
) == OFFSET_TYPE
7926 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7927 TYPE_OFFSET_BASETYPE (to
)))
7930 /* Const and volatile mean something different for function types,
7931 so the usual checks are not appropriate. */
7932 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7934 /* In Objective-C++, some types may have been 'volatilized' by
7935 the compiler for EH; when comparing them here, the volatile
7936 qualification must be ignored. */
7937 bool objc_quals_match
= objc_type_quals_match (to
, from
);
7939 if (!at_least_as_qualified_p (to
, from
) && !objc_quals_match
)
7942 if (!at_least_as_qualified_p (from
, to
) && !objc_quals_match
)
7946 to_more_cv_qualified
= true;
7950 constp
&= TYPE_READONLY (to
);
7953 if (TREE_CODE (to
) == VECTOR_TYPE
)
7954 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7956 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
7957 return ((constp
>= 0 || to_more_cv_qualified
)
7958 && (is_opaque_pointer
7959 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
7963 /* When comparing, say, char ** to char const **, this function takes
7964 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7965 types to this function. */
7968 comp_ptr_ttypes (tree to
, tree from
)
7970 return comp_ptr_ttypes_real (to
, from
, 1);
7973 /* Returns true iff FNTYPE is a non-class type that involves
7974 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7975 if a parameter type is ill-formed. */
7978 error_type_p (const_tree type
)
7982 switch (TREE_CODE (type
))
7988 case REFERENCE_TYPE
:
7990 return error_type_p (TREE_TYPE (type
));
7994 if (error_type_p (TREE_TYPE (type
)))
7996 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7997 if (error_type_p (TREE_VALUE (t
)))
8002 if (TYPE_PTRMEMFUNC_P (type
))
8003 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
8011 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
8012 type or inheritance-related types, regardless of cv-quals. */
8015 ptr_reasonably_similar (const_tree to
, const_tree from
)
8017 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
8019 /* Any target type is similar enough to void. */
8020 if (TREE_CODE (to
) == VOID_TYPE
)
8021 return !error_type_p (from
);
8022 if (TREE_CODE (from
) == VOID_TYPE
)
8023 return !error_type_p (to
);
8025 if (TREE_CODE (to
) != TREE_CODE (from
))
8028 if (TREE_CODE (from
) == OFFSET_TYPE
8029 && comptypes (TYPE_OFFSET_BASETYPE (to
),
8030 TYPE_OFFSET_BASETYPE (from
),
8031 COMPARE_BASE
| COMPARE_DERIVED
))
8034 if (TREE_CODE (to
) == VECTOR_TYPE
8035 && vector_types_convertible_p (to
, from
, false))
8038 if (TREE_CODE (to
) == INTEGER_TYPE
8039 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
8042 if (TREE_CODE (to
) == FUNCTION_TYPE
)
8043 return !error_type_p (to
) && !error_type_p (from
);
8045 if (TREE_CODE (to
) != POINTER_TYPE
)
8047 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
8048 COMPARE_BASE
| COMPARE_DERIVED
);
8052 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
8053 pointer-to-member types) are the same, ignoring cv-qualification at
8057 comp_ptr_ttypes_const (tree to
, tree from
)
8059 bool is_opaque_pointer
= false;
8061 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
8063 if (TREE_CODE (to
) != TREE_CODE (from
))
8066 if (TREE_CODE (from
) == OFFSET_TYPE
8067 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
8068 TYPE_OFFSET_BASETYPE (to
)))
8071 if (TREE_CODE (to
) == VECTOR_TYPE
)
8072 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
8074 if (TREE_CODE (to
) != POINTER_TYPE
)
8075 return (is_opaque_pointer
8076 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
8080 /* Returns the type qualifiers for this type, including the qualifiers on the
8081 elements for an array type. */
8084 cp_type_quals (const_tree type
)
8087 /* This CONST_CAST is okay because strip_array_types returns its
8088 argument unmodified and we assign it to a const_tree. */
8089 type
= strip_array_types (CONST_CAST_TREE (type
));
8090 if (type
== error_mark_node
8091 /* Quals on a FUNCTION_TYPE are memfn quals. */
8092 || TREE_CODE (type
) == FUNCTION_TYPE
)
8093 return TYPE_UNQUALIFIED
;
8094 quals
= TYPE_QUALS (type
);
8095 /* METHOD and REFERENCE_TYPEs should never have quals. */
8096 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
8097 && TREE_CODE (type
) != REFERENCE_TYPE
)
8098 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
8099 == TYPE_UNQUALIFIED
));
8103 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
8107 type_memfn_quals (const_tree type
)
8109 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8110 return TYPE_QUALS (type
);
8111 else if (TREE_CODE (type
) == METHOD_TYPE
)
8112 return cp_type_quals (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))));
8117 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
8121 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
)
8123 /* Could handle METHOD_TYPE here if necessary. */
8124 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8125 if (TYPE_QUALS (type
) == memfn_quals
)
8127 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
8129 return build_qualified_type (type
, memfn_quals
);
8132 /* Returns nonzero if TYPE is const or volatile. */
8135 cv_qualified_p (const_tree type
)
8137 int quals
= cp_type_quals (type
);
8138 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
8141 /* Returns nonzero if the TYPE contains a mutable member. */
8144 cp_has_mutable_p (const_tree type
)
8146 /* This CONST_CAST is okay because strip_array_types returns its
8147 argument unmodified and we assign it to a const_tree. */
8148 type
= strip_array_types (CONST_CAST_TREE(type
));
8150 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
8153 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
8154 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
8155 approximation. In particular, consider:
8158 struct S { int i; };
8159 const S s = { f(); }
8161 Here, we will make "s" as TREE_READONLY (because it is declared
8162 "const") -- only to reverse ourselves upon seeing that the
8163 initializer is non-constant. */
8166 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
8168 tree type
= TREE_TYPE (decl
);
8170 if (type
== error_mark_node
)
8173 if (TREE_CODE (decl
) == TYPE_DECL
)
8176 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
8177 && type_quals
!= TYPE_UNQUALIFIED
));
8179 /* Avoid setting TREE_READONLY incorrectly. */
8180 if (/* If the object has a constructor, the constructor may modify
8182 TYPE_NEEDS_CONSTRUCTING (type
)
8183 /* If the type isn't complete, we don't know yet if it will need
8185 || !COMPLETE_TYPE_P (type
)
8186 /* If the type has a mutable component, that component might be
8188 || TYPE_HAS_MUTABLE_P (type
))
8189 type_quals
&= ~TYPE_QUAL_CONST
;
8191 c_apply_type_quals_to_decl (type_quals
, decl
);
8194 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8195 exemplar types such that casting T1 to T2 is casting away constness
8196 if and only if there is no implicit conversion from T1 to T2. */
8199 casts_away_constness_r (tree
*t1
, tree
*t2
)
8204 /* [expr.const.cast]
8206 For multi-level pointer to members and multi-level mixed pointers
8207 and pointers to members (conv.qual), the "member" aspect of a
8208 pointer to member level is ignored when determining if a const
8209 cv-qualifier has been cast away. */
8210 /* [expr.const.cast]
8212 For two pointer types:
8214 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8215 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8218 casting from X1 to X2 casts away constness if, for a non-pointer
8219 type T there does not exist an implicit conversion (clause
8222 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8226 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8227 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
8228 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
8230 *t1
= cp_build_qualified_type (void_type_node
,
8231 cp_type_quals (*t1
));
8232 *t2
= cp_build_qualified_type (void_type_node
,
8233 cp_type_quals (*t2
));
8237 quals1
= cp_type_quals (*t1
);
8238 quals2
= cp_type_quals (*t2
);
8240 if (TYPE_PTRMEM_P (*t1
))
8241 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
8243 *t1
= TREE_TYPE (*t1
);
8244 if (TYPE_PTRMEM_P (*t2
))
8245 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
8247 *t2
= TREE_TYPE (*t2
);
8249 casts_away_constness_r (t1
, t2
);
8250 *t1
= build_pointer_type (*t1
);
8251 *t2
= build_pointer_type (*t2
);
8252 *t1
= cp_build_qualified_type (*t1
, quals1
);
8253 *t2
= cp_build_qualified_type (*t2
, quals2
);
8256 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8259 ??? This function returns non-zero if casting away qualifiers not
8260 just const. We would like to return to the caller exactly which
8261 qualifiers are casted away to give more accurate diagnostics.
8265 casts_away_constness (tree t1
, tree t2
)
8267 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
8269 /* [expr.const.cast]
8271 Casting from an lvalue of type T1 to an lvalue of type T2
8272 using a reference cast casts away constness if a cast from an
8273 rvalue of type "pointer to T1" to the type "pointer to T2"
8274 casts away constness. */
8275 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
8276 return casts_away_constness (build_pointer_type (t1
),
8277 build_pointer_type (TREE_TYPE (t2
)));
8280 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
8281 /* [expr.const.cast]
8283 Casting from an rvalue of type "pointer to data member of X
8284 of type T1" to the type "pointer to data member of Y of type
8285 T2" casts away constness if a cast from an rvalue of type
8286 "pointer to T1" to the type "pointer to T2" casts away
8288 return casts_away_constness
8289 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
8290 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
8292 /* Casting away constness is only something that makes sense for
8293 pointer or reference types. */
8294 if (TREE_CODE (t1
) != POINTER_TYPE
8295 || TREE_CODE (t2
) != POINTER_TYPE
)
8298 /* Top-level qualifiers don't matter. */
8299 t1
= TYPE_MAIN_VARIANT (t1
);
8300 t2
= TYPE_MAIN_VARIANT (t2
);
8301 casts_away_constness_r (&t1
, &t2
);
8302 if (!can_convert (t2
, t1
))
8308 /* If T is a REFERENCE_TYPE return the type to which T refers.
8309 Otherwise, return T itself. */
8312 non_reference (tree t
)
8314 if (TREE_CODE (t
) == REFERENCE_TYPE
)
8320 /* Return nonzero if REF is an lvalue valid for this language;
8321 otherwise, print an error message and return zero. USE says
8322 how the lvalue is being used and so selects the error message. */
8325 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
8327 int win
= lvalue_p (ref
);
8329 if (!win
&& (complain
& tf_error
))