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
);
815 /* Save space: see if the result is identical to one of the args. */
816 if (valtype
== TREE_TYPE (t1
) && ! p2
)
817 return cp_build_type_attribute_variant (t1
, attributes
);
818 if (valtype
== TREE_TYPE (t2
) && ! p1
)
819 return cp_build_type_attribute_variant (t2
, attributes
);
821 /* Simple way if one arg fails to specify argument types. */
822 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
824 rval
= build_function_type (valtype
, p2
);
825 if ((raises
= TYPE_RAISES_EXCEPTIONS (t2
)))
826 rval
= build_exception_variant (rval
, raises
);
827 return cp_build_type_attribute_variant (rval
, attributes
);
829 raises
= TYPE_RAISES_EXCEPTIONS (t1
);
830 if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
832 rval
= build_function_type (valtype
, p1
);
834 rval
= build_exception_variant (rval
, raises
);
835 return cp_build_type_attribute_variant (rval
, attributes
);
838 rval
= build_function_type (valtype
, commonparms (p1
, p2
));
839 t1
= build_exception_variant (rval
, raises
);
845 /* Get this value the long way, since TYPE_METHOD_BASETYPE
846 is just the main variant of this. */
847 tree basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2
)));
848 tree raises
= TYPE_RAISES_EXCEPTIONS (t1
);
851 /* If this was a member function type, get back to the
852 original type of type member function (i.e., without
853 the class instance variable up front. */
854 t1
= build_function_type (TREE_TYPE (t1
),
855 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
856 t2
= build_function_type (TREE_TYPE (t2
),
857 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
858 t3
= merge_types (t1
, t2
);
859 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
860 TYPE_ARG_TYPES (t3
));
861 t1
= build_exception_variant (t3
, raises
);
866 /* There is no need to merge attributes into a TYPENAME_TYPE.
867 When the type is instantiated it will have whatever
868 attributes result from the instantiation. */
874 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
876 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
879 return cp_build_type_attribute_variant (t1
, attributes
);
882 /* Return the ARRAY_TYPE type without its domain. */
885 strip_array_domain (tree type
)
888 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
889 if (TYPE_DOMAIN (type
) == NULL_TREE
)
891 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
892 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
895 /* Wrapper around cp_common_type that is used by c-common.c and other
896 front end optimizations that remove promotions.
898 Return the common type for two arithmetic types T1 and T2 under the
899 usual arithmetic conversions. The default conversions have already
900 been applied, and enumerated types converted to their compatible
904 common_type (tree t1
, tree t2
)
906 /* If one type is nonsense, use the other */
907 if (t1
== error_mark_node
)
909 if (t2
== error_mark_node
)
912 return cp_common_type (t1
, t2
);
915 /* Return the common type of two pointer types T1 and T2. This is the
916 type for the result of most arithmetic operations if the operands
917 have the given two types.
919 We assume that comp_target_types has already been done and returned
920 nonzero; if that isn't so, this may crash. */
923 common_pointer_type (tree t1
, tree t2
)
925 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
926 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
927 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
929 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
930 CPO_CONVERSION
, tf_warning_or_error
);
933 /* Compare two exception specifier types for exactness or subsetness, if
934 allowed. Returns false for mismatch, true for match (same, or
937 [except.spec] "If a class X ... objects of class X or any class publicly
938 and unambiguously derived from X. Similarly, if a pointer type Y * ...
939 exceptions of type Y * or that are pointers to any type publicly and
940 unambiguously derived from Y. Otherwise a function only allows exceptions
941 that have the same type ..."
942 This does not mention cv qualifiers and is different to what throw
943 [except.throw] and catch [except.catch] will do. They will ignore the
944 top level cv qualifiers, and allow qualifiers in the pointer to class
947 We implement the letter of the standard. */
950 comp_except_types (tree a
, tree b
, bool exact
)
952 if (same_type_p (a
, b
))
956 if (cp_type_quals (a
) || cp_type_quals (b
))
959 if (TREE_CODE (a
) == POINTER_TYPE
960 && TREE_CODE (b
) == POINTER_TYPE
)
964 if (cp_type_quals (a
) || cp_type_quals (b
))
968 if (TREE_CODE (a
) != RECORD_TYPE
969 || TREE_CODE (b
) != RECORD_TYPE
)
972 if (PUBLICLY_UNIQUELY_DERIVED_P (a
, b
))
978 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
979 If EXACT is false, T2 can be stricter than T1 (according to 15.4/7),
980 otherwise it must be exact. Exception lists are unordered, but
981 we've already filtered out duplicates. Most lists will be in order,
982 we should try to make use of that. */
985 comp_except_specs (const_tree t1
, const_tree t2
, bool exact
)
994 if (t1
== NULL_TREE
) /* T1 is ... */
995 return t2
== NULL_TREE
|| !exact
;
996 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
997 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
998 if (t2
== NULL_TREE
) /* T2 is ... */
1000 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1003 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1004 Count how many we find, to determine exactness. For exact matching and
1005 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1007 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1009 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1011 tree a
= TREE_VALUE (probe
);
1012 tree b
= TREE_VALUE (t2
);
1014 if (comp_except_types (a
, b
, exact
))
1016 if (probe
== base
&& exact
)
1017 base
= TREE_CHAIN (probe
);
1022 if (probe
== NULL_TREE
)
1025 return !exact
|| base
== NULL_TREE
|| length
== list_length (t1
);
1028 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1029 [] can match [size]. */
1032 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1041 /* The type of the array elements must be the same. */
1042 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1045 d1
= TYPE_DOMAIN (t1
);
1046 d2
= TYPE_DOMAIN (t2
);
1051 /* If one of the arrays is dimensionless, and the other has a
1052 dimension, they are of different types. However, it is valid to
1060 declarations for an array object can specify
1061 array types that differ by the presence or absence of a major
1062 array bound (_dcl.array_). */
1064 return allow_redeclaration
;
1066 /* Check that the dimensions are the same. */
1068 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1070 max1
= TYPE_MAX_VALUE (d1
);
1071 max2
= TYPE_MAX_VALUE (d2
);
1072 if (processing_template_decl
&& !abi_version_at_least (2)
1073 && !value_dependent_expression_p (max1
)
1074 && !value_dependent_expression_p (max2
))
1076 /* With abi-1 we do not fold non-dependent array bounds, (and
1077 consequently mangle them incorrectly). We must therefore
1078 fold them here, to verify the domains have the same
1084 if (!cp_tree_equal (max1
, max2
))
1090 /* Compare the relative position of T1 and T2 into their respective
1091 template parameter list.
1092 T1 and T2 must be template parameter types.
1093 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1096 comp_template_parms_position (tree t1
, tree t2
)
1098 gcc_assert (t1
&& t2
1099 && TREE_CODE (t1
) == TREE_CODE (t2
)
1100 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1101 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1102 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1104 if (TEMPLATE_TYPE_IDX (t1
) != TEMPLATE_TYPE_IDX (t2
)
1105 || TEMPLATE_TYPE_LEVEL (t1
) != TEMPLATE_TYPE_LEVEL (t2
)
1106 || (TEMPLATE_TYPE_PARAMETER_PACK (t1
)
1107 != TEMPLATE_TYPE_PARAMETER_PACK (t2
)))
1113 /* Subroutine of incompatible_dependent_types_p.
1114 Return the template parameter of the dependent type T.
1115 If T is a typedef, return the template parameters of
1116 the _decl_ of the typedef. T must be a dependent type. */
1119 get_template_parms_of_dependent_type (tree t
)
1121 tree tinfo
= NULL_TREE
, tparms
= NULL_TREE
;
1123 /* First, try the obvious case of getting the
1124 template info from T itself. */
1125 if ((tinfo
= get_template_info (t
)))
1127 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
1128 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (t
);
1129 else if (typedef_variant_p (t
)
1130 && !NAMESPACE_SCOPE_P (TYPE_NAME (t
)))
1131 tinfo
= get_template_info (DECL_CONTEXT (TYPE_NAME (t
)));
1132 /* If T is a TYPENAME_TYPE which context is a template type
1133 parameter, get the template parameters from that context. */
1134 else if (TYPE_CONTEXT (t
)
1135 && TREE_CODE (TYPE_CONTEXT (t
)) == TEMPLATE_TYPE_PARM
)
1136 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (TYPE_CONTEXT (t
));
1137 else if (TYPE_CONTEXT (t
)
1138 && !NAMESPACE_SCOPE_P (t
))
1139 tinfo
= get_template_info (TYPE_CONTEXT (t
));
1142 tparms
= DECL_TEMPLATE_PARMS (TI_TEMPLATE (tinfo
));
1147 /* Subroutine of structural_comptypes.
1148 Compare the dependent types T1 and T2.
1149 Return TRUE if we are sure they can't be equal, FALSE otherwise.
1150 The whole point of this function is to support cases where either T1 or
1151 T2 is a typedef. In those cases, we need to compare the template parameters
1152 of the _decl_ of the typedef. If those don't match then we know T1
1153 and T2 cannot be equal. */
1156 incompatible_dependent_types_p (tree t1
, tree t2
)
1158 tree tparms1
= NULL_TREE
, tparms2
= NULL_TREE
;
1159 bool t1_typedef_variant_p
, t2_typedef_variant_p
;
1161 if (!uses_template_parms (t1
) || !uses_template_parms (t2
))
1164 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
)
1166 /* If T1 and T2 don't have the same relative position in their
1167 template parameters set, they can't be equal. */
1168 if (!comp_template_parms_position (t1
, t2
))
1172 t1_typedef_variant_p
= typedef_variant_p (t1
);
1173 t2_typedef_variant_p
= typedef_variant_p (t2
);
1175 /* Either T1 or T2 must be a typedef. */
1176 if (!t1_typedef_variant_p
&& !t2_typedef_variant_p
)
1179 if (!t1_typedef_variant_p
|| !t2_typedef_variant_p
)
1180 /* Either T1 or T2 is not a typedef so we cannot compare the
1181 the template parms of the typedefs of T1 and T2.
1182 At this point, if the main variant type of T1 and T2 are equal
1183 it means the two types can't be incompatible, from the perspective
1184 of this function. */
1185 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1188 /* So if we reach this point, it means either T1 or T2 is a typedef variant.
1189 Let's compare their template parameters. */
1191 tparms1
= get_template_parms_of_dependent_type (t1
);
1192 tparms2
= get_template_parms_of_dependent_type (t2
);
1194 /* If T2 is a template type parm and if we could not get the template
1195 parms it belongs to, that means we have not finished parsing the
1196 full set of template parameters of the template declaration it
1197 belongs to yet. If we could get the template parms T1 belongs to,
1198 that mostly means T1 and T2 belongs to templates that are
1199 different and incompatible. */
1200 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
1201 && (tparms1
== NULL_TREE
|| tparms2
== NULL_TREE
)
1202 && tparms1
!= tparms2
)
1205 if (tparms1
== NULL_TREE
1206 || tparms2
== NULL_TREE
1207 || tparms1
== tparms2
)
1210 /* And now compare the mighty template parms! */
1211 return !comp_template_parms (tparms1
, tparms2
);
1214 /* Subroutine in comptypes. */
1217 structural_comptypes (tree t1
, tree t2
, int strict
)
1222 /* Suppress errors caused by previously reported errors. */
1223 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1226 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1228 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1229 current instantiation. */
1230 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1231 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1233 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1234 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1236 if (TYPE_PTRMEMFUNC_P (t1
))
1237 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1238 if (TYPE_PTRMEMFUNC_P (t2
))
1239 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1241 /* Different classes of types can't be compatible. */
1242 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1245 /* Qualifiers must match. For array types, we will check when we
1246 recur on the array element types. */
1247 if (TREE_CODE (t1
) != ARRAY_TYPE
1248 && TYPE_QUALS (t1
) != TYPE_QUALS (t2
))
1250 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1253 /* If T1 and T2 are dependent typedefs then check upfront that
1254 the template parameters of their typedef DECLs match before
1255 going down checking their subtypes. */
1256 if (incompatible_dependent_types_p (t1
, t2
))
1259 /* Allow for two different type nodes which have essentially the same
1260 definition. Note that we already checked for equality of the type
1261 qualifiers (just above). */
1263 if (TREE_CODE (t1
) != ARRAY_TYPE
1264 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1268 /* Compare the types. Break out if they could be the same. */
1269 switch (TREE_CODE (t1
))
1273 /* All void and bool types are the same. */
1277 case FIXED_POINT_TYPE
:
1279 /* With these nodes, we can't determine type equivalence by
1280 looking at what is stored in the nodes themselves, because
1281 two nodes might have different TYPE_MAIN_VARIANTs but still
1282 represent the same type. For example, wchar_t and int could
1283 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1284 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1285 and are distinct types. On the other hand, int and the
1288 typedef int INT __attribute((may_alias));
1290 have identical properties, different TYPE_MAIN_VARIANTs, but
1291 represent the same type. The canonical type system keeps
1292 track of equivalence in this case, so we fall back on it. */
1293 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1295 case TEMPLATE_TEMPLATE_PARM
:
1296 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1297 if (!comp_template_parms_position (t1
, t2
))
1299 if (!comp_template_parms
1300 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1301 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1303 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1305 /* Don't check inheritance. */
1306 strict
= COMPARE_STRICT
;
1311 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1312 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1313 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1314 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1317 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1319 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1325 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1326 strict
& ~COMPARE_REDECLARATION
))
1328 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1332 case REFERENCE_TYPE
:
1333 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1335 /* fall through to checks for pointer types */
1338 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1339 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
)
1340 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1346 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1348 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1353 /* Target types must match incl. qualifiers. */
1354 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1358 case TEMPLATE_TYPE_PARM
:
1359 /* If incompatible_dependent_types_p called earlier didn't decide
1360 T1 and T2 were different, they might be equal. */
1364 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1365 TYPENAME_TYPE_FULLNAME (t2
)))
1367 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1371 case UNBOUND_CLASS_TEMPLATE
:
1372 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1374 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1379 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1384 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1385 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1389 case TYPE_PACK_EXPANSION
:
1390 return same_type_p (PACK_EXPANSION_PATTERN (t1
),
1391 PACK_EXPANSION_PATTERN (t2
));
1394 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1395 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1396 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1397 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1398 || (DECLTYPE_FOR_LAMBDA_RETURN (t1
)
1399 != DECLTYPE_FOR_LAMBDA_RETURN (t2
))
1400 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1401 DECLTYPE_TYPE_EXPR (t2
)))
1409 /* If we get here, we know that from a target independent POV the
1410 types are the same. Make sure the target attributes are also
1412 return targetm
.comp_type_attributes (t1
, t2
);
1415 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1416 is a bitwise-or of the COMPARE_* flags. */
1419 comptypes (tree t1
, tree t2
, int strict
)
1421 if (strict
== COMPARE_STRICT
)
1426 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1429 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1430 /* At least one of the types requires structural equality, so
1431 perform a deep check. */
1432 return structural_comptypes (t1
, t2
, strict
);
1434 #ifdef ENABLE_CHECKING
1435 if (USE_CANONICAL_TYPES
)
1437 bool result
= structural_comptypes (t1
, t2
, strict
);
1439 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1440 /* The two types are structurally equivalent, but their
1441 canonical types were different. This is a failure of the
1442 canonical type propagation code.*/
1444 ("canonical types differ for identical types %T and %T",
1446 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1447 /* Two types are structurally different, but the canonical
1448 types are the same. This means we were over-eager in
1449 assigning canonical types. */
1451 ("same canonical type node for different types %T and %T",
1457 if (USE_CANONICAL_TYPES
)
1458 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1461 return structural_comptypes (t1
, t2
, strict
);
1463 else if (strict
== COMPARE_STRUCTURAL
)
1464 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1466 return structural_comptypes (t1
, t2
, strict
);
1469 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1472 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1474 int q1
= cp_type_quals (type1
);
1475 int q2
= cp_type_quals (type2
);
1477 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1478 return (q1
& q2
) == q2
;
1481 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1482 more cv-qualified that TYPE1, and 0 otherwise. */
1485 comp_cv_qualification (const_tree type1
, const_tree type2
)
1487 int q1
= cp_type_quals (type1
);
1488 int q2
= cp_type_quals (type2
);
1493 if ((q1
& q2
) == q2
)
1495 else if ((q1
& q2
) == q1
)
1501 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1502 subset of the cv-qualification signature of TYPE2, and the types
1503 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1506 comp_cv_qual_signature (tree type1
, tree type2
)
1508 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1510 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1516 /* Subroutines of `comptypes'. */
1518 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1519 equivalent in the sense that functions with those parameter types
1520 can have equivalent types. The two lists must be equivalent,
1521 element by element. */
1524 compparms (const_tree parms1
, const_tree parms2
)
1528 /* An unspecified parmlist matches any specified parmlist
1529 whose argument types don't need default promotions. */
1531 for (t1
= parms1
, t2
= parms2
;
1533 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1535 /* If one parmlist is shorter than the other,
1536 they fail to match. */
1539 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1546 /* Process a sizeof or alignof expression where the operand is a
1550 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1555 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1556 if (type
== error_mark_node
)
1557 return error_mark_node
;
1559 type
= non_reference (type
);
1560 if (TREE_CODE (type
) == METHOD_TYPE
)
1563 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
1564 "invalid application of %qs to a member function",
1565 operator_name_info
[(int) op
].name
);
1566 value
= size_one_node
;
1569 dependent_p
= dependent_type_p (type
);
1571 complete_type (type
);
1573 /* VLA types will have a non-constant size. In the body of an
1574 uninstantiated template, we don't need to try to compute the
1575 value, because the sizeof expression is not an integral
1576 constant expression in that case. And, if we do try to
1577 compute the value, we'll likely end up with SAVE_EXPRs, which
1578 the template substitution machinery does not expect to see. */
1579 || (processing_template_decl
1580 && COMPLETE_TYPE_P (type
)
1581 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1583 value
= build_min (op
, size_type_node
, type
);
1584 TREE_READONLY (value
) = 1;
1588 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1593 /* Return the size of the type, without producing any warnings for
1594 types whose size cannot be taken. This routine should be used only
1595 in some other routine that has already produced a diagnostic about
1596 using the size of such a type. */
1598 cxx_sizeof_nowarn (tree type
)
1600 if (TREE_CODE (type
) == FUNCTION_TYPE
1601 || TREE_CODE (type
) == VOID_TYPE
1602 || TREE_CODE (type
) == ERROR_MARK
)
1603 return size_one_node
;
1604 else if (!COMPLETE_TYPE_P (type
))
1605 return size_zero_node
;
1607 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1610 /* Process a sizeof expression where the operand is an expression. */
1613 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1615 if (e
== error_mark_node
)
1616 return error_mark_node
;
1618 if (processing_template_decl
)
1620 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1621 TREE_SIDE_EFFECTS (e
) = 0;
1622 TREE_READONLY (e
) = 1;
1627 /* To get the size of a static data member declared as an array of
1628 unknown bound, we need to instantiate it. */
1629 if (TREE_CODE (e
) == VAR_DECL
1630 && VAR_HAD_UNKNOWN_BOUND (e
)
1631 && DECL_TEMPLATE_INSTANTIATION (e
))
1632 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1634 if (TREE_CODE (e
) == COMPONENT_REF
1635 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1636 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1638 if (complain
& tf_error
)
1639 error ("invalid application of %<sizeof%> to a bit-field");
1641 return error_mark_node
;
1644 else if (is_overloaded_fn (e
))
1646 if (complain
& tf_error
)
1647 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1650 return error_mark_node
;
1653 else if (type_unknown_p (e
))
1655 if (complain
& tf_error
)
1656 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1658 return error_mark_node
;
1664 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1667 /* Implement the __alignof keyword: Return the minimum required
1668 alignment of E, measured in bytes. For VAR_DECL's and
1669 FIELD_DECL's return DECL_ALIGN (which can be set from an
1670 "aligned" __attribute__ specification). */
1673 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1677 if (e
== error_mark_node
)
1678 return error_mark_node
;
1680 if (processing_template_decl
)
1682 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1683 TREE_SIDE_EFFECTS (e
) = 0;
1684 TREE_READONLY (e
) = 1;
1689 if (TREE_CODE (e
) == VAR_DECL
)
1690 t
= size_int (DECL_ALIGN_UNIT (e
));
1691 else if (TREE_CODE (e
) == COMPONENT_REF
1692 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1693 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1695 if (complain
& tf_error
)
1696 error ("invalid application of %<__alignof%> to a bit-field");
1698 return error_mark_node
;
1701 else if (TREE_CODE (e
) == COMPONENT_REF
1702 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1703 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1704 else if (is_overloaded_fn (e
))
1706 if (complain
& tf_error
)
1707 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1710 return error_mark_node
;
1711 if (TREE_CODE (e
) == FUNCTION_DECL
)
1712 t
= size_int (DECL_ALIGN_UNIT (e
));
1716 else if (type_unknown_p (e
))
1718 if (complain
& tf_error
)
1719 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1721 return error_mark_node
;
1725 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1726 complain
& tf_error
);
1728 return fold_convert (size_type_node
, t
);
1731 /* Process a sizeof or alignof expression E with code OP where the operand
1732 is an expression. */
1735 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1737 if (op
== SIZEOF_EXPR
)
1738 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1740 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1743 /* EXPR is being used in a context that is not a function call.
1748 The expression can be used only as the left-hand operand of a
1749 member function call.
1751 [expr.mptr.operator]
1753 If the result of .* or ->* is a function, then that result can be
1754 used only as the operand for the function call operator ().
1756 by issuing an error message if appropriate. Returns true iff EXPR
1757 violates these rules. */
1760 invalid_nonstatic_memfn_p (const_tree expr
, tsubst_flags_t complain
)
1762 if (expr
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1764 if (complain
& tf_error
)
1765 error ("invalid use of non-static member function");
1771 /* If EXP is a reference to a bitfield, and the type of EXP does not
1772 match the declared type of the bitfield, return the declared type
1773 of the bitfield. Otherwise, return NULL_TREE. */
1776 is_bitfield_expr_with_lowered_type (const_tree exp
)
1778 switch (TREE_CODE (exp
))
1781 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1782 ? TREE_OPERAND (exp
, 1)
1783 : TREE_OPERAND (exp
, 0)))
1785 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1788 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1792 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1798 field
= TREE_OPERAND (exp
, 1);
1799 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1801 if (same_type_ignoring_top_level_qualifiers_p
1802 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1804 return DECL_BIT_FIELD_TYPE (field
);
1808 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1809 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1810 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1818 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1819 bitfield with a lowered type, the type of EXP is returned, rather
1823 unlowered_expr_type (const_tree exp
)
1827 type
= is_bitfield_expr_with_lowered_type (exp
);
1829 type
= TREE_TYPE (exp
);
1834 /* Perform the conversions in [expr] that apply when an lvalue appears
1835 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1836 function-to-pointer conversions. In addition, manifest constants
1837 are replaced by their values, and bitfield references are converted
1838 to their declared types.
1840 Although the returned value is being used as an rvalue, this
1841 function does not wrap the returned expression in a
1842 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1843 that the return value is no longer an lvalue. */
1846 decay_conversion (tree exp
)
1849 enum tree_code code
;
1851 type
= TREE_TYPE (exp
);
1852 if (type
== error_mark_node
)
1853 return error_mark_node
;
1855 exp
= resolve_nondeduced_context (exp
);
1856 if (type_unknown_p (exp
))
1858 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1859 return error_mark_node
;
1862 exp
= decl_constant_value (exp
);
1863 if (error_operand_p (exp
))
1864 return error_mark_node
;
1866 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1867 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1868 code
= TREE_CODE (type
);
1869 if (code
== VOID_TYPE
)
1871 error ("void value not ignored as it ought to be");
1872 return error_mark_node
;
1874 if (invalid_nonstatic_memfn_p (exp
, tf_warning_or_error
))
1875 return error_mark_node
;
1876 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1877 return cp_build_unary_op (ADDR_EXPR
, exp
, 0, tf_warning_or_error
);
1878 if (code
== ARRAY_TYPE
)
1883 if (TREE_CODE (exp
) == INDIRECT_REF
)
1884 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1885 TREE_OPERAND (exp
, 0));
1887 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1889 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1890 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1891 TREE_OPERAND (exp
, 0), op1
);
1895 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1897 error ("invalid use of non-lvalue array");
1898 return error_mark_node
;
1901 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1903 if (TREE_CODE (exp
) == VAR_DECL
)
1905 if (!cxx_mark_addressable (exp
))
1906 return error_mark_node
;
1907 adr
= build_nop (ptrtype
, build_address (exp
));
1910 /* This way is better for a COMPONENT_REF since it can
1911 simplify the offset for a component. */
1912 adr
= cp_build_unary_op (ADDR_EXPR
, exp
, 1, tf_warning_or_error
);
1913 return cp_convert (ptrtype
, adr
);
1916 /* If a bitfield is used in a context where integral promotion
1917 applies, then the caller is expected to have used
1918 default_conversion. That function promotes bitfields correctly
1919 before calling this function. At this point, if we have a
1920 bitfield referenced, we may assume that is not subject to
1921 promotion, and that, therefore, the type of the resulting rvalue
1922 is the declared type of the bitfield. */
1923 exp
= convert_bitfield_to_declared_type (exp
);
1925 /* We do not call rvalue() here because we do not want to wrap EXP
1926 in a NON_LVALUE_EXPR. */
1930 Non-class rvalues always have cv-unqualified types. */
1931 type
= TREE_TYPE (exp
);
1932 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
1933 exp
= build_nop (cv_unqualified (type
), exp
);
1938 /* Perform preparatory conversions, as part of the "usual arithmetic
1939 conversions". In particular, as per [expr]:
1941 Whenever an lvalue expression appears as an operand of an
1942 operator that expects the rvalue for that operand, the
1943 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1944 standard conversions are applied to convert the expression to an
1947 In addition, we perform integral promotions here, as those are
1948 applied to both operands to a binary operator before determining
1949 what additional conversions should apply. */
1952 default_conversion (tree exp
)
1954 /* Check for target-specific promotions. */
1955 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
1957 exp
= cp_convert (promoted_type
, exp
);
1958 /* Perform the integral promotions first so that bitfield
1959 expressions (which may promote to "int", even if the bitfield is
1960 declared "unsigned") are promoted correctly. */
1961 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
1962 exp
= perform_integral_promotions (exp
);
1963 /* Perform the other conversions. */
1964 exp
= decay_conversion (exp
);
1969 /* EXPR is an expression with an integral or enumeration type.
1970 Perform the integral promotions in [conv.prom], and return the
1974 perform_integral_promotions (tree expr
)
1981 If the bitfield has an enumerated type, it is treated as any
1982 other value of that type for promotion purposes. */
1983 type
= is_bitfield_expr_with_lowered_type (expr
);
1984 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
1985 type
= TREE_TYPE (expr
);
1986 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
1987 promoted_type
= type_promotes_to (type
);
1988 if (type
!= promoted_type
)
1989 expr
= cp_convert (promoted_type
, expr
);
1993 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1994 decay_conversion to one. */
1997 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
2001 if (TREE_CODE (totype
) != POINTER_TYPE
)
2004 t
= TREE_TYPE (totype
);
2005 if (!same_type_p (t
, char_type_node
)
2006 && !same_type_p (t
, char16_type_node
)
2007 && !same_type_p (t
, char32_type_node
)
2008 && !same_type_p (t
, wchar_type_node
))
2011 if (TREE_CODE (exp
) == STRING_CST
)
2013 /* Make sure that we don't try to convert between char and wide chars. */
2014 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
2019 /* Is this a string constant which has decayed to 'const char *'? */
2020 t
= build_pointer_type (build_qualified_type (t
, TYPE_QUAL_CONST
));
2021 if (!same_type_p (TREE_TYPE (exp
), t
))
2024 if (TREE_CODE (exp
) != ADDR_EXPR
2025 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2029 /* This warning is not very useful, as it complains about printf. */
2031 warning (OPT_Wwrite_strings
,
2032 "deprecated conversion from string constant to %qT",
2038 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2039 can, for example, use as an lvalue. This code used to be in
2040 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2041 expressions, where we're dealing with aggregates. But now it's again only
2042 called from unary_complex_lvalue. The case (in particular) that led to
2043 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2047 rationalize_conditional_expr (enum tree_code code
, tree t
,
2048 tsubst_flags_t complain
)
2050 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2051 the first operand is always the one to be used if both operands
2052 are equal, so we know what conditional expression this used to be. */
2053 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2055 tree op0
= TREE_OPERAND (t
, 0);
2056 tree op1
= TREE_OPERAND (t
, 1);
2058 /* The following code is incorrect if either operand side-effects. */
2059 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2060 && !TREE_SIDE_EFFECTS (op1
));
2062 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
2063 ? LE_EXPR
: GE_EXPR
),
2064 op0
, TREE_CODE (op0
),
2065 op1
, TREE_CODE (op1
),
2066 /*overloaded_p=*/NULL
,
2068 cp_build_unary_op (code
, op0
, 0, complain
),
2069 cp_build_unary_op (code
, op1
, 0, complain
),
2074 build_conditional_expr (TREE_OPERAND (t
, 0),
2075 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2077 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2082 /* Given the TYPE of an anonymous union field inside T, return the
2083 FIELD_DECL for the field. If not found return NULL_TREE. Because
2084 anonymous unions can nest, we must also search all anonymous unions
2085 that are directly reachable. */
2088 lookup_anon_field (tree t
, tree type
)
2092 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
2094 if (TREE_STATIC (field
))
2096 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2099 /* If we find it directly, return the field. */
2100 if (DECL_NAME (field
) == NULL_TREE
2101 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2106 /* Otherwise, it could be nested, search harder. */
2107 if (DECL_NAME (field
) == NULL_TREE
2108 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2110 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2118 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2119 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2120 non-NULL, it indicates the path to the base used to name MEMBER.
2121 If PRESERVE_REFERENCE is true, the expression returned will have
2122 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2123 returned will have the type referred to by the reference.
2125 This function does not perform access control; that is either done
2126 earlier by the parser when the name of MEMBER is resolved to MEMBER
2127 itself, or later when overload resolution selects one of the
2128 functions indicated by MEMBER. */
2131 build_class_member_access_expr (tree object
, tree member
,
2132 tree access_path
, bool preserve_reference
,
2133 tsubst_flags_t complain
)
2137 tree result
= NULL_TREE
;
2139 if (error_operand_p (object
) || error_operand_p (member
))
2140 return error_mark_node
;
2142 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2146 The type of the first expression shall be "class object" (of a
2148 object_type
= TREE_TYPE (object
);
2149 if (!currently_open_class (object_type
)
2150 && !complete_type_or_else (object_type
, object
))
2151 return error_mark_node
;
2152 if (!CLASS_TYPE_P (object_type
))
2154 if (complain
& tf_error
)
2155 error ("request for member %qD in %qE, which is of non-class type %qT",
2156 member
, object
, object_type
);
2157 return error_mark_node
;
2160 /* The standard does not seem to actually say that MEMBER must be a
2161 member of OBJECT_TYPE. However, that is clearly what is
2163 if (DECL_P (member
))
2165 member_scope
= DECL_CLASS_CONTEXT (member
);
2167 if (TREE_DEPRECATED (member
))
2168 warn_deprecated_use (member
, NULL_TREE
);
2171 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2172 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2173 presently be the anonymous union. Go outwards until we find a
2174 type related to OBJECT_TYPE. */
2175 while (ANON_AGGR_TYPE_P (member_scope
)
2176 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2178 member_scope
= TYPE_CONTEXT (member_scope
);
2179 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2181 if (complain
& tf_error
)
2183 if (TREE_CODE (member
) == FIELD_DECL
)
2184 error ("invalid use of nonstatic data member %qE", member
);
2186 error ("%qD is not a member of %qT", member
, object_type
);
2188 return error_mark_node
;
2191 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2192 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2193 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2195 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2197 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2200 /* In [expr.ref], there is an explicit list of the valid choices for
2201 MEMBER. We check for each of those cases here. */
2202 if (TREE_CODE (member
) == VAR_DECL
)
2204 /* A static data member. */
2206 /* If OBJECT has side-effects, they are supposed to occur. */
2207 if (TREE_SIDE_EFFECTS (object
))
2208 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2210 else if (TREE_CODE (member
) == FIELD_DECL
)
2212 /* A non-static data member. */
2217 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
2218 && integer_zerop (TREE_OPERAND (object
, 0)));
2220 /* Convert OBJECT to the type of MEMBER. */
2221 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2222 TYPE_MAIN_VARIANT (member_scope
)))
2227 binfo
= lookup_base (access_path
? access_path
: object_type
,
2228 member_scope
, ba_unique
, &kind
);
2229 if (binfo
== error_mark_node
)
2230 return error_mark_node
;
2232 /* It is invalid to try to get to a virtual base of a
2233 NULL object. The most common cause is invalid use of
2235 if (null_object_p
&& kind
== bk_via_virtual
)
2237 if (complain
& tf_error
)
2239 error ("invalid access to non-static data member %qD of "
2242 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2244 return error_mark_node
;
2247 /* Convert to the base. */
2248 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2250 /* If we found the base successfully then we should be able
2251 to convert to it successfully. */
2252 gcc_assert (object
!= error_mark_node
);
2255 /* Complain about other invalid uses of offsetof, even though they will
2256 give the right answer. Note that we complain whether or not they
2257 actually used the offsetof macro, since there's no way to know at this
2258 point. So we just give a warning, instead of a pedwarn. */
2259 /* Do not produce this warning for base class field references, because
2260 we know for a fact that didn't come from offsetof. This does occur
2261 in various testsuite cases where a null object is passed where a
2262 vtable access is required. */
2263 if (null_object_p
&& warn_invalid_offsetof
2264 && CLASSTYPE_NON_STD_LAYOUT (object_type
)
2265 && !DECL_FIELD_IS_BASE (member
)
2266 && cp_unevaluated_operand
== 0
2267 && (complain
& tf_warning
))
2269 warning (OPT_Winvalid_offsetof
,
2270 "invalid access to non-static data member %qD "
2271 " of NULL object", member
);
2272 warning (OPT_Winvalid_offsetof
,
2273 "(perhaps the %<offsetof%> macro was used incorrectly)");
2276 /* If MEMBER is from an anonymous aggregate, we have converted
2277 OBJECT so that it refers to the class containing the
2278 anonymous union. Generate a reference to the anonymous union
2279 itself, and recur to find MEMBER. */
2280 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2281 /* When this code is called from build_field_call, the
2282 object already has the type of the anonymous union.
2283 That is because the COMPONENT_REF was already
2284 constructed, and was then disassembled before calling
2285 build_field_call. After the function-call code is
2286 cleaned up, this waste can be eliminated. */
2287 && (!same_type_ignoring_top_level_qualifiers_p
2288 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2290 tree anonymous_union
;
2292 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2293 DECL_CONTEXT (member
));
2294 object
= build_class_member_access_expr (object
,
2296 /*access_path=*/NULL_TREE
,
2301 /* Compute the type of the field, as described in [expr.ref]. */
2302 type_quals
= TYPE_UNQUALIFIED
;
2303 member_type
= TREE_TYPE (member
);
2304 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2306 type_quals
= (cp_type_quals (member_type
)
2307 | cp_type_quals (object_type
));
2309 /* A field is const (volatile) if the enclosing object, or the
2310 field itself, is const (volatile). But, a mutable field is
2311 not const, even within a const object. */
2312 if (DECL_MUTABLE_P (member
))
2313 type_quals
&= ~TYPE_QUAL_CONST
;
2314 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2317 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
2319 result
= fold_if_not_in_template (result
);
2321 /* Mark the expression const or volatile, as appropriate. Even
2322 though we've dealt with the type above, we still have to mark the
2323 expression itself. */
2324 if (type_quals
& TYPE_QUAL_CONST
)
2325 TREE_READONLY (result
) = 1;
2326 if (type_quals
& TYPE_QUAL_VOLATILE
)
2327 TREE_THIS_VOLATILE (result
) = 1;
2329 else if (BASELINK_P (member
))
2331 /* The member is a (possibly overloaded) member function. */
2335 /* If the MEMBER is exactly one static member function, then we
2336 know the type of the expression. Otherwise, we must wait
2337 until overload resolution has been performed. */
2338 functions
= BASELINK_FUNCTIONS (member
);
2339 if (TREE_CODE (functions
) == FUNCTION_DECL
2340 && DECL_STATIC_FUNCTION_P (functions
))
2341 type
= TREE_TYPE (functions
);
2343 type
= unknown_type_node
;
2344 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2345 base. That will happen when the function is called. */
2346 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2348 else if (TREE_CODE (member
) == CONST_DECL
)
2350 /* The member is an enumerator. */
2352 /* If OBJECT has side-effects, they are supposed to occur. */
2353 if (TREE_SIDE_EFFECTS (object
))
2354 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2359 if (complain
& tf_error
)
2360 error ("invalid use of %qD", member
);
2361 return error_mark_node
;
2364 if (!preserve_reference
)
2367 If E2 is declared to have type "reference to T", then ... the
2368 type of E1.E2 is T. */
2369 result
= convert_from_reference (result
);
2374 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2375 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2378 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2380 tree object_type
= TREE_TYPE (object
);
2381 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2384 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2386 error ("qualified type %qT does not match destructor name ~%qT",
2388 return error_mark_node
;
2390 if (TREE_CODE (dtor_type
) == IDENTIFIER_NODE
)
2392 /* In a template, names we can't find a match for are still accepted
2393 destructor names, and we check them here. */
2394 if (check_dtor_name (object_type
, dtor_type
))
2395 dtor_type
= object_type
;
2398 error ("object type %qT does not match destructor name ~%qT",
2399 object_type
, dtor_type
);
2400 return error_mark_node
;
2404 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2406 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2407 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2408 return error_mark_node
;
2410 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2411 /*protect=*/1, /*want_type=*/false);
2412 expr
= (adjust_result_of_qualified_name_lookup
2413 (expr
, dtor_type
, object_type
));
2417 /* An expression of the form "A::template B" has been resolved to
2418 DECL. Issue a diagnostic if B is not a template or template
2422 check_template_keyword (tree decl
)
2424 /* The standard says:
2428 If a name prefixed by the keyword template is not a member
2429 template, the program is ill-formed.
2431 DR 228 removed the restriction that the template be a member
2434 DR 96, if accepted would add the further restriction that explicit
2435 template arguments must be provided if the template keyword is
2436 used, but, as of 2005-10-16, that DR is still in "drafting". If
2437 this DR is accepted, then the semantic checks here can be
2438 simplified, as the entity named must in fact be a template
2439 specialization, rather than, as at present, a set of overloaded
2440 functions containing at least one template function. */
2441 if (TREE_CODE (decl
) != TEMPLATE_DECL
2442 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2444 if (!is_overloaded_fn (decl
))
2445 permerror (input_location
, "%qD is not a template", decl
);
2450 if (BASELINK_P (fns
))
2451 fns
= BASELINK_FUNCTIONS (fns
);
2454 tree fn
= OVL_CURRENT (fns
);
2455 if (TREE_CODE (fn
) == TEMPLATE_DECL
2456 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2458 if (TREE_CODE (fn
) == FUNCTION_DECL
2459 && DECL_USE_TEMPLATE (fn
)
2460 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2462 fns
= OVL_NEXT (fns
);
2465 permerror (input_location
, "%qD is not a template", decl
);
2470 /* This function is called by the parser to process a class member
2471 access expression of the form OBJECT.NAME. NAME is a node used by
2472 the parser to represent a name; it is not yet a DECL. It may,
2473 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2474 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2475 there is no reason to do the lookup twice, so the parser keeps the
2476 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2477 be a template via the use of the "A::template B" syntax. */
2480 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2481 tsubst_flags_t complain
)
2486 tree access_path
= NULL_TREE
;
2487 tree orig_object
= object
;
2488 tree orig_name
= name
;
2490 if (object
== error_mark_node
|| name
== error_mark_node
)
2491 return error_mark_node
;
2493 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2494 if (!objc_is_public (object
, name
))
2495 return error_mark_node
;
2497 object_type
= TREE_TYPE (object
);
2499 if (processing_template_decl
)
2501 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2502 dependent_type_p (object_type
)
2503 /* If NAME is just an IDENTIFIER_NODE, then the expression
2505 || TREE_CODE (object
) == IDENTIFIER_NODE
2506 /* If NAME is "f<args>", where either 'f' or 'args' is
2507 dependent, then the expression is dependent. */
2508 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2509 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2510 TREE_OPERAND (name
, 1)))
2511 /* If NAME is "T::X" where "T" is dependent, then the
2512 expression is dependent. */
2513 || (TREE_CODE (name
) == SCOPE_REF
2514 && TYPE_P (TREE_OPERAND (name
, 0))
2515 && dependent_type_p (TREE_OPERAND (name
, 0))))
2516 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2517 object
= build_non_dependent_expr (object
);
2522 The type of the first expression shall be "class object" (of a
2524 if (!currently_open_class (object_type
)
2525 && !complete_type_or_else (object_type
, object
))
2526 return error_mark_node
;
2527 if (!CLASS_TYPE_P (object_type
))
2529 if (complain
& tf_error
)
2530 error ("request for member %qD in %qE, which is of non-class type %qT",
2531 name
, object
, object_type
);
2532 return error_mark_node
;
2535 if (BASELINK_P (name
))
2536 /* A member function that has already been looked up. */
2540 bool is_template_id
= false;
2541 tree template_args
= NULL_TREE
;
2544 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2546 is_template_id
= true;
2547 template_args
= TREE_OPERAND (name
, 1);
2548 name
= TREE_OPERAND (name
, 0);
2550 if (TREE_CODE (name
) == OVERLOAD
)
2551 name
= DECL_NAME (get_first_fn (name
));
2552 else if (DECL_P (name
))
2553 name
= DECL_NAME (name
);
2556 if (TREE_CODE (name
) == SCOPE_REF
)
2558 /* A qualified name. The qualifying class or namespace `S'
2559 has already been looked up; it is either a TYPE or a
2561 scope
= TREE_OPERAND (name
, 0);
2562 name
= TREE_OPERAND (name
, 1);
2564 /* If SCOPE is a namespace, then the qualified name does not
2565 name a member of OBJECT_TYPE. */
2566 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2568 if (complain
& tf_error
)
2569 error ("%<%D::%D%> is not a member of %qT",
2570 scope
, name
, object_type
);
2571 return error_mark_node
;
2574 gcc_assert (CLASS_TYPE_P (scope
));
2575 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2576 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2578 if (constructor_name_p (name
, scope
))
2580 if (complain
& tf_error
)
2581 error ("cannot call constructor %<%T::%D%> directly",
2583 return error_mark_node
;
2586 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2587 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2588 if (access_path
== error_mark_node
)
2589 return error_mark_node
;
2592 if (complain
& tf_error
)
2593 error ("%qT is not a base of %qT", scope
, object_type
);
2594 return error_mark_node
;
2600 access_path
= object_type
;
2603 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2604 member
= lookup_destructor (object
, scope
, name
);
2607 /* Look up the member. */
2608 member
= lookup_member (access_path
, name
, /*protect=*/1,
2609 /*want_type=*/false);
2610 if (member
== NULL_TREE
)
2612 if (complain
& tf_error
)
2613 error ("%qD has no member named %qE", object_type
, name
);
2614 return error_mark_node
;
2616 if (member
== error_mark_node
)
2617 return error_mark_node
;
2622 tree templ
= member
;
2624 if (BASELINK_P (templ
))
2625 templ
= lookup_template_function (templ
, template_args
);
2628 if (complain
& tf_error
)
2629 error ("%qD is not a member template function", name
);
2630 return error_mark_node
;
2635 if (TREE_DEPRECATED (member
))
2636 warn_deprecated_use (member
, NULL_TREE
);
2639 check_template_keyword (member
);
2641 expr
= build_class_member_access_expr (object
, member
, access_path
,
2642 /*preserve_reference=*/false,
2644 if (processing_template_decl
&& expr
!= error_mark_node
)
2646 if (BASELINK_P (member
))
2648 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2649 BASELINK_QUALIFIED_P (member
) = 1;
2652 return build_min_non_dep (COMPONENT_REF
, expr
,
2653 orig_object
, orig_name
,
2660 /* Return an expression for the MEMBER_NAME field in the internal
2661 representation of PTRMEM, a pointer-to-member function. (Each
2662 pointer-to-member function type gets its own RECORD_TYPE so it is
2663 more convenient to access the fields by name than by FIELD_DECL.)
2664 This routine converts the NAME to a FIELD_DECL and then creates the
2665 node for the complete expression. */
2668 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2674 /* This code is a stripped down version of
2675 build_class_member_access_expr. It does not work to use that
2676 routine directly because it expects the object to be of class
2678 ptrmem_type
= TREE_TYPE (ptrmem
);
2679 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2680 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2681 /*want_type=*/false);
2682 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2683 cp_type_quals (ptrmem_type
));
2684 return fold_build3_loc (input_location
,
2685 COMPONENT_REF
, member_type
,
2686 ptrmem
, member
, NULL_TREE
);
2689 /* Given an expression PTR for a pointer, return an expression
2690 for the value pointed to.
2691 ERRORSTRING is the name of the operator to appear in error messages.
2693 This function may need to overload OPERATOR_FNNAME.
2694 Must also handle REFERENCE_TYPEs for C++. */
2697 build_x_indirect_ref (tree expr
, ref_operator errorstring
,
2698 tsubst_flags_t complain
)
2700 tree orig_expr
= expr
;
2703 if (processing_template_decl
)
2705 /* Retain the type if we know the operand is a pointer so that
2706 describable_type doesn't make auto deduction break. */
2707 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2708 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2709 if (type_dependent_expression_p (expr
))
2710 return build_min_nt (INDIRECT_REF
, expr
);
2711 expr
= build_non_dependent_expr (expr
);
2714 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2715 NULL_TREE
, /*overloaded_p=*/NULL
, complain
);
2717 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2719 if (processing_template_decl
&& rval
!= error_mark_node
)
2720 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2725 /* Helper function called from c-common. */
2727 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2728 tree ptr
, ref_operator errorstring
)
2730 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2734 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2735 tsubst_flags_t complain
)
2739 if (ptr
== error_mark_node
)
2740 return error_mark_node
;
2742 if (ptr
== current_class_ptr
)
2743 return current_class_ref
;
2745 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2746 ? ptr
: decay_conversion (ptr
));
2747 type
= TREE_TYPE (pointer
);
2749 if (POINTER_TYPE_P (type
))
2753 If the type of the expression is "pointer to T," the type
2754 of the result is "T." */
2755 tree t
= TREE_TYPE (type
);
2757 if (CONVERT_EXPR_P (ptr
)
2758 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2760 /* If a warning is issued, mark it to avoid duplicates from
2761 the backend. This only needs to be done at
2762 warn_strict_aliasing > 2. */
2763 if (warn_strict_aliasing
> 2)
2764 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2765 type
, TREE_OPERAND (ptr
, 0)))
2766 TREE_NO_WARNING (ptr
) = 1;
2769 if (VOID_TYPE_P (t
))
2771 /* A pointer to incomplete type (other than cv void) can be
2772 dereferenced [expr.unary.op]/1 */
2773 if (complain
& tf_error
)
2774 error ("%qT is not a pointer-to-object type", type
);
2775 return error_mark_node
;
2777 else if (TREE_CODE (pointer
) == ADDR_EXPR
2778 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2779 /* The POINTER was something like `&x'. We simplify `*&x' to
2781 return TREE_OPERAND (pointer
, 0);
2784 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2786 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2787 so that we get the proper error message if the result is used
2788 to assign to. Also, &* is supposed to be a no-op. */
2789 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2790 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2791 TREE_SIDE_EFFECTS (ref
)
2792 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2796 else if (!(complain
& tf_error
))
2797 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2799 /* `pointer' won't be an error_mark_node if we were given a
2800 pointer to member, so it's cool to check for this here. */
2801 else if (TYPE_PTR_TO_MEMBER_P (type
))
2802 switch (errorstring
)
2804 case RO_ARRAY_INDEXING
:
2805 error ("invalid use of array indexing on pointer to member");
2808 error ("invalid use of unary %<*%> on pointer to member");
2810 case RO_IMPLICIT_CONVERSION
:
2811 error ("invalid use of implicit conversion on pointer to member");
2816 else if (pointer
!= error_mark_node
)
2817 switch (errorstring
)
2820 error ("invalid type argument");
2822 case RO_ARRAY_INDEXING
:
2823 error ("invalid type argument of array indexing");
2826 error ("invalid type argument of unary %<*%>");
2828 case RO_IMPLICIT_CONVERSION
:
2829 error ("invalid type argument of implicit conversion");
2834 return error_mark_node
;
2837 /* This handles expressions of the form "a[i]", which denotes
2840 This is logically equivalent in C to *(a+i), but we may do it differently.
2841 If A is a variable or a member, we generate a primitive ARRAY_REF.
2842 This avoids forcing the array out of registers, and can work on
2843 arrays that are not lvalues (for example, members of structures returned
2846 If INDEX is of some user-defined type, it must be converted to
2847 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2848 will inherit the type of the array, which will be some pointer type.
2850 LOC is the location to use in building the array reference. */
2853 build_array_ref (location_t loc
, tree array
, tree idx
)
2859 error_at (loc
, "subscript missing in array reference");
2860 return error_mark_node
;
2863 if (TREE_TYPE (array
) == error_mark_node
2864 || TREE_TYPE (idx
) == error_mark_node
)
2865 return error_mark_node
;
2867 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2869 switch (TREE_CODE (array
))
2873 tree value
= build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
);
2874 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2875 TREE_OPERAND (array
, 0), value
);
2876 SET_EXPR_LOCATION (ret
, loc
);
2881 ret
= build_conditional_expr
2882 (TREE_OPERAND (array
, 0),
2883 build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
),
2884 build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
),
2885 tf_warning_or_error
);
2886 protected_set_expr_location (ret
, loc
);
2893 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2897 warn_array_subscript_with_type_char (idx
);
2899 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2901 error_at (loc
, "array subscript is not an integer");
2902 return error_mark_node
;
2905 /* Apply integral promotions *after* noticing character types.
2906 (It is unclear why we do these promotions -- the standard
2907 does not say that we should. In fact, the natural thing would
2908 seem to be to convert IDX to ptrdiff_t; we're performing
2909 pointer arithmetic.) */
2910 idx
= perform_integral_promotions (idx
);
2912 /* An array that is indexed by a non-constant
2913 cannot be stored in a register; we must be able to do
2914 address arithmetic on its address.
2915 Likewise an array of elements of variable size. */
2916 if (TREE_CODE (idx
) != INTEGER_CST
2917 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2918 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2921 if (!cxx_mark_addressable (array
))
2922 return error_mark_node
;
2925 /* An array that is indexed by a constant value which is not within
2926 the array bounds cannot be stored in a register either; because we
2927 would get a crash in store_bit_field/extract_bit_field when trying
2928 to access a non-existent part of the register. */
2929 if (TREE_CODE (idx
) == INTEGER_CST
2930 && TYPE_DOMAIN (TREE_TYPE (array
))
2931 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
2933 if (!cxx_mark_addressable (array
))
2934 return error_mark_node
;
2937 if (!lvalue_p (array
))
2938 pedwarn (loc
, OPT_pedantic
,
2939 "ISO C++ forbids subscripting non-lvalue array");
2941 /* Note in C++ it is valid to subscript a `register' array, since
2942 it is valid to take the address of something with that
2943 storage specification. */
2947 while (TREE_CODE (foo
) == COMPONENT_REF
)
2948 foo
= TREE_OPERAND (foo
, 0);
2949 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
))
2950 warning_at (loc
, OPT_Wextra
,
2951 "subscripting array declared %<register%>");
2954 type
= TREE_TYPE (TREE_TYPE (array
));
2955 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
2956 /* Array ref is const/volatile if the array elements are
2957 or if the array is.. */
2958 TREE_READONLY (rval
)
2959 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
2960 TREE_SIDE_EFFECTS (rval
)
2961 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
2962 TREE_THIS_VOLATILE (rval
)
2963 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
2964 ret
= require_complete_type (fold_if_not_in_template (rval
));
2965 protected_set_expr_location (ret
, loc
);
2970 tree ar
= default_conversion (array
);
2971 tree ind
= default_conversion (idx
);
2973 /* Put the integer in IND to simplify error checking. */
2974 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
2981 if (ar
== error_mark_node
)
2984 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
2986 error_at (loc
, "subscripted value is neither array nor pointer");
2987 return error_mark_node
;
2989 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
2991 error_at (loc
, "array subscript is not an integer");
2992 return error_mark_node
;
2995 warn_array_subscript_with_type_char (idx
);
2997 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
2999 tf_warning_or_error
),
3001 tf_warning_or_error
);
3002 protected_set_expr_location (ret
, loc
);
3007 /* Resolve a pointer to member function. INSTANCE is the object
3008 instance to use, if the member points to a virtual member.
3010 This used to avoid checking for virtual functions if basetype
3011 has no virtual functions, according to an earlier ANSI draft.
3012 With the final ISO C++ rules, such an optimization is
3013 incorrect: A pointer to a derived member can be static_cast
3014 to pointer-to-base-member, as long as the dynamic object
3015 later has the right member. */
3018 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
3020 if (TREE_CODE (function
) == OFFSET_REF
)
3021 function
= TREE_OPERAND (function
, 1);
3023 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3025 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
3026 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3028 tree instance_ptr
= *instance_ptrptr
;
3029 tree instance_save_expr
= 0;
3030 if (instance_ptr
== error_mark_node
)
3032 if (TREE_CODE (function
) == PTRMEM_CST
)
3034 /* Extracting the function address from a pmf is only
3035 allowed with -Wno-pmf-conversions. It only works for
3037 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
3038 e1
= convert (fntype
, e1
);
3043 error ("object missing in use of %qE", function
);
3044 return error_mark_node
;
3048 if (TREE_SIDE_EFFECTS (instance_ptr
))
3049 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3051 if (TREE_SIDE_EFFECTS (function
))
3052 function
= save_expr (function
);
3054 /* Start by extracting all the information from the PMF itself. */
3055 e3
= pfn_from_ptrmemfunc (function
);
3056 delta
= delta_from_ptrmemfunc (function
);
3057 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3058 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3060 case ptrmemfunc_vbit_in_pfn
:
3061 e1
= cp_build_binary_op (input_location
,
3062 BIT_AND_EXPR
, idx
, integer_one_node
,
3063 tf_warning_or_error
);
3064 idx
= cp_build_binary_op (input_location
,
3065 MINUS_EXPR
, idx
, integer_one_node
,
3066 tf_warning_or_error
);
3069 case ptrmemfunc_vbit_in_delta
:
3070 e1
= cp_build_binary_op (input_location
,
3071 BIT_AND_EXPR
, delta
, integer_one_node
,
3072 tf_warning_or_error
);
3073 delta
= cp_build_binary_op (input_location
,
3074 RSHIFT_EXPR
, delta
, integer_one_node
,
3075 tf_warning_or_error
);
3082 /* Convert down to the right base before using the instance. A
3083 special case is that in a pointer to member of class C, C may
3084 be incomplete. In that case, the function will of course be
3085 a member of C, and no conversion is required. In fact,
3086 lookup_base will fail in that case, because incomplete
3087 classes do not have BINFOs. */
3088 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3089 if (!same_type_ignoring_top_level_qualifiers_p
3090 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3092 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3093 basetype
, ba_check
, NULL
);
3094 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3096 if (instance_ptr
== error_mark_node
)
3097 return error_mark_node
;
3099 /* ...and then the delta in the PMF. */
3100 instance_ptr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (instance_ptr
),
3101 instance_ptr
, fold_convert (sizetype
, delta
));
3103 /* Hand back the adjusted 'this' argument to our caller. */
3104 *instance_ptrptr
= instance_ptr
;
3106 /* Next extract the vtable pointer from the object. */
3107 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3109 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, tf_warning_or_error
);
3110 /* If the object is not dynamic the access invokes undefined
3111 behavior. As it is not executed in this case silence the
3112 spurious warnings it may provoke. */
3113 TREE_NO_WARNING (vtbl
) = 1;
3115 /* Finally, extract the function pointer from the vtable. */
3116 e2
= fold_build2_loc (input_location
,
3117 POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
,
3118 fold_convert (sizetype
, idx
));
3119 e2
= cp_build_indirect_ref (e2
, RO_NULL
, tf_warning_or_error
);
3120 TREE_CONSTANT (e2
) = 1;
3122 /* When using function descriptors, the address of the
3123 vtable entry is treated as a function pointer. */
3124 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3125 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3126 cp_build_unary_op (ADDR_EXPR
, e2
, /*noconvert=*/1,
3127 tf_warning_or_error
));
3129 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3130 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
3132 /* Make sure this doesn't get evaluated first inside one of the
3133 branches of the COND_EXPR. */
3134 if (instance_save_expr
)
3135 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3136 instance_save_expr
, e1
);
3143 /* Used by the C-common bits. */
3145 build_function_call (location_t loc ATTRIBUTE_UNUSED
,
3146 tree function
, tree params
)
3148 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3151 /* Used by the C-common bits. */
3153 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED
,
3154 tree function
, VEC(tree
,gc
) *params
,
3155 VEC(tree
,gc
) *origtypes ATTRIBUTE_UNUSED
)
3157 VEC(tree
,gc
) *orig_params
= params
;
3158 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3159 tf_warning_or_error
);
3161 /* cp_build_function_call_vec can reallocate PARAMS by adding
3162 default arguments. That should never happen here. Verify
3164 gcc_assert (params
== orig_params
);
3169 /* Build a function call using a tree list of arguments. */
3172 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3177 vec
= make_tree_vector ();
3178 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3179 VEC_safe_push (tree
, gc
, vec
, TREE_VALUE (params
));
3180 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3181 release_tree_vector (vec
);
3185 /* Build a function call using a vector of arguments. PARAMS may be
3186 NULL if there are no parameters. This changes the contents of
3190 cp_build_function_call_vec (tree function
, VEC(tree
,gc
) **params
,
3191 tsubst_flags_t complain
)
3193 tree fntype
, fndecl
;
3195 tree original
= function
;
3199 VEC(tree
,gc
) *allocated
= NULL
;
3202 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3203 expressions, like those used for ObjC messenger dispatches. */
3204 if (params
!= NULL
&& !VEC_empty (tree
, *params
))
3205 function
= objc_rewrite_function_call (function
,
3206 VEC_index (tree
, *params
, 0));
3208 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3209 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3210 if (TREE_CODE (function
) == NOP_EXPR
3211 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3212 function
= TREE_OPERAND (function
, 0);
3214 if (TREE_CODE (function
) == FUNCTION_DECL
)
3216 mark_used (function
);
3219 /* Convert anything with function type to a pointer-to-function. */
3220 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
3221 pedwarn (input_location
, OPT_pedantic
,
3222 "ISO C++ forbids calling %<::main%> from within program");
3224 function
= build_addr_func (function
);
3230 function
= build_addr_func (function
);
3233 if (function
== error_mark_node
)
3234 return error_mark_node
;
3236 fntype
= TREE_TYPE (function
);
3238 if (TYPE_PTRMEMFUNC_P (fntype
))
3240 if (complain
& tf_error
)
3241 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3242 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3243 original
, original
);
3244 return error_mark_node
;
3247 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
3248 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3250 if (!((TREE_CODE (fntype
) == POINTER_TYPE
3251 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
3253 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3255 if (complain
& tf_error
)
3256 error ("%qE cannot be used as a function", original
);
3257 return error_mark_node
;
3260 /* fntype now gets the type of function pointed to. */
3261 fntype
= TREE_TYPE (fntype
);
3262 parm_types
= TYPE_ARG_TYPES (fntype
);
3266 allocated
= make_tree_vector ();
3267 params
= &allocated
;
3270 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3273 return error_mark_node
;
3275 argarray
= VEC_address (tree
, *params
);
3277 /* Check for errors in format strings and inappropriately
3279 check_function_arguments (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
,
3282 ret
= build_cxx_call (function
, nargs
, argarray
);
3284 if (allocated
!= NULL
)
3285 release_tree_vector (allocated
);
3290 /* Subroutine of convert_arguments.
3291 Warn about wrong number of args are genereted. */
3294 warn_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3298 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3300 if (DECL_NAME (fndecl
) == NULL_TREE
3301 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3304 ? G_("too many arguments to constructor %q#D")
3305 : G_("too few arguments to constructor %q#D"),
3310 ? G_("too many arguments to member function %q#D")
3311 : G_("too few arguments to member function %q#D"),
3317 ? G_("too many arguments to function %q#D")
3318 : G_("too few arguments to function %q#D"),
3320 inform (DECL_SOURCE_LOCATION (fndecl
),
3324 error_at (loc
, too_many_p
? G_("too many arguments to function")
3325 : G_("too few arguments to function"));
3328 /* Convert the actual parameter expressions in the list VALUES to the
3329 types in the list TYPELIST. The converted expressions are stored
3330 back in the VALUES vector.
3331 If parmdecls is exhausted, or when an element has NULL as its type,
3332 perform the default conversions.
3334 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3336 This is also where warnings about wrong number of args are generated.
3338 Returns the actual number of arguments processed (which might be less
3339 than the length of the vector), or -1 on error.
3341 In C++, unspecified trailing parameters can be filled in with their
3342 default arguments, if such were specified. Do so here. */
3345 convert_arguments (tree typelist
, VEC(tree
,gc
) **values
, tree fndecl
,
3346 int flags
, tsubst_flags_t complain
)
3351 /* Argument passing is always copy-initialization. */
3352 flags
|= LOOKUP_ONLYCONVERTING
;
3354 for (i
= 0, typetail
= typelist
;
3355 i
< VEC_length (tree
, *values
);
3358 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3359 tree val
= VEC_index (tree
, *values
, i
);
3361 if (val
== error_mark_node
|| type
== error_mark_node
)
3364 if (type
== void_type_node
)
3366 if (complain
& tf_error
)
3368 warn_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3375 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3376 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3377 if (TREE_CODE (val
) == NOP_EXPR
3378 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3379 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3380 val
= TREE_OPERAND (val
, 0);
3382 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3384 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3385 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3386 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3387 val
= decay_conversion (val
);
3390 if (val
== error_mark_node
)
3395 /* Formal parm type is specified by a function prototype. */
3398 if (!COMPLETE_TYPE_P (complete_type (type
)))
3400 if (complain
& tf_error
)
3403 error ("parameter %P of %qD has incomplete type %qT",
3406 error ("parameter %P has incomplete type %qT", i
, type
);
3408 parmval
= error_mark_node
;
3412 parmval
= convert_for_initialization
3413 (NULL_TREE
, type
, val
, flags
,
3414 "argument passing", fndecl
, i
, complain
);
3415 parmval
= convert_for_arg_passing (type
, parmval
);
3418 if (parmval
== error_mark_node
)
3421 VEC_replace (tree
, *values
, i
, parmval
);
3425 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3426 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3427 /* Don't do ellipsis conversion for __built_in_constant_p
3428 as this will result in spurious errors for non-trivial
3430 val
= require_complete_type (val
);
3432 val
= convert_arg_to_ellipsis (val
);
3434 VEC_replace (tree
, *values
, i
, val
);
3438 typetail
= TREE_CHAIN (typetail
);
3441 if (typetail
!= 0 && typetail
!= void_list_node
)
3443 /* See if there are default arguments that can be used. Because
3444 we hold default arguments in the FUNCTION_TYPE (which is so
3445 wrong), we can see default parameters here from deduced
3446 contexts (and via typeof) for indirect function calls.
3447 Fortunately we know whether we have a function decl to
3448 provide default arguments in a language conformant
3450 if (fndecl
&& TREE_PURPOSE (typetail
)
3451 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3453 for (; typetail
!= void_list_node
; ++i
)
3456 = convert_default_arg (TREE_VALUE (typetail
),
3457 TREE_PURPOSE (typetail
),
3460 if (parmval
== error_mark_node
)
3463 VEC_safe_push (tree
, gc
, *values
, parmval
);
3464 typetail
= TREE_CHAIN (typetail
);
3465 /* ends with `...'. */
3466 if (typetail
== NULL_TREE
)
3472 if (complain
& tf_error
)
3473 warn_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3481 /* Build a binary-operation expression, after performing default
3482 conversions on the operands. CODE is the kind of expression to
3483 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3484 are the tree codes which correspond to ARG1 and ARG2 when issuing
3485 warnings about possibly misplaced parentheses. They may differ
3486 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3487 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3488 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3489 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3490 ARG2_CODE as ERROR_MARK. */
3493 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3494 tree arg2
, enum tree_code arg2_code
, bool *overloaded_p
,
3495 tsubst_flags_t complain
)
3504 if (processing_template_decl
)
3506 if (type_dependent_expression_p (arg1
)
3507 || type_dependent_expression_p (arg2
))
3508 return build_min_nt (code
, arg1
, arg2
);
3509 arg1
= build_non_dependent_expr (arg1
);
3510 arg2
= build_non_dependent_expr (arg2
);
3513 if (code
== DOTSTAR_EXPR
)
3514 expr
= build_m_component_ref (arg1
, arg2
);
3516 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3517 overloaded_p
, complain
);
3519 /* Check for cases such as x+y<<z which users are likely to
3520 misinterpret. But don't warn about obj << x + y, since that is a
3521 common idiom for I/O. */
3522 if (warn_parentheses
3523 && (complain
& tf_warning
)
3524 && !processing_template_decl
3525 && !error_operand_p (arg1
)
3526 && !error_operand_p (arg2
)
3527 && (code
!= LSHIFT_EXPR
3528 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3529 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3531 if (processing_template_decl
&& expr
!= error_mark_node
)
3532 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3537 /* Build and return an ARRAY_REF expression. */
3540 build_x_array_ref (tree arg1
, tree arg2
, tsubst_flags_t complain
)
3542 tree orig_arg1
= arg1
;
3543 tree orig_arg2
= arg2
;
3546 if (processing_template_decl
)
3548 if (type_dependent_expression_p (arg1
)
3549 || type_dependent_expression_p (arg2
))
3550 return build_min_nt (ARRAY_REF
, arg1
, arg2
,
3551 NULL_TREE
, NULL_TREE
);
3552 arg1
= build_non_dependent_expr (arg1
);
3553 arg2
= build_non_dependent_expr (arg2
);
3556 expr
= build_new_op (ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3557 /*overloaded_p=*/NULL
, complain
);
3559 if (processing_template_decl
&& expr
!= error_mark_node
)
3560 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3561 NULL_TREE
, NULL_TREE
);
3565 /* For the c-common bits. */
3567 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3568 int convert_p ATTRIBUTE_UNUSED
)
3570 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3574 /* Build a binary-operation expression without default conversions.
3575 CODE is the kind of expression to build.
3576 LOCATION is the location_t of the operator in the source code.
3577 This function differs from `build' in several ways:
3578 the data type of the result is computed and recorded in it,
3579 warnings are generated if arg data types are invalid,
3580 special handling for addition and subtraction of pointers is known,
3581 and some optimization is done (operations on narrow ints
3582 are done in the narrower type when that gives the same result).
3583 Constant folding is also done before the result is returned.
3585 Note that the operands will never have enumeral types
3586 because either they have just had the default conversions performed
3587 or they have both just been converted to some other type in which
3588 the arithmetic is to be done.
3590 C++: must do special pointer arithmetic when implementing
3591 multiple inheritance, and deal with pointer to member functions. */
3594 cp_build_binary_op (location_t location
,
3595 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3596 tsubst_flags_t complain
)
3599 enum tree_code code0
, code1
;
3601 const char *invalid_op_diag
;
3603 /* Expression code to give to the expression when it is built.
3604 Normally this is CODE, which is what the caller asked for,
3605 but in some special cases we change it. */
3606 enum tree_code resultcode
= code
;
3608 /* Data type in which the computation is to be performed.
3609 In the simplest cases this is the common type of the arguments. */
3610 tree result_type
= NULL
;
3612 /* Nonzero means operands have already been type-converted
3613 in whatever way is necessary.
3614 Zero means they need to be converted to RESULT_TYPE. */
3617 /* Nonzero means create the expression with this type, rather than
3619 tree build_type
= 0;
3621 /* Nonzero means after finally constructing the expression
3622 convert it to this type. */
3623 tree final_type
= 0;
3627 /* Nonzero if this is an operation like MIN or MAX which can
3628 safely be computed in short if both args are promoted shorts.
3629 Also implies COMMON.
3630 -1 indicates a bitwise operation; this makes a difference
3631 in the exact conditions for when it is safe to do the operation
3632 in a narrower mode. */
3635 /* Nonzero if this is a comparison operation;
3636 if both args are promoted shorts, compare the original shorts.
3637 Also implies COMMON. */
3638 int short_compare
= 0;
3640 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3643 /* True if both operands have arithmetic type. */
3644 bool arithmetic_types_p
;
3646 /* Apply default conversions. */
3650 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3651 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3652 || code
== TRUTH_XOR_EXPR
)
3654 if (!really_overloaded_fn (op0
))
3655 op0
= decay_conversion (op0
);
3656 if (!really_overloaded_fn (op1
))
3657 op1
= decay_conversion (op1
);
3661 if (!really_overloaded_fn (op0
))
3662 op0
= default_conversion (op0
);
3663 if (!really_overloaded_fn (op1
))
3664 op1
= default_conversion (op1
);
3667 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3668 STRIP_TYPE_NOPS (op0
);
3669 STRIP_TYPE_NOPS (op1
);
3671 /* DTRT if one side is an overloaded function, but complain about it. */
3672 if (type_unknown_p (op0
))
3674 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3675 if (t
!= error_mark_node
)
3677 if (complain
& tf_error
)
3678 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3683 if (type_unknown_p (op1
))
3685 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3686 if (t
!= error_mark_node
)
3688 if (complain
& tf_error
)
3689 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3695 type0
= TREE_TYPE (op0
);
3696 type1
= TREE_TYPE (op1
);
3698 /* The expression codes of the data types of the arguments tell us
3699 whether the arguments are integers, floating, pointers, etc. */
3700 code0
= TREE_CODE (type0
);
3701 code1
= TREE_CODE (type1
);
3703 /* If an error was already reported for one of the arguments,
3704 avoid reporting another error. */
3705 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3706 return error_mark_node
;
3708 if ((invalid_op_diag
3709 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3711 error (invalid_op_diag
);
3712 return error_mark_node
;
3715 /* Issue warnings about peculiar, but valid, uses of NULL. */
3716 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3717 /* It's reasonable to use pointer values as operands of &&
3718 and ||, so NULL is no exception. */
3719 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3720 && ( /* Both are NULL (or 0) and the operation was not a
3721 comparison or a pointer subtraction. */
3722 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3723 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
3724 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3725 || (!null_ptr_cst_p (orig_op0
)
3726 && !TYPE_PTR_P (type0
) && !TYPE_PTR_TO_MEMBER_P (type0
))
3727 || (!null_ptr_cst_p (orig_op1
)
3728 && !TYPE_PTR_P (type1
) && !TYPE_PTR_TO_MEMBER_P (type1
)))
3729 && (complain
& tf_warning
))
3730 /* Some sort of arithmetic operation involving NULL was
3732 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3737 /* Subtraction of two similar pointers.
3738 We must subtract them as integers, then divide by object size. */
3739 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3740 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3742 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3743 /* In all other cases except pointer - int, the usual arithmetic
3745 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3750 /* The pointer - int case is just like pointer + int; fall
3753 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3754 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3758 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3759 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3760 if (processing_template_decl
)
3762 result_type
= TREE_TYPE (ptr_operand
);
3765 return cp_pointer_int_sum (code
,
3776 case TRUNC_DIV_EXPR
:
3778 case FLOOR_DIV_EXPR
:
3779 case ROUND_DIV_EXPR
:
3780 case EXACT_DIV_EXPR
:
3781 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3782 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3783 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3784 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3786 enum tree_code tcode0
= code0
, tcode1
= code1
;
3788 warn_for_div_by_zero (location
, op1
);
3790 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3791 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3792 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3793 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3795 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3796 resultcode
= RDIV_EXPR
;
3798 /* When dividing two signed integers, we have to promote to int.
3799 unless we divide by a constant != -1. Note that default
3800 conversion will have been performed on the operands at this
3801 point, so we have to dig out the original type to find out if
3803 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3804 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3805 || (TREE_CODE (op1
) == INTEGER_CST
3806 && ! integer_all_onesp (op1
)));
3815 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3816 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3817 && !VECTOR_FLOAT_TYPE_P (type0
)
3818 && !VECTOR_FLOAT_TYPE_P (type1
)))
3822 case TRUNC_MOD_EXPR
:
3823 case FLOOR_MOD_EXPR
:
3824 warn_for_div_by_zero (location
, op1
);
3826 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3827 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
3828 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
3830 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3832 /* Although it would be tempting to shorten always here, that loses
3833 on some targets, since the modulo instruction is undefined if the
3834 quotient can't be represented in the computation mode. We shorten
3835 only if unsigned or if dividing by something we know != -1. */
3836 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3837 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3838 || (TREE_CODE (op1
) == INTEGER_CST
3839 && ! integer_all_onesp (op1
)));
3844 case TRUTH_ANDIF_EXPR
:
3845 case TRUTH_ORIF_EXPR
:
3846 case TRUTH_AND_EXPR
:
3848 result_type
= boolean_type_node
;
3851 /* Shift operations: result has same type as first operand;
3852 always convert second operand to int.
3853 Also set SHORT_SHIFT if shifting rightward. */
3856 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3858 result_type
= type0
;
3859 if (TREE_CODE (op1
) == INTEGER_CST
)
3861 if (tree_int_cst_lt (op1
, integer_zero_node
))
3863 if ((complain
& tf_warning
)
3864 && c_inhibit_evaluation_warnings
== 0)
3865 warning (0, "right shift count is negative");
3869 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3870 && (complain
& tf_warning
)
3871 && c_inhibit_evaluation_warnings
== 0)
3872 warning (0, "right shift count >= width of type");
3875 /* Convert the shift-count to an integer, regardless of
3876 size of value being shifted. */
3877 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3878 op1
= cp_convert (integer_type_node
, op1
);
3879 /* Avoid converting op1 to result_type later. */
3885 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3887 result_type
= type0
;
3888 if (TREE_CODE (op1
) == INTEGER_CST
)
3890 if (tree_int_cst_lt (op1
, integer_zero_node
))
3892 if ((complain
& tf_warning
)
3893 && c_inhibit_evaluation_warnings
== 0)
3894 warning (0, "left shift count is negative");
3896 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3898 if ((complain
& tf_warning
)
3899 && c_inhibit_evaluation_warnings
== 0)
3900 warning (0, "left shift count >= width of type");
3903 /* Convert the shift-count to an integer, regardless of
3904 size of value being shifted. */
3905 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3906 op1
= cp_convert (integer_type_node
, op1
);
3907 /* Avoid converting op1 to result_type later. */
3914 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3916 result_type
= type0
;
3917 if (TREE_CODE (op1
) == INTEGER_CST
)
3919 if (tree_int_cst_lt (op1
, integer_zero_node
))
3921 if (complain
& tf_warning
)
3922 warning (0, (code
== LROTATE_EXPR
)
3923 ? G_("left rotate count is negative")
3924 : G_("right rotate count is negative"));
3926 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3928 if (complain
& tf_warning
)
3929 warning (0, (code
== LROTATE_EXPR
)
3930 ? G_("left rotate count >= width of type")
3931 : G_("right rotate count >= width of type"));
3934 /* Convert the shift-count to an integer, regardless of
3935 size of value being shifted. */
3936 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3937 op1
= cp_convert (integer_type_node
, op1
);
3943 if ((complain
& tf_warning
)
3944 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
3945 warning (OPT_Wfloat_equal
,
3946 "comparing floating point with == or != is unsafe");
3947 if ((complain
& tf_warning
)
3948 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
3949 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
3950 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
3952 build_type
= boolean_type_node
;
3953 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3954 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
3955 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3956 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
3958 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3959 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
3960 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3961 CPO_COMPARISON
, complain
);
3962 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
3963 && null_ptr_cst_p (op1
))
3965 if (TREE_CODE (op0
) == ADDR_EXPR
3966 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
3968 if (complain
& tf_warning
)
3969 warning (OPT_Waddress
, "the address of %qD will never be NULL",
3970 TREE_OPERAND (op0
, 0));
3972 result_type
= type0
;
3974 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
3975 && null_ptr_cst_p (op0
))
3977 if (TREE_CODE (op1
) == ADDR_EXPR
3978 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
3980 if (complain
& tf_warning
)
3981 warning (OPT_Waddress
, "the address of %qD will never be NULL",
3982 TREE_OPERAND (op1
, 0));
3984 result_type
= type1
;
3986 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3988 result_type
= type0
;
3989 if (complain
& tf_error
)
3990 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
3992 return error_mark_node
;
3994 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
3996 result_type
= type1
;
3997 if (complain
& tf_error
)
3998 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4000 return error_mark_node
;
4002 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
4004 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4005 == ptrmemfunc_vbit_in_delta
)
4007 tree pfn0
= pfn_from_ptrmemfunc (op0
);
4008 tree delta0
= delta_from_ptrmemfunc (op0
);
4009 tree e1
= cp_build_binary_op (location
,
4012 fold_convert (TREE_TYPE (pfn0
),
4015 tree e2
= cp_build_binary_op (location
,
4020 e2
= cp_build_binary_op (location
,
4021 EQ_EXPR
, e2
, integer_zero_node
,
4023 op0
= cp_build_binary_op (location
,
4024 TRUTH_ANDIF_EXPR
, e1
, e2
,
4026 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
4030 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4031 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
4033 result_type
= TREE_TYPE (op0
);
4035 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4036 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4037 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4040 /* E will be the final comparison. */
4042 /* E1 and E2 are for scratch. */
4050 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4051 CPO_COMPARISON
, complain
);
4053 if (!same_type_p (TREE_TYPE (op0
), type
))
4054 op0
= cp_convert_and_check (type
, op0
);
4055 if (!same_type_p (TREE_TYPE (op1
), type
))
4056 op1
= cp_convert_and_check (type
, op1
);
4058 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4059 return error_mark_node
;
4061 if (TREE_SIDE_EFFECTS (op0
))
4062 op0
= save_expr (op0
);
4063 if (TREE_SIDE_EFFECTS (op1
))
4064 op1
= save_expr (op1
);
4066 pfn0
= pfn_from_ptrmemfunc (op0
);
4067 pfn1
= pfn_from_ptrmemfunc (op1
);
4068 delta0
= delta_from_ptrmemfunc (op0
);
4069 delta1
= delta_from_ptrmemfunc (op1
);
4070 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4071 == ptrmemfunc_vbit_in_delta
)
4076 && ((op0.delta == op1.delta)
4077 || (!op0.pfn && op0.delta & 1 == 0
4078 && op1.delta & 1 == 0))
4080 The reason for the `!op0.pfn' bit is that a NULL
4081 pointer-to-member is any member with a zero PFN and
4082 LSB of the DELTA field is 0. */
4084 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4088 e1
= cp_build_binary_op (location
,
4089 EQ_EXPR
, e1
, integer_zero_node
,
4091 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4095 e2
= cp_build_binary_op (location
,
4096 EQ_EXPR
, e2
, integer_zero_node
,
4098 e1
= cp_build_binary_op (location
,
4099 TRUTH_ANDIF_EXPR
, e2
, e1
,
4101 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4103 fold_convert (TREE_TYPE (pfn0
),
4106 e2
= cp_build_binary_op (location
,
4107 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4108 e1
= cp_build_binary_op (location
,
4109 EQ_EXPR
, delta0
, delta1
, complain
);
4110 e1
= cp_build_binary_op (location
,
4111 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4118 && (!op0.pfn || op0.delta == op1.delta))
4120 The reason for the `!op0.pfn' bit is that a NULL
4121 pointer-to-member is any member with a zero PFN; the
4122 DELTA field is unspecified. */
4124 e1
= cp_build_binary_op (location
,
4125 EQ_EXPR
, delta0
, delta1
, complain
);
4126 e2
= cp_build_binary_op (location
,
4129 fold_convert (TREE_TYPE (pfn0
),
4132 e1
= cp_build_binary_op (location
,
4133 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4135 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4136 e
= cp_build_binary_op (location
,
4137 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4138 if (code
== EQ_EXPR
)
4140 return cp_build_binary_op (location
,
4141 EQ_EXPR
, e
, integer_zero_node
, complain
);
4145 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4146 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4148 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4149 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4157 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4158 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4160 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4161 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4162 CPO_COMPARISON
, complain
);
4169 if (TREE_CODE (orig_op0
) == STRING_CST
4170 || TREE_CODE (orig_op1
) == STRING_CST
)
4172 if (complain
& tf_warning
)
4173 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4176 build_type
= boolean_type_node
;
4177 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4178 || code0
== ENUMERAL_TYPE
)
4179 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4180 || code1
== ENUMERAL_TYPE
))
4182 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4183 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4184 CPO_COMPARISON
, complain
);
4185 else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
4186 && integer_zerop (op1
))
4187 result_type
= type0
;
4188 else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
4189 && integer_zerop (op0
))
4190 result_type
= type1
;
4191 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4193 result_type
= type0
;
4194 if (complain
& tf_error
)
4195 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4197 return error_mark_node
;
4199 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4201 result_type
= type1
;
4202 if (complain
& tf_error
)
4203 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4205 return error_mark_node
;
4209 case UNORDERED_EXPR
:
4216 build_type
= integer_type_node
;
4217 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4219 if (complain
& tf_error
)
4220 error ("unordered comparison on non-floating point argument");
4221 return error_mark_node
;
4230 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4231 || code0
== ENUMERAL_TYPE
)
4232 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4233 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4234 arithmetic_types_p
= 1;
4237 arithmetic_types_p
= 0;
4238 /* Vector arithmetic is only allowed when both sides are vectors. */
4239 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4241 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4242 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4245 binary_op_error (location
, code
, type0
, type1
);
4246 return error_mark_node
;
4248 arithmetic_types_p
= 1;
4251 /* Determine the RESULT_TYPE, if it is not already known. */
4253 && arithmetic_types_p
4254 && (shorten
|| common
|| short_compare
))
4255 result_type
= cp_common_type (type0
, type1
);
4259 if (complain
& tf_error
)
4260 error ("invalid operands of types %qT and %qT to binary %qO",
4261 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4262 return error_mark_node
;
4265 /* If we're in a template, the only thing we need to know is the
4267 if (processing_template_decl
)
4269 /* Since the middle-end checks the type when doing a build2, we
4270 need to build the tree in pieces. This built tree will never
4271 get out of the front-end as we replace it when instantiating
4273 tree tmp
= build2 (resultcode
,
4274 build_type
? build_type
: result_type
,
4276 TREE_OPERAND (tmp
, 0) = op0
;
4280 if (arithmetic_types_p
)
4282 bool first_complex
= (code0
== COMPLEX_TYPE
);
4283 bool second_complex
= (code1
== COMPLEX_TYPE
);
4284 int none_complex
= (!first_complex
&& !second_complex
);
4286 /* Adapted from patch for c/24581. */
4287 if (first_complex
!= second_complex
4288 && (code
== PLUS_EXPR
4289 || code
== MINUS_EXPR
4290 || code
== MULT_EXPR
4291 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4292 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4293 && flag_signed_zeros
)
4295 /* An operation on mixed real/complex operands must be
4296 handled specially, but the language-independent code can
4297 more easily optimize the plain complex arithmetic if
4298 -fno-signed-zeros. */
4299 tree real_type
= TREE_TYPE (result_type
);
4303 if (TREE_TYPE (op0
) != result_type
)
4304 op0
= cp_convert_and_check (result_type
, op0
);
4305 if (TREE_TYPE (op1
) != real_type
)
4306 op1
= cp_convert_and_check (real_type
, op1
);
4310 if (TREE_TYPE (op0
) != real_type
)
4311 op0
= cp_convert_and_check (real_type
, op0
);
4312 if (TREE_TYPE (op1
) != result_type
)
4313 op1
= cp_convert_and_check (result_type
, op1
);
4315 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4316 return error_mark_node
;
4319 op0
= save_expr (op0
);
4320 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4321 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4325 case TRUNC_DIV_EXPR
:
4326 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4330 real
= build2 (resultcode
, real_type
, real
, op1
);
4338 op1
= save_expr (op1
);
4339 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4340 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4344 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4347 real
= build2 (resultcode
, real_type
, op0
, real
);
4350 real
= build2 (resultcode
, real_type
, op0
, real
);
4351 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4357 return build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4360 /* For certain operations (which identify themselves by shorten != 0)
4361 if both args were extended from the same smaller type,
4362 do the arithmetic in that type and then extend.
4364 shorten !=0 and !=1 indicates a bitwise operation.
4365 For them, this optimization is safe only if
4366 both args are zero-extended or both are sign-extended.
4367 Otherwise, we might change the result.
4368 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4369 but calculated in (unsigned short) it would be (unsigned short)-1. */
4371 if (shorten
&& none_complex
)
4373 final_type
= result_type
;
4374 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4378 /* Comparison operations are shortened too but differently.
4379 They identify themselves by setting short_compare = 1. */
4383 /* Don't write &op0, etc., because that would prevent op0
4384 from being kept in a register.
4385 Instead, make copies of the our local variables and
4386 pass the copies by reference, then copy them back afterward. */
4387 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4388 enum tree_code xresultcode
= resultcode
;
4390 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4392 return cp_convert (boolean_type_node
, val
);
4393 op0
= xop0
, op1
= xop1
;
4395 resultcode
= xresultcode
;
4398 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4399 && warn_sign_compare
4400 && !TREE_NO_WARNING (orig_op0
)
4401 && !TREE_NO_WARNING (orig_op1
)
4402 /* Do not warn until the template is instantiated; we cannot
4403 bound the ranges of the arguments until that point. */
4404 && !processing_template_decl
4405 && (complain
& tf_warning
)
4406 && c_inhibit_evaluation_warnings
== 0)
4408 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4409 result_type
, resultcode
);
4413 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4414 Then the expression will be built.
4415 It will be given type FINAL_TYPE if that is nonzero;
4416 otherwise, it will be given type RESULT_TYPE. */
4419 if (TREE_TYPE (op0
) != result_type
)
4420 op0
= cp_convert_and_check (result_type
, op0
);
4421 if (TREE_TYPE (op1
) != result_type
)
4422 op1
= cp_convert_and_check (result_type
, op1
);
4424 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4425 return error_mark_node
;
4428 if (build_type
== NULL_TREE
)
4429 build_type
= result_type
;
4431 result
= build2 (resultcode
, build_type
, op0
, op1
);
4432 result
= fold_if_not_in_template (result
);
4433 if (final_type
!= 0)
4434 result
= cp_convert (final_type
, result
);
4436 if (TREE_OVERFLOW_P (result
)
4437 && !TREE_OVERFLOW_P (op0
)
4438 && !TREE_OVERFLOW_P (op1
))
4439 overflow_warning (location
, result
);
4444 /* Return a tree for the sum or difference (RESULTCODE says which)
4445 of pointer PTROP and integer INTOP. */
4448 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4450 tree res_type
= TREE_TYPE (ptrop
);
4452 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4453 in certain circumstance (when it's valid to do so). So we need
4454 to make sure it's complete. We don't need to check here, if we
4455 can actually complete it at all, as those checks will be done in
4456 pointer_int_sum() anyway. */
4457 complete_type (TREE_TYPE (res_type
));
4459 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4460 fold_if_not_in_template (intop
));
4463 /* Return a tree for the difference of pointers OP0 and OP1.
4464 The resulting tree has type int. */
4467 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4470 tree restype
= ptrdiff_type_node
;
4471 tree target_type
= TREE_TYPE (ptrtype
);
4473 if (!complete_type_or_else (target_type
, NULL_TREE
))
4474 return error_mark_node
;
4476 if (TREE_CODE (target_type
) == VOID_TYPE
)
4477 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4478 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4479 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4480 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4481 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4483 /* First do the subtraction as integers;
4484 then drop through to build the divide operator. */
4486 op0
= cp_build_binary_op (input_location
,
4488 cp_convert (restype
, op0
),
4489 cp_convert (restype
, op1
),
4490 tf_warning_or_error
);
4492 /* This generates an error if op1 is a pointer to an incomplete type. */
4493 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4494 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4496 op1
= (TYPE_PTROB_P (ptrtype
)
4497 ? size_in_bytes (target_type
)
4498 : integer_one_node
);
4500 /* Do the division. */
4502 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4503 return fold_if_not_in_template (result
);
4506 /* Construct and perhaps optimize a tree representation
4507 for a unary operation. CODE, a tree_code, specifies the operation
4508 and XARG is the operand. */
4511 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4513 tree orig_expr
= xarg
;
4517 if (processing_template_decl
)
4519 if (type_dependent_expression_p (xarg
))
4520 return build_min_nt (code
, xarg
, NULL_TREE
);
4522 xarg
= build_non_dependent_expr (xarg
);
4527 /* [expr.unary.op] says:
4529 The address of an object of incomplete type can be taken.
4531 (And is just the ordinary address operator, not an overloaded
4532 "operator &".) However, if the type is a template
4533 specialization, we must complete the type at this point so that
4534 an overloaded "operator &" will be available if required. */
4535 if (code
== ADDR_EXPR
4536 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4537 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4538 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4539 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4540 /* Don't look for a function. */;
4542 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4543 /*overloaded_p=*/NULL
, complain
);
4544 if (!exp
&& code
== ADDR_EXPR
)
4546 if (is_overloaded_fn (xarg
))
4548 tree fn
= get_first_fn (xarg
);
4549 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4551 error (DECL_CONSTRUCTOR_P (fn
)
4552 ? G_("taking address of constructor %qE")
4553 : G_("taking address of destructor %qE"),
4555 return error_mark_node
;
4559 /* A pointer to member-function can be formed only by saying
4561 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4562 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4564 if (TREE_CODE (xarg
) != OFFSET_REF
4565 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4567 error ("invalid use of %qE to form a pointer-to-member-function",
4569 if (TREE_CODE (xarg
) != OFFSET_REF
)
4570 inform (input_location
, " a qualified-id is required");
4571 return error_mark_node
;
4575 error ("parentheses around %qE cannot be used to form a"
4576 " pointer-to-member-function",
4578 PTRMEM_OK_P (xarg
) = 1;
4582 if (TREE_CODE (xarg
) == OFFSET_REF
)
4584 ptrmem
= PTRMEM_OK_P (xarg
);
4586 if (!ptrmem
&& !flag_ms_extensions
4587 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4589 /* A single non-static member, make sure we don't allow a
4590 pointer-to-member. */
4591 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4592 TREE_OPERAND (xarg
, 0),
4593 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4594 PTRMEM_OK_P (xarg
) = ptrmem
;
4597 else if (TREE_CODE (xarg
) == TARGET_EXPR
&& (complain
& tf_warning
))
4598 warning (0, "taking address of temporary");
4599 exp
= cp_build_unary_op (ADDR_EXPR
, xarg
, 0, complain
);
4602 if (processing_template_decl
&& exp
!= error_mark_node
)
4603 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4604 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4605 if (TREE_CODE (exp
) == ADDR_EXPR
)
4606 PTRMEM_OK_P (exp
) = ptrmem
;
4610 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4611 constants, where a null value is represented by an INTEGER_CST of
4615 cp_truthvalue_conversion (tree expr
)
4617 tree type
= TREE_TYPE (expr
);
4618 if (TYPE_PTRMEM_P (type
))
4619 return build_binary_op (EXPR_LOCATION (expr
),
4620 NE_EXPR
, expr
, integer_zero_node
, 1);
4622 return c_common_truthvalue_conversion (input_location
, expr
);
4625 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4628 condition_conversion (tree expr
)
4631 if (processing_template_decl
)
4633 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4634 tf_warning_or_error
, LOOKUP_NORMAL
);
4635 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4639 /* Returns the address of T. This function will fold away
4640 ADDR_EXPR of INDIRECT_REF. */
4643 build_address (tree t
)
4645 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4646 return error_mark_node
;
4647 t
= build_fold_addr_expr (t
);
4648 if (TREE_CODE (t
) != ADDR_EXPR
)
4653 /* Returns the address of T with type TYPE. */
4656 build_typed_address (tree t
, tree type
)
4658 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4659 return error_mark_node
;
4660 t
= build_fold_addr_expr_with_type (t
, type
);
4661 if (TREE_CODE (t
) != ADDR_EXPR
)
4666 /* Return a NOP_EXPR converting EXPR to TYPE. */
4669 build_nop (tree type
, tree expr
)
4671 if (type
== error_mark_node
|| error_operand_p (expr
))
4673 return build1 (NOP_EXPR
, type
, expr
);
4676 /* C++: Must handle pointers to members.
4678 Perhaps type instantiation should be extended to handle conversion
4679 from aggregates to types we don't yet know we want? (Or are those
4680 cases typically errors which should be reported?)
4682 NOCONVERT nonzero suppresses the default promotions
4683 (such as from short to int). */
4686 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
4687 tsubst_flags_t complain
)
4689 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4692 const char *errstring
= NULL
;
4694 const char *invalid_op_diag
;
4696 if (error_operand_p (arg
))
4697 return error_mark_node
;
4699 if ((invalid_op_diag
4700 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
4705 error (invalid_op_diag
);
4706 return error_mark_node
;
4711 case UNARY_PLUS_EXPR
:
4714 int flags
= WANT_ARITH
| WANT_ENUM
;
4715 /* Unary plus (but not unary minus) is allowed on pointers. */
4716 if (code
== UNARY_PLUS_EXPR
)
4717 flags
|= WANT_POINTER
;
4718 arg
= build_expr_type_conversion (flags
, arg
, true);
4720 errstring
= (code
== NEGATE_EXPR
4721 ? _("wrong type argument to unary minus")
4722 : _("wrong type argument to unary plus"));
4725 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4726 arg
= perform_integral_promotions (arg
);
4728 /* Make sure the result is not an lvalue: a unary plus or minus
4729 expression is always a rvalue. */
4736 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4740 arg
= default_conversion (arg
);
4742 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
4743 | WANT_VECTOR_OR_COMPLEX
,
4745 errstring
= _("wrong type argument to bit-complement");
4746 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4747 arg
= perform_integral_promotions (arg
);
4751 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4752 errstring
= _("wrong type argument to abs");
4753 else if (!noconvert
)
4754 arg
= default_conversion (arg
);
4758 /* Conjugating a real value is a no-op, but allow it anyway. */
4759 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4760 errstring
= _("wrong type argument to conjugation");
4761 else if (!noconvert
)
4762 arg
= default_conversion (arg
);
4765 case TRUTH_NOT_EXPR
:
4766 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
4768 val
= invert_truthvalue_loc (input_location
, arg
);
4769 if (arg
!= error_mark_node
)
4771 errstring
= _("in argument to unary !");
4778 if (TREE_CODE (arg
) == COMPLEX_CST
)
4779 return TREE_REALPART (arg
);
4780 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4782 arg
= build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4783 return fold_if_not_in_template (arg
);
4789 if (TREE_CODE (arg
) == COMPLEX_CST
)
4790 return TREE_IMAGPART (arg
);
4791 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4793 arg
= build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4794 return fold_if_not_in_template (arg
);
4797 return cp_convert (TREE_TYPE (arg
), integer_zero_node
);
4799 case PREINCREMENT_EXPR
:
4800 case POSTINCREMENT_EXPR
:
4801 case PREDECREMENT_EXPR
:
4802 case POSTDECREMENT_EXPR
:
4803 /* Handle complex lvalues (when permitted)
4804 by reduction to simpler cases. */
4806 val
= unary_complex_lvalue (code
, arg
);
4810 /* Increment or decrement the real part of the value,
4811 and don't change the imaginary part. */
4812 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4816 arg
= stabilize_reference (arg
);
4817 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
4818 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
4819 real
= cp_build_unary_op (code
, real
, 1, complain
);
4820 if (real
== error_mark_node
|| imag
== error_mark_node
)
4821 return error_mark_node
;
4822 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
4826 /* Report invalid types. */
4828 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
4831 if (code
== PREINCREMENT_EXPR
)
4832 errstring
= _("no pre-increment operator for type");
4833 else if (code
== POSTINCREMENT_EXPR
)
4834 errstring
= _("no post-increment operator for type");
4835 else if (code
== PREDECREMENT_EXPR
)
4836 errstring
= _("no pre-decrement operator for type");
4838 errstring
= _("no post-decrement operator for type");
4841 else if (arg
== error_mark_node
)
4842 return error_mark_node
;
4844 /* Report something read-only. */
4846 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
4847 || TREE_READONLY (arg
))
4849 if (complain
& tf_error
)
4850 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
4851 || code
== POSTINCREMENT_EXPR
)
4852 ? REK_INCREMENT
: REK_DECREMENT
));
4854 return error_mark_node
;
4859 tree declared_type
= unlowered_expr_type (arg
);
4861 argtype
= TREE_TYPE (arg
);
4863 /* ARM $5.2.5 last annotation says this should be forbidden. */
4864 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
4866 if (complain
& tf_error
)
4867 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
4868 ? G_("ISO C++ forbids incrementing an enum")
4869 : G_("ISO C++ forbids decrementing an enum"));
4871 return error_mark_node
;
4874 /* Compute the increment. */
4876 if (TREE_CODE (argtype
) == POINTER_TYPE
)
4878 tree type
= complete_type (TREE_TYPE (argtype
));
4880 if (!COMPLETE_OR_VOID_TYPE_P (type
))
4882 if (complain
& tf_error
)
4883 error (((code
== PREINCREMENT_EXPR
4884 || code
== POSTINCREMENT_EXPR
))
4885 ? G_("cannot increment a pointer to incomplete type %qT")
4886 : G_("cannot decrement a pointer to incomplete type %qT"),
4887 TREE_TYPE (argtype
));
4889 return error_mark_node
;
4891 else if ((pedantic
|| warn_pointer_arith
)
4892 && !TYPE_PTROB_P (argtype
))
4894 if (complain
& tf_error
)
4895 permerror (input_location
, (code
== PREINCREMENT_EXPR
4896 || code
== POSTINCREMENT_EXPR
)
4897 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
4898 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
4901 return error_mark_node
;
4904 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
4907 inc
= integer_one_node
;
4909 inc
= cp_convert (argtype
, inc
);
4911 /* Complain about anything else that is not a true lvalue. */
4912 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
4913 || code
== POSTINCREMENT_EXPR
)
4914 ? lv_increment
: lv_decrement
),
4916 return error_mark_node
;
4918 /* Forbid using -- on `bool'. */
4919 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
4921 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
4923 if (complain
& tf_error
)
4924 error ("invalid use of Boolean expression as operand "
4925 "to %<operator--%>");
4926 return error_mark_node
;
4928 val
= boolean_increment (code
, arg
);
4931 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
4933 TREE_SIDE_EFFECTS (val
) = 1;
4938 /* Note that this operation never does default_conversion
4939 regardless of NOCONVERT. */
4941 argtype
= lvalue_type (arg
);
4943 if (TREE_CODE (arg
) == OFFSET_REF
)
4946 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4948 tree type
= build_pointer_type (TREE_TYPE (argtype
));
4949 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4952 else if (pedantic
&& DECL_MAIN_P (arg
))
4955 /* Apparently a lot of autoconf scripts for C++ packages do this,
4956 so only complain if -pedantic. */
4957 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
4958 pedwarn (input_location
, OPT_pedantic
,
4959 "ISO C++ forbids taking address of function %<::main%>");
4960 else if (flag_pedantic_errors
)
4961 return error_mark_node
;
4964 /* Let &* cancel out to simplify resulting code. */
4965 if (TREE_CODE (arg
) == INDIRECT_REF
)
4967 /* We don't need to have `current_class_ptr' wrapped in a
4968 NON_LVALUE_EXPR node. */
4969 if (arg
== current_class_ref
)
4970 return current_class_ptr
;
4972 arg
= TREE_OPERAND (arg
, 0);
4973 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
4975 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
4976 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4979 /* Don't let this be an lvalue. */
4984 /* Uninstantiated types are all functions. Taking the
4985 address of a function is a no-op, so just return the
4988 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
4989 || !IDENTIFIER_OPNAME_P (arg
));
4991 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
4992 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
4994 /* They're trying to take the address of a unique non-static
4995 member function. This is ill-formed (except in MS-land),
4996 but let's try to DTRT.
4997 Note: We only handle unique functions here because we don't
4998 want to complain if there's a static overload; non-unique
4999 cases will be handled by instantiate_type. But we need to
5000 handle this case here to allow casts on the resulting PMF.
5001 We could defer this in non-MS mode, but it's easier to give
5002 a useful error here. */
5004 /* Inside constant member functions, the `this' pointer
5005 contains an extra const qualifier. TYPE_MAIN_VARIANT
5006 is used here to remove this const from the diagnostics
5007 and the created OFFSET_REF. */
5008 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
5009 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
5012 if (! flag_ms_extensions
)
5014 tree name
= DECL_NAME (fn
);
5015 if (!(complain
& tf_error
))
5016 return error_mark_node
;
5017 else if (current_class_type
5018 && TREE_OPERAND (arg
, 0) == current_class_ref
)
5019 /* An expression like &memfn. */
5020 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
5021 " or parenthesized non-static member function to form"
5022 " a pointer to member function. Say %<&%T::%D%>",
5025 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
5026 " function to form a pointer to member function."
5030 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
5034 if (type_unknown_p (arg
))
5035 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
5037 /* Handle complex lvalues (when permitted)
5038 by reduction to simpler cases. */
5039 val
= unary_complex_lvalue (code
, arg
);
5043 switch (TREE_CODE (arg
))
5047 case FIX_TRUNC_EXPR
:
5048 /* Even if we're not being pedantic, we cannot allow this
5049 extension when we're instantiating in a SFINAE
5051 if (! lvalue_p (arg
) && complain
== tf_none
)
5053 if (complain
& tf_error
)
5054 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
5056 return error_mark_node
;
5061 arg
= BASELINK_FUNCTIONS (arg
);
5065 arg
= OVL_CURRENT (arg
);
5069 /* Turn a reference to a non-static data member into a
5070 pointer-to-member. */
5075 if (!PTRMEM_OK_P (arg
))
5076 return cp_build_unary_op (code
, arg
, 0, complain
);
5078 t
= TREE_OPERAND (arg
, 1);
5079 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
5081 if (complain
& tf_error
)
5082 error ("cannot create pointer to reference member %qD", t
);
5083 return error_mark_node
;
5086 type
= build_ptrmem_type (context_for_name_lookup (t
),
5088 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
5096 /* Anything not already handled and not a true memory reference
5098 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5099 && TREE_CODE (argtype
) != METHOD_TYPE
5100 && TREE_CODE (arg
) != OFFSET_REF
5101 && !lvalue_or_else (arg
, lv_addressof
, complain
))
5102 return error_mark_node
;
5104 if (argtype
!= error_mark_node
)
5105 argtype
= build_pointer_type (argtype
);
5107 /* In a template, we are processing a non-dependent expression
5108 so we can just form an ADDR_EXPR with the correct type. */
5109 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
5111 val
= build_address (arg
);
5112 if (TREE_CODE (arg
) == OFFSET_REF
)
5113 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
5115 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
5117 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
5119 /* We can only get here with a single static member
5121 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
5122 && DECL_STATIC_FUNCTION_P (fn
));
5124 val
= build_address (fn
);
5125 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
5126 /* Do not lose object's side effects. */
5127 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
5128 TREE_OPERAND (arg
, 0), val
);
5130 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
5132 if (complain
& tf_error
)
5133 error ("attempt to take address of bit-field structure member %qD",
5134 TREE_OPERAND (arg
, 1));
5135 return error_mark_node
;
5139 tree object
= TREE_OPERAND (arg
, 0);
5140 tree field
= TREE_OPERAND (arg
, 1);
5141 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5142 (TREE_TYPE (object
), decl_type_context (field
)));
5143 val
= build_address (arg
);
5146 if (TREE_CODE (argtype
) == POINTER_TYPE
5147 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
5149 build_ptrmemfunc_type (argtype
);
5150 val
= build_ptrmemfunc (argtype
, val
, 0,
5151 /*c_cast_p=*/false);
5163 argtype
= TREE_TYPE (arg
);
5164 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5167 if (complain
& tf_error
)
5168 error ("%s", errstring
);
5169 return error_mark_node
;
5172 /* Hook for the c-common bits that build a unary op. */
5174 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5175 enum tree_code code
, tree xarg
, int noconvert
)
5177 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5180 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5181 for certain kinds of expressions which are not really lvalues
5182 but which we can accept as lvalues.
5184 If ARG is not a kind of expression we can handle, return
5188 unary_complex_lvalue (enum tree_code code
, tree arg
)
5190 /* Inside a template, making these kinds of adjustments is
5191 pointless; we are only concerned with the type of the
5193 if (processing_template_decl
)
5196 /* Handle (a, b) used as an "lvalue". */
5197 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5199 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5200 tf_warning_or_error
);
5201 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5202 TREE_OPERAND (arg
, 0), real_result
);
5205 /* Handle (a ? b : c) used as an "lvalue". */
5206 if (TREE_CODE (arg
) == COND_EXPR
5207 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5208 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5210 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5211 if (TREE_CODE (arg
) == MODIFY_EXPR
5212 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5213 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5215 tree lvalue
= TREE_OPERAND (arg
, 0);
5216 if (TREE_SIDE_EFFECTS (lvalue
))
5218 lvalue
= stabilize_reference (lvalue
);
5219 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5220 lvalue
, TREE_OPERAND (arg
, 1));
5222 return unary_complex_lvalue
5223 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5226 if (code
!= ADDR_EXPR
)
5229 /* Handle (a = b) used as an "lvalue" for `&'. */
5230 if (TREE_CODE (arg
) == MODIFY_EXPR
5231 || TREE_CODE (arg
) == INIT_EXPR
)
5233 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5234 tf_warning_or_error
);
5235 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5237 TREE_NO_WARNING (arg
) = 1;
5241 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5242 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5243 || TREE_CODE (arg
) == OFFSET_REF
)
5246 /* We permit compiler to make function calls returning
5247 objects of aggregate type look like lvalues. */
5251 if (TREE_CODE (targ
) == SAVE_EXPR
)
5252 targ
= TREE_OPERAND (targ
, 0);
5254 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5256 if (TREE_CODE (arg
) == SAVE_EXPR
)
5259 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
5260 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5263 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5264 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5265 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5268 /* Don't let anything else be handled specially. */
5272 /* Mark EXP saying that we need to be able to take the
5273 address of it; it should not be allocated in a register.
5274 Value is true if successful.
5276 C++: we do not allow `current_class_ptr' to be addressable. */
5279 cxx_mark_addressable (tree exp
)
5284 switch (TREE_CODE (x
))
5291 x
= TREE_OPERAND (x
, 0);
5295 if (x
== current_class_ptr
)
5297 error ("cannot take the address of %<this%>, which is an rvalue expression");
5298 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5304 /* Caller should not be trying to mark initialized
5305 constant fields addressable. */
5306 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5307 || DECL_IN_AGGR_P (x
) == 0
5309 || DECL_EXTERNAL (x
));
5314 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5315 && !DECL_ARTIFICIAL (x
))
5317 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5320 ("address of explicit register variable %qD requested", x
);
5323 else if (extra_warnings
)
5325 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5327 TREE_ADDRESSABLE (x
) = 1;
5331 TREE_ADDRESSABLE (x
) = 1;
5335 TREE_ADDRESSABLE (x
) = 1;
5339 TREE_ADDRESSABLE (x
) = 1;
5340 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5348 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5351 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5352 tsubst_flags_t complain
)
5354 tree orig_ifexp
= ifexp
;
5355 tree orig_op1
= op1
;
5356 tree orig_op2
= op2
;
5359 if (processing_template_decl
)
5361 /* The standard says that the expression is type-dependent if
5362 IFEXP is type-dependent, even though the eventual type of the
5363 expression doesn't dependent on IFEXP. */
5364 if (type_dependent_expression_p (ifexp
)
5365 /* As a GNU extension, the middle operand may be omitted. */
5366 || (op1
&& type_dependent_expression_p (op1
))
5367 || type_dependent_expression_p (op2
))
5368 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5369 ifexp
= build_non_dependent_expr (ifexp
);
5371 op1
= build_non_dependent_expr (op1
);
5372 op2
= build_non_dependent_expr (op2
);
5375 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5376 if (processing_template_decl
&& expr
!= error_mark_node
)
5377 return build_min_non_dep (COND_EXPR
, expr
,
5378 orig_ifexp
, orig_op1
, orig_op2
);
5382 /* Given a list of expressions, return a compound expression
5383 that performs them all and returns the value of the last of them. */
5385 tree
build_x_compound_expr_from_list (tree list
, const char *msg
)
5387 tree expr
= TREE_VALUE (list
);
5389 if (TREE_CHAIN (list
))
5392 permerror (input_location
, "%s expression list treated as compound expression", msg
);
5394 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5395 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5396 tf_warning_or_error
);
5402 /* Like build_x_compound_expr_from_list, but using a VEC. */
5405 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5407 if (VEC_empty (tree
, vec
))
5409 else if (VEC_length (tree
, vec
) == 1)
5410 return VEC_index (tree
, vec
, 0);
5418 permerror (input_location
,
5419 "%s expression list treated as compound expression",
5422 expr
= VEC_index (tree
, vec
, 0);
5423 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5424 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5430 /* Handle overloading of the ',' operator when needed. */
5433 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5436 tree orig_op1
= op1
;
5437 tree orig_op2
= op2
;
5439 if (processing_template_decl
)
5441 if (type_dependent_expression_p (op1
)
5442 || type_dependent_expression_p (op2
))
5443 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5444 op1
= build_non_dependent_expr (op1
);
5445 op2
= build_non_dependent_expr (op2
);
5448 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5449 /*overloaded_p=*/NULL
, complain
);
5451 result
= cp_build_compound_expr (op1
, op2
, complain
);
5453 if (processing_template_decl
&& result
!= error_mark_node
)
5454 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5459 /* Like cp_build_compound_expr, but for the c-common bits. */
5462 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5464 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5467 /* Build a compound expression. */
5470 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5472 lhs
= convert_to_void (lhs
, "left-hand operand of comma", complain
);
5474 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5475 return error_mark_node
;
5477 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5479 /* If the rhs is a TARGET_EXPR, then build the compound
5480 expression inside the target_expr's initializer. This
5481 helps the compiler to eliminate unnecessary temporaries. */
5482 tree init
= TREE_OPERAND (rhs
, 1);
5484 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5485 TREE_OPERAND (rhs
, 1) = init
;
5490 if (type_unknown_p (rhs
))
5492 error ("no context to resolve type of %qE", rhs
);
5493 return error_mark_node
;
5496 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5499 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5500 casts away constness. CAST gives the type of cast.
5502 ??? This function warns for casting away any qualifier not just
5503 const. We would like to specify exactly what qualifiers are casted
5508 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5509 enum tree_code cast
)
5511 /* C-style casts are allowed to cast away constness. With
5512 WARN_CAST_QUAL, we still want to issue a warning. */
5513 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5516 if (!casts_away_constness (src_type
, dest_type
))
5522 warning (OPT_Wcast_qual
,
5523 "cast from type %qT to type %qT casts away qualifiers",
5524 src_type
, dest_type
);
5527 case STATIC_CAST_EXPR
:
5528 error ("static_cast from type %qT to type %qT casts away qualifiers",
5529 src_type
, dest_type
);
5532 case REINTERPRET_CAST_EXPR
:
5533 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5534 src_type
, dest_type
);
5541 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5542 (another pointer-to-member type in the same hierarchy) and return
5543 the converted expression. If ALLOW_INVERSE_P is permitted, a
5544 pointer-to-derived may be converted to pointer-to-base; otherwise,
5545 only the other direction is permitted. If C_CAST_P is true, this
5546 conversion is taking place as part of a C-style cast. */
5549 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5552 if (TYPE_PTRMEM_P (type
))
5556 if (TREE_CODE (expr
) == PTRMEM_CST
)
5557 expr
= cplus_expand_constant (expr
);
5558 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5559 TYPE_PTRMEM_CLASS_TYPE (type
),
5562 if (!integer_zerop (delta
))
5564 tree cond
, op1
, op2
;
5566 cond
= cp_build_binary_op (input_location
,
5569 build_int_cst (TREE_TYPE (expr
), -1),
5570 tf_warning_or_error
);
5571 op1
= build_nop (ptrdiff_type_node
, expr
);
5572 op2
= cp_build_binary_op (input_location
,
5573 PLUS_EXPR
, op1
, delta
,
5574 tf_warning_or_error
);
5576 expr
= fold_build3_loc (input_location
,
5577 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5581 return build_nop (type
, expr
);
5584 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5585 allow_inverse_p
, c_cast_p
);
5588 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
5589 a version of EXPR that has TREE_OVERFLOW set if it is set in ORIG.
5590 Otherwise, return EXPR unchanged. */
5593 ignore_overflows (tree expr
, tree orig
)
5595 if (TREE_CODE (expr
) == INTEGER_CST
5596 && CONSTANT_CLASS_P (orig
)
5597 && TREE_CODE (orig
) != STRING_CST
5598 && TREE_OVERFLOW (expr
) != TREE_OVERFLOW (orig
))
5600 if (!TREE_OVERFLOW (orig
))
5601 /* Ensure constant sharing. */
5602 expr
= build_int_cst_wide (TREE_TYPE (expr
),
5603 TREE_INT_CST_LOW (expr
),
5604 TREE_INT_CST_HIGH (expr
));
5607 /* Avoid clobbering a shared constant. */
5608 expr
= copy_node (expr
);
5609 TREE_OVERFLOW (expr
) = TREE_OVERFLOW (orig
);
5615 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5616 this static_cast is being attempted as one of the possible casts
5617 allowed by a C-style cast. (In that case, accessibility of base
5618 classes is not considered, and it is OK to cast away
5619 constness.) Return the result of the cast. *VALID_P is set to
5620 indicate whether or not the cast was valid. */
5623 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5624 bool *valid_p
, tsubst_flags_t complain
)
5630 /* Assume the cast is valid. */
5633 intype
= TREE_TYPE (expr
);
5635 /* Save casted types in the function's used types hash table. */
5636 used_types_insert (type
);
5638 /* [expr.static.cast]
5640 An lvalue of type "cv1 B", where B is a class type, can be cast
5641 to type "reference to cv2 D", where D is a class derived (clause
5642 _class.derived_) from B, if a valid standard conversion from
5643 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5644 same cv-qualification as, or greater cv-qualification than, cv1,
5645 and B is not a virtual base class of D. */
5646 /* We check this case before checking the validity of "TYPE t =
5647 EXPR;" below because for this case:
5650 struct D : public B { D(const B&); };
5652 void f() { static_cast<const D&>(b); }
5654 we want to avoid constructing a new D. The standard is not
5655 completely clear about this issue, but our interpretation is
5656 consistent with other compilers. */
5657 if (TREE_CODE (type
) == REFERENCE_TYPE
5658 && CLASS_TYPE_P (TREE_TYPE (type
))
5659 && CLASS_TYPE_P (intype
)
5660 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5661 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5662 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5663 build_pointer_type (TYPE_MAIN_VARIANT
5664 (TREE_TYPE (type
))))
5666 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5670 /* There is a standard conversion from "D*" to "B*" even if "B"
5671 is ambiguous or inaccessible. If this is really a
5672 static_cast, then we check both for inaccessibility and
5673 ambiguity. However, if this is a static_cast being performed
5674 because the user wrote a C-style cast, then accessibility is
5676 base
= lookup_base (TREE_TYPE (type
), intype
,
5677 c_cast_p
? ba_unique
: ba_check
,
5680 /* Convert from "B*" to "D*". This function will check that "B"
5681 is not a virtual base of "D". */
5682 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5683 base
, /*nonnull=*/false);
5684 /* Convert the pointer to a reference -- but then remember that
5685 there are no expressions with reference type in C++. */
5686 return convert_from_reference (cp_fold_convert (type
, expr
));
5689 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5690 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5691 if (TREE_CODE (type
) == REFERENCE_TYPE
5692 && TYPE_REF_IS_RVALUE (type
)
5693 && real_lvalue_p (expr
)
5694 && reference_related_p (TREE_TYPE (type
), intype
)
5695 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5697 expr
= build_typed_address (expr
, type
);
5698 return convert_from_reference (expr
);
5703 /* Resolve overloaded address here rather than once in
5704 implicit_conversion and again in the inverse code below. */
5705 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5707 expr
= instantiate_type (type
, expr
, complain
);
5708 intype
= TREE_TYPE (expr
);
5711 /* [expr.static.cast]
5713 An expression e can be explicitly converted to a type T using a
5714 static_cast of the form static_cast<T>(e) if the declaration T
5715 t(e);" is well-formed, for some invented temporary variable
5717 result
= perform_direct_initialization_if_possible (type
, expr
,
5718 c_cast_p
, complain
);
5721 result
= convert_from_reference (result
);
5723 /* Ignore any integer overflow caused by the cast. */
5724 result
= ignore_overflows (result
, orig
);
5726 /* [expr.static.cast]
5728 If T is a reference type, the result is an lvalue; otherwise,
5729 the result is an rvalue. */
5730 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5731 result
= rvalue (result
);
5735 /* [expr.static.cast]
5737 Any expression can be explicitly converted to type cv void. */
5738 if (TREE_CODE (type
) == VOID_TYPE
)
5739 return convert_to_void (expr
, /*implicit=*/NULL
, complain
);
5741 /* [expr.static.cast]
5743 The inverse of any standard conversion sequence (clause _conv_),
5744 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5745 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5746 (_conv.bool_) conversions, can be performed explicitly using
5747 static_cast subject to the restriction that the explicit
5748 conversion does not cast away constness (_expr.const.cast_), and
5749 the following additional rules for specific cases: */
5750 /* For reference, the conversions not excluded are: integral
5751 promotions, floating point promotion, integral conversions,
5752 floating point conversions, floating-integral conversions,
5753 pointer conversions, and pointer to member conversions. */
5756 A value of integral _or enumeration_ type can be explicitly
5757 converted to an enumeration type. */
5758 /* The effect of all that is that any conversion between any two
5759 types which are integral, floating, or enumeration types can be
5761 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5762 || SCALAR_FLOAT_TYPE_P (type
))
5763 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5764 || SCALAR_FLOAT_TYPE_P (intype
)))
5766 expr
= ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5768 /* Ignore any integer overflow caused by the cast. */
5769 expr
= ignore_overflows (expr
, orig
);
5773 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5774 && CLASS_TYPE_P (TREE_TYPE (type
))
5775 && CLASS_TYPE_P (TREE_TYPE (intype
))
5776 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5777 (TREE_TYPE (intype
))),
5778 build_pointer_type (TYPE_MAIN_VARIANT
5779 (TREE_TYPE (type
)))))
5784 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5785 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
5786 c_cast_p
? ba_unique
: ba_check
,
5788 return build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
5791 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5792 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5799 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
5800 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
5802 if (TYPE_PTRMEM_P (type
))
5804 t1
= (build_ptrmem_type
5806 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
5807 t2
= (build_ptrmem_type
5809 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
5816 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
5819 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5820 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
5825 /* [expr.static.cast]
5827 An rvalue of type "pointer to cv void" can be explicitly
5828 converted to a pointer to object type. A value of type pointer
5829 to object converted to "pointer to cv void" and back to the
5830 original pointer type will have its original value. */
5831 if (TREE_CODE (intype
) == POINTER_TYPE
5832 && VOID_TYPE_P (TREE_TYPE (intype
))
5833 && TYPE_PTROB_P (type
))
5836 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5837 return build_nop (type
, expr
);
5841 return error_mark_node
;
5844 /* Return an expression representing static_cast<TYPE>(EXPR). */
5847 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5852 if (type
== error_mark_node
|| expr
== error_mark_node
)
5853 return error_mark_node
;
5855 if (processing_template_decl
)
5857 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
5858 /* We don't know if it will or will not have side effects. */
5859 TREE_SIDE_EFFECTS (expr
) = 1;
5860 return convert_from_reference (expr
);
5863 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5864 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5865 if (TREE_CODE (type
) != REFERENCE_TYPE
5866 && TREE_CODE (expr
) == NOP_EXPR
5867 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5868 expr
= TREE_OPERAND (expr
, 0);
5870 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
5875 if (complain
& tf_error
)
5876 error ("invalid static_cast from type %qT to type %qT",
5877 TREE_TYPE (expr
), type
);
5878 return error_mark_node
;
5881 /* EXPR is an expression with member function or pointer-to-member
5882 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5883 not permitted by ISO C++, but we accept it in some modes. If we
5884 are not in one of those modes, issue a diagnostic. Return the
5885 converted expression. */
5888 convert_member_func_to_ptr (tree type
, tree expr
)
5893 intype
= TREE_TYPE (expr
);
5894 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
5895 || TREE_CODE (intype
) == METHOD_TYPE
);
5897 if (pedantic
|| warn_pmf2ptr
)
5898 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
5899 "converting from %qT to %qT", intype
, type
);
5901 if (TREE_CODE (intype
) == METHOD_TYPE
)
5902 expr
= build_addr_func (expr
);
5903 else if (TREE_CODE (expr
) == PTRMEM_CST
)
5904 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
5907 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
5908 decl
= build_address (decl
);
5909 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
5912 return build_nop (type
, expr
);
5915 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
5916 If C_CAST_P is true, this reinterpret cast is being done as part of
5917 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
5918 indicate whether or not reinterpret_cast was valid. */
5921 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5922 bool *valid_p
, tsubst_flags_t complain
)
5926 /* Assume the cast is invalid. */
5930 if (type
== error_mark_node
|| error_operand_p (expr
))
5931 return error_mark_node
;
5933 intype
= TREE_TYPE (expr
);
5935 /* Save casted types in the function's used types hash table. */
5936 used_types_insert (type
);
5938 /* [expr.reinterpret.cast]
5939 An lvalue expression of type T1 can be cast to the type
5940 "reference to T2" if an expression of type "pointer to T1" can be
5941 explicitly converted to the type "pointer to T2" using a
5942 reinterpret_cast. */
5943 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5945 if (! real_lvalue_p (expr
))
5947 if (complain
& tf_error
)
5948 error ("invalid cast of an rvalue expression of type "
5951 return error_mark_node
;
5954 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
5955 "B" are related class types; the reinterpret_cast does not
5956 adjust the pointer. */
5957 if (TYPE_PTR_P (intype
)
5958 && (complain
& tf_warning
)
5959 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
5960 COMPARE_BASE
| COMPARE_DERIVED
)))
5961 warning (0, "casting %qT to %qT does not dereference pointer",
5964 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0, complain
);
5966 if (warn_strict_aliasing
> 2)
5967 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
5969 if (expr
!= error_mark_node
)
5970 expr
= build_reinterpret_cast_1
5971 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
5973 if (expr
!= error_mark_node
)
5974 /* cp_build_indirect_ref isn't right for rvalue refs. */
5975 expr
= convert_from_reference (fold_convert (type
, expr
));
5979 /* As a G++ extension, we consider conversions from member
5980 functions, and pointers to member functions to
5981 pointer-to-function and pointer-to-void types. If
5982 -Wno-pmf-conversions has not been specified,
5983 convert_member_func_to_ptr will issue an error message. */
5984 if ((TYPE_PTRMEMFUNC_P (intype
)
5985 || TREE_CODE (intype
) == METHOD_TYPE
)
5986 && TYPE_PTR_P (type
)
5987 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
5988 || VOID_TYPE_P (TREE_TYPE (type
))))
5989 return convert_member_func_to_ptr (type
, expr
);
5991 /* If the cast is not to a reference type, the lvalue-to-rvalue,
5992 array-to-pointer, and function-to-pointer conversions are
5994 expr
= decay_conversion (expr
);
5996 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5997 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5998 if (TREE_CODE (expr
) == NOP_EXPR
5999 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6000 expr
= TREE_OPERAND (expr
, 0);
6002 if (error_operand_p (expr
))
6003 return error_mark_node
;
6005 intype
= TREE_TYPE (expr
);
6007 /* [expr.reinterpret.cast]
6008 A pointer can be converted to any integral type large enough to
6010 if (CP_INTEGRAL_TYPE_P (type
) && TYPE_PTR_P (intype
))
6012 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
6014 if (complain
& tf_error
)
6015 permerror (input_location
, "cast from %qT to %qT loses precision",
6018 return error_mark_node
;
6021 /* [expr.reinterpret.cast]
6022 A value of integral or enumeration type can be explicitly
6023 converted to a pointer. */
6024 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6027 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6028 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6029 return fold_if_not_in_template (build_nop (type
, expr
));
6030 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6031 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6036 check_for_casting_away_constness (intype
, type
, REINTERPRET_CAST_EXPR
);
6037 /* Warn about possible alignment problems. */
6038 if (STRICT_ALIGNMENT
&& warn_cast_align
6039 && (complain
& tf_warning
)
6040 && !VOID_TYPE_P (type
)
6041 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6042 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6043 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6044 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6045 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6046 "increases required alignment of target type", intype
, type
);
6048 /* We need to strip nops here, because the front end likes to
6049 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6051 if (warn_strict_aliasing
<= 2)
6052 strict_aliasing_warning (intype
, type
, sexpr
);
6054 return fold_if_not_in_template (build_nop (type
, expr
));
6056 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6057 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6059 if (pedantic
&& (complain
& tf_warning
))
6060 /* Only issue a warning, as we have always supported this
6061 where possible, and it is necessary in some cases. DR 195
6062 addresses this issue, but as of 2004/10/26 is still in
6064 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6065 return fold_if_not_in_template (build_nop (type
, expr
));
6067 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6068 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6069 else if (TREE_CODE (intype
) == VECTOR_TYPE
6070 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6071 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6076 if (complain
& tf_error
)
6077 error ("invalid cast from type %qT to type %qT", intype
, type
);
6078 return error_mark_node
;
6081 return cp_convert (type
, expr
);
6085 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6087 if (type
== error_mark_node
|| expr
== error_mark_node
)
6088 return error_mark_node
;
6090 if (processing_template_decl
)
6092 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6094 if (!TREE_SIDE_EFFECTS (t
)
6095 && type_dependent_expression_p (expr
))
6096 /* There might turn out to be side effects inside expr. */
6097 TREE_SIDE_EFFECTS (t
) = 1;
6098 return convert_from_reference (t
);
6101 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6102 /*valid_p=*/NULL
, complain
);
6105 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6106 return an appropriate expression. Otherwise, return
6107 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6108 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6109 performing a C-style cast, its value upon return will indicate
6110 whether or not the conversion succeeded. */
6113 build_const_cast_1 (tree dst_type
, tree expr
, bool complain
,
6117 tree reference_type
;
6119 /* Callers are responsible for handling error_mark_node as a
6120 destination type. */
6121 gcc_assert (dst_type
!= error_mark_node
);
6122 /* In a template, callers should be building syntactic
6123 representations of casts, not using this machinery. */
6124 gcc_assert (!processing_template_decl
);
6126 /* Assume the conversion is invalid. */
6130 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6133 error ("invalid use of const_cast with type %qT, "
6134 "which is not a pointer, "
6135 "reference, nor a pointer-to-data-member type", dst_type
);
6136 return error_mark_node
;
6139 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6142 error ("invalid use of const_cast with type %qT, which is a pointer "
6143 "or reference to a function type", dst_type
);
6144 return error_mark_node
;
6147 /* Save casted types in the function's used types hash table. */
6148 used_types_insert (dst_type
);
6150 src_type
= TREE_TYPE (expr
);
6151 /* Expressions do not really have reference types. */
6152 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6153 src_type
= TREE_TYPE (src_type
);
6155 /* [expr.const.cast]
6157 An lvalue of type T1 can be explicitly converted to an lvalue of
6158 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6159 types) if a pointer to T1 can be explicitly converted to the type
6160 pointer to T2 using a const_cast. */
6161 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6163 reference_type
= dst_type
;
6164 if (! real_lvalue_p (expr
))
6167 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6168 src_type
, dst_type
);
6169 return error_mark_node
;
6171 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6172 src_type
= build_pointer_type (src_type
);
6176 reference_type
= NULL_TREE
;
6177 /* If the destination type is not a reference type, the
6178 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6179 conversions are performed. */
6180 src_type
= type_decays_to (src_type
);
6181 if (src_type
== error_mark_node
)
6182 return error_mark_node
;
6185 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6186 && comp_ptr_ttypes_const (dst_type
, src_type
))
6191 /* This cast is actually a C-style cast. Issue a warning if
6192 the user is making a potentially unsafe cast. */
6193 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
);
6197 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0,
6198 complain
? tf_warning_or_error
: tf_none
);
6199 expr
= build_nop (reference_type
, expr
);
6200 return convert_from_reference (expr
);
6204 expr
= decay_conversion (expr
);
6205 /* build_c_cast puts on a NOP_EXPR to make the result not an
6206 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6207 non-lvalue context. */
6208 if (TREE_CODE (expr
) == NOP_EXPR
6209 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6210 expr
= TREE_OPERAND (expr
, 0);
6211 return build_nop (dst_type
, expr
);
6216 error ("invalid const_cast from type %qT to type %qT",
6217 src_type
, dst_type
);
6218 return error_mark_node
;
6222 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6224 if (type
== error_mark_node
|| error_operand_p (expr
))
6225 return error_mark_node
;
6227 if (processing_template_decl
)
6229 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6231 if (!TREE_SIDE_EFFECTS (t
)
6232 && type_dependent_expression_p (expr
))
6233 /* There might turn out to be side effects inside expr. */
6234 TREE_SIDE_EFFECTS (t
) = 1;
6235 return convert_from_reference (t
);
6238 return build_const_cast_1 (type
, expr
, complain
& tf_error
,
6242 /* Like cp_build_c_cast, but for the c-common bits. */
6245 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6247 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6250 /* Build an expression representing an explicit C-style cast to type
6251 TYPE of expression EXPR. */
6254 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6260 if (type
== error_mark_node
|| error_operand_p (expr
))
6261 return error_mark_node
;
6263 if (processing_template_decl
)
6265 tree t
= build_min (CAST_EXPR
, type
,
6266 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6267 /* We don't know if it will or will not have side effects. */
6268 TREE_SIDE_EFFECTS (t
) = 1;
6269 return convert_from_reference (t
);
6272 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6273 'Class') should always be retained, because this information aids
6274 in method lookup. */
6275 if (objc_is_object_ptr (type
)
6276 && objc_is_object_ptr (TREE_TYPE (expr
)))
6277 return build_nop (type
, expr
);
6279 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6280 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6281 if (TREE_CODE (type
) != REFERENCE_TYPE
6282 && TREE_CODE (value
) == NOP_EXPR
6283 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6284 value
= TREE_OPERAND (value
, 0);
6286 if (TREE_CODE (type
) == ARRAY_TYPE
)
6288 /* Allow casting from T1* to T2[] because Cfront allows it.
6289 NIHCL uses it. It is not valid ISO C++ however. */
6290 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6292 if (complain
& tf_error
)
6293 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6295 return error_mark_node
;
6296 type
= build_pointer_type (TREE_TYPE (type
));
6300 if (complain
& tf_error
)
6301 error ("ISO C++ forbids casting to an array type %qT", type
);
6302 return error_mark_node
;
6306 if (TREE_CODE (type
) == FUNCTION_TYPE
6307 || TREE_CODE (type
) == METHOD_TYPE
)
6309 if (complain
& tf_error
)
6310 error ("invalid cast to function type %qT", type
);
6311 return error_mark_node
;
6314 if (TREE_CODE (type
) == POINTER_TYPE
6315 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
6316 /* Casting to an integer of smaller size is an error detected elsewhere. */
6317 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
6318 /* Don't warn about converting any constant. */
6319 && !TREE_CONSTANT (value
))
6320 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
6321 "cast to pointer from integer of different size");
6323 /* A C-style cast can be a const_cast. */
6324 result
= build_const_cast_1 (type
, value
, /*complain=*/false,
6329 /* Or a static cast. */
6330 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6331 &valid_p
, complain
);
6332 /* Or a reinterpret_cast. */
6334 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6335 &valid_p
, complain
);
6336 /* The static_cast or reinterpret_cast may be followed by a
6339 /* A valid cast may result in errors if, for example, a
6340 conversion to am ambiguous base class is required. */
6341 && !error_operand_p (result
))
6345 /* Non-class rvalues always have cv-unqualified type. */
6346 if (!CLASS_TYPE_P (type
))
6347 type
= TYPE_MAIN_VARIANT (type
);
6348 result_type
= TREE_TYPE (result
);
6349 if (!CLASS_TYPE_P (result_type
))
6350 result_type
= TYPE_MAIN_VARIANT (result_type
);
6351 /* If the type of RESULT does not match TYPE, perform a
6352 const_cast to make it match. If the static_cast or
6353 reinterpret_cast succeeded, we will differ by at most
6354 cv-qualification, so the follow-on const_cast is guaranteed
6356 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6358 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6359 gcc_assert (valid_p
);
6364 return error_mark_node
;
6367 /* For use from the C common bits. */
6369 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6370 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6371 enum tree_code modifycode
,
6372 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6373 tree rhs_origtype ATTRIBUTE_UNUSED
)
6375 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6378 /* Build an assignment expression of lvalue LHS from value RHS.
6379 MODIFYCODE is the code for a binary operator that we use
6380 to combine the old value of LHS with RHS to get the new value.
6381 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6383 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6386 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6387 tsubst_flags_t complain
)
6391 tree lhstype
= TREE_TYPE (lhs
);
6392 tree olhstype
= lhstype
;
6393 bool plain_assign
= (modifycode
== NOP_EXPR
);
6395 /* Avoid duplicate error messages from operands that had errors. */
6396 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6397 return error_mark_node
;
6399 /* Handle control structure constructs used as "lvalues". */
6400 switch (TREE_CODE (lhs
))
6402 /* Handle --foo = 5; as these are valid constructs in C++. */
6403 case PREDECREMENT_EXPR
:
6404 case PREINCREMENT_EXPR
:
6405 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6406 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6407 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6408 TREE_OPERAND (lhs
, 1));
6409 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6410 modifycode
, rhs
, complain
);
6411 if (newrhs
== error_mark_node
)
6412 return error_mark_node
;
6413 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6415 /* Handle (a, b) used as an "lvalue". */
6417 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6418 modifycode
, rhs
, complain
);
6419 if (newrhs
== error_mark_node
)
6420 return error_mark_node
;
6421 return build2 (COMPOUND_EXPR
, lhstype
,
6422 TREE_OPERAND (lhs
, 0), newrhs
);
6425 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6426 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6427 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6428 TREE_OPERAND (lhs
, 1));
6429 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6431 if (newrhs
== error_mark_node
)
6432 return error_mark_node
;
6433 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6437 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6438 when neither operand has side-effects. */
6439 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6440 return error_mark_node
;
6442 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6443 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6445 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6446 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6448 TREE_OPERAND (lhs
, 0),
6449 TREE_OPERAND (lhs
, 1)),
6450 TREE_OPERAND (lhs
, 0),
6451 TREE_OPERAND (lhs
, 1));
6454 /* Handle (a ? b : c) used as an "lvalue". */
6457 /* Produce (a ? (b = rhs) : (c = rhs))
6458 except that the RHS goes through a save-expr
6459 so the code to compute it is only emitted once. */
6461 tree preeval
= NULL_TREE
;
6463 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6465 if (complain
& tf_error
)
6466 error ("void value not ignored as it ought to be");
6467 return error_mark_node
;
6470 rhs
= stabilize_expr (rhs
, &preeval
);
6472 /* Check this here to avoid odd errors when trying to convert
6473 a throw to the type of the COND_EXPR. */
6474 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6475 return error_mark_node
;
6477 cond
= build_conditional_expr
6478 (TREE_OPERAND (lhs
, 0),
6479 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6480 modifycode
, rhs
, complain
),
6481 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6482 modifycode
, rhs
, complain
),
6485 if (cond
== error_mark_node
)
6487 /* Make sure the code to compute the rhs comes out
6488 before the split. */
6490 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6498 if (modifycode
== INIT_EXPR
)
6500 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6501 /* Do the default thing. */;
6502 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6504 /* Compound literal. */
6505 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6506 /* Call convert to generate an error; see PR 11063. */
6507 rhs
= convert (lhstype
, rhs
);
6508 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6509 TREE_SIDE_EFFECTS (result
) = 1;
6512 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6513 /* Do the default thing. */;
6516 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6517 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6518 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6520 release_tree_vector (rhs_vec
);
6521 if (result
== NULL_TREE
)
6522 return error_mark_node
;
6528 lhs
= require_complete_type (lhs
);
6529 if (lhs
== error_mark_node
)
6530 return error_mark_node
;
6532 if (modifycode
== NOP_EXPR
)
6534 /* `operator=' is not an inheritable operator. */
6535 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6536 /* Do the default thing. */;
6539 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6540 lhs
, rhs
, make_node (NOP_EXPR
),
6541 /*overloaded_p=*/NULL
,
6543 if (result
== NULL_TREE
)
6544 return error_mark_node
;
6551 /* A binary op has been requested. Combine the old LHS
6552 value with the RHS producing the value we should actually
6553 store into the LHS. */
6554 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6555 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6556 || MAYBE_CLASS_TYPE_P (lhstype
)));
6558 lhs
= stabilize_reference (lhs
);
6559 newrhs
= cp_build_binary_op (input_location
,
6560 modifycode
, lhs
, rhs
,
6562 if (newrhs
== error_mark_node
)
6564 if (complain
& tf_error
)
6565 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6566 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6567 return error_mark_node
;
6570 /* Now it looks like a plain assignment. */
6571 modifycode
= NOP_EXPR
;
6573 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6574 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6577 /* The left-hand side must be an lvalue. */
6578 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6579 return error_mark_node
;
6581 /* Warn about modifying something that is `const'. Don't warn if
6582 this is initialization. */
6583 if (modifycode
!= INIT_EXPR
6584 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6585 /* Functions are not modifiable, even though they are
6587 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6588 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6589 /* If it's an aggregate and any field is const, then it is
6590 effectively const. */
6591 || (CLASS_TYPE_P (lhstype
)
6592 && C_TYPE_FIELDS_READONLY (lhstype
))))
6594 if (complain
& tf_error
)
6595 readonly_error (lhs
, REK_ASSIGNMENT
);
6597 return error_mark_node
;
6600 /* If storing into a structure or union member, it may have been given a
6601 lowered bitfield type. We need to convert to the declared type first,
6602 so retrieve it now. */
6604 olhstype
= unlowered_expr_type (lhs
);
6606 /* Convert new value to destination type. */
6608 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6612 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6614 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6615 return error_mark_node
;
6616 newrhs
= digest_init (lhstype
, newrhs
);
6619 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6620 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6622 if (complain
& tf_error
)
6623 error ("incompatible types in assignment of %qT to %qT",
6624 TREE_TYPE (rhs
), lhstype
);
6625 return error_mark_node
;
6628 /* Allow array assignment in compiler-generated code. */
6629 else if (!current_function_decl
6630 || !DECL_ARTIFICIAL (current_function_decl
))
6632 /* This routine is used for both initialization and assignment.
6633 Make sure the diagnostic message differentiates the context. */
6634 if (complain
& tf_error
)
6636 if (modifycode
== INIT_EXPR
)
6637 error ("array used as initializer");
6639 error ("invalid array assignment");
6641 return error_mark_node
;
6644 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6645 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6646 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6647 /*explicit_value_init_p=*/false,
6648 from_array
, complain
);
6651 if (modifycode
== INIT_EXPR
)
6652 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6653 LOOKUP_ONLYCONVERTING. */
6654 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6655 "initialization", NULL_TREE
, 0,
6658 newrhs
= convert_for_assignment (olhstype
, newrhs
, "assignment",
6659 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6661 if (!same_type_p (lhstype
, olhstype
))
6662 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6664 if (modifycode
!= INIT_EXPR
)
6666 if (TREE_CODE (newrhs
) == CALL_EXPR
6667 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6668 newrhs
= build_cplus_new (lhstype
, newrhs
);
6670 /* Can't initialize directly from a TARGET_EXPR, since that would
6671 cause the lhs to be constructed twice, and possibly result in
6672 accidental self-initialization. So we force the TARGET_EXPR to be
6673 expanded without a target. */
6674 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6675 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6676 TREE_OPERAND (newrhs
, 0));
6679 if (newrhs
== error_mark_node
)
6680 return error_mark_node
;
6682 if (c_dialect_objc () && flag_objc_gc
)
6684 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6690 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6691 lhstype
, lhs
, newrhs
);
6693 TREE_SIDE_EFFECTS (result
) = 1;
6695 TREE_NO_WARNING (result
) = 1;
6701 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6702 tsubst_flags_t complain
)
6704 if (processing_template_decl
)
6705 return build_min_nt (MODOP_EXPR
, lhs
,
6706 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6708 if (modifycode
!= NOP_EXPR
)
6710 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6711 make_node (modifycode
),
6712 /*overloaded_p=*/NULL
,
6716 TREE_NO_WARNING (rval
) = 1;
6720 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6723 /* Helper function for get_delta_difference which assumes FROM is a base
6724 class of TO. Returns a delta for the conversion of pointer-to-member
6725 of FROM to pointer-to-member of TO. If the conversion is invalid,
6726 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6727 If C_CAST_P is true, this conversion is taking place as part of a C-style
6731 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
)
6736 binfo
= lookup_base (to
, from
, c_cast_p
? ba_unique
: ba_check
, &kind
);
6737 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6739 error (" in pointer to member function conversion");
6740 return size_zero_node
;
6744 if (kind
!= bk_via_virtual
)
6745 return BINFO_OFFSET (binfo
);
6747 /* FROM is a virtual base class of TO. Issue an error or warning
6748 depending on whether or not this is a reinterpret cast. */
6750 error ("pointer to member conversion via virtual base %qT",
6751 BINFO_TYPE (binfo_from_vbase (binfo
)));
6753 return size_zero_node
;
6760 /* Get difference in deltas for different pointer to member function
6761 types. Returns an integer constant of type PTRDIFF_TYPE_NODE. If
6762 the conversion is invalid, the constant is zero. If
6763 ALLOW_INVERSE_P is true, then allow reverse conversions as well.
6764 If C_CAST_P is true this conversion is taking place as part of a
6767 Note that the naming of FROM and TO is kind of backwards; the return
6768 value is what we add to a TO in order to get a FROM. They are named
6769 this way because we call this function to find out how to convert from
6770 a pointer to member of FROM to a pointer to member of TO. */
6773 get_delta_difference (tree from
, tree to
,
6774 bool allow_inverse_p
,
6779 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
6780 /* Pointer to member of incomplete class is permitted*/
6781 result
= size_zero_node
;
6783 result
= get_delta_difference_1 (from
, to
, c_cast_p
);
6787 if (!allow_inverse_p
)
6789 error_not_base_type (from
, to
);
6790 error (" in pointer to member conversion");
6791 result
= size_zero_node
;
6795 result
= get_delta_difference_1 (to
, from
, c_cast_p
);
6798 result
= size_diffop_loc (input_location
,
6799 size_zero_node
, result
);
6802 error_not_base_type (from
, to
);
6803 error (" in pointer to member conversion");
6804 result
= size_zero_node
;
6809 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
6813 /* Return a constructor for the pointer-to-member-function TYPE using
6814 the other components as specified. */
6817 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
6822 VEC(constructor_elt
, gc
) *v
;
6824 /* Pull the FIELD_DECLs out of the type. */
6825 pfn_field
= TYPE_FIELDS (type
);
6826 delta_field
= TREE_CHAIN (pfn_field
);
6828 /* Make sure DELTA has the type we want. */
6829 delta
= convert_and_check (delta_type_node
, delta
);
6831 /* Convert to the correct target type if necessary. */
6832 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
6834 /* Finish creating the initializer. */
6835 v
= VEC_alloc(constructor_elt
, gc
, 2);
6836 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
6837 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
6838 u
= build_constructor (type
, v
);
6839 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
6840 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
6841 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
6843 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
6848 /* Build a constructor for a pointer to member function. It can be
6849 used to initialize global variables, local variable, or used
6850 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6853 If FORCE is nonzero, then force this conversion, even if
6854 we would rather not do it. Usually set when using an explicit
6855 cast. A C-style cast is being processed iff C_CAST_P is true.
6857 Return error_mark_node, if something goes wrong. */
6860 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
)
6866 if (error_operand_p (pfn
))
6867 return error_mark_node
;
6869 pfn_type
= TREE_TYPE (pfn
);
6870 to_type
= build_ptrmemfunc_type (type
);
6872 /* Handle multiple conversions of pointer to member functions. */
6873 if (TYPE_PTRMEMFUNC_P (pfn_type
))
6875 tree delta
= NULL_TREE
;
6876 tree npfn
= NULL_TREE
;
6880 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
6881 error ("invalid conversion to type %qT from type %qT",
6884 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
6885 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
6889 /* We don't have to do any conversion to convert a
6890 pointer-to-member to its own type. But, we don't want to
6891 just return a PTRMEM_CST if there's an explicit cast; that
6892 cast should make the expression an invalid template argument. */
6893 if (TREE_CODE (pfn
) != PTRMEM_CST
)
6895 if (same_type_p (to_type
, pfn_type
))
6897 else if (integer_zerop (n
))
6898 return build_reinterpret_cast (to_type
, pfn
,
6899 tf_warning_or_error
);
6902 if (TREE_SIDE_EFFECTS (pfn
))
6903 pfn
= save_expr (pfn
);
6905 /* Obtain the function pointer and the current DELTA. */
6906 if (TREE_CODE (pfn
) == PTRMEM_CST
)
6907 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
6910 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
6911 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
6914 /* Just adjust the DELTA field. */
6915 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6916 (TREE_TYPE (delta
), ptrdiff_type_node
));
6917 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
6918 n
= cp_build_binary_op (input_location
,
6919 LSHIFT_EXPR
, n
, integer_one_node
,
6920 tf_warning_or_error
);
6921 delta
= cp_build_binary_op (input_location
,
6922 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
6923 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
6926 /* Handle null pointer to member function conversions. */
6927 if (integer_zerop (pfn
))
6929 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
6930 return build_ptrmemfunc1 (to_type
,
6935 if (type_unknown_p (pfn
))
6936 return instantiate_type (type
, pfn
, tf_warning_or_error
);
6938 fn
= TREE_OPERAND (pfn
, 0);
6939 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
6940 /* In a template, we will have preserved the
6942 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
6943 return make_ptrmem_cst (to_type
, fn
);
6946 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
6949 ??? There is no consistency as to the types returned for the above
6950 values. Some code acts as if it were a sizetype and some as if it were
6951 integer_type_node. */
6954 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
6956 tree type
= TREE_TYPE (cst
);
6957 tree fn
= PTRMEM_CST_MEMBER (cst
);
6958 tree ptr_class
, fn_class
;
6960 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6962 /* The class that the function belongs to. */
6963 fn_class
= DECL_CONTEXT (fn
);
6965 /* The class that we're creating a pointer to member of. */
6966 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
6968 /* First, calculate the adjustment to the function's class. */
6969 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
6972 if (!DECL_VIRTUAL_P (fn
))
6973 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
6976 /* If we're dealing with a virtual function, we have to adjust 'this'
6977 again, to point to the base which provides the vtable entry for
6978 fn; the call will do the opposite adjustment. */
6979 tree orig_class
= DECL_CONTEXT (fn
);
6980 tree binfo
= binfo_or_else (orig_class
, fn_class
);
6981 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
6982 *delta
, BINFO_OFFSET (binfo
));
6983 *delta
= fold_if_not_in_template (*delta
);
6985 /* We set PFN to the vtable offset at which the function can be
6986 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
6987 case delta is shifted left, and then incremented). */
6988 *pfn
= DECL_VINDEX (fn
);
6989 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
6990 TYPE_SIZE_UNIT (vtable_entry_type
));
6991 *pfn
= fold_if_not_in_template (*pfn
);
6993 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
6995 case ptrmemfunc_vbit_in_pfn
:
6996 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
6998 *pfn
= fold_if_not_in_template (*pfn
);
7001 case ptrmemfunc_vbit_in_delta
:
7002 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
7003 *delta
, integer_one_node
);
7004 *delta
= fold_if_not_in_template (*delta
);
7005 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7006 *delta
, integer_one_node
);
7007 *delta
= fold_if_not_in_template (*delta
);
7014 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
7015 *pfn
= fold_if_not_in_template (*pfn
);
7019 /* Return an expression for PFN from the pointer-to-member function
7023 pfn_from_ptrmemfunc (tree t
)
7025 if (TREE_CODE (t
) == PTRMEM_CST
)
7030 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7035 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
7038 /* Return an expression for DELTA from the pointer-to-member function
7042 delta_from_ptrmemfunc (tree t
)
7044 if (TREE_CODE (t
) == PTRMEM_CST
)
7049 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7054 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7057 /* Convert value RHS to type TYPE as preparation for an assignment to
7058 an lvalue of type TYPE. ERRTYPE is a string to use in error
7059 messages: "assignment", "return", etc. If FNDECL is non-NULL, we
7060 are doing the conversion in order to pass the PARMNUMth argument of
7064 convert_for_assignment (tree type
, tree rhs
,
7065 const char *errtype
, tree fndecl
, int parmnum
,
7066 tsubst_flags_t complain
, int flags
)
7069 enum tree_code coder
;
7071 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7072 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7073 rhs
= TREE_OPERAND (rhs
, 0);
7075 rhstype
= TREE_TYPE (rhs
);
7076 coder
= TREE_CODE (rhstype
);
7078 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7079 && vector_types_convertible_p (type
, rhstype
, true))
7080 return convert (type
, rhs
);
7082 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7083 return error_mark_node
;
7084 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7085 return error_mark_node
;
7087 /* The RHS of an assignment cannot have void type. */
7088 if (coder
== VOID_TYPE
)
7090 if (complain
& tf_error
)
7091 error ("void value not ignored as it ought to be");
7092 return error_mark_node
;
7095 /* Simplify the RHS if possible. */
7096 if (TREE_CODE (rhs
) == CONST_DECL
)
7097 rhs
= DECL_INITIAL (rhs
);
7099 if (c_dialect_objc ())
7102 tree rname
= fndecl
;
7104 if (!strcmp (errtype
, "assignment"))
7106 else if (!strcmp (errtype
, "initialization"))
7110 tree selector
= objc_message_selector ();
7114 if (selector
&& parmno
> 1)
7121 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7122 return convert (type
, rhs
);
7127 The expression is implicitly converted (clause _conv_) to the
7128 cv-unqualified type of the left operand.
7130 We allow bad conversions here because by the time we get to this point
7131 we are committed to doing the conversion. If we end up doing a bad
7132 conversion, convert_like will complain. */
7133 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7135 /* When -Wno-pmf-conversions is use, we just silently allow
7136 conversions from pointers-to-members to plain pointers. If
7137 the conversion doesn't work, cp_convert will complain. */
7139 && TYPE_PTR_P (type
)
7140 && TYPE_PTRMEMFUNC_P (rhstype
))
7141 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7144 if (complain
& tf_error
)
7146 /* If the right-hand side has unknown type, then it is an
7147 overloaded function. Call instantiate_type to get error
7149 if (rhstype
== unknown_type_node
)
7150 instantiate_type (type
, rhs
, tf_warning_or_error
);
7152 error ("cannot convert %qT to %qT for argument %qP to %qD",
7153 rhstype
, type
, parmnum
, fndecl
);
7155 error ("cannot convert %qT to %qT in %s", rhstype
, type
,
7158 return error_mark_node
;
7161 if (warn_missing_format_attribute
)
7163 const enum tree_code codel
= TREE_CODE (type
);
7164 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7166 && check_missing_format_attribute (type
, rhstype
)
7167 && (complain
& tf_warning
))
7168 warning (OPT_Wmissing_format_attribute
,
7169 "%s might be a candidate for a format attribute",
7173 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7175 if (warn_parentheses
7176 && TREE_CODE (type
) == BOOLEAN_TYPE
7177 && TREE_CODE (rhs
) == MODIFY_EXPR
7178 && !TREE_NO_WARNING (rhs
)
7179 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7180 && (complain
& tf_warning
))
7182 location_t loc
= EXPR_HAS_LOCATION (rhs
)
7183 ? EXPR_LOCATION (rhs
) : input_location
;
7185 warning_at (loc
, OPT_Wparentheses
,
7186 "suggest parentheses around assignment used as truth value");
7187 TREE_NO_WARNING (rhs
) = 1;
7190 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7194 /* Convert RHS to be of type TYPE.
7195 If EXP is nonzero, it is the target of the initialization.
7196 ERRTYPE is a string to use in error messages.
7198 Two major differences between the behavior of
7199 `convert_for_assignment' and `convert_for_initialization'
7200 are that references are bashed in the former, while
7201 copied in the latter, and aggregates are assigned in
7202 the former (operator=) while initialized in the
7205 If using constructor make sure no conversion operator exists, if one does
7206 exist, an ambiguity exists.
7208 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7211 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7212 const char *errtype
, tree fndecl
, int parmnum
,
7213 tsubst_flags_t complain
)
7215 enum tree_code codel
= TREE_CODE (type
);
7217 enum tree_code coder
;
7219 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7220 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7221 if (TREE_CODE (rhs
) == NOP_EXPR
7222 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7223 && codel
!= REFERENCE_TYPE
)
7224 rhs
= TREE_OPERAND (rhs
, 0);
7226 if (type
== error_mark_node
7227 || rhs
== error_mark_node
7228 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7229 return error_mark_node
;
7231 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7232 && TREE_CODE (type
) != ARRAY_TYPE
7233 && (TREE_CODE (type
) != REFERENCE_TYPE
7234 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7235 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7236 && (TREE_CODE (type
) != REFERENCE_TYPE
7237 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7238 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7239 rhs
= decay_conversion (rhs
);
7241 rhstype
= TREE_TYPE (rhs
);
7242 coder
= TREE_CODE (rhstype
);
7244 if (coder
== ERROR_MARK
)
7245 return error_mark_node
;
7247 /* We accept references to incomplete types, so we can
7248 return here before checking if RHS is of complete type. */
7250 if (codel
== REFERENCE_TYPE
)
7252 /* This should eventually happen in convert_arguments. */
7253 int savew
= 0, savee
= 0;
7256 savew
= warningcount
, savee
= errorcount
;
7257 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7258 /*cleanup=*/NULL
, complain
);
7261 if (warningcount
> savew
)
7262 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7263 else if (errorcount
> savee
)
7264 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7270 exp
= require_complete_type (exp
);
7271 if (exp
== error_mark_node
)
7272 return error_mark_node
;
7274 rhstype
= non_reference (rhstype
);
7276 type
= complete_type (type
);
7278 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7279 /* Don't try to do copy-initialization if we already have
7280 direct-initialization. */
7283 if (MAYBE_CLASS_TYPE_P (type
))
7284 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
7286 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7290 /* If RETVAL is the address of, or a reference to, a local variable or
7291 temporary give an appropriate warning. */
7294 maybe_warn_about_returning_address_of_local (tree retval
)
7296 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7297 tree whats_returned
= retval
;
7301 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7302 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7303 else if (CONVERT_EXPR_P (whats_returned
)
7304 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7305 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7310 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7312 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7314 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7316 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7317 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7319 warning (0, "returning reference to temporary");
7322 if (TREE_CODE (whats_returned
) == VAR_DECL
7323 && DECL_NAME (whats_returned
)
7324 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7326 warning (0, "reference to non-lvalue returned");
7331 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7332 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7333 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7335 if (DECL_P (whats_returned
)
7336 && DECL_NAME (whats_returned
)
7337 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7338 && !(TREE_STATIC (whats_returned
)
7339 || TREE_PUBLIC (whats_returned
)))
7341 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7342 warning (0, "reference to local variable %q+D returned",
7345 warning (0, "address of local variable %q+D returned",
7351 /* Check that returning RETVAL from the current function is valid.
7352 Return an expression explicitly showing all conversions required to
7353 change RETVAL into the function return type, and to assign it to
7354 the DECL_RESULT for the function. Set *NO_WARNING to true if
7355 code reaches end of non-void function warning shouldn't be issued
7356 on this RETURN_EXPR. */
7359 check_return_expr (tree retval
, bool *no_warning
)
7362 /* The type actually returned by the function, after any
7365 int fn_returns_value_p
;
7366 bool named_return_value_okay_p
;
7368 *no_warning
= false;
7370 /* A `volatile' function is one that isn't supposed to return, ever.
7371 (This is a G++ extension, used to get better code for functions
7372 that call the `volatile' function.) */
7373 if (TREE_THIS_VOLATILE (current_function_decl
))
7374 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7376 /* Check for various simple errors. */
7377 if (DECL_DESTRUCTOR_P (current_function_decl
))
7380 error ("returning a value from a destructor");
7383 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7385 if (in_function_try_handler
)
7386 /* If a return statement appears in a handler of the
7387 function-try-block of a constructor, the program is ill-formed. */
7388 error ("cannot return from a handler of a function-try-block of a constructor");
7390 /* You can't return a value from a constructor. */
7391 error ("returning a value from a constructor");
7395 /* As an extension, deduce lambda return type from a return statement
7396 anywhere in the body. */
7397 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7399 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7400 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7402 tree type
= lambda_return_type (retval
);
7403 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7405 if (VOID_TYPE_P (type
))
7407 else if (oldtype
== NULL_TREE
)
7409 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7410 "can only be deduced when the return statement is "
7411 "the only statement in the function body");
7412 apply_lambda_return_type (lambda
, type
);
7414 else if (!same_type_p (type
, oldtype
))
7415 error ("inconsistent types %qT and %qT deduced for "
7416 "lambda return type", type
, oldtype
);
7420 if (processing_template_decl
)
7422 current_function_returns_value
= 1;
7423 if (check_for_bare_parameter_packs (retval
))
7424 retval
= error_mark_node
;
7428 /* When no explicit return-value is given in a function with a named
7429 return value, the named return value is used. */
7430 result
= DECL_RESULT (current_function_decl
);
7431 valtype
= TREE_TYPE (result
);
7432 gcc_assert (valtype
!= NULL_TREE
);
7433 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7434 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7437 /* Check for a return statement with no return value in a function
7438 that's supposed to return a value. */
7439 if (!retval
&& fn_returns_value_p
)
7441 permerror (input_location
, "return-statement with no value, in function returning %qT",
7443 /* Clear this, so finish_function won't say that we reach the
7444 end of a non-void function (which we don't, we gave a
7446 current_function_returns_null
= 0;
7447 /* And signal caller that TREE_NO_WARNING should be set on the
7448 RETURN_EXPR to avoid control reaches end of non-void function
7449 warnings in tree-cfg.c. */
7452 /* Check for a return statement with a value in a function that
7453 isn't supposed to return a value. */
7454 else if (retval
&& !fn_returns_value_p
)
7456 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7457 /* You can return a `void' value from a function of `void'
7458 type. In that case, we have to evaluate the expression for
7459 its side-effects. */
7460 finish_expr_stmt (retval
);
7462 permerror (input_location
, "return-statement with a value, in function "
7463 "returning 'void'");
7464 current_function_returns_null
= 1;
7466 /* There's really no value to return, after all. */
7470 /* Remember that this function can sometimes return without a
7472 current_function_returns_null
= 1;
7474 /* Remember that this function did return a value. */
7475 current_function_returns_value
= 1;
7477 /* Check for erroneous operands -- but after giving ourselves a
7478 chance to provide an error about returning a value from a void
7480 if (error_operand_p (retval
))
7482 current_function_return_value
= error_mark_node
;
7483 return error_mark_node
;
7486 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7487 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7488 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7489 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7491 && retval
&& null_ptr_cst_p (retval
))
7492 warning (0, "%<operator new%> must not return NULL unless it is "
7493 "declared %<throw()%> (or -fcheck-new is in effect)");
7495 /* Effective C++ rule 15. See also start_function. */
7497 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7501 /* The function return type must be a reference to the current
7503 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7504 && same_type_ignoring_top_level_qualifiers_p
7505 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7507 /* Returning '*this' is obviously OK. */
7508 if (retval
== current_class_ref
)
7510 /* If we are calling a function whose return type is the same of
7511 the current class reference, it is ok. */
7512 else if (TREE_CODE (retval
) == INDIRECT_REF
7513 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7518 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7521 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7523 [...] For a function with a class return type, if the expression
7524 in the return statement is the name of a local object, and the cv-
7525 unqualified type of the local object is the same as the function
7526 return type, an implementation is permitted to omit creating the tem-
7527 porary object to hold the function return value [...]
7529 So, if this is a value-returning function that always returns the same
7530 local variable, remember it.
7532 It might be nice to be more flexible, and choose the first suitable
7533 variable even if the function sometimes returns something else, but
7534 then we run the risk of clobbering the variable we chose if the other
7535 returned expression uses the chosen variable somehow. And people expect
7536 this restriction, anyway. (jason 2000-11-19)
7538 See finish_function and finalize_nrv for the rest of this optimization. */
7540 named_return_value_okay_p
=
7541 (retval
!= NULL_TREE
7542 /* Must be a local, automatic variable. */
7543 && TREE_CODE (retval
) == VAR_DECL
7544 && DECL_CONTEXT (retval
) == current_function_decl
7545 && ! TREE_STATIC (retval
)
7546 && ! DECL_ANON_UNION_VAR_P (retval
)
7547 && (DECL_ALIGN (retval
)
7548 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7549 /* The cv-unqualified type of the returned value must be the
7550 same as the cv-unqualified return type of the
7552 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7554 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7555 /* And the returned value must be non-volatile. */
7556 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7558 if (fn_returns_value_p
&& flag_elide_constructors
)
7560 if (named_return_value_okay_p
7561 && (current_function_return_value
== NULL_TREE
7562 || current_function_return_value
== retval
))
7563 current_function_return_value
= retval
;
7565 current_function_return_value
= error_mark_node
;
7568 /* We don't need to do any conversions when there's nothing being
7573 /* Do any required conversions. */
7574 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7575 /* No conversions are required. */
7579 /* The type the function is declared to return. */
7580 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7581 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7583 /* The functype's return type will have been set to void, if it
7584 was an incomplete type. Just treat this as 'return;' */
7585 if (VOID_TYPE_P (functype
))
7586 return error_mark_node
;
7588 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7589 treated as an rvalue for the purposes of overload resolution to
7590 favor move constructors over copy constructors. */
7591 if ((cxx_dialect
!= cxx98
)
7592 && named_return_value_okay_p
7593 /* The variable must not have the `volatile' qualifier. */
7594 && !(cp_type_quals (TREE_TYPE (retval
)) & TYPE_QUAL_VOLATILE
)
7595 /* The return type must be a class type. */
7596 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7597 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7599 /* First convert the value to the function's return type, then
7600 to the type of return value's location to handle the
7601 case that functype is smaller than the valtype. */
7602 retval
= convert_for_initialization
7603 (NULL_TREE
, functype
, retval
, flags
, "return", NULL_TREE
, 0,
7604 tf_warning_or_error
);
7605 retval
= convert (valtype
, retval
);
7607 /* If the conversion failed, treat this just like `return;'. */
7608 if (retval
== error_mark_node
)
7610 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7611 else if (! cfun
->returns_struct
7612 && TREE_CODE (retval
) == TARGET_EXPR
7613 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7614 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7615 TREE_OPERAND (retval
, 0));
7617 maybe_warn_about_returning_address_of_local (retval
);
7620 /* Actually copy the value returned into the appropriate location. */
7621 if (retval
&& retval
!= result
)
7622 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7628 /* Returns nonzero if the pointer-type FROM can be converted to the
7629 pointer-type TO via a qualification conversion. If CONSTP is -1,
7630 then we return nonzero if the pointers are similar, and the
7631 cv-qualification signature of FROM is a proper subset of that of TO.
7633 If CONSTP is positive, then all outer pointers have been
7637 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7639 bool to_more_cv_qualified
= false;
7640 bool is_opaque_pointer
= false;
7642 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7644 if (TREE_CODE (to
) != TREE_CODE (from
))
7647 if (TREE_CODE (from
) == OFFSET_TYPE
7648 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7649 TYPE_OFFSET_BASETYPE (to
)))
7652 /* Const and volatile mean something different for function types,
7653 so the usual checks are not appropriate. */
7654 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7656 /* In Objective-C++, some types may have been 'volatilized' by
7657 the compiler for EH; when comparing them here, the volatile
7658 qualification must be ignored. */
7659 bool objc_quals_match
= objc_type_quals_match (to
, from
);
7661 if (!at_least_as_qualified_p (to
, from
) && !objc_quals_match
)
7664 if (!at_least_as_qualified_p (from
, to
) && !objc_quals_match
)
7668 to_more_cv_qualified
= true;
7672 constp
&= TYPE_READONLY (to
);
7675 if (TREE_CODE (to
) == VECTOR_TYPE
)
7676 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7678 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
7679 return ((constp
>= 0 || to_more_cv_qualified
)
7680 && (is_opaque_pointer
7681 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
7685 /* When comparing, say, char ** to char const **, this function takes
7686 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7687 types to this function. */
7690 comp_ptr_ttypes (tree to
, tree from
)
7692 return comp_ptr_ttypes_real (to
, from
, 1);
7695 /* Returns true iff FNTYPE is a non-class type that involves
7696 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7697 if a parameter type is ill-formed. */
7700 error_type_p (const_tree type
)
7704 switch (TREE_CODE (type
))
7710 case REFERENCE_TYPE
:
7712 return error_type_p (TREE_TYPE (type
));
7716 if (error_type_p (TREE_TYPE (type
)))
7718 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7719 if (error_type_p (TREE_VALUE (t
)))
7724 if (TYPE_PTRMEMFUNC_P (type
))
7725 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
7733 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7734 type or inheritance-related types, regardless of cv-quals. */
7737 ptr_reasonably_similar (const_tree to
, const_tree from
)
7739 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7741 /* Any target type is similar enough to void. */
7742 if (TREE_CODE (to
) == VOID_TYPE
)
7743 return !error_type_p (from
);
7744 if (TREE_CODE (from
) == VOID_TYPE
)
7745 return !error_type_p (to
);
7747 if (TREE_CODE (to
) != TREE_CODE (from
))
7750 if (TREE_CODE (from
) == OFFSET_TYPE
7751 && comptypes (TYPE_OFFSET_BASETYPE (to
),
7752 TYPE_OFFSET_BASETYPE (from
),
7753 COMPARE_BASE
| COMPARE_DERIVED
))
7756 if (TREE_CODE (to
) == VECTOR_TYPE
7757 && vector_types_convertible_p (to
, from
, false))
7760 if (TREE_CODE (to
) == INTEGER_TYPE
7761 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
7764 if (TREE_CODE (to
) == FUNCTION_TYPE
)
7765 return !error_type_p (to
) && !error_type_p (from
);
7767 if (TREE_CODE (to
) != POINTER_TYPE
)
7769 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
7770 COMPARE_BASE
| COMPARE_DERIVED
);
7774 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
7775 pointer-to-member types) are the same, ignoring cv-qualification at
7779 comp_ptr_ttypes_const (tree to
, tree from
)
7781 bool is_opaque_pointer
= false;
7783 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7785 if (TREE_CODE (to
) != TREE_CODE (from
))
7788 if (TREE_CODE (from
) == OFFSET_TYPE
7789 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
7790 TYPE_OFFSET_BASETYPE (to
)))
7793 if (TREE_CODE (to
) == VECTOR_TYPE
)
7794 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7796 if (TREE_CODE (to
) != POINTER_TYPE
)
7797 return (is_opaque_pointer
7798 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
7802 /* Returns the type qualifiers for this type, including the qualifiers on the
7803 elements for an array type. */
7806 cp_type_quals (const_tree type
)
7808 /* This CONST_CAST is okay because strip_array_types returns its
7809 argument unmodified and we assign it to a const_tree. */
7810 type
= strip_array_types (CONST_CAST_TREE(type
));
7811 if (type
== error_mark_node
)
7812 return TYPE_UNQUALIFIED
;
7813 return TYPE_QUALS (type
);
7816 /* Returns nonzero if the TYPE is const from a C++ perspective: look inside
7820 cp_type_readonly (const_tree type
)
7822 /* This CONST_CAST is okay because strip_array_types returns its
7823 argument unmodified and we assign it to a const_tree. */
7824 type
= strip_array_types (CONST_CAST_TREE(type
));
7825 return TYPE_READONLY (type
);
7828 /* Returns nonzero if TYPE is const or volatile. */
7831 cv_qualified_p (const_tree type
)
7833 int quals
= cp_type_quals (type
);
7834 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
7837 /* Returns nonzero if the TYPE contains a mutable member. */
7840 cp_has_mutable_p (const_tree type
)
7842 /* This CONST_CAST is okay because strip_array_types returns its
7843 argument unmodified and we assign it to a const_tree. */
7844 type
= strip_array_types (CONST_CAST_TREE(type
));
7846 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
7849 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
7850 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
7851 approximation. In particular, consider:
7854 struct S { int i; };
7855 const S s = { f(); }
7857 Here, we will make "s" as TREE_READONLY (because it is declared
7858 "const") -- only to reverse ourselves upon seeing that the
7859 initializer is non-constant. */
7862 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
7864 tree type
= TREE_TYPE (decl
);
7866 if (type
== error_mark_node
)
7869 if (TREE_CODE (decl
) == TYPE_DECL
)
7872 if (TREE_CODE (type
) == FUNCTION_TYPE
7873 && type_quals
!= TYPE_UNQUALIFIED
)
7875 /* This was an error in C++98 (cv-qualifiers cannot be added to
7876 a function type), but DR 295 makes the code well-formed by
7877 dropping the extra qualifiers. */
7880 tree bad_type
= build_qualified_type (type
, type_quals
);
7881 pedwarn (input_location
, OPT_pedantic
,
7882 "ignoring %qV qualifiers added to function type %qT",
7886 TREE_TYPE (decl
) = TYPE_MAIN_VARIANT (type
);
7890 /* Avoid setting TREE_READONLY incorrectly. */
7891 if (/* If the object has a constructor, the constructor may modify
7893 TYPE_NEEDS_CONSTRUCTING (type
)
7894 /* If the type isn't complete, we don't know yet if it will need
7896 || !COMPLETE_TYPE_P (type
)
7897 /* If the type has a mutable component, that component might be
7899 || TYPE_HAS_MUTABLE_P (type
))
7900 type_quals
&= ~TYPE_QUAL_CONST
;
7902 c_apply_type_quals_to_decl (type_quals
, decl
);
7905 /* Subroutine of casts_away_constness. Make T1 and T2 point at
7906 exemplar types such that casting T1 to T2 is casting away constness
7907 if and only if there is no implicit conversion from T1 to T2. */
7910 casts_away_constness_r (tree
*t1
, tree
*t2
)
7915 /* [expr.const.cast]
7917 For multi-level pointer to members and multi-level mixed pointers
7918 and pointers to members (conv.qual), the "member" aspect of a
7919 pointer to member level is ignored when determining if a const
7920 cv-qualifier has been cast away. */
7921 /* [expr.const.cast]
7923 For two pointer types:
7925 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
7926 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
7929 casting from X1 to X2 casts away constness if, for a non-pointer
7930 type T there does not exist an implicit conversion (clause
7933 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
7937 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
7938 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
7939 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
7941 *t1
= cp_build_qualified_type (void_type_node
,
7942 cp_type_quals (*t1
));
7943 *t2
= cp_build_qualified_type (void_type_node
,
7944 cp_type_quals (*t2
));
7948 quals1
= cp_type_quals (*t1
);
7949 quals2
= cp_type_quals (*t2
);
7951 if (TYPE_PTRMEM_P (*t1
))
7952 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
7954 *t1
= TREE_TYPE (*t1
);
7955 if (TYPE_PTRMEM_P (*t2
))
7956 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
7958 *t2
= TREE_TYPE (*t2
);
7960 casts_away_constness_r (t1
, t2
);
7961 *t1
= build_pointer_type (*t1
);
7962 *t2
= build_pointer_type (*t2
);
7963 *t1
= cp_build_qualified_type (*t1
, quals1
);
7964 *t2
= cp_build_qualified_type (*t2
, quals2
);
7967 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
7970 ??? This function returns non-zero if casting away qualifiers not
7971 just const. We would like to return to the caller exactly which
7972 qualifiers are casted away to give more accurate diagnostics.
7976 casts_away_constness (tree t1
, tree t2
)
7978 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
7980 /* [expr.const.cast]
7982 Casting from an lvalue of type T1 to an lvalue of type T2
7983 using a reference cast casts away constness if a cast from an
7984 rvalue of type "pointer to T1" to the type "pointer to T2"
7985 casts away constness. */
7986 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
7987 return casts_away_constness (build_pointer_type (t1
),
7988 build_pointer_type (TREE_TYPE (t2
)));
7991 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
7992 /* [expr.const.cast]
7994 Casting from an rvalue of type "pointer to data member of X
7995 of type T1" to the type "pointer to data member of Y of type
7996 T2" casts away constness if a cast from an rvalue of type
7997 "pointer to T1" to the type "pointer to T2" casts away
7999 return casts_away_constness
8000 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
8001 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
8003 /* Casting away constness is only something that makes sense for
8004 pointer or reference types. */
8005 if (TREE_CODE (t1
) != POINTER_TYPE
8006 || TREE_CODE (t2
) != POINTER_TYPE
)
8009 /* Top-level qualifiers don't matter. */
8010 t1
= TYPE_MAIN_VARIANT (t1
);
8011 t2
= TYPE_MAIN_VARIANT (t2
);
8012 casts_away_constness_r (&t1
, &t2
);
8013 if (!can_convert (t2
, t1
))
8019 /* If T is a REFERENCE_TYPE return the type to which T refers.
8020 Otherwise, return T itself. */
8023 non_reference (tree t
)
8025 if (TREE_CODE (t
) == REFERENCE_TYPE
)
8031 /* Return nonzero if REF is an lvalue valid for this language;
8032 otherwise, print an error message and return zero. USE says
8033 how the lvalue is being used and so selects the error message. */
8036 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
8038 int win
= lvalue_p (ref
);
8040 if (!win
&& (complain
& tf_error
))