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
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"
41 #include "diagnostic.h"
48 static tree
pfn_from_ptrmemfunc (tree
);
49 static tree
delta_from_ptrmemfunc (tree
);
50 static tree
convert_for_assignment (tree
, tree
, const char *, tree
, int,
52 static tree
cp_pointer_int_sum (enum tree_code
, tree
, tree
);
53 static tree
rationalize_conditional_expr (enum tree_code
, tree
,
55 static int comp_ptr_ttypes_real (tree
, tree
, int);
56 static bool comp_except_types (tree
, tree
, bool);
57 static bool comp_array_types (const_tree
, const_tree
, bool);
58 static tree
pointer_diff (tree
, tree
, tree
);
59 static tree
get_delta_difference (tree
, tree
, bool, bool);
60 static void casts_away_constness_r (tree
*, tree
*);
61 static bool casts_away_constness (tree
, tree
);
62 static void maybe_warn_about_returning_address_of_local (tree
);
63 static tree
lookup_destructor (tree
, tree
, tree
);
64 static void warn_args_num (location_t
, tree
, bool);
65 static int convert_arguments (tree
, VEC(tree
,gc
) **, tree
, int,
68 /* Do `exp = require_complete_type (exp);' to make sure exp
69 does not have an incomplete type. (That includes void types.)
70 Returns the error_mark_node if the VALUE does not have
71 complete type when this function returns. */
74 require_complete_type (tree value
)
78 if (processing_template_decl
|| value
== error_mark_node
)
81 if (TREE_CODE (value
) == OVERLOAD
)
82 type
= unknown_type_node
;
84 type
= TREE_TYPE (value
);
86 if (type
== error_mark_node
)
87 return error_mark_node
;
89 /* First, detect a valid value with a complete type. */
90 if (COMPLETE_TYPE_P (type
))
93 if (complete_type_or_else (type
, value
))
96 return error_mark_node
;
99 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
100 a template instantiation, do the instantiation. Returns TYPE,
101 whether or not it could be completed, unless something goes
102 horribly wrong, in which case the error_mark_node is returned. */
105 complete_type (tree type
)
107 if (type
== NULL_TREE
)
108 /* Rather than crash, we return something sure to cause an error
110 return error_mark_node
;
112 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
114 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
116 tree t
= complete_type (TREE_TYPE (type
));
117 unsigned int needs_constructing
, has_nontrivial_dtor
;
118 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
121 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
123 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
124 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
126 TYPE_NEEDS_CONSTRUCTING (t
) = needs_constructing
;
127 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = has_nontrivial_dtor
;
130 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
131 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
136 /* Like complete_type, but issue an error if the TYPE cannot be completed.
137 VALUE is used for informative diagnostics.
138 Returns NULL_TREE if the type cannot be made complete. */
141 complete_type_or_else (tree type
, tree value
)
143 type
= complete_type (type
);
144 if (type
== error_mark_node
)
145 /* We already issued an error. */
147 else if (!COMPLETE_TYPE_P (type
))
149 cxx_incomplete_type_diagnostic (value
, type
, DK_ERROR
);
156 /* Return truthvalue of whether type of EXP is instantiated. */
159 type_unknown_p (const_tree exp
)
161 return (TREE_CODE (exp
) == TREE_LIST
162 || TREE_TYPE (exp
) == unknown_type_node
);
166 /* Return the common type of two parameter lists.
167 We assume that comptypes has already been done and returned 1;
168 if that isn't so, this may crash.
170 As an optimization, free the space we allocate if the parameter
171 lists are already common. */
174 commonparms (tree p1
, tree p2
)
176 tree oldargs
= p1
, newargs
, n
;
180 len
= list_length (p1
);
181 newargs
= tree_last (p1
);
183 if (newargs
== void_list_node
)
192 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
197 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
199 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
201 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
204 else if (! TREE_PURPOSE (p1
))
206 if (TREE_PURPOSE (p2
))
208 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
214 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
216 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
218 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
221 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
224 TREE_VALUE (n
) = TREE_VALUE (p1
);
232 /* Given a type, perhaps copied for a typedef,
233 find the "original" version of it. */
235 original_type (tree t
)
237 int quals
= cp_type_quals (t
);
238 while (t
!= error_mark_node
239 && TYPE_NAME (t
) != NULL_TREE
)
241 tree x
= TYPE_NAME (t
);
242 if (TREE_CODE (x
) != TYPE_DECL
)
244 x
= DECL_ORIGINAL_TYPE (x
);
249 return cp_build_qualified_type (t
, quals
);
252 /* Return the common type for two arithmetic types T1 and T2 under the
253 usual arithmetic conversions. The default conversions have already
254 been applied, and enumerated types converted to their compatible
258 cp_common_type (tree t1
, tree t2
)
260 enum tree_code code1
= TREE_CODE (t1
);
261 enum tree_code code2
= TREE_CODE (t2
);
264 /* In what follows, we slightly generalize the rules given in [expr] so
265 as to deal with `long long' and `complex'. First, merge the
267 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
269 if (SCOPED_ENUM_P (t1
) || SCOPED_ENUM_P (t2
))
271 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
272 return build_type_attribute_variant (t1
, attributes
);
277 /* FIXME: Attributes. */
278 gcc_assert (ARITHMETIC_TYPE_P (t1
)
279 || TREE_CODE (t1
) == VECTOR_TYPE
280 || UNSCOPED_ENUM_P (t1
));
281 gcc_assert (ARITHMETIC_TYPE_P (t2
)
282 || TREE_CODE (t2
) == VECTOR_TYPE
283 || UNSCOPED_ENUM_P (t2
));
285 /* If one type is complex, form the common type of the non-complex
286 components, then make that complex. Use T1 or T2 if it is the
288 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
290 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
291 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
293 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
295 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
296 return build_type_attribute_variant (t1
, attributes
);
297 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
298 return build_type_attribute_variant (t2
, attributes
);
300 return build_type_attribute_variant (build_complex_type (subtype
),
304 if (code1
== VECTOR_TYPE
)
306 /* When we get here we should have two vectors of the same size.
307 Just prefer the unsigned one if present. */
308 if (TYPE_UNSIGNED (t1
))
309 return build_type_attribute_variant (t1
, attributes
);
311 return build_type_attribute_variant (t2
, attributes
);
314 /* If only one is real, use it as the result. */
315 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
316 return build_type_attribute_variant (t1
, attributes
);
317 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
318 return build_type_attribute_variant (t2
, attributes
);
320 /* Both real or both integers; use the one with greater precision. */
321 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
322 return build_type_attribute_variant (t1
, attributes
);
323 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
324 return build_type_attribute_variant (t2
, attributes
);
326 /* The types are the same; no need to do anything fancy. */
327 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
328 return build_type_attribute_variant (t1
, attributes
);
330 if (code1
!= REAL_TYPE
)
332 /* If one is unsigned long long, then convert the other to unsigned
334 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
335 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
336 return build_type_attribute_variant (long_long_unsigned_type_node
,
338 /* If one is a long long, and the other is an unsigned long, and
339 long long can represent all the values of an unsigned long, then
340 convert to a long long. Otherwise, convert to an unsigned long
341 long. Otherwise, if either operand is long long, convert the
344 Since we're here, we know the TYPE_PRECISION is the same;
345 therefore converting to long long cannot represent all the values
346 of an unsigned long, so we choose unsigned long long in that
348 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
349 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
351 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
352 ? long_long_unsigned_type_node
353 : long_long_integer_type_node
);
354 return build_type_attribute_variant (t
, attributes
);
357 /* Go through the same procedure, but for longs. */
358 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
359 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
360 return build_type_attribute_variant (long_unsigned_type_node
,
362 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
363 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
365 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
366 ? long_unsigned_type_node
: long_integer_type_node
);
367 return build_type_attribute_variant (t
, attributes
);
369 /* Otherwise prefer the unsigned one. */
370 if (TYPE_UNSIGNED (t1
))
371 return build_type_attribute_variant (t1
, attributes
);
373 return build_type_attribute_variant (t2
, attributes
);
377 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
378 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
379 return build_type_attribute_variant (long_double_type_node
,
381 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
382 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
383 return build_type_attribute_variant (double_type_node
,
385 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
386 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
387 return build_type_attribute_variant (float_type_node
,
390 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
391 the standard C++ floating-point types. Logic earlier in this
392 function has already eliminated the possibility that
393 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
394 compelling reason to choose one or the other. */
395 return build_type_attribute_variant (t1
, attributes
);
399 /* T1 and T2 are arithmetic or enumeration types. Return the type
400 that will result from the "usual arithmetic conversions" on T1 and
401 T2 as described in [expr]. */
404 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
406 gcc_assert (ARITHMETIC_TYPE_P (t1
)
407 || TREE_CODE (t1
) == VECTOR_TYPE
408 || UNSCOPED_ENUM_P (t1
));
409 gcc_assert (ARITHMETIC_TYPE_P (t2
)
410 || TREE_CODE (t2
) == VECTOR_TYPE
411 || UNSCOPED_ENUM_P (t2
));
413 /* Perform the integral promotions. We do not promote real types here. */
414 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1
)
415 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2
))
417 t1
= type_promotes_to (t1
);
418 t2
= type_promotes_to (t2
);
421 return cp_common_type (t1
, t2
);
424 /* Subroutine of composite_pointer_type to implement the recursive
425 case. See that function for documentation of the parameters. */
428 composite_pointer_type_r (tree t1
, tree t2
,
429 composite_pointer_operation operation
,
430 tsubst_flags_t complain
)
437 /* Determine the types pointed to by T1 and T2. */
438 if (TREE_CODE (t1
) == POINTER_TYPE
)
440 pointee1
= TREE_TYPE (t1
);
441 pointee2
= TREE_TYPE (t2
);
445 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
446 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
451 Otherwise, the composite pointer type is a pointer type
452 similar (_conv.qual_) to the type of one of the operands,
453 with a cv-qualification signature (_conv.qual_) that is the
454 union of the cv-qualification signatures of the operand
456 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
457 result_type
= pointee1
;
458 else if ((TREE_CODE (pointee1
) == POINTER_TYPE
459 && TREE_CODE (pointee2
) == POINTER_TYPE
)
460 || (TYPE_PTR_TO_MEMBER_P (pointee1
)
461 && TYPE_PTR_TO_MEMBER_P (pointee2
)))
462 result_type
= composite_pointer_type_r (pointee1
, pointee2
, operation
,
466 if (complain
& tf_error
)
471 permerror (input_location
, "comparison between "
472 "distinct pointer types %qT and %qT lacks a cast",
476 permerror (input_location
, "conversion between "
477 "distinct pointer types %qT and %qT lacks a cast",
480 case CPO_CONDITIONAL_EXPR
:
481 permerror (input_location
, "conditional expression between "
482 "distinct pointer types %qT and %qT lacks a cast",
489 result_type
= void_type_node
;
491 result_type
= cp_build_qualified_type (result_type
,
492 (cp_type_quals (pointee1
)
493 | cp_type_quals (pointee2
)));
494 /* If the original types were pointers to members, so is the
496 if (TYPE_PTR_TO_MEMBER_P (t1
))
498 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
499 TYPE_PTRMEM_CLASS_TYPE (t2
))
500 && (complain
& tf_error
))
505 permerror (input_location
, "comparison between "
506 "distinct pointer types %qT and %qT lacks a cast",
510 permerror (input_location
, "conversion between "
511 "distinct pointer types %qT and %qT lacks a cast",
514 case CPO_CONDITIONAL_EXPR
:
515 permerror (input_location
, "conditional expression between "
516 "distinct pointer types %qT and %qT lacks a cast",
523 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
527 result_type
= build_pointer_type (result_type
);
529 /* Merge the attributes. */
530 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
531 return build_type_attribute_variant (result_type
, attributes
);
534 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
535 ARG1 and ARG2 are the values with those types. The OPERATION is to
536 describe the operation between the pointer types,
537 in case an error occurs.
539 This routine also implements the computation of a common type for
540 pointers-to-members as per [expr.eq]. */
543 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
544 composite_pointer_operation operation
,
545 tsubst_flags_t complain
)
552 If one operand is a null pointer constant, the composite pointer
553 type is the type of the other operand. */
554 if (null_ptr_cst_p (arg1
))
556 if (null_ptr_cst_p (arg2
))
563 If one of the operands has type "pointer to cv1 void*", then
564 the other has type "pointer to cv2T", and the composite pointer
565 type is "pointer to cv12 void", where cv12 is the union of cv1
568 If either type is a pointer to void, make sure it is T1. */
569 if (TREE_CODE (t2
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t2
)))
577 /* Now, if T1 is a pointer to void, merge the qualifiers. */
578 if (TREE_CODE (t1
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t1
)))
583 if (TYPE_PTRFN_P (t2
) && (complain
& tf_error
))
588 pedwarn (input_location
, OPT_pedantic
,
589 "ISO C++ forbids comparison between "
590 "pointer of type %<void *%> and pointer-to-function");
593 pedwarn (input_location
, OPT_pedantic
,
594 "ISO C++ forbids conversion between "
595 "pointer of type %<void *%> and pointer-to-function");
597 case CPO_CONDITIONAL_EXPR
:
598 pedwarn (input_location
, OPT_pedantic
,
599 "ISO C++ forbids conditional expression between "
600 "pointer of type %<void *%> and pointer-to-function");
607 = cp_build_qualified_type (void_type_node
,
608 (cp_type_quals (TREE_TYPE (t1
))
609 | cp_type_quals (TREE_TYPE (t2
))));
610 result_type
= build_pointer_type (result_type
);
611 /* Merge the attributes. */
612 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
613 return build_type_attribute_variant (result_type
, attributes
);
616 if (c_dialect_objc () && TREE_CODE (t1
) == POINTER_TYPE
617 && TREE_CODE (t2
) == POINTER_TYPE
)
619 if (objc_compare_types (t1
, t2
, -3, NULL_TREE
))
623 /* [expr.eq] permits the application of a pointer conversion to
624 bring the pointers to a common type. */
625 if (TREE_CODE (t1
) == POINTER_TYPE
&& TREE_CODE (t2
) == POINTER_TYPE
626 && CLASS_TYPE_P (TREE_TYPE (t1
))
627 && CLASS_TYPE_P (TREE_TYPE (t2
))
628 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
631 class1
= TREE_TYPE (t1
);
632 class2
= TREE_TYPE (t2
);
634 if (DERIVED_FROM_P (class1
, class2
))
635 t2
= (build_pointer_type
636 (cp_build_qualified_type (class1
, TYPE_QUALS (class2
))));
637 else if (DERIVED_FROM_P (class2
, class1
))
638 t1
= (build_pointer_type
639 (cp_build_qualified_type (class2
, TYPE_QUALS (class1
))));
642 if (complain
& tf_error
)
646 error ("comparison between distinct "
647 "pointer types %qT and %qT lacks a cast", t1
, t2
);
650 error ("conversion between distinct "
651 "pointer types %qT and %qT lacks a cast", t1
, t2
);
653 case CPO_CONDITIONAL_EXPR
:
654 error ("conditional expression between distinct "
655 "pointer types %qT and %qT lacks a cast", t1
, t2
);
660 return error_mark_node
;
663 /* [expr.eq] permits the application of a pointer-to-member
664 conversion to change the class type of one of the types. */
665 else if (TYPE_PTR_TO_MEMBER_P (t1
)
666 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
667 TYPE_PTRMEM_CLASS_TYPE (t2
)))
669 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
670 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
672 if (DERIVED_FROM_P (class1
, class2
))
673 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
674 else if (DERIVED_FROM_P (class2
, class1
))
675 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
678 if (complain
& tf_error
)
682 error ("comparison between distinct "
683 "pointer-to-member types %qT and %qT lacks a cast",
687 error ("conversion between distinct "
688 "pointer-to-member types %qT and %qT lacks a cast",
691 case CPO_CONDITIONAL_EXPR
:
692 error ("conditional expression between distinct "
693 "pointer-to-member types %qT and %qT lacks a cast",
699 return error_mark_node
;
703 return composite_pointer_type_r (t1
, t2
, operation
, complain
);
706 /* Return the merged type of two types.
707 We assume that comptypes has already been done and returned 1;
708 if that isn't so, this may crash.
710 This just combines attributes and default arguments; any other
711 differences would cause the two types to compare unalike. */
714 merge_types (tree t1
, tree t2
)
716 enum tree_code code1
;
717 enum tree_code code2
;
720 /* Save time if the two types are the same. */
723 if (original_type (t1
) == original_type (t2
))
726 /* If one type is nonsense, use the other. */
727 if (t1
== error_mark_node
)
729 if (t2
== error_mark_node
)
732 /* Merge the attributes. */
733 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
735 if (TYPE_PTRMEMFUNC_P (t1
))
736 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
737 if (TYPE_PTRMEMFUNC_P (t2
))
738 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
740 code1
= TREE_CODE (t1
);
741 code2
= TREE_CODE (t2
);
744 gcc_assert (code1
== TYPENAME_TYPE
|| code2
== TYPENAME_TYPE
);
745 if (code1
== TYPENAME_TYPE
)
747 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
748 code1
= TREE_CODE (t1
);
752 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
753 code2
= TREE_CODE (t2
);
761 /* For two pointers, do this recursively on the target type. */
763 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
764 int quals
= cp_type_quals (t1
);
766 if (code1
== POINTER_TYPE
)
767 t1
= build_pointer_type (target
);
769 t1
= cp_build_reference_type (target
, TYPE_REF_IS_RVALUE (t1
));
770 t1
= build_type_attribute_variant (t1
, attributes
);
771 t1
= cp_build_qualified_type (t1
, quals
);
773 if (TREE_CODE (target
) == METHOD_TYPE
)
774 t1
= build_ptrmemfunc_type (t1
);
783 quals
= cp_type_quals (t1
);
784 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
785 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
786 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
788 t1
= cp_build_qualified_type (t1
, quals
);
794 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
795 /* Save space: see if the result is identical to one of the args. */
796 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
797 return build_type_attribute_variant (t1
, attributes
);
798 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
799 return build_type_attribute_variant (t2
, attributes
);
800 /* Merge the element types, and have a size if either arg has one. */
801 t1
= build_cplus_array_type
802 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
807 /* Function types: prefer the one that specified arg types.
808 If both do, merge the arg types. Also merge the return types. */
810 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
811 tree p1
= TYPE_ARG_TYPES (t1
);
812 tree p2
= TYPE_ARG_TYPES (t2
);
816 /* Save space: see if the result is identical to one of the args. */
817 if (valtype
== TREE_TYPE (t1
) && ! p2
)
818 return cp_build_type_attribute_variant (t1
, attributes
);
819 if (valtype
== TREE_TYPE (t2
) && ! p1
)
820 return cp_build_type_attribute_variant (t2
, attributes
);
822 /* Simple way if one arg fails to specify argument types. */
823 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
826 raises
= TYPE_RAISES_EXCEPTIONS (t2
);
828 else if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
831 raises
= TYPE_RAISES_EXCEPTIONS (t1
);
835 parms
= commonparms (p1
, p2
);
836 /* In cases where we're merging a real declaration with a
837 built-in declaration, t1 is the real one. */
838 raises
= TYPE_RAISES_EXCEPTIONS (t1
);
841 rval
= build_function_type (valtype
, parms
);
842 gcc_assert (type_memfn_quals (t1
) == type_memfn_quals (t2
));
843 rval
= apply_memfn_quals (rval
, type_memfn_quals (t1
));
844 t1
= build_exception_variant (rval
, raises
);
850 /* Get this value the long way, since TYPE_METHOD_BASETYPE
851 is just the main variant of this. */
852 tree basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2
)));
853 tree raises
= TYPE_RAISES_EXCEPTIONS (t1
);
856 /* If this was a member function type, get back to the
857 original type of type member function (i.e., without
858 the class instance variable up front. */
859 t1
= build_function_type (TREE_TYPE (t1
),
860 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
861 t2
= build_function_type (TREE_TYPE (t2
),
862 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
863 t3
= merge_types (t1
, t2
);
864 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
865 TYPE_ARG_TYPES (t3
));
866 t1
= build_exception_variant (t3
, raises
);
871 /* There is no need to merge attributes into a TYPENAME_TYPE.
872 When the type is instantiated it will have whatever
873 attributes result from the instantiation. */
879 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
881 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
884 return cp_build_type_attribute_variant (t1
, attributes
);
887 /* Return the ARRAY_TYPE type without its domain. */
890 strip_array_domain (tree type
)
893 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
894 if (TYPE_DOMAIN (type
) == NULL_TREE
)
896 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
897 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
900 /* Wrapper around cp_common_type that is used by c-common.c and other
901 front end optimizations that remove promotions.
903 Return the common type for two arithmetic types T1 and T2 under the
904 usual arithmetic conversions. The default conversions have already
905 been applied, and enumerated types converted to their compatible
909 common_type (tree t1
, tree t2
)
911 /* If one type is nonsense, use the other */
912 if (t1
== error_mark_node
)
914 if (t2
== error_mark_node
)
917 return cp_common_type (t1
, t2
);
920 /* Return the common type of two pointer types T1 and T2. This is the
921 type for the result of most arithmetic operations if the operands
922 have the given two types.
924 We assume that comp_target_types has already been done and returned
925 nonzero; if that isn't so, this may crash. */
928 common_pointer_type (tree t1
, tree t2
)
930 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
931 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
932 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
934 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
935 CPO_CONVERSION
, tf_warning_or_error
);
938 /* Compare two exception specifier types for exactness or subsetness, if
939 allowed. Returns false for mismatch, true for match (same, or
942 [except.spec] "If a class X ... objects of class X or any class publicly
943 and unambiguously derived from X. Similarly, if a pointer type Y * ...
944 exceptions of type Y * or that are pointers to any type publicly and
945 unambiguously derived from Y. Otherwise a function only allows exceptions
946 that have the same type ..."
947 This does not mention cv qualifiers and is different to what throw
948 [except.throw] and catch [except.catch] will do. They will ignore the
949 top level cv qualifiers, and allow qualifiers in the pointer to class
952 We implement the letter of the standard. */
955 comp_except_types (tree a
, tree b
, bool exact
)
957 if (same_type_p (a
, b
))
961 if (cp_type_quals (a
) || cp_type_quals (b
))
964 if (TREE_CODE (a
) == POINTER_TYPE
965 && TREE_CODE (b
) == POINTER_TYPE
)
969 if (cp_type_quals (a
) || cp_type_quals (b
))
973 if (TREE_CODE (a
) != RECORD_TYPE
974 || TREE_CODE (b
) != RECORD_TYPE
)
977 if (PUBLICLY_UNIQUELY_DERIVED_P (a
, b
))
983 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
984 If EXACT is false, T2 can be stricter than T1 (according to 15.4/7),
985 otherwise it must be exact. Exception lists are unordered, but
986 we've already filtered out duplicates. Most lists will be in order,
987 we should try to make use of that. */
990 comp_except_specs (const_tree t1
, const_tree t2
, bool exact
)
999 if (t1
== NULL_TREE
) /* T1 is ... */
1000 return t2
== NULL_TREE
|| !exact
;
1001 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1002 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1003 if (t2
== NULL_TREE
) /* T2 is ... */
1005 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1008 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1009 Count how many we find, to determine exactness. For exact matching and
1010 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1012 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1014 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1016 tree a
= TREE_VALUE (probe
);
1017 tree b
= TREE_VALUE (t2
);
1019 if (comp_except_types (a
, b
, exact
))
1021 if (probe
== base
&& exact
)
1022 base
= TREE_CHAIN (probe
);
1027 if (probe
== NULL_TREE
)
1030 return !exact
|| base
== NULL_TREE
|| length
== list_length (t1
);
1033 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1034 [] can match [size]. */
1037 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1046 /* The type of the array elements must be the same. */
1047 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1050 d1
= TYPE_DOMAIN (t1
);
1051 d2
= TYPE_DOMAIN (t2
);
1056 /* If one of the arrays is dimensionless, and the other has a
1057 dimension, they are of different types. However, it is valid to
1065 declarations for an array object can specify
1066 array types that differ by the presence or absence of a major
1067 array bound (_dcl.array_). */
1069 return allow_redeclaration
;
1071 /* Check that the dimensions are the same. */
1073 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1075 max1
= TYPE_MAX_VALUE (d1
);
1076 max2
= TYPE_MAX_VALUE (d2
);
1077 if (processing_template_decl
&& !abi_version_at_least (2)
1078 && !value_dependent_expression_p (max1
)
1079 && !value_dependent_expression_p (max2
))
1081 /* With abi-1 we do not fold non-dependent array bounds, (and
1082 consequently mangle them incorrectly). We must therefore
1083 fold them here, to verify the domains have the same
1089 if (!cp_tree_equal (max1
, max2
))
1095 /* Compare the relative position of T1 and T2 into their respective
1096 template parameter list.
1097 T1 and T2 must be template parameter types.
1098 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1101 comp_template_parms_position (tree t1
, tree t2
)
1103 gcc_assert (t1
&& t2
1104 && TREE_CODE (t1
) == TREE_CODE (t2
)
1105 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1106 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1107 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1109 if (TEMPLATE_TYPE_IDX (t1
) != TEMPLATE_TYPE_IDX (t2
)
1110 || TEMPLATE_TYPE_LEVEL (t1
) != TEMPLATE_TYPE_LEVEL (t2
)
1111 || (TEMPLATE_TYPE_PARAMETER_PACK (t1
)
1112 != TEMPLATE_TYPE_PARAMETER_PACK (t2
)))
1118 /* Subroutine of incompatible_dependent_types_p.
1119 Return the template parameter of the dependent type T.
1120 If T is a typedef, return the template parameters of
1121 the _decl_ of the typedef. T must be a dependent type. */
1124 get_template_parms_of_dependent_type (tree t
)
1126 tree tinfo
= NULL_TREE
, tparms
= NULL_TREE
;
1128 /* First, try the obvious case of getting the
1129 template info from T itself. */
1130 if ((tinfo
= get_template_info (t
)))
1132 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
1133 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (t
);
1134 else if (typedef_variant_p (t
)
1135 && !NAMESPACE_SCOPE_P (TYPE_NAME (t
)))
1136 tinfo
= get_template_info (DECL_CONTEXT (TYPE_NAME (t
)));
1137 /* If T is a TYPENAME_TYPE which context is a template type
1138 parameter, get the template parameters from that context. */
1139 else if (TYPE_CONTEXT (t
)
1140 && TREE_CODE (TYPE_CONTEXT (t
)) == TEMPLATE_TYPE_PARM
)
1141 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (TYPE_CONTEXT (t
));
1142 else if (TYPE_CONTEXT (t
)
1143 && !NAMESPACE_SCOPE_P (t
))
1144 tinfo
= get_template_info (TYPE_CONTEXT (t
));
1147 tparms
= DECL_TEMPLATE_PARMS (TI_TEMPLATE (tinfo
));
1152 /* Subroutine of structural_comptypes.
1153 Compare the dependent types T1 and T2.
1154 Return TRUE if we are sure they can't be equal, FALSE otherwise.
1155 The whole point of this function is to support cases where either T1 or
1156 T2 is a typedef. In those cases, we need to compare the template parameters
1157 of the _decl_ of the typedef. If those don't match then we know T1
1158 and T2 cannot be equal. */
1161 incompatible_dependent_types_p (tree t1
, tree t2
)
1163 tree tparms1
= NULL_TREE
, tparms2
= NULL_TREE
;
1164 bool t1_typedef_variant_p
, t2_typedef_variant_p
;
1166 if (!uses_template_parms (t1
) || !uses_template_parms (t2
))
1169 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
)
1171 /* If T1 and T2 don't have the same relative position in their
1172 template parameters set, they can't be equal. */
1173 if (!comp_template_parms_position (t1
, t2
))
1177 t1_typedef_variant_p
= typedef_variant_p (t1
);
1178 t2_typedef_variant_p
= typedef_variant_p (t2
);
1180 /* Either T1 or T2 must be a typedef. */
1181 if (!t1_typedef_variant_p
&& !t2_typedef_variant_p
)
1184 if (!t1_typedef_variant_p
|| !t2_typedef_variant_p
)
1185 /* Either T1 or T2 is not a typedef so we cannot compare the
1186 the template parms of the typedefs of T1 and T2.
1187 At this point, if the main variant type of T1 and T2 are equal
1188 it means the two types can't be incompatible, from the perspective
1189 of this function. */
1190 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1193 /* So if we reach this point, it means either T1 or T2 is a typedef variant.
1194 Let's compare their template parameters. */
1196 tparms1
= get_template_parms_of_dependent_type (t1
);
1197 tparms2
= get_template_parms_of_dependent_type (t2
);
1199 /* If T2 is a template type parm and if we could not get the template
1200 parms it belongs to, that means we have not finished parsing the
1201 full set of template parameters of the template declaration it
1202 belongs to yet. If we could get the template parms T1 belongs to,
1203 that mostly means T1 and T2 belongs to templates that are
1204 different and incompatible. */
1205 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
1206 && (tparms1
== NULL_TREE
|| tparms2
== NULL_TREE
)
1207 && tparms1
!= tparms2
)
1210 if (tparms1
== NULL_TREE
1211 || tparms2
== NULL_TREE
1212 || tparms1
== tparms2
)
1215 /* And now compare the mighty template parms! */
1216 return !comp_template_parms (tparms1
, tparms2
);
1219 /* Subroutine in comptypes. */
1222 structural_comptypes (tree t1
, tree t2
, int strict
)
1227 /* Suppress errors caused by previously reported errors. */
1228 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1231 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1233 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1234 current instantiation. */
1235 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1236 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1238 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1239 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1241 if (TYPE_PTRMEMFUNC_P (t1
))
1242 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1243 if (TYPE_PTRMEMFUNC_P (t2
))
1244 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1246 /* Different classes of types can't be compatible. */
1247 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1250 /* Qualifiers must match. For array types, we will check when we
1251 recur on the array element types. */
1252 if (TREE_CODE (t1
) != ARRAY_TYPE
1253 && TYPE_QUALS (t1
) != TYPE_QUALS (t2
))
1255 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1258 /* If T1 and T2 are dependent typedefs then check upfront that
1259 the template parameters of their typedef DECLs match before
1260 going down checking their subtypes. */
1261 if (incompatible_dependent_types_p (t1
, t2
))
1264 /* Allow for two different type nodes which have essentially the same
1265 definition. Note that we already checked for equality of the type
1266 qualifiers (just above). */
1268 if (TREE_CODE (t1
) != ARRAY_TYPE
1269 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1273 /* Compare the types. Break out if they could be the same. */
1274 switch (TREE_CODE (t1
))
1278 /* All void and bool types are the same. */
1282 case FIXED_POINT_TYPE
:
1284 /* With these nodes, we can't determine type equivalence by
1285 looking at what is stored in the nodes themselves, because
1286 two nodes might have different TYPE_MAIN_VARIANTs but still
1287 represent the same type. For example, wchar_t and int could
1288 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1289 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1290 and are distinct types. On the other hand, int and the
1293 typedef int INT __attribute((may_alias));
1295 have identical properties, different TYPE_MAIN_VARIANTs, but
1296 represent the same type. The canonical type system keeps
1297 track of equivalence in this case, so we fall back on it. */
1298 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1300 case TEMPLATE_TEMPLATE_PARM
:
1301 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1302 if (!comp_template_parms_position (t1
, t2
))
1304 if (!comp_template_parms
1305 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1306 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1308 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1310 /* Don't check inheritance. */
1311 strict
= COMPARE_STRICT
;
1316 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1317 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1318 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1319 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1322 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1324 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1330 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1331 strict
& ~COMPARE_REDECLARATION
))
1333 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1337 case REFERENCE_TYPE
:
1338 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1340 /* fall through to checks for pointer types */
1343 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1344 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
)
1345 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1351 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1353 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1358 /* Target types must match incl. qualifiers. */
1359 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1363 case TEMPLATE_TYPE_PARM
:
1364 /* If incompatible_dependent_types_p called earlier didn't decide
1365 T1 and T2 were different, they might be equal. */
1369 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1370 TYPENAME_TYPE_FULLNAME (t2
)))
1372 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1376 case UNBOUND_CLASS_TEMPLATE
:
1377 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1379 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1384 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1389 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1390 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1394 case TYPE_PACK_EXPANSION
:
1395 return same_type_p (PACK_EXPANSION_PATTERN (t1
),
1396 PACK_EXPANSION_PATTERN (t2
));
1399 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1400 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1401 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1402 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1403 || (DECLTYPE_FOR_LAMBDA_RETURN (t1
)
1404 != DECLTYPE_FOR_LAMBDA_RETURN (t2
))
1405 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1406 DECLTYPE_TYPE_EXPR (t2
)))
1414 /* If we get here, we know that from a target independent POV the
1415 types are the same. Make sure the target attributes are also
1417 return targetm
.comp_type_attributes (t1
, t2
);
1420 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1421 is a bitwise-or of the COMPARE_* flags. */
1424 comptypes (tree t1
, tree t2
, int strict
)
1426 if (strict
== COMPARE_STRICT
)
1431 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1434 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1435 /* At least one of the types requires structural equality, so
1436 perform a deep check. */
1437 return structural_comptypes (t1
, t2
, strict
);
1439 #ifdef ENABLE_CHECKING
1440 if (USE_CANONICAL_TYPES
)
1442 bool result
= structural_comptypes (t1
, t2
, strict
);
1444 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1445 /* The two types are structurally equivalent, but their
1446 canonical types were different. This is a failure of the
1447 canonical type propagation code.*/
1449 ("canonical types differ for identical types %T and %T",
1451 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1452 /* Two types are structurally different, but the canonical
1453 types are the same. This means we were over-eager in
1454 assigning canonical types. */
1456 ("same canonical type node for different types %T and %T",
1462 if (USE_CANONICAL_TYPES
)
1463 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1466 return structural_comptypes (t1
, t2
, strict
);
1468 else if (strict
== COMPARE_STRUCTURAL
)
1469 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1471 return structural_comptypes (t1
, t2
, strict
);
1474 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1477 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1479 int q1
= cp_type_quals (type1
);
1480 int q2
= cp_type_quals (type2
);
1482 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1483 return (q1
& q2
) == q2
;
1486 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1487 more cv-qualified that TYPE1, and 0 otherwise. */
1490 comp_cv_qualification (const_tree type1
, const_tree type2
)
1492 int q1
= cp_type_quals (type1
);
1493 int q2
= cp_type_quals (type2
);
1498 if ((q1
& q2
) == q2
)
1500 else if ((q1
& q2
) == q1
)
1506 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1507 subset of the cv-qualification signature of TYPE2, and the types
1508 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1511 comp_cv_qual_signature (tree type1
, tree type2
)
1513 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1515 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1521 /* Subroutines of `comptypes'. */
1523 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1524 equivalent in the sense that functions with those parameter types
1525 can have equivalent types. The two lists must be equivalent,
1526 element by element. */
1529 compparms (const_tree parms1
, const_tree parms2
)
1533 /* An unspecified parmlist matches any specified parmlist
1534 whose argument types don't need default promotions. */
1536 for (t1
= parms1
, t2
= parms2
;
1538 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1540 /* If one parmlist is shorter than the other,
1541 they fail to match. */
1544 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1551 /* Process a sizeof or alignof expression where the operand is a
1555 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1560 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1561 if (type
== error_mark_node
)
1562 return error_mark_node
;
1564 type
= non_reference (type
);
1565 if (TREE_CODE (type
) == METHOD_TYPE
)
1568 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
1569 "invalid application of %qs to a member function",
1570 operator_name_info
[(int) op
].name
);
1571 value
= size_one_node
;
1574 dependent_p
= dependent_type_p (type
);
1576 complete_type (type
);
1578 /* VLA types will have a non-constant size. In the body of an
1579 uninstantiated template, we don't need to try to compute the
1580 value, because the sizeof expression is not an integral
1581 constant expression in that case. And, if we do try to
1582 compute the value, we'll likely end up with SAVE_EXPRs, which
1583 the template substitution machinery does not expect to see. */
1584 || (processing_template_decl
1585 && COMPLETE_TYPE_P (type
)
1586 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1588 value
= build_min (op
, size_type_node
, type
);
1589 TREE_READONLY (value
) = 1;
1593 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1598 /* Return the size of the type, without producing any warnings for
1599 types whose size cannot be taken. This routine should be used only
1600 in some other routine that has already produced a diagnostic about
1601 using the size of such a type. */
1603 cxx_sizeof_nowarn (tree type
)
1605 if (TREE_CODE (type
) == FUNCTION_TYPE
1606 || TREE_CODE (type
) == VOID_TYPE
1607 || TREE_CODE (type
) == ERROR_MARK
)
1608 return size_one_node
;
1609 else if (!COMPLETE_TYPE_P (type
))
1610 return size_zero_node
;
1612 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1615 /* Process a sizeof expression where the operand is an expression. */
1618 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1620 if (e
== error_mark_node
)
1621 return error_mark_node
;
1623 if (processing_template_decl
)
1625 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1626 TREE_SIDE_EFFECTS (e
) = 0;
1627 TREE_READONLY (e
) = 1;
1632 /* To get the size of a static data member declared as an array of
1633 unknown bound, we need to instantiate it. */
1634 if (TREE_CODE (e
) == VAR_DECL
1635 && VAR_HAD_UNKNOWN_BOUND (e
)
1636 && DECL_TEMPLATE_INSTANTIATION (e
))
1637 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1639 e
= mark_type_use (e
);
1641 if (TREE_CODE (e
) == COMPONENT_REF
1642 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1643 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1645 if (complain
& tf_error
)
1646 error ("invalid application of %<sizeof%> to a bit-field");
1648 return error_mark_node
;
1651 else if (is_overloaded_fn (e
))
1653 if (complain
& tf_error
)
1654 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1657 return error_mark_node
;
1660 else if (type_unknown_p (e
))
1662 if (complain
& tf_error
)
1663 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1665 return error_mark_node
;
1671 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1674 /* Implement the __alignof keyword: Return the minimum required
1675 alignment of E, measured in bytes. For VAR_DECL's and
1676 FIELD_DECL's return DECL_ALIGN (which can be set from an
1677 "aligned" __attribute__ specification). */
1680 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1684 if (e
== error_mark_node
)
1685 return error_mark_node
;
1687 if (processing_template_decl
)
1689 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1690 TREE_SIDE_EFFECTS (e
) = 0;
1691 TREE_READONLY (e
) = 1;
1696 e
= mark_type_use (e
);
1698 if (TREE_CODE (e
) == VAR_DECL
)
1699 t
= size_int (DECL_ALIGN_UNIT (e
));
1700 else if (TREE_CODE (e
) == COMPONENT_REF
1701 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1702 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1704 if (complain
& tf_error
)
1705 error ("invalid application of %<__alignof%> to a bit-field");
1707 return error_mark_node
;
1710 else if (TREE_CODE (e
) == COMPONENT_REF
1711 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1712 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1713 else if (is_overloaded_fn (e
))
1715 if (complain
& tf_error
)
1716 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1719 return error_mark_node
;
1720 if (TREE_CODE (e
) == FUNCTION_DECL
)
1721 t
= size_int (DECL_ALIGN_UNIT (e
));
1725 else if (type_unknown_p (e
))
1727 if (complain
& tf_error
)
1728 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1730 return error_mark_node
;
1734 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1735 complain
& tf_error
);
1737 return fold_convert (size_type_node
, t
);
1740 /* Process a sizeof or alignof expression E with code OP where the operand
1741 is an expression. */
1744 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1746 if (op
== SIZEOF_EXPR
)
1747 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1749 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1752 /* EXPR is being used in a context that is not a function call.
1757 The expression can be used only as the left-hand operand of a
1758 member function call.
1760 [expr.mptr.operator]
1762 If the result of .* or ->* is a function, then that result can be
1763 used only as the operand for the function call operator ().
1765 by issuing an error message if appropriate. Returns true iff EXPR
1766 violates these rules. */
1769 invalid_nonstatic_memfn_p (const_tree expr
, tsubst_flags_t complain
)
1771 if (expr
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1773 if (complain
& tf_error
)
1774 error ("invalid use of non-static member function");
1780 /* If EXP is a reference to a bitfield, and the type of EXP does not
1781 match the declared type of the bitfield, return the declared type
1782 of the bitfield. Otherwise, return NULL_TREE. */
1785 is_bitfield_expr_with_lowered_type (const_tree exp
)
1787 switch (TREE_CODE (exp
))
1790 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1791 ? TREE_OPERAND (exp
, 1)
1792 : TREE_OPERAND (exp
, 0)))
1794 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1797 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1801 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1807 field
= TREE_OPERAND (exp
, 1);
1808 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1810 if (same_type_ignoring_top_level_qualifiers_p
1811 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1813 return DECL_BIT_FIELD_TYPE (field
);
1817 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1818 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1819 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1827 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1828 bitfield with a lowered type, the type of EXP is returned, rather
1832 unlowered_expr_type (const_tree exp
)
1836 type
= is_bitfield_expr_with_lowered_type (exp
);
1838 type
= TREE_TYPE (exp
);
1843 /* Perform the conversions in [expr] that apply when an lvalue appears
1844 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1845 function-to-pointer conversions. In addition, manifest constants
1846 are replaced by their values, and bitfield references are converted
1847 to their declared types. Note that this function does not perform the
1848 lvalue-to-rvalue conversion for class types. If you need that conversion
1849 to for class types, then you probably need to use force_rvalue.
1851 Although the returned value is being used as an rvalue, this
1852 function does not wrap the returned expression in a
1853 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1854 that the return value is no longer an lvalue. */
1857 decay_conversion (tree exp
)
1860 enum tree_code code
;
1862 type
= TREE_TYPE (exp
);
1863 if (type
== error_mark_node
)
1864 return error_mark_node
;
1866 exp
= mark_rvalue_use (exp
);
1868 exp
= resolve_nondeduced_context (exp
);
1869 if (type_unknown_p (exp
))
1871 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1872 return error_mark_node
;
1875 exp
= decl_constant_value (exp
);
1876 if (error_operand_p (exp
))
1877 return error_mark_node
;
1879 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1880 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1881 code
= TREE_CODE (type
);
1882 if (code
== VOID_TYPE
)
1884 error ("void value not ignored as it ought to be");
1885 return error_mark_node
;
1887 if (invalid_nonstatic_memfn_p (exp
, tf_warning_or_error
))
1888 return error_mark_node
;
1889 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1890 return cp_build_unary_op (ADDR_EXPR
, exp
, 0, tf_warning_or_error
);
1891 if (code
== ARRAY_TYPE
)
1896 if (TREE_CODE (exp
) == INDIRECT_REF
)
1897 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1898 TREE_OPERAND (exp
, 0));
1900 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1902 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1903 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1904 TREE_OPERAND (exp
, 0), op1
);
1908 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1910 error ("invalid use of non-lvalue array");
1911 return error_mark_node
;
1914 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1916 if (TREE_CODE (exp
) == VAR_DECL
)
1918 if (!cxx_mark_addressable (exp
))
1919 return error_mark_node
;
1920 adr
= build_nop (ptrtype
, build_address (exp
));
1923 /* This way is better for a COMPONENT_REF since it can
1924 simplify the offset for a component. */
1925 adr
= cp_build_unary_op (ADDR_EXPR
, exp
, 1, tf_warning_or_error
);
1926 return cp_convert (ptrtype
, adr
);
1929 /* If a bitfield is used in a context where integral promotion
1930 applies, then the caller is expected to have used
1931 default_conversion. That function promotes bitfields correctly
1932 before calling this function. At this point, if we have a
1933 bitfield referenced, we may assume that is not subject to
1934 promotion, and that, therefore, the type of the resulting rvalue
1935 is the declared type of the bitfield. */
1936 exp
= convert_bitfield_to_declared_type (exp
);
1938 /* We do not call rvalue() here because we do not want to wrap EXP
1939 in a NON_LVALUE_EXPR. */
1943 Non-class rvalues always have cv-unqualified types. */
1944 type
= TREE_TYPE (exp
);
1945 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
1946 exp
= build_nop (cv_unqualified (type
), exp
);
1951 /* Perform preparatory conversions, as part of the "usual arithmetic
1952 conversions". In particular, as per [expr]:
1954 Whenever an lvalue expression appears as an operand of an
1955 operator that expects the rvalue for that operand, the
1956 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1957 standard conversions are applied to convert the expression to an
1960 In addition, we perform integral promotions here, as those are
1961 applied to both operands to a binary operator before determining
1962 what additional conversions should apply. */
1965 default_conversion (tree exp
)
1967 /* Check for target-specific promotions. */
1968 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
1970 exp
= cp_convert (promoted_type
, exp
);
1971 /* Perform the integral promotions first so that bitfield
1972 expressions (which may promote to "int", even if the bitfield is
1973 declared "unsigned") are promoted correctly. */
1974 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
1975 exp
= perform_integral_promotions (exp
);
1976 /* Perform the other conversions. */
1977 exp
= decay_conversion (exp
);
1982 /* EXPR is an expression with an integral or enumeration type.
1983 Perform the integral promotions in [conv.prom], and return the
1987 perform_integral_promotions (tree expr
)
1992 expr
= mark_rvalue_use (expr
);
1996 If the bitfield has an enumerated type, it is treated as any
1997 other value of that type for promotion purposes. */
1998 type
= is_bitfield_expr_with_lowered_type (expr
);
1999 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
2000 type
= TREE_TYPE (expr
);
2001 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
2002 promoted_type
= type_promotes_to (type
);
2003 if (type
!= promoted_type
)
2004 expr
= cp_convert (promoted_type
, expr
);
2008 /* Returns nonzero iff exp is a STRING_CST or the result of applying
2009 decay_conversion to one. */
2012 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
2016 if (TREE_CODE (totype
) != POINTER_TYPE
)
2019 t
= TREE_TYPE (totype
);
2020 if (!same_type_p (t
, char_type_node
)
2021 && !same_type_p (t
, char16_type_node
)
2022 && !same_type_p (t
, char32_type_node
)
2023 && !same_type_p (t
, wchar_type_node
))
2026 if (TREE_CODE (exp
) == STRING_CST
)
2028 /* Make sure that we don't try to convert between char and wide chars. */
2029 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
2034 /* Is this a string constant which has decayed to 'const char *'? */
2035 t
= build_pointer_type (build_qualified_type (t
, TYPE_QUAL_CONST
));
2036 if (!same_type_p (TREE_TYPE (exp
), t
))
2039 if (TREE_CODE (exp
) != ADDR_EXPR
2040 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2044 /* This warning is not very useful, as it complains about printf. */
2046 warning (OPT_Wwrite_strings
,
2047 "deprecated conversion from string constant to %qT",
2053 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2054 can, for example, use as an lvalue. This code used to be in
2055 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2056 expressions, where we're dealing with aggregates. But now it's again only
2057 called from unary_complex_lvalue. The case (in particular) that led to
2058 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2062 rationalize_conditional_expr (enum tree_code code
, tree t
,
2063 tsubst_flags_t complain
)
2065 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2066 the first operand is always the one to be used if both operands
2067 are equal, so we know what conditional expression this used to be. */
2068 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2070 tree op0
= TREE_OPERAND (t
, 0);
2071 tree op1
= TREE_OPERAND (t
, 1);
2073 /* The following code is incorrect if either operand side-effects. */
2074 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2075 && !TREE_SIDE_EFFECTS (op1
));
2077 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
2078 ? LE_EXPR
: GE_EXPR
),
2079 op0
, TREE_CODE (op0
),
2080 op1
, TREE_CODE (op1
),
2081 /*overloaded_p=*/NULL
,
2083 cp_build_unary_op (code
, op0
, 0, complain
),
2084 cp_build_unary_op (code
, op1
, 0, complain
),
2089 build_conditional_expr (TREE_OPERAND (t
, 0),
2090 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2092 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2097 /* Given the TYPE of an anonymous union field inside T, return the
2098 FIELD_DECL for the field. If not found return NULL_TREE. Because
2099 anonymous unions can nest, we must also search all anonymous unions
2100 that are directly reachable. */
2103 lookup_anon_field (tree t
, tree type
)
2107 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
2109 if (TREE_STATIC (field
))
2111 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2114 /* If we find it directly, return the field. */
2115 if (DECL_NAME (field
) == NULL_TREE
2116 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2121 /* Otherwise, it could be nested, search harder. */
2122 if (DECL_NAME (field
) == NULL_TREE
2123 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2125 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2133 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2134 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2135 non-NULL, it indicates the path to the base used to name MEMBER.
2136 If PRESERVE_REFERENCE is true, the expression returned will have
2137 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2138 returned will have the type referred to by the reference.
2140 This function does not perform access control; that is either done
2141 earlier by the parser when the name of MEMBER is resolved to MEMBER
2142 itself, or later when overload resolution selects one of the
2143 functions indicated by MEMBER. */
2146 build_class_member_access_expr (tree object
, tree member
,
2147 tree access_path
, bool preserve_reference
,
2148 tsubst_flags_t complain
)
2152 tree result
= NULL_TREE
;
2154 if (error_operand_p (object
) || error_operand_p (member
))
2155 return error_mark_node
;
2157 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2161 The type of the first expression shall be "class object" (of a
2163 object_type
= TREE_TYPE (object
);
2164 if (!currently_open_class (object_type
)
2165 && !complete_type_or_else (object_type
, object
))
2166 return error_mark_node
;
2167 if (!CLASS_TYPE_P (object_type
))
2169 if (complain
& tf_error
)
2170 error ("request for member %qD in %qE, which is of non-class type %qT",
2171 member
, object
, object_type
);
2172 return error_mark_node
;
2175 /* The standard does not seem to actually say that MEMBER must be a
2176 member of OBJECT_TYPE. However, that is clearly what is
2178 if (DECL_P (member
))
2180 member_scope
= DECL_CLASS_CONTEXT (member
);
2182 if (TREE_DEPRECATED (member
))
2183 warn_deprecated_use (member
, NULL_TREE
);
2186 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2187 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2188 presently be the anonymous union. Go outwards until we find a
2189 type related to OBJECT_TYPE. */
2190 while (ANON_AGGR_TYPE_P (member_scope
)
2191 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2193 member_scope
= TYPE_CONTEXT (member_scope
);
2194 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2196 if (complain
& tf_error
)
2198 if (TREE_CODE (member
) == FIELD_DECL
)
2199 error ("invalid use of nonstatic data member %qE", member
);
2201 error ("%qD is not a member of %qT", member
, object_type
);
2203 return error_mark_node
;
2206 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2207 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2208 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2210 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2212 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2215 /* In [expr.ref], there is an explicit list of the valid choices for
2216 MEMBER. We check for each of those cases here. */
2217 if (TREE_CODE (member
) == VAR_DECL
)
2219 /* A static data member. */
2221 /* If OBJECT has side-effects, they are supposed to occur. */
2222 if (TREE_SIDE_EFFECTS (object
))
2223 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2225 else if (TREE_CODE (member
) == FIELD_DECL
)
2227 /* A non-static data member. */
2232 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
2233 && integer_zerop (TREE_OPERAND (object
, 0)));
2235 /* Convert OBJECT to the type of MEMBER. */
2236 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2237 TYPE_MAIN_VARIANT (member_scope
)))
2242 binfo
= lookup_base (access_path
? access_path
: object_type
,
2243 member_scope
, ba_unique
, &kind
);
2244 if (binfo
== error_mark_node
)
2245 return error_mark_node
;
2247 /* It is invalid to try to get to a virtual base of a
2248 NULL object. The most common cause is invalid use of
2250 if (null_object_p
&& kind
== bk_via_virtual
)
2252 if (complain
& tf_error
)
2254 error ("invalid access to non-static data member %qD of "
2257 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2259 return error_mark_node
;
2262 /* Convert to the base. */
2263 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2265 /* If we found the base successfully then we should be able
2266 to convert to it successfully. */
2267 gcc_assert (object
!= error_mark_node
);
2270 /* Complain about other invalid uses of offsetof, even though they will
2271 give the right answer. Note that we complain whether or not they
2272 actually used the offsetof macro, since there's no way to know at this
2273 point. So we just give a warning, instead of a pedwarn. */
2274 /* Do not produce this warning for base class field references, because
2275 we know for a fact that didn't come from offsetof. This does occur
2276 in various testsuite cases where a null object is passed where a
2277 vtable access is required. */
2278 if (null_object_p
&& warn_invalid_offsetof
2279 && CLASSTYPE_NON_STD_LAYOUT (object_type
)
2280 && !DECL_FIELD_IS_BASE (member
)
2281 && cp_unevaluated_operand
== 0
2282 && (complain
& tf_warning
))
2284 warning (OPT_Winvalid_offsetof
,
2285 "invalid access to non-static data member %qD "
2286 " of NULL object", member
);
2287 warning (OPT_Winvalid_offsetof
,
2288 "(perhaps the %<offsetof%> macro was used incorrectly)");
2291 /* If MEMBER is from an anonymous aggregate, we have converted
2292 OBJECT so that it refers to the class containing the
2293 anonymous union. Generate a reference to the anonymous union
2294 itself, and recur to find MEMBER. */
2295 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2296 /* When this code is called from build_field_call, the
2297 object already has the type of the anonymous union.
2298 That is because the COMPONENT_REF was already
2299 constructed, and was then disassembled before calling
2300 build_field_call. After the function-call code is
2301 cleaned up, this waste can be eliminated. */
2302 && (!same_type_ignoring_top_level_qualifiers_p
2303 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2305 tree anonymous_union
;
2307 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2308 DECL_CONTEXT (member
));
2309 object
= build_class_member_access_expr (object
,
2311 /*access_path=*/NULL_TREE
,
2316 /* Compute the type of the field, as described in [expr.ref]. */
2317 type_quals
= TYPE_UNQUALIFIED
;
2318 member_type
= TREE_TYPE (member
);
2319 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2321 type_quals
= (cp_type_quals (member_type
)
2322 | cp_type_quals (object_type
));
2324 /* A field is const (volatile) if the enclosing object, or the
2325 field itself, is const (volatile). But, a mutable field is
2326 not const, even within a const object. */
2327 if (DECL_MUTABLE_P (member
))
2328 type_quals
&= ~TYPE_QUAL_CONST
;
2329 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2332 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
2334 result
= fold_if_not_in_template (result
);
2336 /* Mark the expression const or volatile, as appropriate. Even
2337 though we've dealt with the type above, we still have to mark the
2338 expression itself. */
2339 if (type_quals
& TYPE_QUAL_CONST
)
2340 TREE_READONLY (result
) = 1;
2341 if (type_quals
& TYPE_QUAL_VOLATILE
)
2342 TREE_THIS_VOLATILE (result
) = 1;
2344 else if (BASELINK_P (member
))
2346 /* The member is a (possibly overloaded) member function. */
2350 /* If the MEMBER is exactly one static member function, then we
2351 know the type of the expression. Otherwise, we must wait
2352 until overload resolution has been performed. */
2353 functions
= BASELINK_FUNCTIONS (member
);
2354 if (TREE_CODE (functions
) == FUNCTION_DECL
2355 && DECL_STATIC_FUNCTION_P (functions
))
2356 type
= TREE_TYPE (functions
);
2358 type
= unknown_type_node
;
2359 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2360 base. That will happen when the function is called. */
2361 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2363 else if (TREE_CODE (member
) == CONST_DECL
)
2365 /* The member is an enumerator. */
2367 /* If OBJECT has side-effects, they are supposed to occur. */
2368 if (TREE_SIDE_EFFECTS (object
))
2369 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2374 if (complain
& tf_error
)
2375 error ("invalid use of %qD", member
);
2376 return error_mark_node
;
2379 if (!preserve_reference
)
2382 If E2 is declared to have type "reference to T", then ... the
2383 type of E1.E2 is T. */
2384 result
= convert_from_reference (result
);
2389 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2390 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2393 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2395 tree object_type
= TREE_TYPE (object
);
2396 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2399 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2401 error ("qualified type %qT does not match destructor name ~%qT",
2403 return error_mark_node
;
2405 if (TREE_CODE (dtor_type
) == IDENTIFIER_NODE
)
2407 /* In a template, names we can't find a match for are still accepted
2408 destructor names, and we check them here. */
2409 if (check_dtor_name (object_type
, dtor_type
))
2410 dtor_type
= object_type
;
2413 error ("object type %qT does not match destructor name ~%qT",
2414 object_type
, dtor_type
);
2415 return error_mark_node
;
2419 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2421 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2422 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2423 return error_mark_node
;
2425 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2426 /*protect=*/1, /*want_type=*/false);
2427 expr
= (adjust_result_of_qualified_name_lookup
2428 (expr
, dtor_type
, object_type
));
2432 /* An expression of the form "A::template B" has been resolved to
2433 DECL. Issue a diagnostic if B is not a template or template
2437 check_template_keyword (tree decl
)
2439 /* The standard says:
2443 If a name prefixed by the keyword template is not a member
2444 template, the program is ill-formed.
2446 DR 228 removed the restriction that the template be a member
2449 DR 96, if accepted would add the further restriction that explicit
2450 template arguments must be provided if the template keyword is
2451 used, but, as of 2005-10-16, that DR is still in "drafting". If
2452 this DR is accepted, then the semantic checks here can be
2453 simplified, as the entity named must in fact be a template
2454 specialization, rather than, as at present, a set of overloaded
2455 functions containing at least one template function. */
2456 if (TREE_CODE (decl
) != TEMPLATE_DECL
2457 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2459 if (!is_overloaded_fn (decl
))
2460 permerror (input_location
, "%qD is not a template", decl
);
2465 if (BASELINK_P (fns
))
2466 fns
= BASELINK_FUNCTIONS (fns
);
2469 tree fn
= OVL_CURRENT (fns
);
2470 if (TREE_CODE (fn
) == TEMPLATE_DECL
2471 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2473 if (TREE_CODE (fn
) == FUNCTION_DECL
2474 && DECL_USE_TEMPLATE (fn
)
2475 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2477 fns
= OVL_NEXT (fns
);
2480 permerror (input_location
, "%qD is not a template", decl
);
2485 /* This function is called by the parser to process a class member
2486 access expression of the form OBJECT.NAME. NAME is a node used by
2487 the parser to represent a name; it is not yet a DECL. It may,
2488 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2489 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2490 there is no reason to do the lookup twice, so the parser keeps the
2491 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2492 be a template via the use of the "A::template B" syntax. */
2495 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2496 tsubst_flags_t complain
)
2501 tree access_path
= NULL_TREE
;
2502 tree orig_object
= object
;
2503 tree orig_name
= name
;
2505 if (object
== error_mark_node
|| name
== error_mark_node
)
2506 return error_mark_node
;
2508 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2509 if (!objc_is_public (object
, name
))
2510 return error_mark_node
;
2512 object_type
= TREE_TYPE (object
);
2514 if (processing_template_decl
)
2516 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2517 dependent_type_p (object_type
)
2518 /* If NAME is just an IDENTIFIER_NODE, then the expression
2520 || TREE_CODE (object
) == IDENTIFIER_NODE
2521 /* If NAME is "f<args>", where either 'f' or 'args' is
2522 dependent, then the expression is dependent. */
2523 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2524 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2525 TREE_OPERAND (name
, 1)))
2526 /* If NAME is "T::X" where "T" is dependent, then the
2527 expression is dependent. */
2528 || (TREE_CODE (name
) == SCOPE_REF
2529 && TYPE_P (TREE_OPERAND (name
, 0))
2530 && dependent_type_p (TREE_OPERAND (name
, 0))))
2531 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2532 object
= build_non_dependent_expr (object
);
2537 The type of the first expression shall be "class object" (of a
2539 if (!currently_open_class (object_type
)
2540 && !complete_type_or_else (object_type
, object
))
2541 return error_mark_node
;
2542 if (!CLASS_TYPE_P (object_type
))
2544 if (complain
& tf_error
)
2545 error ("request for member %qD in %qE, which is of non-class type %qT",
2546 name
, object
, object_type
);
2547 return error_mark_node
;
2550 if (BASELINK_P (name
))
2551 /* A member function that has already been looked up. */
2555 bool is_template_id
= false;
2556 tree template_args
= NULL_TREE
;
2559 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2561 is_template_id
= true;
2562 template_args
= TREE_OPERAND (name
, 1);
2563 name
= TREE_OPERAND (name
, 0);
2565 if (TREE_CODE (name
) == OVERLOAD
)
2566 name
= DECL_NAME (get_first_fn (name
));
2567 else if (DECL_P (name
))
2568 name
= DECL_NAME (name
);
2571 if (TREE_CODE (name
) == SCOPE_REF
)
2573 /* A qualified name. The qualifying class or namespace `S'
2574 has already been looked up; it is either a TYPE or a
2576 scope
= TREE_OPERAND (name
, 0);
2577 name
= TREE_OPERAND (name
, 1);
2579 /* If SCOPE is a namespace, then the qualified name does not
2580 name a member of OBJECT_TYPE. */
2581 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2583 if (complain
& tf_error
)
2584 error ("%<%D::%D%> is not a member of %qT",
2585 scope
, name
, object_type
);
2586 return error_mark_node
;
2589 gcc_assert (CLASS_TYPE_P (scope
));
2590 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2591 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2593 if (constructor_name_p (name
, scope
))
2595 if (complain
& tf_error
)
2596 error ("cannot call constructor %<%T::%D%> directly",
2598 return error_mark_node
;
2601 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2602 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2603 if (access_path
== error_mark_node
)
2604 return error_mark_node
;
2607 if (complain
& tf_error
)
2608 error ("%qT is not a base of %qT", scope
, object_type
);
2609 return error_mark_node
;
2615 access_path
= object_type
;
2618 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2619 member
= lookup_destructor (object
, scope
, name
);
2622 /* Look up the member. */
2623 member
= lookup_member (access_path
, name
, /*protect=*/1,
2624 /*want_type=*/false);
2625 if (member
== NULL_TREE
)
2627 if (complain
& tf_error
)
2628 error ("%qD has no member named %qE", object_type
, name
);
2629 return error_mark_node
;
2631 if (member
== error_mark_node
)
2632 return error_mark_node
;
2637 tree templ
= member
;
2639 if (BASELINK_P (templ
))
2640 templ
= lookup_template_function (templ
, template_args
);
2643 if (complain
& tf_error
)
2644 error ("%qD is not a member template function", name
);
2645 return error_mark_node
;
2650 if (TREE_DEPRECATED (member
))
2651 warn_deprecated_use (member
, NULL_TREE
);
2654 check_template_keyword (member
);
2656 expr
= build_class_member_access_expr (object
, member
, access_path
,
2657 /*preserve_reference=*/false,
2659 if (processing_template_decl
&& expr
!= error_mark_node
)
2661 if (BASELINK_P (member
))
2663 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2664 BASELINK_QUALIFIED_P (member
) = 1;
2667 return build_min_non_dep (COMPONENT_REF
, expr
,
2668 orig_object
, orig_name
,
2675 /* Return an expression for the MEMBER_NAME field in the internal
2676 representation of PTRMEM, a pointer-to-member function. (Each
2677 pointer-to-member function type gets its own RECORD_TYPE so it is
2678 more convenient to access the fields by name than by FIELD_DECL.)
2679 This routine converts the NAME to a FIELD_DECL and then creates the
2680 node for the complete expression. */
2683 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2689 /* This code is a stripped down version of
2690 build_class_member_access_expr. It does not work to use that
2691 routine directly because it expects the object to be of class
2693 ptrmem_type
= TREE_TYPE (ptrmem
);
2694 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2695 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2696 /*want_type=*/false);
2697 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2698 cp_type_quals (ptrmem_type
));
2699 return fold_build3_loc (input_location
,
2700 COMPONENT_REF
, member_type
,
2701 ptrmem
, member
, NULL_TREE
);
2704 /* Given an expression PTR for a pointer, return an expression
2705 for the value pointed to.
2706 ERRORSTRING is the name of the operator to appear in error messages.
2708 This function may need to overload OPERATOR_FNNAME.
2709 Must also handle REFERENCE_TYPEs for C++. */
2712 build_x_indirect_ref (tree expr
, ref_operator errorstring
,
2713 tsubst_flags_t complain
)
2715 tree orig_expr
= expr
;
2718 if (processing_template_decl
)
2720 /* Retain the type if we know the operand is a pointer so that
2721 describable_type doesn't make auto deduction break. */
2722 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2723 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2724 if (type_dependent_expression_p (expr
))
2725 return build_min_nt (INDIRECT_REF
, expr
);
2726 expr
= build_non_dependent_expr (expr
);
2729 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2730 NULL_TREE
, /*overloaded_p=*/NULL
, complain
);
2732 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2734 if (processing_template_decl
&& rval
!= error_mark_node
)
2735 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2740 /* Helper function called from c-common. */
2742 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2743 tree ptr
, ref_operator errorstring
)
2745 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2749 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2750 tsubst_flags_t complain
)
2754 if (ptr
== error_mark_node
)
2755 return error_mark_node
;
2757 if (ptr
== current_class_ptr
)
2758 return current_class_ref
;
2760 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2761 ? ptr
: decay_conversion (ptr
));
2762 type
= TREE_TYPE (pointer
);
2764 if (POINTER_TYPE_P (type
))
2768 If the type of the expression is "pointer to T," the type
2769 of the result is "T." */
2770 tree t
= TREE_TYPE (type
);
2772 if (CONVERT_EXPR_P (ptr
)
2773 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2775 /* If a warning is issued, mark it to avoid duplicates from
2776 the backend. This only needs to be done at
2777 warn_strict_aliasing > 2. */
2778 if (warn_strict_aliasing
> 2)
2779 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2780 type
, TREE_OPERAND (ptr
, 0)))
2781 TREE_NO_WARNING (ptr
) = 1;
2784 if (VOID_TYPE_P (t
))
2786 /* A pointer to incomplete type (other than cv void) can be
2787 dereferenced [expr.unary.op]/1 */
2788 if (complain
& tf_error
)
2789 error ("%qT is not a pointer-to-object type", type
);
2790 return error_mark_node
;
2792 else if (TREE_CODE (pointer
) == ADDR_EXPR
2793 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2794 /* The POINTER was something like `&x'. We simplify `*&x' to
2796 return TREE_OPERAND (pointer
, 0);
2799 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2801 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2802 so that we get the proper error message if the result is used
2803 to assign to. Also, &* is supposed to be a no-op. */
2804 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2805 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2806 TREE_SIDE_EFFECTS (ref
)
2807 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2811 else if (!(complain
& tf_error
))
2812 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2814 /* `pointer' won't be an error_mark_node if we were given a
2815 pointer to member, so it's cool to check for this here. */
2816 else if (TYPE_PTR_TO_MEMBER_P (type
))
2817 switch (errorstring
)
2819 case RO_ARRAY_INDEXING
:
2820 error ("invalid use of array indexing on pointer to member");
2823 error ("invalid use of unary %<*%> on pointer to member");
2825 case RO_IMPLICIT_CONVERSION
:
2826 error ("invalid use of implicit conversion on pointer to member");
2831 else if (pointer
!= error_mark_node
)
2832 switch (errorstring
)
2835 error ("invalid type argument");
2837 case RO_ARRAY_INDEXING
:
2838 error ("invalid type argument of array indexing");
2841 error ("invalid type argument of unary %<*%>");
2843 case RO_IMPLICIT_CONVERSION
:
2844 error ("invalid type argument of implicit conversion");
2849 return error_mark_node
;
2852 /* This handles expressions of the form "a[i]", which denotes
2855 This is logically equivalent in C to *(a+i), but we may do it differently.
2856 If A is a variable or a member, we generate a primitive ARRAY_REF.
2857 This avoids forcing the array out of registers, and can work on
2858 arrays that are not lvalues (for example, members of structures returned
2861 If INDEX is of some user-defined type, it must be converted to
2862 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2863 will inherit the type of the array, which will be some pointer type.
2865 LOC is the location to use in building the array reference. */
2868 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
2869 tsubst_flags_t complain
)
2875 if (complain
& tf_error
)
2876 error_at (loc
, "subscript missing in array reference");
2877 return error_mark_node
;
2880 if (TREE_TYPE (array
) == error_mark_node
2881 || TREE_TYPE (idx
) == error_mark_node
)
2882 return error_mark_node
;
2884 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2886 switch (TREE_CODE (array
))
2890 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2892 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2893 TREE_OPERAND (array
, 0), value
);
2894 SET_EXPR_LOCATION (ret
, loc
);
2899 ret
= build_conditional_expr
2900 (TREE_OPERAND (array
, 0),
2901 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2903 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
2905 tf_warning_or_error
);
2906 protected_set_expr_location (ret
, loc
);
2913 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2917 warn_array_subscript_with_type_char (idx
);
2919 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2921 if (complain
& tf_error
)
2922 error_at (loc
, "array subscript is not an integer");
2923 return error_mark_node
;
2926 /* Apply integral promotions *after* noticing character types.
2927 (It is unclear why we do these promotions -- the standard
2928 does not say that we should. In fact, the natural thing would
2929 seem to be to convert IDX to ptrdiff_t; we're performing
2930 pointer arithmetic.) */
2931 idx
= perform_integral_promotions (idx
);
2933 /* An array that is indexed by a non-constant
2934 cannot be stored in a register; we must be able to do
2935 address arithmetic on its address.
2936 Likewise an array of elements of variable size. */
2937 if (TREE_CODE (idx
) != INTEGER_CST
2938 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2939 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2942 if (!cxx_mark_addressable (array
))
2943 return error_mark_node
;
2946 /* An array that is indexed by a constant value which is not within
2947 the array bounds cannot be stored in a register either; because we
2948 would get a crash in store_bit_field/extract_bit_field when trying
2949 to access a non-existent part of the register. */
2950 if (TREE_CODE (idx
) == INTEGER_CST
2951 && TYPE_DOMAIN (TREE_TYPE (array
))
2952 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
2954 if (!cxx_mark_addressable (array
))
2955 return error_mark_node
;
2958 if (!lvalue_p (array
) && (complain
& tf_error
))
2959 pedwarn (loc
, OPT_pedantic
,
2960 "ISO C++ forbids subscripting non-lvalue array");
2962 /* Note in C++ it is valid to subscript a `register' array, since
2963 it is valid to take the address of something with that
2964 storage specification. */
2968 while (TREE_CODE (foo
) == COMPONENT_REF
)
2969 foo
= TREE_OPERAND (foo
, 0);
2970 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
)
2971 && (complain
& tf_warning
))
2972 warning_at (loc
, OPT_Wextra
,
2973 "subscripting array declared %<register%>");
2976 type
= TREE_TYPE (TREE_TYPE (array
));
2977 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
2978 /* Array ref is const/volatile if the array elements are
2979 or if the array is.. */
2980 TREE_READONLY (rval
)
2981 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
2982 TREE_SIDE_EFFECTS (rval
)
2983 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
2984 TREE_THIS_VOLATILE (rval
)
2985 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
2986 ret
= require_complete_type (fold_if_not_in_template (rval
));
2987 protected_set_expr_location (ret
, loc
);
2992 tree ar
= default_conversion (array
);
2993 tree ind
= default_conversion (idx
);
2995 /* Put the integer in IND to simplify error checking. */
2996 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
3003 if (ar
== error_mark_node
)
3006 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
3008 if (complain
& tf_error
)
3009 error_at (loc
, "subscripted value is neither array nor pointer");
3010 return error_mark_node
;
3012 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
3014 if (complain
& tf_error
)
3015 error_at (loc
, "array subscript is not an integer");
3016 return error_mark_node
;
3019 warn_array_subscript_with_type_char (idx
);
3021 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
3026 protected_set_expr_location (ret
, loc
);
3031 /* Entry point for Obj-C++. */
3034 build_array_ref (location_t loc
, tree array
, tree idx
)
3036 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
3039 /* Resolve a pointer to member function. INSTANCE is the object
3040 instance to use, if the member points to a virtual member.
3042 This used to avoid checking for virtual functions if basetype
3043 has no virtual functions, according to an earlier ANSI draft.
3044 With the final ISO C++ rules, such an optimization is
3045 incorrect: A pointer to a derived member can be static_cast
3046 to pointer-to-base-member, as long as the dynamic object
3047 later has the right member. */
3050 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
3052 if (TREE_CODE (function
) == OFFSET_REF
)
3053 function
= TREE_OPERAND (function
, 1);
3055 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3057 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
3058 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3060 tree instance_ptr
= *instance_ptrptr
;
3061 tree instance_save_expr
= 0;
3062 if (instance_ptr
== error_mark_node
)
3064 if (TREE_CODE (function
) == PTRMEM_CST
)
3066 /* Extracting the function address from a pmf is only
3067 allowed with -Wno-pmf-conversions. It only works for
3069 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
3070 e1
= convert (fntype
, e1
);
3075 error ("object missing in use of %qE", function
);
3076 return error_mark_node
;
3080 if (TREE_SIDE_EFFECTS (instance_ptr
))
3081 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3083 if (TREE_SIDE_EFFECTS (function
))
3084 function
= save_expr (function
);
3086 /* Start by extracting all the information from the PMF itself. */
3087 e3
= pfn_from_ptrmemfunc (function
);
3088 delta
= delta_from_ptrmemfunc (function
);
3089 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3090 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3092 case ptrmemfunc_vbit_in_pfn
:
3093 e1
= cp_build_binary_op (input_location
,
3094 BIT_AND_EXPR
, idx
, integer_one_node
,
3095 tf_warning_or_error
);
3096 idx
= cp_build_binary_op (input_location
,
3097 MINUS_EXPR
, idx
, integer_one_node
,
3098 tf_warning_or_error
);
3101 case ptrmemfunc_vbit_in_delta
:
3102 e1
= cp_build_binary_op (input_location
,
3103 BIT_AND_EXPR
, delta
, integer_one_node
,
3104 tf_warning_or_error
);
3105 delta
= cp_build_binary_op (input_location
,
3106 RSHIFT_EXPR
, delta
, integer_one_node
,
3107 tf_warning_or_error
);
3114 /* Convert down to the right base before using the instance. A
3115 special case is that in a pointer to member of class C, C may
3116 be incomplete. In that case, the function will of course be
3117 a member of C, and no conversion is required. In fact,
3118 lookup_base will fail in that case, because incomplete
3119 classes do not have BINFOs. */
3120 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3121 if (!same_type_ignoring_top_level_qualifiers_p
3122 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3124 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3125 basetype
, ba_check
, NULL
);
3126 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3128 if (instance_ptr
== error_mark_node
)
3129 return error_mark_node
;
3131 /* ...and then the delta in the PMF. */
3132 instance_ptr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (instance_ptr
),
3133 instance_ptr
, fold_convert (sizetype
, delta
));
3135 /* Hand back the adjusted 'this' argument to our caller. */
3136 *instance_ptrptr
= instance_ptr
;
3138 /* Next extract the vtable pointer from the object. */
3139 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3141 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, tf_warning_or_error
);
3142 /* If the object is not dynamic the access invokes undefined
3143 behavior. As it is not executed in this case silence the
3144 spurious warnings it may provoke. */
3145 TREE_NO_WARNING (vtbl
) = 1;
3147 /* Finally, extract the function pointer from the vtable. */
3148 e2
= fold_build2_loc (input_location
,
3149 POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
,
3150 fold_convert (sizetype
, idx
));
3151 e2
= cp_build_indirect_ref (e2
, RO_NULL
, tf_warning_or_error
);
3152 TREE_CONSTANT (e2
) = 1;
3154 /* When using function descriptors, the address of the
3155 vtable entry is treated as a function pointer. */
3156 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3157 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3158 cp_build_unary_op (ADDR_EXPR
, e2
, /*noconvert=*/1,
3159 tf_warning_or_error
));
3161 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3162 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
3164 /* Make sure this doesn't get evaluated first inside one of the
3165 branches of the COND_EXPR. */
3166 if (instance_save_expr
)
3167 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3168 instance_save_expr
, e1
);
3175 /* Used by the C-common bits. */
3177 build_function_call (location_t loc ATTRIBUTE_UNUSED
,
3178 tree function
, tree params
)
3180 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3183 /* Used by the C-common bits. */
3185 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED
,
3186 tree function
, VEC(tree
,gc
) *params
,
3187 VEC(tree
,gc
) *origtypes ATTRIBUTE_UNUSED
)
3189 VEC(tree
,gc
) *orig_params
= params
;
3190 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3191 tf_warning_or_error
);
3193 /* cp_build_function_call_vec can reallocate PARAMS by adding
3194 default arguments. That should never happen here. Verify
3196 gcc_assert (params
== orig_params
);
3201 /* Build a function call using a tree list of arguments. */
3204 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3209 vec
= make_tree_vector ();
3210 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3211 VEC_safe_push (tree
, gc
, vec
, TREE_VALUE (params
));
3212 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3213 release_tree_vector (vec
);
3217 /* Build a function call using a vector of arguments. PARAMS may be
3218 NULL if there are no parameters. This changes the contents of
3222 cp_build_function_call_vec (tree function
, VEC(tree
,gc
) **params
,
3223 tsubst_flags_t complain
)
3225 tree fntype
, fndecl
;
3227 tree original
= function
;
3231 VEC(tree
,gc
) *allocated
= NULL
;
3234 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3235 expressions, like those used for ObjC messenger dispatches. */
3236 if (params
!= NULL
&& !VEC_empty (tree
, *params
))
3237 function
= objc_rewrite_function_call (function
,
3238 VEC_index (tree
, *params
, 0));
3240 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3241 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3242 if (TREE_CODE (function
) == NOP_EXPR
3243 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3244 function
= TREE_OPERAND (function
, 0);
3246 if (TREE_CODE (function
) == FUNCTION_DECL
)
3248 mark_used (function
);
3251 /* Convert anything with function type to a pointer-to-function. */
3252 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
3253 pedwarn (input_location
, OPT_pedantic
,
3254 "ISO C++ forbids calling %<::main%> from within program");
3256 function
= build_addr_func (function
);
3262 function
= build_addr_func (function
);
3265 if (function
== error_mark_node
)
3266 return error_mark_node
;
3268 fntype
= TREE_TYPE (function
);
3270 if (TYPE_PTRMEMFUNC_P (fntype
))
3272 if (complain
& tf_error
)
3273 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3274 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3275 original
, original
);
3276 return error_mark_node
;
3279 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
3280 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3282 if (!((TREE_CODE (fntype
) == POINTER_TYPE
3283 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
3285 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3287 if (complain
& tf_error
)
3288 error ("%qE cannot be used as a function", original
);
3289 return error_mark_node
;
3292 /* fntype now gets the type of function pointed to. */
3293 fntype
= TREE_TYPE (fntype
);
3294 parm_types
= TYPE_ARG_TYPES (fntype
);
3298 allocated
= make_tree_vector ();
3299 params
= &allocated
;
3302 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3305 return error_mark_node
;
3307 argarray
= VEC_address (tree
, *params
);
3309 /* Check for errors in format strings and inappropriately
3311 check_function_arguments (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
,
3314 ret
= build_cxx_call (function
, nargs
, argarray
);
3316 if (allocated
!= NULL
)
3317 release_tree_vector (allocated
);
3322 /* Subroutine of convert_arguments.
3323 Warn about wrong number of args are genereted. */
3326 warn_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3330 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3332 if (DECL_NAME (fndecl
) == NULL_TREE
3333 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3336 ? G_("too many arguments to constructor %q#D")
3337 : G_("too few arguments to constructor %q#D"),
3342 ? G_("too many arguments to member function %q#D")
3343 : G_("too few arguments to member function %q#D"),
3349 ? G_("too many arguments to function %q#D")
3350 : G_("too few arguments to function %q#D"),
3352 inform (DECL_SOURCE_LOCATION (fndecl
),
3356 error_at (loc
, too_many_p
? G_("too many arguments to function")
3357 : G_("too few arguments to function"));
3360 /* Convert the actual parameter expressions in the list VALUES to the
3361 types in the list TYPELIST. The converted expressions are stored
3362 back in the VALUES vector.
3363 If parmdecls is exhausted, or when an element has NULL as its type,
3364 perform the default conversions.
3366 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3368 This is also where warnings about wrong number of args are generated.
3370 Returns the actual number of arguments processed (which might be less
3371 than the length of the vector), or -1 on error.
3373 In C++, unspecified trailing parameters can be filled in with their
3374 default arguments, if such were specified. Do so here. */
3377 convert_arguments (tree typelist
, VEC(tree
,gc
) **values
, tree fndecl
,
3378 int flags
, tsubst_flags_t complain
)
3383 /* Argument passing is always copy-initialization. */
3384 flags
|= LOOKUP_ONLYCONVERTING
;
3386 for (i
= 0, typetail
= typelist
;
3387 i
< VEC_length (tree
, *values
);
3390 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3391 tree val
= VEC_index (tree
, *values
, i
);
3393 if (val
== error_mark_node
|| type
== error_mark_node
)
3396 if (type
== void_type_node
)
3398 if (complain
& tf_error
)
3400 warn_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3407 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3408 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3409 if (TREE_CODE (val
) == NOP_EXPR
3410 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3411 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3412 val
= TREE_OPERAND (val
, 0);
3414 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3416 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3417 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3418 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3419 val
= decay_conversion (val
);
3422 if (val
== error_mark_node
)
3427 /* Formal parm type is specified by a function prototype. */
3430 if (!COMPLETE_TYPE_P (complete_type (type
)))
3432 if (complain
& tf_error
)
3435 error ("parameter %P of %qD has incomplete type %qT",
3438 error ("parameter %P has incomplete type %qT", i
, type
);
3440 parmval
= error_mark_node
;
3444 parmval
= convert_for_initialization
3445 (NULL_TREE
, type
, val
, flags
,
3446 "argument passing", fndecl
, i
, complain
);
3447 parmval
= convert_for_arg_passing (type
, parmval
);
3450 if (parmval
== error_mark_node
)
3453 VEC_replace (tree
, *values
, i
, parmval
);
3457 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3458 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3459 /* Don't do ellipsis conversion for __built_in_constant_p
3460 as this will result in spurious errors for non-trivial
3462 val
= require_complete_type (val
);
3464 val
= convert_arg_to_ellipsis (val
);
3466 VEC_replace (tree
, *values
, i
, val
);
3470 typetail
= TREE_CHAIN (typetail
);
3473 if (typetail
!= 0 && typetail
!= void_list_node
)
3475 /* See if there are default arguments that can be used. Because
3476 we hold default arguments in the FUNCTION_TYPE (which is so
3477 wrong), we can see default parameters here from deduced
3478 contexts (and via typeof) for indirect function calls.
3479 Fortunately we know whether we have a function decl to
3480 provide default arguments in a language conformant
3482 if (fndecl
&& TREE_PURPOSE (typetail
)
3483 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3485 for (; typetail
!= void_list_node
; ++i
)
3488 = convert_default_arg (TREE_VALUE (typetail
),
3489 TREE_PURPOSE (typetail
),
3492 if (parmval
== error_mark_node
)
3495 VEC_safe_push (tree
, gc
, *values
, parmval
);
3496 typetail
= TREE_CHAIN (typetail
);
3497 /* ends with `...'. */
3498 if (typetail
== NULL_TREE
)
3504 if (complain
& tf_error
)
3505 warn_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3513 /* Build a binary-operation expression, after performing default
3514 conversions on the operands. CODE is the kind of expression to
3515 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3516 are the tree codes which correspond to ARG1 and ARG2 when issuing
3517 warnings about possibly misplaced parentheses. They may differ
3518 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3519 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3520 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3521 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3522 ARG2_CODE as ERROR_MARK. */
3525 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3526 tree arg2
, enum tree_code arg2_code
, bool *overloaded_p
,
3527 tsubst_flags_t complain
)
3536 if (processing_template_decl
)
3538 if (type_dependent_expression_p (arg1
)
3539 || type_dependent_expression_p (arg2
))
3540 return build_min_nt (code
, arg1
, arg2
);
3541 arg1
= build_non_dependent_expr (arg1
);
3542 arg2
= build_non_dependent_expr (arg2
);
3545 if (code
== DOTSTAR_EXPR
)
3546 expr
= build_m_component_ref (arg1
, arg2
);
3548 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3549 overloaded_p
, complain
);
3551 /* Check for cases such as x+y<<z which users are likely to
3552 misinterpret. But don't warn about obj << x + y, since that is a
3553 common idiom for I/O. */
3554 if (warn_parentheses
3555 && (complain
& tf_warning
)
3556 && !processing_template_decl
3557 && !error_operand_p (arg1
)
3558 && !error_operand_p (arg2
)
3559 && (code
!= LSHIFT_EXPR
3560 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3561 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3563 if (processing_template_decl
&& expr
!= error_mark_node
)
3564 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3569 /* Build and return an ARRAY_REF expression. */
3572 build_x_array_ref (tree arg1
, tree arg2
, tsubst_flags_t complain
)
3574 tree orig_arg1
= arg1
;
3575 tree orig_arg2
= arg2
;
3578 if (processing_template_decl
)
3580 if (type_dependent_expression_p (arg1
)
3581 || type_dependent_expression_p (arg2
))
3582 return build_min_nt (ARRAY_REF
, arg1
, arg2
,
3583 NULL_TREE
, NULL_TREE
);
3584 arg1
= build_non_dependent_expr (arg1
);
3585 arg2
= build_non_dependent_expr (arg2
);
3588 expr
= build_new_op (ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3589 /*overloaded_p=*/NULL
, complain
);
3591 if (processing_template_decl
&& expr
!= error_mark_node
)
3592 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3593 NULL_TREE
, NULL_TREE
);
3597 /* For the c-common bits. */
3599 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3600 int convert_p ATTRIBUTE_UNUSED
)
3602 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3606 /* Build a binary-operation expression without default conversions.
3607 CODE is the kind of expression to build.
3608 LOCATION is the location_t of the operator in the source code.
3609 This function differs from `build' in several ways:
3610 the data type of the result is computed and recorded in it,
3611 warnings are generated if arg data types are invalid,
3612 special handling for addition and subtraction of pointers is known,
3613 and some optimization is done (operations on narrow ints
3614 are done in the narrower type when that gives the same result).
3615 Constant folding is also done before the result is returned.
3617 Note that the operands will never have enumeral types
3618 because either they have just had the default conversions performed
3619 or they have both just been converted to some other type in which
3620 the arithmetic is to be done.
3622 C++: must do special pointer arithmetic when implementing
3623 multiple inheritance, and deal with pointer to member functions. */
3626 cp_build_binary_op (location_t location
,
3627 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3628 tsubst_flags_t complain
)
3631 enum tree_code code0
, code1
;
3633 const char *invalid_op_diag
;
3635 /* Expression code to give to the expression when it is built.
3636 Normally this is CODE, which is what the caller asked for,
3637 but in some special cases we change it. */
3638 enum tree_code resultcode
= code
;
3640 /* Data type in which the computation is to be performed.
3641 In the simplest cases this is the common type of the arguments. */
3642 tree result_type
= NULL
;
3644 /* Nonzero means operands have already been type-converted
3645 in whatever way is necessary.
3646 Zero means they need to be converted to RESULT_TYPE. */
3649 /* Nonzero means create the expression with this type, rather than
3651 tree build_type
= 0;
3653 /* Nonzero means after finally constructing the expression
3654 convert it to this type. */
3655 tree final_type
= 0;
3659 /* Nonzero if this is an operation like MIN or MAX which can
3660 safely be computed in short if both args are promoted shorts.
3661 Also implies COMMON.
3662 -1 indicates a bitwise operation; this makes a difference
3663 in the exact conditions for when it is safe to do the operation
3664 in a narrower mode. */
3667 /* Nonzero if this is a comparison operation;
3668 if both args are promoted shorts, compare the original shorts.
3669 Also implies COMMON. */
3670 int short_compare
= 0;
3672 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3675 /* True if both operands have arithmetic type. */
3676 bool arithmetic_types_p
;
3678 /* Apply default conversions. */
3682 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3683 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3684 || code
== TRUTH_XOR_EXPR
)
3686 if (!really_overloaded_fn (op0
))
3687 op0
= decay_conversion (op0
);
3688 if (!really_overloaded_fn (op1
))
3689 op1
= decay_conversion (op1
);
3693 if (!really_overloaded_fn (op0
))
3694 op0
= default_conversion (op0
);
3695 if (!really_overloaded_fn (op1
))
3696 op1
= default_conversion (op1
);
3699 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3700 STRIP_TYPE_NOPS (op0
);
3701 STRIP_TYPE_NOPS (op1
);
3703 /* DTRT if one side is an overloaded function, but complain about it. */
3704 if (type_unknown_p (op0
))
3706 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3707 if (t
!= error_mark_node
)
3709 if (complain
& tf_error
)
3710 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3715 if (type_unknown_p (op1
))
3717 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3718 if (t
!= error_mark_node
)
3720 if (complain
& tf_error
)
3721 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3727 type0
= TREE_TYPE (op0
);
3728 type1
= TREE_TYPE (op1
);
3730 /* The expression codes of the data types of the arguments tell us
3731 whether the arguments are integers, floating, pointers, etc. */
3732 code0
= TREE_CODE (type0
);
3733 code1
= TREE_CODE (type1
);
3735 /* If an error was already reported for one of the arguments,
3736 avoid reporting another error. */
3737 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3738 return error_mark_node
;
3740 if ((invalid_op_diag
3741 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3743 error (invalid_op_diag
);
3744 return error_mark_node
;
3747 /* Issue warnings about peculiar, but valid, uses of NULL. */
3748 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3749 /* It's reasonable to use pointer values as operands of &&
3750 and ||, so NULL is no exception. */
3751 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3752 && ( /* Both are NULL (or 0) and the operation was not a
3753 comparison or a pointer subtraction. */
3754 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3755 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
3756 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3757 || (!null_ptr_cst_p (orig_op0
)
3758 && !TYPE_PTR_P (type0
) && !TYPE_PTR_TO_MEMBER_P (type0
))
3759 || (!null_ptr_cst_p (orig_op1
)
3760 && !TYPE_PTR_P (type1
) && !TYPE_PTR_TO_MEMBER_P (type1
)))
3761 && (complain
& tf_warning
))
3762 /* Some sort of arithmetic operation involving NULL was
3764 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3769 /* Subtraction of two similar pointers.
3770 We must subtract them as integers, then divide by object size. */
3771 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3772 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3774 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3775 /* In all other cases except pointer - int, the usual arithmetic
3777 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3782 /* The pointer - int case is just like pointer + int; fall
3785 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3786 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3790 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3791 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3792 if (processing_template_decl
)
3794 result_type
= TREE_TYPE (ptr_operand
);
3797 return cp_pointer_int_sum (code
,
3808 case TRUNC_DIV_EXPR
:
3810 case FLOOR_DIV_EXPR
:
3811 case ROUND_DIV_EXPR
:
3812 case EXACT_DIV_EXPR
:
3813 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3814 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3815 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3816 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3818 enum tree_code tcode0
= code0
, tcode1
= code1
;
3820 warn_for_div_by_zero (location
, op1
);
3822 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3823 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3824 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3825 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3827 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3828 resultcode
= RDIV_EXPR
;
3830 /* When dividing two signed integers, we have to promote to int.
3831 unless we divide by a constant != -1. Note that default
3832 conversion will have been performed on the operands at this
3833 point, so we have to dig out the original type to find out if
3835 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3836 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3837 || (TREE_CODE (op1
) == INTEGER_CST
3838 && ! integer_all_onesp (op1
)));
3847 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3848 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3849 && !VECTOR_FLOAT_TYPE_P (type0
)
3850 && !VECTOR_FLOAT_TYPE_P (type1
)))
3854 case TRUNC_MOD_EXPR
:
3855 case FLOOR_MOD_EXPR
:
3856 warn_for_div_by_zero (location
, op1
);
3858 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3859 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
3860 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
3862 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3864 /* Although it would be tempting to shorten always here, that loses
3865 on some targets, since the modulo instruction is undefined if the
3866 quotient can't be represented in the computation mode. We shorten
3867 only if unsigned or if dividing by something we know != -1. */
3868 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3869 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3870 || (TREE_CODE (op1
) == INTEGER_CST
3871 && ! integer_all_onesp (op1
)));
3876 case TRUTH_ANDIF_EXPR
:
3877 case TRUTH_ORIF_EXPR
:
3878 case TRUTH_AND_EXPR
:
3880 result_type
= boolean_type_node
;
3883 /* Shift operations: result has same type as first operand;
3884 always convert second operand to int.
3885 Also set SHORT_SHIFT if shifting rightward. */
3888 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3890 result_type
= type0
;
3891 if (TREE_CODE (op1
) == INTEGER_CST
)
3893 if (tree_int_cst_lt (op1
, integer_zero_node
))
3895 if ((complain
& tf_warning
)
3896 && c_inhibit_evaluation_warnings
== 0)
3897 warning (0, "right shift count is negative");
3901 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3902 && (complain
& tf_warning
)
3903 && c_inhibit_evaluation_warnings
== 0)
3904 warning (0, "right shift count >= width of type");
3907 /* Convert the shift-count to an integer, regardless of
3908 size of value being shifted. */
3909 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3910 op1
= cp_convert (integer_type_node
, op1
);
3911 /* Avoid converting op1 to result_type later. */
3917 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3919 result_type
= type0
;
3920 if (TREE_CODE (op1
) == INTEGER_CST
)
3922 if (tree_int_cst_lt (op1
, integer_zero_node
))
3924 if ((complain
& tf_warning
)
3925 && c_inhibit_evaluation_warnings
== 0)
3926 warning (0, "left shift count is negative");
3928 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3930 if ((complain
& tf_warning
)
3931 && c_inhibit_evaluation_warnings
== 0)
3932 warning (0, "left shift count >= width of type");
3935 /* Convert the shift-count to an integer, regardless of
3936 size of value being shifted. */
3937 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3938 op1
= cp_convert (integer_type_node
, op1
);
3939 /* Avoid converting op1 to result_type later. */
3946 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3948 result_type
= type0
;
3949 if (TREE_CODE (op1
) == INTEGER_CST
)
3951 if (tree_int_cst_lt (op1
, integer_zero_node
))
3953 if (complain
& tf_warning
)
3954 warning (0, (code
== LROTATE_EXPR
)
3955 ? G_("left rotate count is negative")
3956 : G_("right rotate count is negative"));
3958 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3960 if (complain
& tf_warning
)
3961 warning (0, (code
== LROTATE_EXPR
)
3962 ? G_("left rotate count >= width of type")
3963 : G_("right rotate count >= width of type"));
3966 /* Convert the shift-count to an integer, regardless of
3967 size of value being shifted. */
3968 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3969 op1
= cp_convert (integer_type_node
, op1
);
3975 if ((complain
& tf_warning
)
3976 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
3977 warning (OPT_Wfloat_equal
,
3978 "comparing floating point with == or != is unsafe");
3979 if ((complain
& tf_warning
)
3980 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
3981 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
3982 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
3984 build_type
= boolean_type_node
;
3985 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3986 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
3987 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3988 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
3990 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3991 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
3992 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3993 CPO_COMPARISON
, complain
);
3994 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
3995 && null_ptr_cst_p (op1
))
3997 if (TREE_CODE (op0
) == ADDR_EXPR
3998 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
4000 if (complain
& tf_warning
)
4001 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4002 TREE_OPERAND (op0
, 0));
4004 result_type
= type0
;
4006 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
4007 && null_ptr_cst_p (op0
))
4009 if (TREE_CODE (op1
) == ADDR_EXPR
4010 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
4012 if (complain
& tf_warning
)
4013 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4014 TREE_OPERAND (op1
, 0));
4016 result_type
= type1
;
4018 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4019 /* One of the operands must be of nullptr_t type. */
4020 result_type
= TREE_TYPE (nullptr_node
);
4021 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4023 result_type
= type0
;
4024 if (complain
& tf_error
)
4025 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4027 return error_mark_node
;
4029 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4031 result_type
= type1
;
4032 if (complain
& tf_error
)
4033 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4035 return error_mark_node
;
4037 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
4039 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4040 == ptrmemfunc_vbit_in_delta
)
4042 tree pfn0
= pfn_from_ptrmemfunc (op0
);
4043 tree delta0
= delta_from_ptrmemfunc (op0
);
4044 tree e1
= cp_build_binary_op (location
,
4047 fold_convert (TREE_TYPE (pfn0
),
4050 tree e2
= cp_build_binary_op (location
,
4055 e2
= cp_build_binary_op (location
,
4056 EQ_EXPR
, e2
, integer_zero_node
,
4058 op0
= cp_build_binary_op (location
,
4059 TRUTH_ANDIF_EXPR
, e1
, e2
,
4061 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
4065 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4066 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
4068 result_type
= TREE_TYPE (op0
);
4070 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4071 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4072 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4075 /* E will be the final comparison. */
4077 /* E1 and E2 are for scratch. */
4085 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4086 CPO_COMPARISON
, complain
);
4088 if (!same_type_p (TREE_TYPE (op0
), type
))
4089 op0
= cp_convert_and_check (type
, op0
);
4090 if (!same_type_p (TREE_TYPE (op1
), type
))
4091 op1
= cp_convert_and_check (type
, op1
);
4093 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4094 return error_mark_node
;
4096 if (TREE_SIDE_EFFECTS (op0
))
4097 op0
= save_expr (op0
);
4098 if (TREE_SIDE_EFFECTS (op1
))
4099 op1
= save_expr (op1
);
4101 pfn0
= pfn_from_ptrmemfunc (op0
);
4102 pfn1
= pfn_from_ptrmemfunc (op1
);
4103 delta0
= delta_from_ptrmemfunc (op0
);
4104 delta1
= delta_from_ptrmemfunc (op1
);
4105 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4106 == ptrmemfunc_vbit_in_delta
)
4111 && ((op0.delta == op1.delta)
4112 || (!op0.pfn && op0.delta & 1 == 0
4113 && op1.delta & 1 == 0))
4115 The reason for the `!op0.pfn' bit is that a NULL
4116 pointer-to-member is any member with a zero PFN and
4117 LSB of the DELTA field is 0. */
4119 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4123 e1
= cp_build_binary_op (location
,
4124 EQ_EXPR
, e1
, integer_zero_node
,
4126 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4130 e2
= cp_build_binary_op (location
,
4131 EQ_EXPR
, e2
, integer_zero_node
,
4133 e1
= cp_build_binary_op (location
,
4134 TRUTH_ANDIF_EXPR
, e2
, e1
,
4136 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4138 fold_convert (TREE_TYPE (pfn0
),
4141 e2
= cp_build_binary_op (location
,
4142 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4143 e1
= cp_build_binary_op (location
,
4144 EQ_EXPR
, delta0
, delta1
, complain
);
4145 e1
= cp_build_binary_op (location
,
4146 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4153 && (!op0.pfn || op0.delta == op1.delta))
4155 The reason for the `!op0.pfn' bit is that a NULL
4156 pointer-to-member is any member with a zero PFN; the
4157 DELTA field is unspecified. */
4159 e1
= cp_build_binary_op (location
,
4160 EQ_EXPR
, delta0
, delta1
, complain
);
4161 e2
= cp_build_binary_op (location
,
4164 fold_convert (TREE_TYPE (pfn0
),
4167 e1
= cp_build_binary_op (location
,
4168 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4170 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4171 e
= cp_build_binary_op (location
,
4172 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4173 if (code
== EQ_EXPR
)
4175 return cp_build_binary_op (location
,
4176 EQ_EXPR
, e
, integer_zero_node
, complain
);
4180 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4181 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4183 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4184 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4192 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4193 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4195 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4196 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4197 CPO_COMPARISON
, complain
);
4204 if (TREE_CODE (orig_op0
) == STRING_CST
4205 || TREE_CODE (orig_op1
) == STRING_CST
)
4207 if (complain
& tf_warning
)
4208 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4211 build_type
= boolean_type_node
;
4212 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4213 || code0
== ENUMERAL_TYPE
)
4214 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4215 || code1
== ENUMERAL_TYPE
))
4217 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4218 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4219 CPO_COMPARISON
, complain
);
4220 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4221 result_type
= type0
;
4222 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4223 result_type
= type1
;
4224 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4225 /* One of the operands must be of nullptr_t type. */
4226 result_type
= TREE_TYPE (nullptr_node
);
4227 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4229 result_type
= type0
;
4230 if (complain
& tf_error
)
4231 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4233 return error_mark_node
;
4235 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4237 result_type
= type1
;
4238 if (complain
& tf_error
)
4239 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4241 return error_mark_node
;
4245 case UNORDERED_EXPR
:
4252 build_type
= integer_type_node
;
4253 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4255 if (complain
& tf_error
)
4256 error ("unordered comparison on non-floating point argument");
4257 return error_mark_node
;
4266 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4267 || code0
== ENUMERAL_TYPE
)
4268 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4269 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4270 arithmetic_types_p
= 1;
4273 arithmetic_types_p
= 0;
4274 /* Vector arithmetic is only allowed when both sides are vectors. */
4275 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4277 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4278 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4281 binary_op_error (location
, code
, type0
, type1
);
4282 return error_mark_node
;
4284 arithmetic_types_p
= 1;
4287 /* Determine the RESULT_TYPE, if it is not already known. */
4289 && arithmetic_types_p
4290 && (shorten
|| common
|| short_compare
))
4291 result_type
= cp_common_type (type0
, type1
);
4295 if (complain
& tf_error
)
4296 error ("invalid operands of types %qT and %qT to binary %qO",
4297 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4298 return error_mark_node
;
4301 /* If we're in a template, the only thing we need to know is the
4303 if (processing_template_decl
)
4305 /* Since the middle-end checks the type when doing a build2, we
4306 need to build the tree in pieces. This built tree will never
4307 get out of the front-end as we replace it when instantiating
4309 tree tmp
= build2 (resultcode
,
4310 build_type
? build_type
: result_type
,
4312 TREE_OPERAND (tmp
, 0) = op0
;
4316 if (arithmetic_types_p
)
4318 bool first_complex
= (code0
== COMPLEX_TYPE
);
4319 bool second_complex
= (code1
== COMPLEX_TYPE
);
4320 int none_complex
= (!first_complex
&& !second_complex
);
4322 /* Adapted from patch for c/24581. */
4323 if (first_complex
!= second_complex
4324 && (code
== PLUS_EXPR
4325 || code
== MINUS_EXPR
4326 || code
== MULT_EXPR
4327 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4328 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4329 && flag_signed_zeros
)
4331 /* An operation on mixed real/complex operands must be
4332 handled specially, but the language-independent code can
4333 more easily optimize the plain complex arithmetic if
4334 -fno-signed-zeros. */
4335 tree real_type
= TREE_TYPE (result_type
);
4339 if (TREE_TYPE (op0
) != result_type
)
4340 op0
= cp_convert_and_check (result_type
, op0
);
4341 if (TREE_TYPE (op1
) != real_type
)
4342 op1
= cp_convert_and_check (real_type
, op1
);
4346 if (TREE_TYPE (op0
) != real_type
)
4347 op0
= cp_convert_and_check (real_type
, op0
);
4348 if (TREE_TYPE (op1
) != result_type
)
4349 op1
= cp_convert_and_check (result_type
, op1
);
4351 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4352 return error_mark_node
;
4355 op0
= save_expr (op0
);
4356 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4357 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4361 case TRUNC_DIV_EXPR
:
4362 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4366 real
= build2 (resultcode
, real_type
, real
, op1
);
4374 op1
= save_expr (op1
);
4375 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4376 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4380 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4383 real
= build2 (resultcode
, real_type
, op0
, real
);
4386 real
= build2 (resultcode
, real_type
, op0
, real
);
4387 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4393 return build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4396 /* For certain operations (which identify themselves by shorten != 0)
4397 if both args were extended from the same smaller type,
4398 do the arithmetic in that type and then extend.
4400 shorten !=0 and !=1 indicates a bitwise operation.
4401 For them, this optimization is safe only if
4402 both args are zero-extended or both are sign-extended.
4403 Otherwise, we might change the result.
4404 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4405 but calculated in (unsigned short) it would be (unsigned short)-1. */
4407 if (shorten
&& none_complex
)
4409 final_type
= result_type
;
4410 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4414 /* Comparison operations are shortened too but differently.
4415 They identify themselves by setting short_compare = 1. */
4419 /* Don't write &op0, etc., because that would prevent op0
4420 from being kept in a register.
4421 Instead, make copies of the our local variables and
4422 pass the copies by reference, then copy them back afterward. */
4423 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4424 enum tree_code xresultcode
= resultcode
;
4426 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4428 return cp_convert (boolean_type_node
, val
);
4429 op0
= xop0
, op1
= xop1
;
4431 resultcode
= xresultcode
;
4434 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4435 && warn_sign_compare
4436 && !TREE_NO_WARNING (orig_op0
)
4437 && !TREE_NO_WARNING (orig_op1
)
4438 /* Do not warn until the template is instantiated; we cannot
4439 bound the ranges of the arguments until that point. */
4440 && !processing_template_decl
4441 && (complain
& tf_warning
)
4442 && c_inhibit_evaluation_warnings
== 0)
4444 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4445 result_type
, resultcode
);
4449 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4450 Then the expression will be built.
4451 It will be given type FINAL_TYPE if that is nonzero;
4452 otherwise, it will be given type RESULT_TYPE. */
4455 if (TREE_TYPE (op0
) != result_type
)
4456 op0
= cp_convert_and_check (result_type
, op0
);
4457 if (TREE_TYPE (op1
) != result_type
)
4458 op1
= cp_convert_and_check (result_type
, op1
);
4460 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4461 return error_mark_node
;
4464 if (build_type
== NULL_TREE
)
4465 build_type
= result_type
;
4467 result
= build2 (resultcode
, build_type
, op0
, op1
);
4468 result
= fold_if_not_in_template (result
);
4469 if (final_type
!= 0)
4470 result
= cp_convert (final_type
, result
);
4472 if (TREE_OVERFLOW_P (result
)
4473 && !TREE_OVERFLOW_P (op0
)
4474 && !TREE_OVERFLOW_P (op1
))
4475 overflow_warning (location
, result
);
4480 /* Return a tree for the sum or difference (RESULTCODE says which)
4481 of pointer PTROP and integer INTOP. */
4484 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4486 tree res_type
= TREE_TYPE (ptrop
);
4488 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4489 in certain circumstance (when it's valid to do so). So we need
4490 to make sure it's complete. We don't need to check here, if we
4491 can actually complete it at all, as those checks will be done in
4492 pointer_int_sum() anyway. */
4493 complete_type (TREE_TYPE (res_type
));
4495 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4496 fold_if_not_in_template (intop
));
4499 /* Return a tree for the difference of pointers OP0 and OP1.
4500 The resulting tree has type int. */
4503 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4506 tree restype
= ptrdiff_type_node
;
4507 tree target_type
= TREE_TYPE (ptrtype
);
4509 if (!complete_type_or_else (target_type
, NULL_TREE
))
4510 return error_mark_node
;
4512 if (TREE_CODE (target_type
) == VOID_TYPE
)
4513 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4514 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4515 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4516 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4517 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4519 /* First do the subtraction as integers;
4520 then drop through to build the divide operator. */
4522 op0
= cp_build_binary_op (input_location
,
4524 cp_convert (restype
, op0
),
4525 cp_convert (restype
, op1
),
4526 tf_warning_or_error
);
4528 /* This generates an error if op1 is a pointer to an incomplete type. */
4529 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4530 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4532 op1
= (TYPE_PTROB_P (ptrtype
)
4533 ? size_in_bytes (target_type
)
4534 : integer_one_node
);
4536 /* Do the division. */
4538 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4539 return fold_if_not_in_template (result
);
4542 /* Construct and perhaps optimize a tree representation
4543 for a unary operation. CODE, a tree_code, specifies the operation
4544 and XARG is the operand. */
4547 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4549 tree orig_expr
= xarg
;
4553 if (processing_template_decl
)
4555 if (type_dependent_expression_p (xarg
))
4556 return build_min_nt (code
, xarg
, NULL_TREE
);
4558 xarg
= build_non_dependent_expr (xarg
);
4563 /* [expr.unary.op] says:
4565 The address of an object of incomplete type can be taken.
4567 (And is just the ordinary address operator, not an overloaded
4568 "operator &".) However, if the type is a template
4569 specialization, we must complete the type at this point so that
4570 an overloaded "operator &" will be available if required. */
4571 if (code
== ADDR_EXPR
4572 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4573 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4574 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4575 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4576 /* Don't look for a function. */;
4578 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4579 /*overloaded_p=*/NULL
, complain
);
4580 if (!exp
&& code
== ADDR_EXPR
)
4582 if (is_overloaded_fn (xarg
))
4584 tree fn
= get_first_fn (xarg
);
4585 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4587 error (DECL_CONSTRUCTOR_P (fn
)
4588 ? G_("taking address of constructor %qE")
4589 : G_("taking address of destructor %qE"),
4591 return error_mark_node
;
4595 /* A pointer to member-function can be formed only by saying
4597 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4598 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4600 if (TREE_CODE (xarg
) != OFFSET_REF
4601 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4603 error ("invalid use of %qE to form a pointer-to-member-function",
4605 if (TREE_CODE (xarg
) != OFFSET_REF
)
4606 inform (input_location
, " a qualified-id is required");
4607 return error_mark_node
;
4611 error ("parentheses around %qE cannot be used to form a"
4612 " pointer-to-member-function",
4614 PTRMEM_OK_P (xarg
) = 1;
4618 if (TREE_CODE (xarg
) == OFFSET_REF
)
4620 ptrmem
= PTRMEM_OK_P (xarg
);
4622 if (!ptrmem
&& !flag_ms_extensions
4623 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4625 /* A single non-static member, make sure we don't allow a
4626 pointer-to-member. */
4627 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4628 TREE_OPERAND (xarg
, 0),
4629 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4630 PTRMEM_OK_P (xarg
) = ptrmem
;
4633 else if (TREE_CODE (xarg
) == TARGET_EXPR
&& (complain
& tf_warning
))
4634 warning (0, "taking address of temporary");
4635 exp
= cp_build_unary_op (ADDR_EXPR
, xarg
, 0, complain
);
4638 if (processing_template_decl
&& exp
!= error_mark_node
)
4639 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4640 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4641 if (TREE_CODE (exp
) == ADDR_EXPR
)
4642 PTRMEM_OK_P (exp
) = ptrmem
;
4646 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4647 constants, where a null value is represented by an INTEGER_CST of
4651 cp_truthvalue_conversion (tree expr
)
4653 tree type
= TREE_TYPE (expr
);
4654 if (TYPE_PTRMEM_P (type
))
4655 return build_binary_op (EXPR_LOCATION (expr
),
4656 NE_EXPR
, expr
, integer_zero_node
, 1);
4658 return c_common_truthvalue_conversion (input_location
, expr
);
4661 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4664 condition_conversion (tree expr
)
4667 if (processing_template_decl
)
4669 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4670 tf_warning_or_error
, LOOKUP_NORMAL
);
4671 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4675 /* Returns the address of T. This function will fold away
4676 ADDR_EXPR of INDIRECT_REF. */
4679 build_address (tree t
)
4681 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4682 return error_mark_node
;
4683 t
= build_fold_addr_expr (t
);
4684 if (TREE_CODE (t
) != ADDR_EXPR
)
4689 /* Returns the address of T with type TYPE. */
4692 build_typed_address (tree t
, tree type
)
4694 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4695 return error_mark_node
;
4696 t
= build_fold_addr_expr_with_type (t
, type
);
4697 if (TREE_CODE (t
) != ADDR_EXPR
)
4702 /* Return a NOP_EXPR converting EXPR to TYPE. */
4705 build_nop (tree type
, tree expr
)
4707 if (type
== error_mark_node
|| error_operand_p (expr
))
4709 return build1 (NOP_EXPR
, type
, expr
);
4712 /* C++: Must handle pointers to members.
4714 Perhaps type instantiation should be extended to handle conversion
4715 from aggregates to types we don't yet know we want? (Or are those
4716 cases typically errors which should be reported?)
4718 NOCONVERT nonzero suppresses the default promotions
4719 (such as from short to int). */
4722 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
4723 tsubst_flags_t complain
)
4725 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4728 const char *errstring
= NULL
;
4730 const char *invalid_op_diag
;
4732 if (error_operand_p (arg
))
4733 return error_mark_node
;
4735 if ((invalid_op_diag
4736 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
4741 error (invalid_op_diag
);
4742 return error_mark_node
;
4747 case UNARY_PLUS_EXPR
:
4750 int flags
= WANT_ARITH
| WANT_ENUM
;
4751 /* Unary plus (but not unary minus) is allowed on pointers. */
4752 if (code
== UNARY_PLUS_EXPR
)
4753 flags
|= WANT_POINTER
;
4754 arg
= build_expr_type_conversion (flags
, arg
, true);
4756 errstring
= (code
== NEGATE_EXPR
4757 ? _("wrong type argument to unary minus")
4758 : _("wrong type argument to unary plus"));
4761 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4762 arg
= perform_integral_promotions (arg
);
4764 /* Make sure the result is not an lvalue: a unary plus or minus
4765 expression is always a rvalue. */
4772 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4776 arg
= default_conversion (arg
);
4778 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
4779 | WANT_VECTOR_OR_COMPLEX
,
4781 errstring
= _("wrong type argument to bit-complement");
4782 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4783 arg
= perform_integral_promotions (arg
);
4787 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4788 errstring
= _("wrong type argument to abs");
4789 else if (!noconvert
)
4790 arg
= default_conversion (arg
);
4794 /* Conjugating a real value is a no-op, but allow it anyway. */
4795 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4796 errstring
= _("wrong type argument to conjugation");
4797 else if (!noconvert
)
4798 arg
= default_conversion (arg
);
4801 case TRUTH_NOT_EXPR
:
4802 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
4804 val
= invert_truthvalue_loc (input_location
, arg
);
4805 if (arg
!= error_mark_node
)
4807 errstring
= _("in argument to unary !");
4814 if (TREE_CODE (arg
) == COMPLEX_CST
)
4815 return TREE_REALPART (arg
);
4816 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4818 arg
= build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4819 return fold_if_not_in_template (arg
);
4825 if (TREE_CODE (arg
) == COMPLEX_CST
)
4826 return TREE_IMAGPART (arg
);
4827 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4829 arg
= build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4830 return fold_if_not_in_template (arg
);
4833 return cp_convert (TREE_TYPE (arg
), integer_zero_node
);
4835 case PREINCREMENT_EXPR
:
4836 case POSTINCREMENT_EXPR
:
4837 case PREDECREMENT_EXPR
:
4838 case POSTDECREMENT_EXPR
:
4839 /* Handle complex lvalues (when permitted)
4840 by reduction to simpler cases. */
4842 val
= unary_complex_lvalue (code
, arg
);
4846 arg
= mark_lvalue_use (arg
);
4848 /* Increment or decrement the real part of the value,
4849 and don't change the imaginary part. */
4850 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4854 arg
= stabilize_reference (arg
);
4855 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
4856 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
4857 real
= cp_build_unary_op (code
, real
, 1, complain
);
4858 if (real
== error_mark_node
|| imag
== error_mark_node
)
4859 return error_mark_node
;
4860 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
4864 /* Report invalid types. */
4866 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
4869 if (code
== PREINCREMENT_EXPR
)
4870 errstring
= _("no pre-increment operator for type");
4871 else if (code
== POSTINCREMENT_EXPR
)
4872 errstring
= _("no post-increment operator for type");
4873 else if (code
== PREDECREMENT_EXPR
)
4874 errstring
= _("no pre-decrement operator for type");
4876 errstring
= _("no post-decrement operator for type");
4879 else if (arg
== error_mark_node
)
4880 return error_mark_node
;
4882 /* Report something read-only. */
4884 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
4885 || TREE_READONLY (arg
))
4887 if (complain
& tf_error
)
4888 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
4889 || code
== POSTINCREMENT_EXPR
)
4890 ? REK_INCREMENT
: REK_DECREMENT
));
4892 return error_mark_node
;
4897 tree declared_type
= unlowered_expr_type (arg
);
4899 argtype
= TREE_TYPE (arg
);
4901 /* ARM $5.2.5 last annotation says this should be forbidden. */
4902 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
4904 if (complain
& tf_error
)
4905 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
4906 ? G_("ISO C++ forbids incrementing an enum")
4907 : G_("ISO C++ forbids decrementing an enum"));
4909 return error_mark_node
;
4912 /* Compute the increment. */
4914 if (TREE_CODE (argtype
) == POINTER_TYPE
)
4916 tree type
= complete_type (TREE_TYPE (argtype
));
4918 if (!COMPLETE_OR_VOID_TYPE_P (type
))
4920 if (complain
& tf_error
)
4921 error (((code
== PREINCREMENT_EXPR
4922 || code
== POSTINCREMENT_EXPR
))
4923 ? G_("cannot increment a pointer to incomplete type %qT")
4924 : G_("cannot decrement a pointer to incomplete type %qT"),
4925 TREE_TYPE (argtype
));
4927 return error_mark_node
;
4929 else if ((pedantic
|| warn_pointer_arith
)
4930 && !TYPE_PTROB_P (argtype
))
4932 if (complain
& tf_error
)
4933 permerror (input_location
, (code
== PREINCREMENT_EXPR
4934 || code
== POSTINCREMENT_EXPR
)
4935 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
4936 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
4939 return error_mark_node
;
4942 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
4945 inc
= integer_one_node
;
4947 inc
= cp_convert (argtype
, inc
);
4949 /* Complain about anything else that is not a true lvalue. */
4950 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
4951 || code
== POSTINCREMENT_EXPR
)
4952 ? lv_increment
: lv_decrement
),
4954 return error_mark_node
;
4956 /* Forbid using -- on `bool'. */
4957 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
4959 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
4961 if (complain
& tf_error
)
4962 error ("invalid use of Boolean expression as operand "
4963 "to %<operator--%>");
4964 return error_mark_node
;
4966 val
= boolean_increment (code
, arg
);
4969 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
4971 TREE_SIDE_EFFECTS (val
) = 1;
4976 /* Note that this operation never does default_conversion
4977 regardless of NOCONVERT. */
4979 argtype
= lvalue_type (arg
);
4981 arg
= mark_lvalue_use (arg
);
4983 if (TREE_CODE (arg
) == OFFSET_REF
)
4986 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4988 tree type
= build_pointer_type (TREE_TYPE (argtype
));
4989 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4992 else if (pedantic
&& DECL_MAIN_P (arg
))
4995 /* Apparently a lot of autoconf scripts for C++ packages do this,
4996 so only complain if -pedantic. */
4997 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
4998 pedwarn (input_location
, OPT_pedantic
,
4999 "ISO C++ forbids taking address of function %<::main%>");
5000 else if (flag_pedantic_errors
)
5001 return error_mark_node
;
5004 /* Let &* cancel out to simplify resulting code. */
5005 if (TREE_CODE (arg
) == INDIRECT_REF
)
5007 /* We don't need to have `current_class_ptr' wrapped in a
5008 NON_LVALUE_EXPR node. */
5009 if (arg
== current_class_ref
)
5010 return current_class_ptr
;
5012 arg
= TREE_OPERAND (arg
, 0);
5013 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
5015 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
5016 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5019 /* Don't let this be an lvalue. */
5024 /* Uninstantiated types are all functions. Taking the
5025 address of a function is a no-op, so just return the
5028 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
5029 || !IDENTIFIER_OPNAME_P (arg
));
5031 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
5032 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
5034 /* They're trying to take the address of a unique non-static
5035 member function. This is ill-formed (except in MS-land),
5036 but let's try to DTRT.
5037 Note: We only handle unique functions here because we don't
5038 want to complain if there's a static overload; non-unique
5039 cases will be handled by instantiate_type. But we need to
5040 handle this case here to allow casts on the resulting PMF.
5041 We could defer this in non-MS mode, but it's easier to give
5042 a useful error here. */
5044 /* Inside constant member functions, the `this' pointer
5045 contains an extra const qualifier. TYPE_MAIN_VARIANT
5046 is used here to remove this const from the diagnostics
5047 and the created OFFSET_REF. */
5048 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
5049 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
5052 if (! flag_ms_extensions
)
5054 tree name
= DECL_NAME (fn
);
5055 if (!(complain
& tf_error
))
5056 return error_mark_node
;
5057 else if (current_class_type
5058 && TREE_OPERAND (arg
, 0) == current_class_ref
)
5059 /* An expression like &memfn. */
5060 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
5061 " or parenthesized non-static member function to form"
5062 " a pointer to member function. Say %<&%T::%D%>",
5065 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
5066 " function to form a pointer to member function."
5070 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
5074 if (type_unknown_p (arg
))
5075 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
5077 /* Handle complex lvalues (when permitted)
5078 by reduction to simpler cases. */
5079 val
= unary_complex_lvalue (code
, arg
);
5083 switch (TREE_CODE (arg
))
5087 case FIX_TRUNC_EXPR
:
5088 /* Even if we're not being pedantic, we cannot allow this
5089 extension when we're instantiating in a SFINAE
5091 if (! lvalue_p (arg
) && complain
== tf_none
)
5093 if (complain
& tf_error
)
5094 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
5096 return error_mark_node
;
5101 arg
= BASELINK_FUNCTIONS (arg
);
5105 arg
= OVL_CURRENT (arg
);
5109 /* Turn a reference to a non-static data member into a
5110 pointer-to-member. */
5115 if (!PTRMEM_OK_P (arg
))
5116 return cp_build_unary_op (code
, arg
, 0, complain
);
5118 t
= TREE_OPERAND (arg
, 1);
5119 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
5121 if (complain
& tf_error
)
5122 error ("cannot create pointer to reference member %qD", t
);
5123 return error_mark_node
;
5126 type
= build_ptrmem_type (context_for_name_lookup (t
),
5128 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
5136 /* Anything not already handled and not a true memory reference
5138 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5139 && TREE_CODE (argtype
) != METHOD_TYPE
5140 && TREE_CODE (arg
) != OFFSET_REF
5141 && !lvalue_or_else (arg
, lv_addressof
, complain
))
5142 return error_mark_node
;
5144 if (argtype
!= error_mark_node
)
5145 argtype
= build_pointer_type (argtype
);
5147 /* In a template, we are processing a non-dependent expression
5148 so we can just form an ADDR_EXPR with the correct type. */
5149 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
5151 val
= build_address (arg
);
5152 if (TREE_CODE (arg
) == OFFSET_REF
)
5153 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
5155 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
5157 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
5159 /* We can only get here with a single static member
5161 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
5162 && DECL_STATIC_FUNCTION_P (fn
));
5164 val
= build_address (fn
);
5165 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
5166 /* Do not lose object's side effects. */
5167 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
5168 TREE_OPERAND (arg
, 0), val
);
5170 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
5172 if (complain
& tf_error
)
5173 error ("attempt to take address of bit-field structure member %qD",
5174 TREE_OPERAND (arg
, 1));
5175 return error_mark_node
;
5179 tree object
= TREE_OPERAND (arg
, 0);
5180 tree field
= TREE_OPERAND (arg
, 1);
5181 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5182 (TREE_TYPE (object
), decl_type_context (field
)));
5183 val
= build_address (arg
);
5186 if (TREE_CODE (argtype
) == POINTER_TYPE
5187 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
5189 build_ptrmemfunc_type (argtype
);
5190 val
= build_ptrmemfunc (argtype
, val
, 0,
5191 /*c_cast_p=*/false);
5203 argtype
= TREE_TYPE (arg
);
5204 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5207 if (complain
& tf_error
)
5208 error ("%s", errstring
);
5209 return error_mark_node
;
5212 /* Hook for the c-common bits that build a unary op. */
5214 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5215 enum tree_code code
, tree xarg
, int noconvert
)
5217 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5220 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5221 for certain kinds of expressions which are not really lvalues
5222 but which we can accept as lvalues.
5224 If ARG is not a kind of expression we can handle, return
5228 unary_complex_lvalue (enum tree_code code
, tree arg
)
5230 /* Inside a template, making these kinds of adjustments is
5231 pointless; we are only concerned with the type of the
5233 if (processing_template_decl
)
5236 /* Handle (a, b) used as an "lvalue". */
5237 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5239 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5240 tf_warning_or_error
);
5241 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5242 TREE_OPERAND (arg
, 0), real_result
);
5245 /* Handle (a ? b : c) used as an "lvalue". */
5246 if (TREE_CODE (arg
) == COND_EXPR
5247 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5248 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5250 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5251 if (TREE_CODE (arg
) == MODIFY_EXPR
5252 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5253 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5255 tree lvalue
= TREE_OPERAND (arg
, 0);
5256 if (TREE_SIDE_EFFECTS (lvalue
))
5258 lvalue
= stabilize_reference (lvalue
);
5259 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5260 lvalue
, TREE_OPERAND (arg
, 1));
5262 return unary_complex_lvalue
5263 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5266 if (code
!= ADDR_EXPR
)
5269 /* Handle (a = b) used as an "lvalue" for `&'. */
5270 if (TREE_CODE (arg
) == MODIFY_EXPR
5271 || TREE_CODE (arg
) == INIT_EXPR
)
5273 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5274 tf_warning_or_error
);
5275 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5277 TREE_NO_WARNING (arg
) = 1;
5281 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5282 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5283 || TREE_CODE (arg
) == OFFSET_REF
)
5286 /* We permit compiler to make function calls returning
5287 objects of aggregate type look like lvalues. */
5291 if (TREE_CODE (targ
) == SAVE_EXPR
)
5292 targ
= TREE_OPERAND (targ
, 0);
5294 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5296 if (TREE_CODE (arg
) == SAVE_EXPR
)
5299 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
5300 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5303 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5304 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5305 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5308 /* Don't let anything else be handled specially. */
5312 /* Mark EXP saying that we need to be able to take the
5313 address of it; it should not be allocated in a register.
5314 Value is true if successful.
5316 C++: we do not allow `current_class_ptr' to be addressable. */
5319 cxx_mark_addressable (tree exp
)
5324 switch (TREE_CODE (x
))
5331 x
= TREE_OPERAND (x
, 0);
5335 if (x
== current_class_ptr
)
5337 error ("cannot take the address of %<this%>, which is an rvalue expression");
5338 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5344 /* Caller should not be trying to mark initialized
5345 constant fields addressable. */
5346 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5347 || DECL_IN_AGGR_P (x
) == 0
5349 || DECL_EXTERNAL (x
));
5354 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5355 && !DECL_ARTIFICIAL (x
))
5357 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5360 ("address of explicit register variable %qD requested", x
);
5363 else if (extra_warnings
)
5365 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5367 TREE_ADDRESSABLE (x
) = 1;
5371 TREE_ADDRESSABLE (x
) = 1;
5375 TREE_ADDRESSABLE (x
) = 1;
5379 TREE_ADDRESSABLE (x
) = 1;
5380 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5388 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5391 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5392 tsubst_flags_t complain
)
5394 tree orig_ifexp
= ifexp
;
5395 tree orig_op1
= op1
;
5396 tree orig_op2
= op2
;
5399 if (processing_template_decl
)
5401 /* The standard says that the expression is type-dependent if
5402 IFEXP is type-dependent, even though the eventual type of the
5403 expression doesn't dependent on IFEXP. */
5404 if (type_dependent_expression_p (ifexp
)
5405 /* As a GNU extension, the middle operand may be omitted. */
5406 || (op1
&& type_dependent_expression_p (op1
))
5407 || type_dependent_expression_p (op2
))
5408 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5409 ifexp
= build_non_dependent_expr (ifexp
);
5411 op1
= build_non_dependent_expr (op1
);
5412 op2
= build_non_dependent_expr (op2
);
5415 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5416 if (processing_template_decl
&& expr
!= error_mark_node
)
5417 return build_min_non_dep (COND_EXPR
, expr
,
5418 orig_ifexp
, orig_op1
, orig_op2
);
5422 /* Given a list of expressions, return a compound expression
5423 that performs them all and returns the value of the last of them. */
5425 tree
build_x_compound_expr_from_list (tree list
, const char *msg
)
5427 tree expr
= TREE_VALUE (list
);
5429 if (TREE_CHAIN (list
))
5432 permerror (input_location
, "%s expression list treated as compound expression", msg
);
5434 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5435 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5436 tf_warning_or_error
);
5442 /* Like build_x_compound_expr_from_list, but using a VEC. */
5445 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5447 if (VEC_empty (tree
, vec
))
5449 else if (VEC_length (tree
, vec
) == 1)
5450 return VEC_index (tree
, vec
, 0);
5458 permerror (input_location
,
5459 "%s expression list treated as compound expression",
5462 expr
= VEC_index (tree
, vec
, 0);
5463 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5464 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5470 /* Handle overloading of the ',' operator when needed. */
5473 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5476 tree orig_op1
= op1
;
5477 tree orig_op2
= op2
;
5479 if (processing_template_decl
)
5481 if (type_dependent_expression_p (op1
)
5482 || type_dependent_expression_p (op2
))
5483 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5484 op1
= build_non_dependent_expr (op1
);
5485 op2
= build_non_dependent_expr (op2
);
5488 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5489 /*overloaded_p=*/NULL
, complain
);
5491 result
= cp_build_compound_expr (op1
, op2
, complain
);
5493 if (processing_template_decl
&& result
!= error_mark_node
)
5494 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5499 /* Like cp_build_compound_expr, but for the c-common bits. */
5502 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5504 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5507 /* Build a compound expression. */
5510 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5512 lhs
= convert_to_void (lhs
, "left-hand operand of comma", complain
);
5514 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5515 return error_mark_node
;
5517 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5519 /* If the rhs is a TARGET_EXPR, then build the compound
5520 expression inside the target_expr's initializer. This
5521 helps the compiler to eliminate unnecessary temporaries. */
5522 tree init
= TREE_OPERAND (rhs
, 1);
5524 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5525 TREE_OPERAND (rhs
, 1) = init
;
5530 if (type_unknown_p (rhs
))
5532 error ("no context to resolve type of %qE", rhs
);
5533 return error_mark_node
;
5536 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5539 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5540 casts away constness. CAST gives the type of cast.
5542 ??? This function warns for casting away any qualifier not just
5543 const. We would like to specify exactly what qualifiers are casted
5548 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5549 enum tree_code cast
)
5551 /* C-style casts are allowed to cast away constness. With
5552 WARN_CAST_QUAL, we still want to issue a warning. */
5553 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5556 if (!casts_away_constness (src_type
, dest_type
))
5562 warning (OPT_Wcast_qual
,
5563 "cast from type %qT to type %qT casts away qualifiers",
5564 src_type
, dest_type
);
5567 case STATIC_CAST_EXPR
:
5568 error ("static_cast from type %qT to type %qT casts away qualifiers",
5569 src_type
, dest_type
);
5572 case REINTERPRET_CAST_EXPR
:
5573 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5574 src_type
, dest_type
);
5581 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5582 (another pointer-to-member type in the same hierarchy) and return
5583 the converted expression. If ALLOW_INVERSE_P is permitted, a
5584 pointer-to-derived may be converted to pointer-to-base; otherwise,
5585 only the other direction is permitted. If C_CAST_P is true, this
5586 conversion is taking place as part of a C-style cast. */
5589 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5592 if (TYPE_PTRMEM_P (type
))
5596 if (TREE_CODE (expr
) == PTRMEM_CST
)
5597 expr
= cplus_expand_constant (expr
);
5598 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5599 TYPE_PTRMEM_CLASS_TYPE (type
),
5602 if (!integer_zerop (delta
))
5604 tree cond
, op1
, op2
;
5606 cond
= cp_build_binary_op (input_location
,
5609 build_int_cst (TREE_TYPE (expr
), -1),
5610 tf_warning_or_error
);
5611 op1
= build_nop (ptrdiff_type_node
, expr
);
5612 op2
= cp_build_binary_op (input_location
,
5613 PLUS_EXPR
, op1
, delta
,
5614 tf_warning_or_error
);
5616 expr
= fold_build3_loc (input_location
,
5617 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5621 return build_nop (type
, expr
);
5624 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5625 allow_inverse_p
, c_cast_p
);
5628 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
5629 a version of EXPR that has TREE_OVERFLOW set if it is set in ORIG.
5630 Otherwise, return EXPR unchanged. */
5633 ignore_overflows (tree expr
, tree orig
)
5635 if (TREE_CODE (expr
) == INTEGER_CST
5636 && CONSTANT_CLASS_P (orig
)
5637 && TREE_CODE (orig
) != STRING_CST
5638 && TREE_OVERFLOW (expr
) != TREE_OVERFLOW (orig
))
5640 if (!TREE_OVERFLOW (orig
))
5641 /* Ensure constant sharing. */
5642 expr
= build_int_cst_wide (TREE_TYPE (expr
),
5643 TREE_INT_CST_LOW (expr
),
5644 TREE_INT_CST_HIGH (expr
));
5647 /* Avoid clobbering a shared constant. */
5648 expr
= copy_node (expr
);
5649 TREE_OVERFLOW (expr
) = TREE_OVERFLOW (orig
);
5655 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5656 this static_cast is being attempted as one of the possible casts
5657 allowed by a C-style cast. (In that case, accessibility of base
5658 classes is not considered, and it is OK to cast away
5659 constness.) Return the result of the cast. *VALID_P is set to
5660 indicate whether or not the cast was valid. */
5663 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5664 bool *valid_p
, tsubst_flags_t complain
)
5670 /* Assume the cast is valid. */
5673 intype
= TREE_TYPE (expr
);
5675 /* Save casted types in the function's used types hash table. */
5676 used_types_insert (type
);
5678 /* [expr.static.cast]
5680 An lvalue of type "cv1 B", where B is a class type, can be cast
5681 to type "reference to cv2 D", where D is a class derived (clause
5682 _class.derived_) from B, if a valid standard conversion from
5683 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5684 same cv-qualification as, or greater cv-qualification than, cv1,
5685 and B is not a virtual base class of D. */
5686 /* We check this case before checking the validity of "TYPE t =
5687 EXPR;" below because for this case:
5690 struct D : public B { D(const B&); };
5692 void f() { static_cast<const D&>(b); }
5694 we want to avoid constructing a new D. The standard is not
5695 completely clear about this issue, but our interpretation is
5696 consistent with other compilers. */
5697 if (TREE_CODE (type
) == REFERENCE_TYPE
5698 && CLASS_TYPE_P (TREE_TYPE (type
))
5699 && CLASS_TYPE_P (intype
)
5700 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5701 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5702 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5703 build_pointer_type (TYPE_MAIN_VARIANT
5704 (TREE_TYPE (type
))))
5706 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5710 /* There is a standard conversion from "D*" to "B*" even if "B"
5711 is ambiguous or inaccessible. If this is really a
5712 static_cast, then we check both for inaccessibility and
5713 ambiguity. However, if this is a static_cast being performed
5714 because the user wrote a C-style cast, then accessibility is
5716 base
= lookup_base (TREE_TYPE (type
), intype
,
5717 c_cast_p
? ba_unique
: ba_check
,
5720 /* Convert from "B*" to "D*". This function will check that "B"
5721 is not a virtual base of "D". */
5722 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5723 base
, /*nonnull=*/false);
5724 /* Convert the pointer to a reference -- but then remember that
5725 there are no expressions with reference type in C++. */
5726 return convert_from_reference (cp_fold_convert (type
, expr
));
5729 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5730 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5731 if (TREE_CODE (type
) == REFERENCE_TYPE
5732 && TYPE_REF_IS_RVALUE (type
)
5733 && real_lvalue_p (expr
)
5734 && reference_related_p (TREE_TYPE (type
), intype
)
5735 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5737 expr
= build_typed_address (expr
, type
);
5738 return convert_from_reference (expr
);
5743 /* Resolve overloaded address here rather than once in
5744 implicit_conversion and again in the inverse code below. */
5745 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5747 expr
= instantiate_type (type
, expr
, complain
);
5748 intype
= TREE_TYPE (expr
);
5751 /* [expr.static.cast]
5753 An expression e can be explicitly converted to a type T using a
5754 static_cast of the form static_cast<T>(e) if the declaration T
5755 t(e);" is well-formed, for some invented temporary variable
5757 result
= perform_direct_initialization_if_possible (type
, expr
,
5758 c_cast_p
, complain
);
5761 result
= convert_from_reference (result
);
5763 /* Ignore any integer overflow caused by the cast. */
5764 result
= ignore_overflows (result
, orig
);
5766 /* [expr.static.cast]
5768 If T is a reference type, the result is an lvalue; otherwise,
5769 the result is an rvalue. */
5770 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5771 result
= rvalue (result
);
5775 /* [expr.static.cast]
5777 Any expression can be explicitly converted to type cv void. */
5778 if (TREE_CODE (type
) == VOID_TYPE
)
5779 return convert_to_void (expr
, /*implicit=*/NULL
, complain
);
5781 /* [expr.static.cast]
5783 The inverse of any standard conversion sequence (clause _conv_),
5784 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5785 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5786 (_conv.bool_) conversions, can be performed explicitly using
5787 static_cast subject to the restriction that the explicit
5788 conversion does not cast away constness (_expr.const.cast_), and
5789 the following additional rules for specific cases: */
5790 /* For reference, the conversions not excluded are: integral
5791 promotions, floating point promotion, integral conversions,
5792 floating point conversions, floating-integral conversions,
5793 pointer conversions, and pointer to member conversions. */
5796 A value of integral _or enumeration_ type can be explicitly
5797 converted to an enumeration type. */
5798 /* The effect of all that is that any conversion between any two
5799 types which are integral, floating, or enumeration types can be
5801 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5802 || SCALAR_FLOAT_TYPE_P (type
))
5803 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5804 || SCALAR_FLOAT_TYPE_P (intype
)))
5806 expr
= ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5808 /* Ignore any integer overflow caused by the cast. */
5809 expr
= ignore_overflows (expr
, orig
);
5813 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5814 && CLASS_TYPE_P (TREE_TYPE (type
))
5815 && CLASS_TYPE_P (TREE_TYPE (intype
))
5816 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5817 (TREE_TYPE (intype
))),
5818 build_pointer_type (TYPE_MAIN_VARIANT
5819 (TREE_TYPE (type
)))))
5824 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5825 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
5826 c_cast_p
? ba_unique
: ba_check
,
5828 return build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
5831 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5832 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5839 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
5840 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
5842 if (TYPE_PTRMEM_P (type
))
5844 t1
= (build_ptrmem_type
5846 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
5847 t2
= (build_ptrmem_type
5849 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
5856 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
5859 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5860 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
5865 /* [expr.static.cast]
5867 An rvalue of type "pointer to cv void" can be explicitly
5868 converted to a pointer to object type. A value of type pointer
5869 to object converted to "pointer to cv void" and back to the
5870 original pointer type will have its original value. */
5871 if (TREE_CODE (intype
) == POINTER_TYPE
5872 && VOID_TYPE_P (TREE_TYPE (intype
))
5873 && TYPE_PTROB_P (type
))
5876 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5877 return build_nop (type
, expr
);
5881 return error_mark_node
;
5884 /* Return an expression representing static_cast<TYPE>(EXPR). */
5887 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5892 if (type
== error_mark_node
|| expr
== error_mark_node
)
5893 return error_mark_node
;
5895 if (processing_template_decl
)
5897 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
5898 /* We don't know if it will or will not have side effects. */
5899 TREE_SIDE_EFFECTS (expr
) = 1;
5900 return convert_from_reference (expr
);
5903 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5904 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5905 if (TREE_CODE (type
) != REFERENCE_TYPE
5906 && TREE_CODE (expr
) == NOP_EXPR
5907 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5908 expr
= TREE_OPERAND (expr
, 0);
5910 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
5915 if (complain
& tf_error
)
5916 error ("invalid static_cast from type %qT to type %qT",
5917 TREE_TYPE (expr
), type
);
5918 return error_mark_node
;
5921 /* EXPR is an expression with member function or pointer-to-member
5922 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5923 not permitted by ISO C++, but we accept it in some modes. If we
5924 are not in one of those modes, issue a diagnostic. Return the
5925 converted expression. */
5928 convert_member_func_to_ptr (tree type
, tree expr
)
5933 intype
= TREE_TYPE (expr
);
5934 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
5935 || TREE_CODE (intype
) == METHOD_TYPE
);
5937 if (pedantic
|| warn_pmf2ptr
)
5938 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
5939 "converting from %qT to %qT", intype
, type
);
5941 if (TREE_CODE (intype
) == METHOD_TYPE
)
5942 expr
= build_addr_func (expr
);
5943 else if (TREE_CODE (expr
) == PTRMEM_CST
)
5944 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
5947 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
5948 decl
= build_address (decl
);
5949 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
5952 return build_nop (type
, expr
);
5955 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
5956 If C_CAST_P is true, this reinterpret cast is being done as part of
5957 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
5958 indicate whether or not reinterpret_cast was valid. */
5961 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5962 bool *valid_p
, tsubst_flags_t complain
)
5966 /* Assume the cast is invalid. */
5970 if (type
== error_mark_node
|| error_operand_p (expr
))
5971 return error_mark_node
;
5973 intype
= TREE_TYPE (expr
);
5975 /* Save casted types in the function's used types hash table. */
5976 used_types_insert (type
);
5978 /* [expr.reinterpret.cast]
5979 An lvalue expression of type T1 can be cast to the type
5980 "reference to T2" if an expression of type "pointer to T1" can be
5981 explicitly converted to the type "pointer to T2" using a
5982 reinterpret_cast. */
5983 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5985 if (! real_lvalue_p (expr
))
5987 if (complain
& tf_error
)
5988 error ("invalid cast of an rvalue expression of type "
5991 return error_mark_node
;
5994 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
5995 "B" are related class types; the reinterpret_cast does not
5996 adjust the pointer. */
5997 if (TYPE_PTR_P (intype
)
5998 && (complain
& tf_warning
)
5999 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
6000 COMPARE_BASE
| COMPARE_DERIVED
)))
6001 warning (0, "casting %qT to %qT does not dereference pointer",
6004 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0, complain
);
6006 if (warn_strict_aliasing
> 2)
6007 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
6009 if (expr
!= error_mark_node
)
6010 expr
= build_reinterpret_cast_1
6011 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
6013 if (expr
!= error_mark_node
)
6014 /* cp_build_indirect_ref isn't right for rvalue refs. */
6015 expr
= convert_from_reference (fold_convert (type
, expr
));
6019 /* As a G++ extension, we consider conversions from member
6020 functions, and pointers to member functions to
6021 pointer-to-function and pointer-to-void types. If
6022 -Wno-pmf-conversions has not been specified,
6023 convert_member_func_to_ptr will issue an error message. */
6024 if ((TYPE_PTRMEMFUNC_P (intype
)
6025 || TREE_CODE (intype
) == METHOD_TYPE
)
6026 && TYPE_PTR_P (type
)
6027 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6028 || VOID_TYPE_P (TREE_TYPE (type
))))
6029 return convert_member_func_to_ptr (type
, expr
);
6031 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6032 array-to-pointer, and function-to-pointer conversions are
6034 expr
= decay_conversion (expr
);
6036 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6037 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6038 if (TREE_CODE (expr
) == NOP_EXPR
6039 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6040 expr
= TREE_OPERAND (expr
, 0);
6042 if (error_operand_p (expr
))
6043 return error_mark_node
;
6045 intype
= TREE_TYPE (expr
);
6047 /* [expr.reinterpret.cast]
6048 A pointer can be converted to any integral type large enough to
6049 hold it. ... A value of type std::nullptr_t can be converted to
6050 an integral type; the conversion has the same meaning and
6051 validity as a conversion of (void*)0 to the integral type. */
6052 if (CP_INTEGRAL_TYPE_P (type
)
6053 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
6055 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
6057 if (complain
& tf_error
)
6058 permerror (input_location
, "cast from %qT to %qT loses precision",
6061 return error_mark_node
;
6063 if (NULLPTR_TYPE_P (intype
))
6064 return build_int_cst (type
, 0);
6066 /* [expr.reinterpret.cast]
6067 A value of integral or enumeration type can be explicitly
6068 converted to a pointer. */
6069 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6072 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6073 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6074 return fold_if_not_in_template (build_nop (type
, expr
));
6075 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6076 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6081 check_for_casting_away_constness (intype
, type
, REINTERPRET_CAST_EXPR
);
6082 /* Warn about possible alignment problems. */
6083 if (STRICT_ALIGNMENT
&& warn_cast_align
6084 && (complain
& tf_warning
)
6085 && !VOID_TYPE_P (type
)
6086 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6087 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6088 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6089 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6090 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6091 "increases required alignment of target type", intype
, type
);
6093 /* We need to strip nops here, because the front end likes to
6094 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6096 if (warn_strict_aliasing
<= 2)
6097 strict_aliasing_warning (intype
, type
, sexpr
);
6099 return fold_if_not_in_template (build_nop (type
, expr
));
6101 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6102 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6104 if (pedantic
&& (complain
& tf_warning
))
6105 /* Only issue a warning, as we have always supported this
6106 where possible, and it is necessary in some cases. DR 195
6107 addresses this issue, but as of 2004/10/26 is still in
6109 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6110 return fold_if_not_in_template (build_nop (type
, expr
));
6112 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6113 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6114 else if (TREE_CODE (intype
) == VECTOR_TYPE
6115 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6116 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6121 if (complain
& tf_error
)
6122 error ("invalid cast from type %qT to type %qT", intype
, type
);
6123 return error_mark_node
;
6126 return cp_convert (type
, expr
);
6130 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6132 if (type
== error_mark_node
|| expr
== error_mark_node
)
6133 return error_mark_node
;
6135 if (processing_template_decl
)
6137 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6139 if (!TREE_SIDE_EFFECTS (t
)
6140 && type_dependent_expression_p (expr
))
6141 /* There might turn out to be side effects inside expr. */
6142 TREE_SIDE_EFFECTS (t
) = 1;
6143 return convert_from_reference (t
);
6146 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6147 /*valid_p=*/NULL
, complain
);
6150 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6151 return an appropriate expression. Otherwise, return
6152 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6153 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6154 performing a C-style cast, its value upon return will indicate
6155 whether or not the conversion succeeded. */
6158 build_const_cast_1 (tree dst_type
, tree expr
, bool complain
,
6162 tree reference_type
;
6164 /* Callers are responsible for handling error_mark_node as a
6165 destination type. */
6166 gcc_assert (dst_type
!= error_mark_node
);
6167 /* In a template, callers should be building syntactic
6168 representations of casts, not using this machinery. */
6169 gcc_assert (!processing_template_decl
);
6171 /* Assume the conversion is invalid. */
6175 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6178 error ("invalid use of const_cast with type %qT, "
6179 "which is not a pointer, "
6180 "reference, nor a pointer-to-data-member type", dst_type
);
6181 return error_mark_node
;
6184 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6187 error ("invalid use of const_cast with type %qT, which is a pointer "
6188 "or reference to a function type", dst_type
);
6189 return error_mark_node
;
6192 /* Save casted types in the function's used types hash table. */
6193 used_types_insert (dst_type
);
6195 src_type
= TREE_TYPE (expr
);
6196 /* Expressions do not really have reference types. */
6197 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6198 src_type
= TREE_TYPE (src_type
);
6200 /* [expr.const.cast]
6202 An lvalue of type T1 can be explicitly converted to an lvalue of
6203 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6204 types) if a pointer to T1 can be explicitly converted to the type
6205 pointer to T2 using a const_cast. */
6206 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6208 reference_type
= dst_type
;
6209 if (! real_lvalue_p (expr
))
6212 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6213 src_type
, dst_type
);
6214 return error_mark_node
;
6216 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6217 src_type
= build_pointer_type (src_type
);
6221 reference_type
= NULL_TREE
;
6222 /* If the destination type is not a reference type, the
6223 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6224 conversions are performed. */
6225 src_type
= type_decays_to (src_type
);
6226 if (src_type
== error_mark_node
)
6227 return error_mark_node
;
6230 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6231 && comp_ptr_ttypes_const (dst_type
, src_type
))
6236 /* This cast is actually a C-style cast. Issue a warning if
6237 the user is making a potentially unsafe cast. */
6238 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
);
6242 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0,
6243 complain
? tf_warning_or_error
: tf_none
);
6244 expr
= build_nop (reference_type
, expr
);
6245 return convert_from_reference (expr
);
6249 expr
= decay_conversion (expr
);
6250 /* build_c_cast puts on a NOP_EXPR to make the result not an
6251 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6252 non-lvalue context. */
6253 if (TREE_CODE (expr
) == NOP_EXPR
6254 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6255 expr
= TREE_OPERAND (expr
, 0);
6256 return build_nop (dst_type
, expr
);
6261 error ("invalid const_cast from type %qT to type %qT",
6262 src_type
, dst_type
);
6263 return error_mark_node
;
6267 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6269 if (type
== error_mark_node
|| error_operand_p (expr
))
6270 return error_mark_node
;
6272 if (processing_template_decl
)
6274 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6276 if (!TREE_SIDE_EFFECTS (t
)
6277 && type_dependent_expression_p (expr
))
6278 /* There might turn out to be side effects inside expr. */
6279 TREE_SIDE_EFFECTS (t
) = 1;
6280 return convert_from_reference (t
);
6283 return build_const_cast_1 (type
, expr
, complain
& tf_error
,
6287 /* Like cp_build_c_cast, but for the c-common bits. */
6290 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6292 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6295 /* Build an expression representing an explicit C-style cast to type
6296 TYPE of expression EXPR. */
6299 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6305 if (type
== error_mark_node
|| error_operand_p (expr
))
6306 return error_mark_node
;
6308 if (processing_template_decl
)
6310 tree t
= build_min (CAST_EXPR
, type
,
6311 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6312 /* We don't know if it will or will not have side effects. */
6313 TREE_SIDE_EFFECTS (t
) = 1;
6314 return convert_from_reference (t
);
6317 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6318 'Class') should always be retained, because this information aids
6319 in method lookup. */
6320 if (objc_is_object_ptr (type
)
6321 && objc_is_object_ptr (TREE_TYPE (expr
)))
6322 return build_nop (type
, expr
);
6324 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6325 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6326 if (TREE_CODE (type
) != REFERENCE_TYPE
6327 && TREE_CODE (value
) == NOP_EXPR
6328 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6329 value
= TREE_OPERAND (value
, 0);
6331 if (TREE_CODE (type
) == ARRAY_TYPE
)
6333 /* Allow casting from T1* to T2[] because Cfront allows it.
6334 NIHCL uses it. It is not valid ISO C++ however. */
6335 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6337 if (complain
& tf_error
)
6338 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6340 return error_mark_node
;
6341 type
= build_pointer_type (TREE_TYPE (type
));
6345 if (complain
& tf_error
)
6346 error ("ISO C++ forbids casting to an array type %qT", type
);
6347 return error_mark_node
;
6351 if (TREE_CODE (type
) == FUNCTION_TYPE
6352 || TREE_CODE (type
) == METHOD_TYPE
)
6354 if (complain
& tf_error
)
6355 error ("invalid cast to function type %qT", type
);
6356 return error_mark_node
;
6359 if (TREE_CODE (type
) == POINTER_TYPE
6360 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
6361 /* Casting to an integer of smaller size is an error detected elsewhere. */
6362 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
6363 /* Don't warn about converting any constant. */
6364 && !TREE_CONSTANT (value
))
6365 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
6366 "cast to pointer from integer of different size");
6368 /* A C-style cast can be a const_cast. */
6369 result
= build_const_cast_1 (type
, value
, /*complain=*/false,
6374 /* Or a static cast. */
6375 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6376 &valid_p
, complain
);
6377 /* Or a reinterpret_cast. */
6379 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6380 &valid_p
, complain
);
6381 /* The static_cast or reinterpret_cast may be followed by a
6384 /* A valid cast may result in errors if, for example, a
6385 conversion to am ambiguous base class is required. */
6386 && !error_operand_p (result
))
6390 /* Non-class rvalues always have cv-unqualified type. */
6391 if (!CLASS_TYPE_P (type
))
6392 type
= TYPE_MAIN_VARIANT (type
);
6393 result_type
= TREE_TYPE (result
);
6394 if (!CLASS_TYPE_P (result_type
))
6395 result_type
= TYPE_MAIN_VARIANT (result_type
);
6396 /* If the type of RESULT does not match TYPE, perform a
6397 const_cast to make it match. If the static_cast or
6398 reinterpret_cast succeeded, we will differ by at most
6399 cv-qualification, so the follow-on const_cast is guaranteed
6401 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6403 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6404 gcc_assert (valid_p
);
6409 return error_mark_node
;
6412 /* For use from the C common bits. */
6414 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6415 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6416 enum tree_code modifycode
,
6417 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6418 tree rhs_origtype ATTRIBUTE_UNUSED
)
6420 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6423 /* Build an assignment expression of lvalue LHS from value RHS.
6424 MODIFYCODE is the code for a binary operator that we use
6425 to combine the old value of LHS with RHS to get the new value.
6426 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6428 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6431 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6432 tsubst_flags_t complain
)
6436 tree lhstype
= TREE_TYPE (lhs
);
6437 tree olhstype
= lhstype
;
6438 bool plain_assign
= (modifycode
== NOP_EXPR
);
6440 /* Avoid duplicate error messages from operands that had errors. */
6441 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6442 return error_mark_node
;
6444 /* Handle control structure constructs used as "lvalues". */
6445 switch (TREE_CODE (lhs
))
6447 /* Handle --foo = 5; as these are valid constructs in C++. */
6448 case PREDECREMENT_EXPR
:
6449 case PREINCREMENT_EXPR
:
6450 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6451 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6452 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6453 TREE_OPERAND (lhs
, 1));
6454 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6455 modifycode
, rhs
, complain
);
6456 if (newrhs
== error_mark_node
)
6457 return error_mark_node
;
6458 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6460 /* Handle (a, b) used as an "lvalue". */
6462 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6463 modifycode
, rhs
, complain
);
6464 if (newrhs
== error_mark_node
)
6465 return error_mark_node
;
6466 return build2 (COMPOUND_EXPR
, lhstype
,
6467 TREE_OPERAND (lhs
, 0), newrhs
);
6470 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6471 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6472 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6473 TREE_OPERAND (lhs
, 1));
6474 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6476 if (newrhs
== error_mark_node
)
6477 return error_mark_node
;
6478 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6482 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6483 when neither operand has side-effects. */
6484 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6485 return error_mark_node
;
6487 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6488 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6490 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6491 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6493 TREE_OPERAND (lhs
, 0),
6494 TREE_OPERAND (lhs
, 1)),
6495 TREE_OPERAND (lhs
, 0),
6496 TREE_OPERAND (lhs
, 1));
6499 /* Handle (a ? b : c) used as an "lvalue". */
6502 /* Produce (a ? (b = rhs) : (c = rhs))
6503 except that the RHS goes through a save-expr
6504 so the code to compute it is only emitted once. */
6506 tree preeval
= NULL_TREE
;
6508 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6510 if (complain
& tf_error
)
6511 error ("void value not ignored as it ought to be");
6512 return error_mark_node
;
6515 rhs
= stabilize_expr (rhs
, &preeval
);
6517 /* Check this here to avoid odd errors when trying to convert
6518 a throw to the type of the COND_EXPR. */
6519 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6520 return error_mark_node
;
6522 cond
= build_conditional_expr
6523 (TREE_OPERAND (lhs
, 0),
6524 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6525 modifycode
, rhs
, complain
),
6526 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6527 modifycode
, rhs
, complain
),
6530 if (cond
== error_mark_node
)
6532 /* Make sure the code to compute the rhs comes out
6533 before the split. */
6535 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6543 if (modifycode
== INIT_EXPR
)
6545 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6546 /* Do the default thing. */;
6547 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6549 /* Compound literal. */
6550 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6551 /* Call convert to generate an error; see PR 11063. */
6552 rhs
= convert (lhstype
, rhs
);
6553 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6554 TREE_SIDE_EFFECTS (result
) = 1;
6557 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6558 /* Do the default thing. */;
6561 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6562 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6563 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6565 release_tree_vector (rhs_vec
);
6566 if (result
== NULL_TREE
)
6567 return error_mark_node
;
6573 lhs
= require_complete_type (lhs
);
6574 if (lhs
== error_mark_node
)
6575 return error_mark_node
;
6577 if (modifycode
== NOP_EXPR
)
6579 /* `operator=' is not an inheritable operator. */
6580 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6581 /* Do the default thing. */;
6584 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6585 lhs
, rhs
, make_node (NOP_EXPR
),
6586 /*overloaded_p=*/NULL
,
6588 if (result
== NULL_TREE
)
6589 return error_mark_node
;
6596 /* A binary op has been requested. Combine the old LHS
6597 value with the RHS producing the value we should actually
6598 store into the LHS. */
6599 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6600 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6601 || MAYBE_CLASS_TYPE_P (lhstype
)));
6603 lhs
= stabilize_reference (lhs
);
6604 newrhs
= cp_build_binary_op (input_location
,
6605 modifycode
, lhs
, rhs
,
6607 if (newrhs
== error_mark_node
)
6609 if (complain
& tf_error
)
6610 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6611 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6612 return error_mark_node
;
6615 /* Now it looks like a plain assignment. */
6616 modifycode
= NOP_EXPR
;
6618 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6619 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6622 /* The left-hand side must be an lvalue. */
6623 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6624 return error_mark_node
;
6626 /* Warn about modifying something that is `const'. Don't warn if
6627 this is initialization. */
6628 if (modifycode
!= INIT_EXPR
6629 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6630 /* Functions are not modifiable, even though they are
6632 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6633 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6634 /* If it's an aggregate and any field is const, then it is
6635 effectively const. */
6636 || (CLASS_TYPE_P (lhstype
)
6637 && C_TYPE_FIELDS_READONLY (lhstype
))))
6639 if (complain
& tf_error
)
6640 readonly_error (lhs
, REK_ASSIGNMENT
);
6642 return error_mark_node
;
6645 /* If storing into a structure or union member, it may have been given a
6646 lowered bitfield type. We need to convert to the declared type first,
6647 so retrieve it now. */
6649 olhstype
= unlowered_expr_type (lhs
);
6651 /* Convert new value to destination type. */
6653 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6657 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6659 if (modifycode
!= INIT_EXPR
)
6661 if (complain
& tf_error
)
6662 error ("assigning to an array from an initializer list");
6663 return error_mark_node
;
6665 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6666 return error_mark_node
;
6667 newrhs
= digest_init (lhstype
, newrhs
);
6670 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6671 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6673 if (complain
& tf_error
)
6674 error ("incompatible types in assignment of %qT to %qT",
6675 TREE_TYPE (rhs
), lhstype
);
6676 return error_mark_node
;
6679 /* Allow array assignment in compiler-generated code. */
6680 else if (!current_function_decl
6681 || !DECL_ARTIFICIAL (current_function_decl
))
6683 /* This routine is used for both initialization and assignment.
6684 Make sure the diagnostic message differentiates the context. */
6685 if (complain
& tf_error
)
6687 if (modifycode
== INIT_EXPR
)
6688 error ("array used as initializer");
6690 error ("invalid array assignment");
6692 return error_mark_node
;
6695 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6696 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6697 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6698 /*explicit_value_init_p=*/false,
6699 from_array
, complain
);
6702 if (modifycode
== INIT_EXPR
)
6703 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6704 LOOKUP_ONLYCONVERTING. */
6705 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6706 "initialization", NULL_TREE
, 0,
6709 newrhs
= convert_for_assignment (olhstype
, newrhs
, "assignment",
6710 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6712 if (!same_type_p (lhstype
, olhstype
))
6713 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6715 if (modifycode
!= INIT_EXPR
)
6717 if (TREE_CODE (newrhs
) == CALL_EXPR
6718 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6719 newrhs
= build_cplus_new (lhstype
, newrhs
);
6721 /* Can't initialize directly from a TARGET_EXPR, since that would
6722 cause the lhs to be constructed twice, and possibly result in
6723 accidental self-initialization. So we force the TARGET_EXPR to be
6724 expanded without a target. */
6725 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6726 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6727 TREE_OPERAND (newrhs
, 0));
6730 if (newrhs
== error_mark_node
)
6731 return error_mark_node
;
6733 if (c_dialect_objc () && flag_objc_gc
)
6735 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6741 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6742 lhstype
, lhs
, newrhs
);
6744 TREE_SIDE_EFFECTS (result
) = 1;
6746 TREE_NO_WARNING (result
) = 1;
6752 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6753 tsubst_flags_t complain
)
6755 if (processing_template_decl
)
6756 return build_min_nt (MODOP_EXPR
, lhs
,
6757 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6759 if (modifycode
!= NOP_EXPR
)
6761 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6762 make_node (modifycode
),
6763 /*overloaded_p=*/NULL
,
6767 TREE_NO_WARNING (rval
) = 1;
6771 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6774 /* Helper function for get_delta_difference which assumes FROM is a base
6775 class of TO. Returns a delta for the conversion of pointer-to-member
6776 of FROM to pointer-to-member of TO. If the conversion is invalid,
6777 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6778 If C_CAST_P is true, this conversion is taking place as part of a C-style
6782 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
)
6787 binfo
= lookup_base (to
, from
, c_cast_p
? ba_unique
: ba_check
, &kind
);
6788 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6790 error (" in pointer to member function conversion");
6791 return size_zero_node
;
6795 if (kind
!= bk_via_virtual
)
6796 return BINFO_OFFSET (binfo
);
6798 /* FROM is a virtual base class of TO. Issue an error or warning
6799 depending on whether or not this is a reinterpret cast. */
6801 error ("pointer to member conversion via virtual base %qT",
6802 BINFO_TYPE (binfo_from_vbase (binfo
)));
6804 return size_zero_node
;
6811 /* Get difference in deltas for different pointer to member function
6812 types. Returns an integer constant of type PTRDIFF_TYPE_NODE. If
6813 the conversion is invalid, the constant is zero. If
6814 ALLOW_INVERSE_P is true, then allow reverse conversions as well.
6815 If C_CAST_P is true this conversion is taking place as part of a
6818 Note that the naming of FROM and TO is kind of backwards; the return
6819 value is what we add to a TO in order to get a FROM. They are named
6820 this way because we call this function to find out how to convert from
6821 a pointer to member of FROM to a pointer to member of TO. */
6824 get_delta_difference (tree from
, tree to
,
6825 bool allow_inverse_p
,
6830 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
6831 /* Pointer to member of incomplete class is permitted*/
6832 result
= size_zero_node
;
6834 result
= get_delta_difference_1 (from
, to
, c_cast_p
);
6838 if (!allow_inverse_p
)
6840 error_not_base_type (from
, to
);
6841 error (" in pointer to member conversion");
6842 result
= size_zero_node
;
6846 result
= get_delta_difference_1 (to
, from
, c_cast_p
);
6849 result
= size_diffop_loc (input_location
,
6850 size_zero_node
, result
);
6853 error_not_base_type (from
, to
);
6854 error (" in pointer to member conversion");
6855 result
= size_zero_node
;
6860 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
6864 /* Return a constructor for the pointer-to-member-function TYPE using
6865 the other components as specified. */
6868 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
6873 VEC(constructor_elt
, gc
) *v
;
6875 /* Pull the FIELD_DECLs out of the type. */
6876 pfn_field
= TYPE_FIELDS (type
);
6877 delta_field
= TREE_CHAIN (pfn_field
);
6879 /* Make sure DELTA has the type we want. */
6880 delta
= convert_and_check (delta_type_node
, delta
);
6882 /* Convert to the correct target type if necessary. */
6883 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
6885 /* Finish creating the initializer. */
6886 v
= VEC_alloc(constructor_elt
, gc
, 2);
6887 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
6888 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
6889 u
= build_constructor (type
, v
);
6890 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
6891 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
6892 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
6894 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
6899 /* Build a constructor for a pointer to member function. It can be
6900 used to initialize global variables, local variable, or used
6901 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6904 If FORCE is nonzero, then force this conversion, even if
6905 we would rather not do it. Usually set when using an explicit
6906 cast. A C-style cast is being processed iff C_CAST_P is true.
6908 Return error_mark_node, if something goes wrong. */
6911 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
)
6917 if (error_operand_p (pfn
))
6918 return error_mark_node
;
6920 pfn_type
= TREE_TYPE (pfn
);
6921 to_type
= build_ptrmemfunc_type (type
);
6923 /* Handle multiple conversions of pointer to member functions. */
6924 if (TYPE_PTRMEMFUNC_P (pfn_type
))
6926 tree delta
= NULL_TREE
;
6927 tree npfn
= NULL_TREE
;
6931 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
6932 error ("invalid conversion to type %qT from type %qT",
6935 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
6936 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
6940 /* We don't have to do any conversion to convert a
6941 pointer-to-member to its own type. But, we don't want to
6942 just return a PTRMEM_CST if there's an explicit cast; that
6943 cast should make the expression an invalid template argument. */
6944 if (TREE_CODE (pfn
) != PTRMEM_CST
)
6946 if (same_type_p (to_type
, pfn_type
))
6948 else if (integer_zerop (n
))
6949 return build_reinterpret_cast (to_type
, pfn
,
6950 tf_warning_or_error
);
6953 if (TREE_SIDE_EFFECTS (pfn
))
6954 pfn
= save_expr (pfn
);
6956 /* Obtain the function pointer and the current DELTA. */
6957 if (TREE_CODE (pfn
) == PTRMEM_CST
)
6958 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
6961 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
6962 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
6965 /* Just adjust the DELTA field. */
6966 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6967 (TREE_TYPE (delta
), ptrdiff_type_node
));
6968 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
6969 n
= cp_build_binary_op (input_location
,
6970 LSHIFT_EXPR
, n
, integer_one_node
,
6971 tf_warning_or_error
);
6972 delta
= cp_build_binary_op (input_location
,
6973 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
6974 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
6977 /* Handle null pointer to member function conversions. */
6978 if (integer_zerop (pfn
))
6980 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
6981 return build_ptrmemfunc1 (to_type
,
6986 if (type_unknown_p (pfn
))
6987 return instantiate_type (type
, pfn
, tf_warning_or_error
);
6989 fn
= TREE_OPERAND (pfn
, 0);
6990 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
6991 /* In a template, we will have preserved the
6993 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
6994 return make_ptrmem_cst (to_type
, fn
);
6997 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7000 ??? There is no consistency as to the types returned for the above
7001 values. Some code acts as if it were a sizetype and some as if it were
7002 integer_type_node. */
7005 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
7007 tree type
= TREE_TYPE (cst
);
7008 tree fn
= PTRMEM_CST_MEMBER (cst
);
7009 tree ptr_class
, fn_class
;
7011 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7013 /* The class that the function belongs to. */
7014 fn_class
= DECL_CONTEXT (fn
);
7016 /* The class that we're creating a pointer to member of. */
7017 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
7019 /* First, calculate the adjustment to the function's class. */
7020 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
7023 if (!DECL_VIRTUAL_P (fn
))
7024 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
7027 /* If we're dealing with a virtual function, we have to adjust 'this'
7028 again, to point to the base which provides the vtable entry for
7029 fn; the call will do the opposite adjustment. */
7030 tree orig_class
= DECL_CONTEXT (fn
);
7031 tree binfo
= binfo_or_else (orig_class
, fn_class
);
7032 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7033 *delta
, BINFO_OFFSET (binfo
));
7034 *delta
= fold_if_not_in_template (*delta
);
7036 /* We set PFN to the vtable offset at which the function can be
7037 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7038 case delta is shifted left, and then incremented). */
7039 *pfn
= DECL_VINDEX (fn
);
7040 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
7041 TYPE_SIZE_UNIT (vtable_entry_type
));
7042 *pfn
= fold_if_not_in_template (*pfn
);
7044 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
7046 case ptrmemfunc_vbit_in_pfn
:
7047 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
7049 *pfn
= fold_if_not_in_template (*pfn
);
7052 case ptrmemfunc_vbit_in_delta
:
7053 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
7054 *delta
, integer_one_node
);
7055 *delta
= fold_if_not_in_template (*delta
);
7056 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7057 *delta
, integer_one_node
);
7058 *delta
= fold_if_not_in_template (*delta
);
7065 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
7066 *pfn
= fold_if_not_in_template (*pfn
);
7070 /* Return an expression for PFN from the pointer-to-member function
7074 pfn_from_ptrmemfunc (tree t
)
7076 if (TREE_CODE (t
) == PTRMEM_CST
)
7081 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7086 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
7089 /* Return an expression for DELTA from the pointer-to-member function
7093 delta_from_ptrmemfunc (tree t
)
7095 if (TREE_CODE (t
) == PTRMEM_CST
)
7100 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7105 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7108 /* Convert value RHS to type TYPE as preparation for an assignment to
7109 an lvalue of type TYPE. ERRTYPE is a string to use in error
7110 messages: "assignment", "return", etc. If FNDECL is non-NULL, we
7111 are doing the conversion in order to pass the PARMNUMth argument of
7115 convert_for_assignment (tree type
, tree rhs
,
7116 const char *errtype
, tree fndecl
, int parmnum
,
7117 tsubst_flags_t complain
, int flags
)
7120 enum tree_code coder
;
7122 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7123 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7124 rhs
= TREE_OPERAND (rhs
, 0);
7126 rhstype
= TREE_TYPE (rhs
);
7127 coder
= TREE_CODE (rhstype
);
7129 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7130 && vector_types_convertible_p (type
, rhstype
, true))
7131 return convert (type
, rhs
);
7133 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7134 return error_mark_node
;
7135 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7136 return error_mark_node
;
7138 /* The RHS of an assignment cannot have void type. */
7139 if (coder
== VOID_TYPE
)
7141 if (complain
& tf_error
)
7142 error ("void value not ignored as it ought to be");
7143 return error_mark_node
;
7146 /* Simplify the RHS if possible. */
7147 if (TREE_CODE (rhs
) == CONST_DECL
)
7148 rhs
= DECL_INITIAL (rhs
);
7150 if (c_dialect_objc ())
7153 tree rname
= fndecl
;
7155 if (!strcmp (errtype
, "assignment"))
7157 else if (!strcmp (errtype
, "initialization"))
7161 tree selector
= objc_message_selector ();
7165 if (selector
&& parmno
> 1)
7172 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7173 return convert (type
, rhs
);
7178 The expression is implicitly converted (clause _conv_) to the
7179 cv-unqualified type of the left operand.
7181 We allow bad conversions here because by the time we get to this point
7182 we are committed to doing the conversion. If we end up doing a bad
7183 conversion, convert_like will complain. */
7184 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7186 /* When -Wno-pmf-conversions is use, we just silently allow
7187 conversions from pointers-to-members to plain pointers. If
7188 the conversion doesn't work, cp_convert will complain. */
7190 && TYPE_PTR_P (type
)
7191 && TYPE_PTRMEMFUNC_P (rhstype
))
7192 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7195 if (complain
& tf_error
)
7197 /* If the right-hand side has unknown type, then it is an
7198 overloaded function. Call instantiate_type to get error
7200 if (rhstype
== unknown_type_node
)
7201 instantiate_type (type
, rhs
, tf_warning_or_error
);
7203 error ("cannot convert %qT to %qT for argument %qP to %qD",
7204 rhstype
, type
, parmnum
, fndecl
);
7206 error ("cannot convert %qT to %qT in %s", rhstype
, type
,
7209 return error_mark_node
;
7212 if (warn_missing_format_attribute
)
7214 const enum tree_code codel
= TREE_CODE (type
);
7215 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7217 && check_missing_format_attribute (type
, rhstype
)
7218 && (complain
& tf_warning
))
7219 warning (OPT_Wmissing_format_attribute
,
7220 "%s might be a candidate for a format attribute",
7224 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7226 if (warn_parentheses
7227 && TREE_CODE (type
) == BOOLEAN_TYPE
7228 && TREE_CODE (rhs
) == MODIFY_EXPR
7229 && !TREE_NO_WARNING (rhs
)
7230 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7231 && (complain
& tf_warning
))
7233 location_t loc
= EXPR_HAS_LOCATION (rhs
)
7234 ? EXPR_LOCATION (rhs
) : input_location
;
7236 warning_at (loc
, OPT_Wparentheses
,
7237 "suggest parentheses around assignment used as truth value");
7238 TREE_NO_WARNING (rhs
) = 1;
7241 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7245 /* Convert RHS to be of type TYPE.
7246 If EXP is nonzero, it is the target of the initialization.
7247 ERRTYPE is a string to use in error messages.
7249 Two major differences between the behavior of
7250 `convert_for_assignment' and `convert_for_initialization'
7251 are that references are bashed in the former, while
7252 copied in the latter, and aggregates are assigned in
7253 the former (operator=) while initialized in the
7256 If using constructor make sure no conversion operator exists, if one does
7257 exist, an ambiguity exists.
7259 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7262 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7263 const char *errtype
, tree fndecl
, int parmnum
,
7264 tsubst_flags_t complain
)
7266 enum tree_code codel
= TREE_CODE (type
);
7268 enum tree_code coder
;
7270 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7271 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7272 if (TREE_CODE (rhs
) == NOP_EXPR
7273 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7274 && codel
!= REFERENCE_TYPE
)
7275 rhs
= TREE_OPERAND (rhs
, 0);
7277 if (type
== error_mark_node
7278 || rhs
== error_mark_node
7279 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7280 return error_mark_node
;
7282 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7283 && TREE_CODE (type
) != ARRAY_TYPE
7284 && (TREE_CODE (type
) != REFERENCE_TYPE
7285 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7286 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7287 && (TREE_CODE (type
) != REFERENCE_TYPE
7288 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7289 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7290 rhs
= decay_conversion (rhs
);
7292 rhstype
= TREE_TYPE (rhs
);
7293 coder
= TREE_CODE (rhstype
);
7295 if (coder
== ERROR_MARK
)
7296 return error_mark_node
;
7298 /* We accept references to incomplete types, so we can
7299 return here before checking if RHS is of complete type. */
7301 if (codel
== REFERENCE_TYPE
)
7303 /* This should eventually happen in convert_arguments. */
7304 int savew
= 0, savee
= 0;
7307 savew
= warningcount
, savee
= errorcount
;
7308 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7309 /*cleanup=*/NULL
, complain
);
7312 if (warningcount
> savew
)
7313 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7314 else if (errorcount
> savee
)
7315 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7321 exp
= require_complete_type (exp
);
7322 if (exp
== error_mark_node
)
7323 return error_mark_node
;
7325 rhstype
= non_reference (rhstype
);
7327 type
= complete_type (type
);
7329 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7330 /* Don't try to do copy-initialization if we already have
7331 direct-initialization. */
7334 if (MAYBE_CLASS_TYPE_P (type
))
7335 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
7337 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7341 /* If RETVAL is the address of, or a reference to, a local variable or
7342 temporary give an appropriate warning. */
7345 maybe_warn_about_returning_address_of_local (tree retval
)
7347 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7348 tree whats_returned
= retval
;
7352 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7353 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7354 else if (CONVERT_EXPR_P (whats_returned
)
7355 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7356 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7361 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7363 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7365 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7367 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7368 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7370 warning (0, "returning reference to temporary");
7373 if (TREE_CODE (whats_returned
) == VAR_DECL
7374 && DECL_NAME (whats_returned
)
7375 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7377 warning (0, "reference to non-lvalue returned");
7382 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7383 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7384 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7386 if (DECL_P (whats_returned
)
7387 && DECL_NAME (whats_returned
)
7388 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7389 && !(TREE_STATIC (whats_returned
)
7390 || TREE_PUBLIC (whats_returned
)))
7392 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7393 warning (0, "reference to local variable %q+D returned",
7396 warning (0, "address of local variable %q+D returned",
7402 /* Check that returning RETVAL from the current function is valid.
7403 Return an expression explicitly showing all conversions required to
7404 change RETVAL into the function return type, and to assign it to
7405 the DECL_RESULT for the function. Set *NO_WARNING to true if
7406 code reaches end of non-void function warning shouldn't be issued
7407 on this RETURN_EXPR. */
7410 check_return_expr (tree retval
, bool *no_warning
)
7413 /* The type actually returned by the function, after any
7416 int fn_returns_value_p
;
7417 bool named_return_value_okay_p
;
7419 *no_warning
= false;
7421 /* A `volatile' function is one that isn't supposed to return, ever.
7422 (This is a G++ extension, used to get better code for functions
7423 that call the `volatile' function.) */
7424 if (TREE_THIS_VOLATILE (current_function_decl
))
7425 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7427 /* Check for various simple errors. */
7428 if (DECL_DESTRUCTOR_P (current_function_decl
))
7431 error ("returning a value from a destructor");
7434 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7436 if (in_function_try_handler
)
7437 /* If a return statement appears in a handler of the
7438 function-try-block of a constructor, the program is ill-formed. */
7439 error ("cannot return from a handler of a function-try-block of a constructor");
7441 /* You can't return a value from a constructor. */
7442 error ("returning a value from a constructor");
7446 /* As an extension, deduce lambda return type from a return statement
7447 anywhere in the body. */
7448 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7450 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7451 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7453 tree type
= lambda_return_type (retval
);
7454 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7456 if (VOID_TYPE_P (type
))
7458 else if (oldtype
== NULL_TREE
)
7460 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7461 "can only be deduced when the return statement is "
7462 "the only statement in the function body");
7463 apply_lambda_return_type (lambda
, type
);
7465 else if (!same_type_p (type
, oldtype
))
7466 error ("inconsistent types %qT and %qT deduced for "
7467 "lambda return type", type
, oldtype
);
7471 if (processing_template_decl
)
7473 current_function_returns_value
= 1;
7474 if (check_for_bare_parameter_packs (retval
))
7475 retval
= error_mark_node
;
7479 /* When no explicit return-value is given in a function with a named
7480 return value, the named return value is used. */
7481 result
= DECL_RESULT (current_function_decl
);
7482 valtype
= TREE_TYPE (result
);
7483 gcc_assert (valtype
!= NULL_TREE
);
7484 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7485 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7488 /* Check for a return statement with no return value in a function
7489 that's supposed to return a value. */
7490 if (!retval
&& fn_returns_value_p
)
7492 permerror (input_location
, "return-statement with no value, in function returning %qT",
7494 /* Clear this, so finish_function won't say that we reach the
7495 end of a non-void function (which we don't, we gave a
7497 current_function_returns_null
= 0;
7498 /* And signal caller that TREE_NO_WARNING should be set on the
7499 RETURN_EXPR to avoid control reaches end of non-void function
7500 warnings in tree-cfg.c. */
7503 /* Check for a return statement with a value in a function that
7504 isn't supposed to return a value. */
7505 else if (retval
&& !fn_returns_value_p
)
7507 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7508 /* You can return a `void' value from a function of `void'
7509 type. In that case, we have to evaluate the expression for
7510 its side-effects. */
7511 finish_expr_stmt (retval
);
7513 permerror (input_location
, "return-statement with a value, in function "
7514 "returning 'void'");
7515 current_function_returns_null
= 1;
7517 /* There's really no value to return, after all. */
7521 /* Remember that this function can sometimes return without a
7523 current_function_returns_null
= 1;
7525 /* Remember that this function did return a value. */
7526 current_function_returns_value
= 1;
7528 /* Check for erroneous operands -- but after giving ourselves a
7529 chance to provide an error about returning a value from a void
7531 if (error_operand_p (retval
))
7533 current_function_return_value
= error_mark_node
;
7534 return error_mark_node
;
7537 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7538 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7539 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7540 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7542 && retval
&& null_ptr_cst_p (retval
))
7543 warning (0, "%<operator new%> must not return NULL unless it is "
7544 "declared %<throw()%> (or -fcheck-new is in effect)");
7546 /* Effective C++ rule 15. See also start_function. */
7548 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7552 /* The function return type must be a reference to the current
7554 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7555 && same_type_ignoring_top_level_qualifiers_p
7556 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7558 /* Returning '*this' is obviously OK. */
7559 if (retval
== current_class_ref
)
7561 /* If we are calling a function whose return type is the same of
7562 the current class reference, it is ok. */
7563 else if (TREE_CODE (retval
) == INDIRECT_REF
7564 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7569 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7572 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7574 [...] For a function with a class return type, if the expression
7575 in the return statement is the name of a local object, and the cv-
7576 unqualified type of the local object is the same as the function
7577 return type, an implementation is permitted to omit creating the tem-
7578 porary object to hold the function return value [...]
7580 So, if this is a value-returning function that always returns the same
7581 local variable, remember it.
7583 It might be nice to be more flexible, and choose the first suitable
7584 variable even if the function sometimes returns something else, but
7585 then we run the risk of clobbering the variable we chose if the other
7586 returned expression uses the chosen variable somehow. And people expect
7587 this restriction, anyway. (jason 2000-11-19)
7589 See finish_function and finalize_nrv for the rest of this optimization. */
7591 named_return_value_okay_p
=
7592 (retval
!= NULL_TREE
7593 /* Must be a local, automatic variable. */
7594 && TREE_CODE (retval
) == VAR_DECL
7595 && DECL_CONTEXT (retval
) == current_function_decl
7596 && ! TREE_STATIC (retval
)
7597 && ! DECL_ANON_UNION_VAR_P (retval
)
7598 && (DECL_ALIGN (retval
)
7599 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7600 /* The cv-unqualified type of the returned value must be the
7601 same as the cv-unqualified return type of the
7603 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7605 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7606 /* And the returned value must be non-volatile. */
7607 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7609 if (fn_returns_value_p
&& flag_elide_constructors
)
7611 if (named_return_value_okay_p
7612 && (current_function_return_value
== NULL_TREE
7613 || current_function_return_value
== retval
))
7614 current_function_return_value
= retval
;
7616 current_function_return_value
= error_mark_node
;
7619 /* We don't need to do any conversions when there's nothing being
7624 /* Do any required conversions. */
7625 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7626 /* No conversions are required. */
7630 /* The type the function is declared to return. */
7631 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7632 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7634 /* The functype's return type will have been set to void, if it
7635 was an incomplete type. Just treat this as 'return;' */
7636 if (VOID_TYPE_P (functype
))
7637 return error_mark_node
;
7639 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7640 treated as an rvalue for the purposes of overload resolution to
7641 favor move constructors over copy constructors. */
7642 if ((cxx_dialect
!= cxx98
)
7643 && named_return_value_okay_p
7644 /* The variable must not have the `volatile' qualifier. */
7645 && !(cp_type_quals (TREE_TYPE (retval
)) & TYPE_QUAL_VOLATILE
)
7646 /* The return type must be a class type. */
7647 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7648 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7650 /* First convert the value to the function's return type, then
7651 to the type of return value's location to handle the
7652 case that functype is smaller than the valtype. */
7653 retval
= convert_for_initialization
7654 (NULL_TREE
, functype
, retval
, flags
, "return", NULL_TREE
, 0,
7655 tf_warning_or_error
);
7656 retval
= convert (valtype
, retval
);
7658 /* If the conversion failed, treat this just like `return;'. */
7659 if (retval
== error_mark_node
)
7661 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7662 else if (! cfun
->returns_struct
7663 && TREE_CODE (retval
) == TARGET_EXPR
7664 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7665 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7666 TREE_OPERAND (retval
, 0));
7668 maybe_warn_about_returning_address_of_local (retval
);
7671 /* Actually copy the value returned into the appropriate location. */
7672 if (retval
&& retval
!= result
)
7673 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7679 /* Returns nonzero if the pointer-type FROM can be converted to the
7680 pointer-type TO via a qualification conversion. If CONSTP is -1,
7681 then we return nonzero if the pointers are similar, and the
7682 cv-qualification signature of FROM is a proper subset of that of TO.
7684 If CONSTP is positive, then all outer pointers have been
7688 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7690 bool to_more_cv_qualified
= false;
7691 bool is_opaque_pointer
= false;
7693 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7695 if (TREE_CODE (to
) != TREE_CODE (from
))
7698 if (TREE_CODE (from
) == OFFSET_TYPE
7699 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7700 TYPE_OFFSET_BASETYPE (to
)))
7703 /* Const and volatile mean something different for function types,
7704 so the usual checks are not appropriate. */
7705 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7707 /* In Objective-C++, some types may have been 'volatilized' by
7708 the compiler for EH; when comparing them here, the volatile
7709 qualification must be ignored. */
7710 bool objc_quals_match
= objc_type_quals_match (to
, from
);
7712 if (!at_least_as_qualified_p (to
, from
) && !objc_quals_match
)
7715 if (!at_least_as_qualified_p (from
, to
) && !objc_quals_match
)
7719 to_more_cv_qualified
= true;
7723 constp
&= TYPE_READONLY (to
);
7726 if (TREE_CODE (to
) == VECTOR_TYPE
)
7727 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7729 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
7730 return ((constp
>= 0 || to_more_cv_qualified
)
7731 && (is_opaque_pointer
7732 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
7736 /* When comparing, say, char ** to char const **, this function takes
7737 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7738 types to this function. */
7741 comp_ptr_ttypes (tree to
, tree from
)
7743 return comp_ptr_ttypes_real (to
, from
, 1);
7746 /* Returns true iff FNTYPE is a non-class type that involves
7747 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7748 if a parameter type is ill-formed. */
7751 error_type_p (const_tree type
)
7755 switch (TREE_CODE (type
))
7761 case REFERENCE_TYPE
:
7763 return error_type_p (TREE_TYPE (type
));
7767 if (error_type_p (TREE_TYPE (type
)))
7769 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7770 if (error_type_p (TREE_VALUE (t
)))
7775 if (TYPE_PTRMEMFUNC_P (type
))
7776 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
7784 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7785 type or inheritance-related types, regardless of cv-quals. */
7788 ptr_reasonably_similar (const_tree to
, const_tree from
)
7790 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7792 /* Any target type is similar enough to void. */
7793 if (TREE_CODE (to
) == VOID_TYPE
)
7794 return !error_type_p (from
);
7795 if (TREE_CODE (from
) == VOID_TYPE
)
7796 return !error_type_p (to
);
7798 if (TREE_CODE (to
) != TREE_CODE (from
))
7801 if (TREE_CODE (from
) == OFFSET_TYPE
7802 && comptypes (TYPE_OFFSET_BASETYPE (to
),
7803 TYPE_OFFSET_BASETYPE (from
),
7804 COMPARE_BASE
| COMPARE_DERIVED
))
7807 if (TREE_CODE (to
) == VECTOR_TYPE
7808 && vector_types_convertible_p (to
, from
, false))
7811 if (TREE_CODE (to
) == INTEGER_TYPE
7812 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
7815 if (TREE_CODE (to
) == FUNCTION_TYPE
)
7816 return !error_type_p (to
) && !error_type_p (from
);
7818 if (TREE_CODE (to
) != POINTER_TYPE
)
7820 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
7821 COMPARE_BASE
| COMPARE_DERIVED
);
7825 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
7826 pointer-to-member types) are the same, ignoring cv-qualification at
7830 comp_ptr_ttypes_const (tree to
, tree from
)
7832 bool is_opaque_pointer
= false;
7834 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7836 if (TREE_CODE (to
) != TREE_CODE (from
))
7839 if (TREE_CODE (from
) == OFFSET_TYPE
7840 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
7841 TYPE_OFFSET_BASETYPE (to
)))
7844 if (TREE_CODE (to
) == VECTOR_TYPE
)
7845 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7847 if (TREE_CODE (to
) != POINTER_TYPE
)
7848 return (is_opaque_pointer
7849 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
7853 /* Returns the type qualifiers for this type, including the qualifiers on the
7854 elements for an array type. */
7857 cp_type_quals (const_tree type
)
7860 /* This CONST_CAST is okay because strip_array_types returns its
7861 argument unmodified and we assign it to a const_tree. */
7862 type
= strip_array_types (CONST_CAST_TREE (type
));
7863 if (type
== error_mark_node
7864 /* Quals on a FUNCTION_TYPE are memfn quals. */
7865 || TREE_CODE (type
) == FUNCTION_TYPE
)
7866 return TYPE_UNQUALIFIED
;
7867 quals
= TYPE_QUALS (type
);
7868 /* METHOD and REFERENCE_TYPEs should never have quals. */
7869 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
7870 && TREE_CODE (type
) != REFERENCE_TYPE
)
7871 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
7872 == TYPE_UNQUALIFIED
));
7876 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
7880 type_memfn_quals (const_tree type
)
7882 if (TREE_CODE (type
) == FUNCTION_TYPE
)
7883 return TYPE_QUALS (type
);
7884 else if (TREE_CODE (type
) == METHOD_TYPE
)
7885 return cp_type_quals (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))));
7890 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
7894 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
)
7896 /* Could handle METHOD_TYPE here if necessary. */
7897 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7898 if (TYPE_QUALS (type
) == memfn_quals
)
7900 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
7902 return build_qualified_type (type
, memfn_quals
);
7905 /* Returns nonzero if the TYPE is const from a C++ perspective: look inside
7909 cp_type_readonly (const_tree type
)
7911 /* This CONST_CAST is okay because strip_array_types returns its
7912 argument unmodified and we assign it to a const_tree. */
7913 return (cp_type_quals (type
) & TYPE_QUAL_CONST
) != 0;
7916 /* Returns nonzero if TYPE is const or volatile. */
7919 cv_qualified_p (const_tree type
)
7921 int quals
= cp_type_quals (type
);
7922 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
7925 /* Returns nonzero if the TYPE contains a mutable member. */
7928 cp_has_mutable_p (const_tree type
)
7930 /* This CONST_CAST is okay because strip_array_types returns its
7931 argument unmodified and we assign it to a const_tree. */
7932 type
= strip_array_types (CONST_CAST_TREE(type
));
7934 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
7937 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
7938 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
7939 approximation. In particular, consider:
7942 struct S { int i; };
7943 const S s = { f(); }
7945 Here, we will make "s" as TREE_READONLY (because it is declared
7946 "const") -- only to reverse ourselves upon seeing that the
7947 initializer is non-constant. */
7950 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
7952 tree type
= TREE_TYPE (decl
);
7954 if (type
== error_mark_node
)
7957 if (TREE_CODE (decl
) == TYPE_DECL
)
7960 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
7961 && type_quals
!= TYPE_UNQUALIFIED
));
7963 /* Avoid setting TREE_READONLY incorrectly. */
7964 if (/* If the object has a constructor, the constructor may modify
7966 TYPE_NEEDS_CONSTRUCTING (type
)
7967 /* If the type isn't complete, we don't know yet if it will need
7969 || !COMPLETE_TYPE_P (type
)
7970 /* If the type has a mutable component, that component might be
7972 || TYPE_HAS_MUTABLE_P (type
))
7973 type_quals
&= ~TYPE_QUAL_CONST
;
7975 c_apply_type_quals_to_decl (type_quals
, decl
);
7978 /* Subroutine of casts_away_constness. Make T1 and T2 point at
7979 exemplar types such that casting T1 to T2 is casting away constness
7980 if and only if there is no implicit conversion from T1 to T2. */
7983 casts_away_constness_r (tree
*t1
, tree
*t2
)
7988 /* [expr.const.cast]
7990 For multi-level pointer to members and multi-level mixed pointers
7991 and pointers to members (conv.qual), the "member" aspect of a
7992 pointer to member level is ignored when determining if a const
7993 cv-qualifier has been cast away. */
7994 /* [expr.const.cast]
7996 For two pointer types:
7998 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
7999 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8002 casting from X1 to X2 casts away constness if, for a non-pointer
8003 type T there does not exist an implicit conversion (clause
8006 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8010 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8011 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
8012 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
8014 *t1
= cp_build_qualified_type (void_type_node
,
8015 cp_type_quals (*t1
));
8016 *t2
= cp_build_qualified_type (void_type_node
,
8017 cp_type_quals (*t2
));
8021 quals1
= cp_type_quals (*t1
);
8022 quals2
= cp_type_quals (*t2
);
8024 if (TYPE_PTRMEM_P (*t1
))
8025 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
8027 *t1
= TREE_TYPE (*t1
);
8028 if (TYPE_PTRMEM_P (*t2
))
8029 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
8031 *t2
= TREE_TYPE (*t2
);
8033 casts_away_constness_r (t1
, t2
);
8034 *t1
= build_pointer_type (*t1
);
8035 *t2
= build_pointer_type (*t2
);
8036 *t1
= cp_build_qualified_type (*t1
, quals1
);
8037 *t2
= cp_build_qualified_type (*t2
, quals2
);
8040 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8043 ??? This function returns non-zero if casting away qualifiers not
8044 just const. We would like to return to the caller exactly which
8045 qualifiers are casted away to give more accurate diagnostics.
8049 casts_away_constness (tree t1
, tree t2
)
8051 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
8053 /* [expr.const.cast]
8055 Casting from an lvalue of type T1 to an lvalue of type T2
8056 using a reference cast casts away constness if a cast from an
8057 rvalue of type "pointer to T1" to the type "pointer to T2"
8058 casts away constness. */
8059 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
8060 return casts_away_constness (build_pointer_type (t1
),
8061 build_pointer_type (TREE_TYPE (t2
)));
8064 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
8065 /* [expr.const.cast]
8067 Casting from an rvalue of type "pointer to data member of X
8068 of type T1" to the type "pointer to data member of Y of type
8069 T2" casts away constness if a cast from an rvalue of type
8070 "pointer to T1" to the type "pointer to T2" casts away
8072 return casts_away_constness
8073 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
8074 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
8076 /* Casting away constness is only something that makes sense for
8077 pointer or reference types. */
8078 if (TREE_CODE (t1
) != POINTER_TYPE
8079 || TREE_CODE (t2
) != POINTER_TYPE
)
8082 /* Top-level qualifiers don't matter. */
8083 t1
= TYPE_MAIN_VARIANT (t1
);
8084 t2
= TYPE_MAIN_VARIANT (t2
);
8085 casts_away_constness_r (&t1
, &t2
);
8086 if (!can_convert (t2
, t1
))
8092 /* If T is a REFERENCE_TYPE return the type to which T refers.
8093 Otherwise, return T itself. */
8096 non_reference (tree t
)
8098 if (TREE_CODE (t
) == REFERENCE_TYPE
)
8104 /* Return nonzero if REF is an lvalue valid for this language;
8105 otherwise, print an error message and return zero. USE says
8106 how the lvalue is being used and so selects the error message. */
8109 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
8111 int win
= lvalue_p (ref
);
8113 if (!win
&& (complain
& tf_error
))