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"
38 #include "diagnostic.h"
45 static tree
pfn_from_ptrmemfunc (tree
);
46 static tree
delta_from_ptrmemfunc (tree
);
47 static tree
convert_for_assignment (tree
, tree
, const char *, tree
, int,
49 static tree
cp_pointer_int_sum (enum tree_code
, tree
, tree
);
50 static tree
rationalize_conditional_expr (enum tree_code
, tree
,
52 static int comp_ptr_ttypes_real (tree
, tree
, int);
53 static bool comp_except_types (tree
, tree
, bool);
54 static bool comp_array_types (const_tree
, const_tree
, bool);
55 static tree
pointer_diff (tree
, tree
, tree
);
56 static tree
get_delta_difference (tree
, tree
, bool, bool);
57 static void casts_away_constness_r (tree
*, tree
*);
58 static bool casts_away_constness (tree
, tree
);
59 static void maybe_warn_about_returning_address_of_local (tree
);
60 static tree
lookup_destructor (tree
, tree
, tree
);
61 static void warn_args_num (location_t
, tree
, bool);
62 static int convert_arguments (tree
, VEC(tree
,gc
) **, tree
, int,
65 /* Do `exp = require_complete_type (exp);' to make sure exp
66 does not have an incomplete type. (That includes void types.)
67 Returns the error_mark_node if the VALUE does not have
68 complete type when this function returns. */
71 require_complete_type (tree value
)
75 if (processing_template_decl
|| value
== error_mark_node
)
78 if (TREE_CODE (value
) == OVERLOAD
)
79 type
= unknown_type_node
;
81 type
= TREE_TYPE (value
);
83 if (type
== error_mark_node
)
84 return error_mark_node
;
86 /* First, detect a valid value with a complete type. */
87 if (COMPLETE_TYPE_P (type
))
90 if (complete_type_or_else (type
, value
))
93 return error_mark_node
;
96 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
97 a template instantiation, do the instantiation. Returns TYPE,
98 whether or not it could be completed, unless something goes
99 horribly wrong, in which case the error_mark_node is returned. */
102 complete_type (tree type
)
104 if (type
== NULL_TREE
)
105 /* Rather than crash, we return something sure to cause an error
107 return error_mark_node
;
109 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
111 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
113 tree t
= complete_type (TREE_TYPE (type
));
114 unsigned int needs_constructing
, has_nontrivial_dtor
;
115 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
118 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
120 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
121 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
123 TYPE_NEEDS_CONSTRUCTING (t
) = needs_constructing
;
124 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = has_nontrivial_dtor
;
127 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
128 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
133 /* Like complete_type, but issue an error if the TYPE cannot be completed.
134 VALUE is used for informative diagnostics.
135 Returns NULL_TREE if the type cannot be made complete. */
138 complete_type_or_else (tree type
, tree value
)
140 type
= complete_type (type
);
141 if (type
== error_mark_node
)
142 /* We already issued an error. */
144 else if (!COMPLETE_TYPE_P (type
))
146 cxx_incomplete_type_diagnostic (value
, type
, DK_ERROR
);
153 /* Return truthvalue of whether type of EXP is instantiated. */
156 type_unknown_p (const_tree exp
)
158 return (TREE_CODE (exp
) == TREE_LIST
159 || TREE_TYPE (exp
) == unknown_type_node
);
163 /* Return the common type of two parameter lists.
164 We assume that comptypes has already been done and returned 1;
165 if that isn't so, this may crash.
167 As an optimization, free the space we allocate if the parameter
168 lists are already common. */
171 commonparms (tree p1
, tree p2
)
173 tree oldargs
= p1
, newargs
, n
;
177 len
= list_length (p1
);
178 newargs
= tree_last (p1
);
180 if (newargs
== void_list_node
)
189 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
194 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
196 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
198 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
201 else if (! TREE_PURPOSE (p1
))
203 if (TREE_PURPOSE (p2
))
205 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
211 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
213 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
215 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
218 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
221 TREE_VALUE (n
) = TREE_VALUE (p1
);
229 /* Given a type, perhaps copied for a typedef,
230 find the "original" version of it. */
232 original_type (tree t
)
234 int quals
= cp_type_quals (t
);
235 while (t
!= error_mark_node
236 && TYPE_NAME (t
) != NULL_TREE
)
238 tree x
= TYPE_NAME (t
);
239 if (TREE_CODE (x
) != TYPE_DECL
)
241 x
= DECL_ORIGINAL_TYPE (x
);
246 return cp_build_qualified_type (t
, quals
);
249 /* Return the common type for two arithmetic types T1 and T2 under the
250 usual arithmetic conversions. The default conversions have already
251 been applied, and enumerated types converted to their compatible
255 cp_common_type (tree t1
, tree t2
)
257 enum tree_code code1
= TREE_CODE (t1
);
258 enum tree_code code2
= TREE_CODE (t2
);
261 /* In what follows, we slightly generalize the rules given in [expr] so
262 as to deal with `long long' and `complex'. First, merge the
264 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
266 if (SCOPED_ENUM_P (t1
) || SCOPED_ENUM_P (t2
))
268 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
269 return build_type_attribute_variant (t1
, attributes
);
274 /* FIXME: Attributes. */
275 gcc_assert (ARITHMETIC_TYPE_P (t1
)
276 || TREE_CODE (t1
) == VECTOR_TYPE
277 || UNSCOPED_ENUM_P (t1
));
278 gcc_assert (ARITHMETIC_TYPE_P (t2
)
279 || TREE_CODE (t2
) == VECTOR_TYPE
280 || UNSCOPED_ENUM_P (t2
));
282 /* If one type is complex, form the common type of the non-complex
283 components, then make that complex. Use T1 or T2 if it is the
285 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
287 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
288 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
290 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
292 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
293 return build_type_attribute_variant (t1
, attributes
);
294 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
295 return build_type_attribute_variant (t2
, attributes
);
297 return build_type_attribute_variant (build_complex_type (subtype
),
301 if (code1
== VECTOR_TYPE
)
303 /* When we get here we should have two vectors of the same size.
304 Just prefer the unsigned one if present. */
305 if (TYPE_UNSIGNED (t1
))
306 return build_type_attribute_variant (t1
, attributes
);
308 return build_type_attribute_variant (t2
, attributes
);
311 /* If only one is real, use it as the result. */
312 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
313 return build_type_attribute_variant (t1
, attributes
);
314 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
315 return build_type_attribute_variant (t2
, attributes
);
317 /* Both real or both integers; use the one with greater precision. */
318 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
319 return build_type_attribute_variant (t1
, attributes
);
320 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
321 return build_type_attribute_variant (t2
, attributes
);
323 /* The types are the same; no need to do anything fancy. */
324 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
325 return build_type_attribute_variant (t1
, attributes
);
327 if (code1
!= REAL_TYPE
)
329 /* If one is unsigned long long, then convert the other to unsigned
331 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
332 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
333 return build_type_attribute_variant (long_long_unsigned_type_node
,
335 /* If one is a long long, and the other is an unsigned long, and
336 long long can represent all the values of an unsigned long, then
337 convert to a long long. Otherwise, convert to an unsigned long
338 long. Otherwise, if either operand is long long, convert the
341 Since we're here, we know the TYPE_PRECISION is the same;
342 therefore converting to long long cannot represent all the values
343 of an unsigned long, so we choose unsigned long long in that
345 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
346 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
348 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
349 ? long_long_unsigned_type_node
350 : long_long_integer_type_node
);
351 return build_type_attribute_variant (t
, attributes
);
353 if (int128_integer_type_node
!= NULL_TREE
354 && (same_type_p (TYPE_MAIN_VARIANT (t1
),
355 int128_integer_type_node
)
356 || same_type_p (TYPE_MAIN_VARIANT (t2
),
357 int128_integer_type_node
)))
359 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
360 ? int128_unsigned_type_node
361 : int128_integer_type_node
);
362 return build_type_attribute_variant (t
, attributes
);
365 /* Go through the same procedure, but for longs. */
366 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
367 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
368 return build_type_attribute_variant (long_unsigned_type_node
,
370 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
371 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
373 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
374 ? long_unsigned_type_node
: long_integer_type_node
);
375 return build_type_attribute_variant (t
, attributes
);
377 /* Otherwise prefer the unsigned one. */
378 if (TYPE_UNSIGNED (t1
))
379 return build_type_attribute_variant (t1
, attributes
);
381 return build_type_attribute_variant (t2
, attributes
);
385 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
386 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
387 return build_type_attribute_variant (long_double_type_node
,
389 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
390 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
391 return build_type_attribute_variant (double_type_node
,
393 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
394 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
395 return build_type_attribute_variant (float_type_node
,
398 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
399 the standard C++ floating-point types. Logic earlier in this
400 function has already eliminated the possibility that
401 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
402 compelling reason to choose one or the other. */
403 return build_type_attribute_variant (t1
, attributes
);
407 /* T1 and T2 are arithmetic or enumeration types. Return the type
408 that will result from the "usual arithmetic conversions" on T1 and
409 T2 as described in [expr]. */
412 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
414 gcc_assert (ARITHMETIC_TYPE_P (t1
)
415 || TREE_CODE (t1
) == VECTOR_TYPE
416 || UNSCOPED_ENUM_P (t1
));
417 gcc_assert (ARITHMETIC_TYPE_P (t2
)
418 || TREE_CODE (t2
) == VECTOR_TYPE
419 || UNSCOPED_ENUM_P (t2
));
421 /* Perform the integral promotions. We do not promote real types here. */
422 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1
)
423 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2
))
425 t1
= type_promotes_to (t1
);
426 t2
= type_promotes_to (t2
);
429 return cp_common_type (t1
, t2
);
432 /* Subroutine of composite_pointer_type to implement the recursive
433 case. See that function for documentation of the parameters. */
436 composite_pointer_type_r (tree t1
, tree t2
,
437 composite_pointer_operation operation
,
438 tsubst_flags_t complain
)
445 /* Determine the types pointed to by T1 and T2. */
446 if (TREE_CODE (t1
) == POINTER_TYPE
)
448 pointee1
= TREE_TYPE (t1
);
449 pointee2
= TREE_TYPE (t2
);
453 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
454 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
459 Otherwise, the composite pointer type is a pointer type
460 similar (_conv.qual_) to the type of one of the operands,
461 with a cv-qualification signature (_conv.qual_) that is the
462 union of the cv-qualification signatures of the operand
464 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
465 result_type
= pointee1
;
466 else if ((TREE_CODE (pointee1
) == POINTER_TYPE
467 && TREE_CODE (pointee2
) == POINTER_TYPE
)
468 || (TYPE_PTR_TO_MEMBER_P (pointee1
)
469 && TYPE_PTR_TO_MEMBER_P (pointee2
)))
470 result_type
= composite_pointer_type_r (pointee1
, pointee2
, operation
,
474 if (complain
& tf_error
)
479 permerror (input_location
, "comparison between "
480 "distinct pointer types %qT and %qT lacks a cast",
484 permerror (input_location
, "conversion between "
485 "distinct pointer types %qT and %qT lacks a cast",
488 case CPO_CONDITIONAL_EXPR
:
489 permerror (input_location
, "conditional expression between "
490 "distinct pointer types %qT and %qT lacks a cast",
497 result_type
= void_type_node
;
499 result_type
= cp_build_qualified_type (result_type
,
500 (cp_type_quals (pointee1
)
501 | cp_type_quals (pointee2
)));
502 /* If the original types were pointers to members, so is the
504 if (TYPE_PTR_TO_MEMBER_P (t1
))
506 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
507 TYPE_PTRMEM_CLASS_TYPE (t2
))
508 && (complain
& tf_error
))
513 permerror (input_location
, "comparison between "
514 "distinct pointer types %qT and %qT lacks a cast",
518 permerror (input_location
, "conversion between "
519 "distinct pointer types %qT and %qT lacks a cast",
522 case CPO_CONDITIONAL_EXPR
:
523 permerror (input_location
, "conditional expression between "
524 "distinct pointer types %qT and %qT lacks a cast",
531 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
535 result_type
= build_pointer_type (result_type
);
537 /* Merge the attributes. */
538 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
539 return build_type_attribute_variant (result_type
, attributes
);
542 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
543 ARG1 and ARG2 are the values with those types. The OPERATION is to
544 describe the operation between the pointer types,
545 in case an error occurs.
547 This routine also implements the computation of a common type for
548 pointers-to-members as per [expr.eq]. */
551 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
552 composite_pointer_operation operation
,
553 tsubst_flags_t complain
)
560 If one operand is a null pointer constant, the composite pointer
561 type is the type of the other operand. */
562 if (null_ptr_cst_p (arg1
))
564 if (null_ptr_cst_p (arg2
))
571 If one of the operands has type "pointer to cv1 void*", then
572 the other has type "pointer to cv2T", and the composite pointer
573 type is "pointer to cv12 void", where cv12 is the union of cv1
576 If either type is a pointer to void, make sure it is T1. */
577 if (TREE_CODE (t2
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t2
)))
585 /* Now, if T1 is a pointer to void, merge the qualifiers. */
586 if (TREE_CODE (t1
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t1
)))
591 if (TYPE_PTRFN_P (t2
) && (complain
& tf_error
))
596 pedwarn (input_location
, OPT_pedantic
,
597 "ISO C++ forbids comparison between "
598 "pointer of type %<void *%> and pointer-to-function");
601 pedwarn (input_location
, OPT_pedantic
,
602 "ISO C++ forbids conversion between "
603 "pointer of type %<void *%> and pointer-to-function");
605 case CPO_CONDITIONAL_EXPR
:
606 pedwarn (input_location
, OPT_pedantic
,
607 "ISO C++ forbids conditional expression between "
608 "pointer of type %<void *%> and pointer-to-function");
615 = cp_build_qualified_type (void_type_node
,
616 (cp_type_quals (TREE_TYPE (t1
))
617 | cp_type_quals (TREE_TYPE (t2
))));
618 result_type
= build_pointer_type (result_type
);
619 /* Merge the attributes. */
620 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
621 return build_type_attribute_variant (result_type
, attributes
);
624 if (c_dialect_objc () && TREE_CODE (t1
) == POINTER_TYPE
625 && TREE_CODE (t2
) == POINTER_TYPE
)
627 if (objc_compare_types (t1
, t2
, -3, NULL_TREE
))
631 /* [expr.eq] permits the application of a pointer conversion to
632 bring the pointers to a common type. */
633 if (TREE_CODE (t1
) == POINTER_TYPE
&& TREE_CODE (t2
) == POINTER_TYPE
634 && CLASS_TYPE_P (TREE_TYPE (t1
))
635 && CLASS_TYPE_P (TREE_TYPE (t2
))
636 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
639 class1
= TREE_TYPE (t1
);
640 class2
= TREE_TYPE (t2
);
642 if (DERIVED_FROM_P (class1
, class2
))
643 t2
= (build_pointer_type
644 (cp_build_qualified_type (class1
, cp_type_quals (class2
))));
645 else if (DERIVED_FROM_P (class2
, class1
))
646 t1
= (build_pointer_type
647 (cp_build_qualified_type (class2
, cp_type_quals (class1
))));
650 if (complain
& tf_error
)
654 error ("comparison between distinct "
655 "pointer types %qT and %qT lacks a cast", t1
, t2
);
658 error ("conversion between distinct "
659 "pointer types %qT and %qT lacks a cast", t1
, t2
);
661 case CPO_CONDITIONAL_EXPR
:
662 error ("conditional expression between distinct "
663 "pointer types %qT and %qT lacks a cast", t1
, t2
);
668 return error_mark_node
;
671 /* [expr.eq] permits the application of a pointer-to-member
672 conversion to change the class type of one of the types. */
673 else if (TYPE_PTR_TO_MEMBER_P (t1
)
674 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
675 TYPE_PTRMEM_CLASS_TYPE (t2
)))
677 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
678 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
680 if (DERIVED_FROM_P (class1
, class2
))
681 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
682 else if (DERIVED_FROM_P (class2
, class1
))
683 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
686 if (complain
& tf_error
)
690 error ("comparison between distinct "
691 "pointer-to-member types %qT and %qT lacks a cast",
695 error ("conversion between distinct "
696 "pointer-to-member types %qT and %qT lacks a cast",
699 case CPO_CONDITIONAL_EXPR
:
700 error ("conditional expression between distinct "
701 "pointer-to-member types %qT and %qT lacks a cast",
707 return error_mark_node
;
711 return composite_pointer_type_r (t1
, t2
, operation
, complain
);
714 /* Return the merged type of two types.
715 We assume that comptypes has already been done and returned 1;
716 if that isn't so, this may crash.
718 This just combines attributes and default arguments; any other
719 differences would cause the two types to compare unalike. */
722 merge_types (tree t1
, tree t2
)
724 enum tree_code code1
;
725 enum tree_code code2
;
728 /* Save time if the two types are the same. */
731 if (original_type (t1
) == original_type (t2
))
734 /* If one type is nonsense, use the other. */
735 if (t1
== error_mark_node
)
737 if (t2
== error_mark_node
)
740 /* Merge the attributes. */
741 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
743 if (TYPE_PTRMEMFUNC_P (t1
))
744 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
745 if (TYPE_PTRMEMFUNC_P (t2
))
746 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
748 code1
= TREE_CODE (t1
);
749 code2
= TREE_CODE (t2
);
752 gcc_assert (code1
== TYPENAME_TYPE
|| code2
== TYPENAME_TYPE
);
753 if (code1
== TYPENAME_TYPE
)
755 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
756 code1
= TREE_CODE (t1
);
760 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
761 code2
= TREE_CODE (t2
);
769 /* For two pointers, do this recursively on the target type. */
771 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
772 int quals
= cp_type_quals (t1
);
774 if (code1
== POINTER_TYPE
)
775 t1
= build_pointer_type (target
);
777 t1
= cp_build_reference_type (target
, TYPE_REF_IS_RVALUE (t1
));
778 t1
= build_type_attribute_variant (t1
, attributes
);
779 t1
= cp_build_qualified_type (t1
, quals
);
781 if (TREE_CODE (target
) == METHOD_TYPE
)
782 t1
= build_ptrmemfunc_type (t1
);
791 quals
= cp_type_quals (t1
);
792 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
793 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
794 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
796 t1
= cp_build_qualified_type (t1
, quals
);
802 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
803 /* Save space: see if the result is identical to one of the args. */
804 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
805 return build_type_attribute_variant (t1
, attributes
);
806 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
807 return build_type_attribute_variant (t2
, attributes
);
808 /* Merge the element types, and have a size if either arg has one. */
809 t1
= build_cplus_array_type
810 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
815 /* Function types: prefer the one that specified arg types.
816 If both do, merge the arg types. Also merge the return types. */
818 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
819 tree p1
= TYPE_ARG_TYPES (t1
);
820 tree p2
= TYPE_ARG_TYPES (t2
);
824 /* Save space: see if the result is identical to one of the args. */
825 if (valtype
== TREE_TYPE (t1
) && ! p2
)
826 return cp_build_type_attribute_variant (t1
, attributes
);
827 if (valtype
== TREE_TYPE (t2
) && ! p1
)
828 return cp_build_type_attribute_variant (t2
, attributes
);
830 /* Simple way if one arg fails to specify argument types. */
831 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
834 raises
= TYPE_RAISES_EXCEPTIONS (t2
);
836 else if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
839 raises
= TYPE_RAISES_EXCEPTIONS (t1
);
843 parms
= commonparms (p1
, p2
);
844 /* In cases where we're merging a real declaration with a
845 built-in declaration, t1 is the real one. */
846 raises
= TYPE_RAISES_EXCEPTIONS (t1
);
849 rval
= build_function_type (valtype
, parms
);
850 gcc_assert (type_memfn_quals (t1
) == type_memfn_quals (t2
));
851 rval
= apply_memfn_quals (rval
, type_memfn_quals (t1
));
852 t1
= build_exception_variant (rval
, raises
);
858 /* Get this value the long way, since TYPE_METHOD_BASETYPE
859 is just the main variant of this. */
860 tree basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2
)));
861 tree raises
= TYPE_RAISES_EXCEPTIONS (t1
);
864 /* If this was a member function type, get back to the
865 original type of type member function (i.e., without
866 the class instance variable up front. */
867 t1
= build_function_type (TREE_TYPE (t1
),
868 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
869 t2
= build_function_type (TREE_TYPE (t2
),
870 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
871 t3
= merge_types (t1
, t2
);
872 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
873 TYPE_ARG_TYPES (t3
));
874 t1
= build_exception_variant (t3
, raises
);
879 /* There is no need to merge attributes into a TYPENAME_TYPE.
880 When the type is instantiated it will have whatever
881 attributes result from the instantiation. */
887 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
889 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
892 return cp_build_type_attribute_variant (t1
, attributes
);
895 /* Return the ARRAY_TYPE type without its domain. */
898 strip_array_domain (tree type
)
901 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
902 if (TYPE_DOMAIN (type
) == NULL_TREE
)
904 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
905 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
908 /* Wrapper around cp_common_type that is used by c-common.c and other
909 front end optimizations that remove promotions.
911 Return the common type for two arithmetic types T1 and T2 under the
912 usual arithmetic conversions. The default conversions have already
913 been applied, and enumerated types converted to their compatible
917 common_type (tree t1
, tree t2
)
919 /* If one type is nonsense, use the other */
920 if (t1
== error_mark_node
)
922 if (t2
== error_mark_node
)
925 return cp_common_type (t1
, t2
);
928 /* Return the common type of two pointer types T1 and T2. This is the
929 type for the result of most arithmetic operations if the operands
930 have the given two types.
932 We assume that comp_target_types has already been done and returned
933 nonzero; if that isn't so, this may crash. */
936 common_pointer_type (tree t1
, tree t2
)
938 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
939 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
940 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
942 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
943 CPO_CONVERSION
, tf_warning_or_error
);
946 /* Compare two exception specifier types for exactness or subsetness, if
947 allowed. Returns false for mismatch, true for match (same, or
950 [except.spec] "If a class X ... objects of class X or any class publicly
951 and unambiguously derived from X. Similarly, if a pointer type Y * ...
952 exceptions of type Y * or that are pointers to any type publicly and
953 unambiguously derived from Y. Otherwise a function only allows exceptions
954 that have the same type ..."
955 This does not mention cv qualifiers and is different to what throw
956 [except.throw] and catch [except.catch] will do. They will ignore the
957 top level cv qualifiers, and allow qualifiers in the pointer to class
960 We implement the letter of the standard. */
963 comp_except_types (tree a
, tree b
, bool exact
)
965 if (same_type_p (a
, b
))
969 if (cp_type_quals (a
) || cp_type_quals (b
))
972 if (TREE_CODE (a
) == POINTER_TYPE
973 && TREE_CODE (b
) == POINTER_TYPE
)
977 if (cp_type_quals (a
) || cp_type_quals (b
))
981 if (TREE_CODE (a
) != RECORD_TYPE
982 || TREE_CODE (b
) != RECORD_TYPE
)
985 if (PUBLICLY_UNIQUELY_DERIVED_P (a
, b
))
991 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
992 If EXACT is false, T2 can be stricter than T1 (according to 15.4/7),
993 otherwise it must be exact. Exception lists are unordered, but
994 we've already filtered out duplicates. Most lists will be in order,
995 we should try to make use of that. */
998 comp_except_specs (const_tree t1
, const_tree t2
, bool exact
)
1007 if (t1
== NULL_TREE
) /* T1 is ... */
1008 return t2
== NULL_TREE
|| !exact
;
1009 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1010 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1011 if (t2
== NULL_TREE
) /* T2 is ... */
1013 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1016 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1017 Count how many we find, to determine exactness. For exact matching and
1018 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1020 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1022 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1024 tree a
= TREE_VALUE (probe
);
1025 tree b
= TREE_VALUE (t2
);
1027 if (comp_except_types (a
, b
, exact
))
1029 if (probe
== base
&& exact
)
1030 base
= TREE_CHAIN (probe
);
1035 if (probe
== NULL_TREE
)
1038 return !exact
|| base
== NULL_TREE
|| length
== list_length (t1
);
1041 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1042 [] can match [size]. */
1045 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1054 /* The type of the array elements must be the same. */
1055 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1058 d1
= TYPE_DOMAIN (t1
);
1059 d2
= TYPE_DOMAIN (t2
);
1064 /* If one of the arrays is dimensionless, and the other has a
1065 dimension, they are of different types. However, it is valid to
1073 declarations for an array object can specify
1074 array types that differ by the presence or absence of a major
1075 array bound (_dcl.array_). */
1077 return allow_redeclaration
;
1079 /* Check that the dimensions are the same. */
1081 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1083 max1
= TYPE_MAX_VALUE (d1
);
1084 max2
= TYPE_MAX_VALUE (d2
);
1085 if (processing_template_decl
&& !abi_version_at_least (2)
1086 && !value_dependent_expression_p (max1
)
1087 && !value_dependent_expression_p (max2
))
1089 /* With abi-1 we do not fold non-dependent array bounds, (and
1090 consequently mangle them incorrectly). We must therefore
1091 fold them here, to verify the domains have the same
1097 if (!cp_tree_equal (max1
, max2
))
1103 /* Compare the relative position of T1 and T2 into their respective
1104 template parameter list.
1105 T1 and T2 must be template parameter types.
1106 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1109 comp_template_parms_position (tree t1
, tree t2
)
1111 gcc_assert (t1
&& t2
1112 && TREE_CODE (t1
) == TREE_CODE (t2
)
1113 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1114 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1115 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1117 if (TEMPLATE_TYPE_IDX (t1
) != TEMPLATE_TYPE_IDX (t2
)
1118 || TEMPLATE_TYPE_LEVEL (t1
) != TEMPLATE_TYPE_LEVEL (t2
)
1119 || (TEMPLATE_TYPE_PARAMETER_PACK (t1
)
1120 != TEMPLATE_TYPE_PARAMETER_PACK (t2
)))
1126 /* Subroutine of incompatible_dependent_types_p.
1127 Return the template parameter of the dependent type T.
1128 If T is a typedef, return the template parameters of
1129 the _decl_ of the typedef. T must be a dependent type. */
1132 get_template_parms_of_dependent_type (tree t
)
1134 tree tinfo
= NULL_TREE
, tparms
= NULL_TREE
;
1136 /* First, try the obvious case of getting the
1137 template info from T itself. */
1138 if ((tinfo
= get_template_info (t
)))
1140 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
1141 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (t
);
1142 else if (typedef_variant_p (t
)
1143 && !NAMESPACE_SCOPE_P (TYPE_NAME (t
)))
1144 tinfo
= get_template_info (DECL_CONTEXT (TYPE_NAME (t
)));
1145 /* If T is a TYPENAME_TYPE which context is a template type
1146 parameter, get the template parameters from that context. */
1147 else if (TYPE_CONTEXT (t
)
1148 && TREE_CODE (TYPE_CONTEXT (t
)) == TEMPLATE_TYPE_PARM
)
1149 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (TYPE_CONTEXT (t
));
1150 else if (TYPE_CONTEXT (t
)
1151 && !NAMESPACE_SCOPE_P (t
))
1152 tinfo
= get_template_info (TYPE_CONTEXT (t
));
1155 tparms
= DECL_TEMPLATE_PARMS (TI_TEMPLATE (tinfo
));
1160 /* Subroutine of structural_comptypes.
1161 Compare the dependent types T1 and T2.
1162 Return TRUE if we are sure they can't be equal, FALSE otherwise.
1163 The whole point of this function is to support cases where either T1 or
1164 T2 is a typedef. In those cases, we need to compare the template parameters
1165 of the _decl_ of the typedef. If those don't match then we know T1
1166 and T2 cannot be equal. */
1169 incompatible_dependent_types_p (tree t1
, tree t2
)
1171 tree tparms1
= NULL_TREE
, tparms2
= NULL_TREE
;
1172 bool t1_typedef_variant_p
, t2_typedef_variant_p
;
1174 if (!uses_template_parms (t1
) || !uses_template_parms (t2
))
1177 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
)
1179 /* If T1 and T2 don't have the same relative position in their
1180 template parameters set, they can't be equal. */
1181 if (!comp_template_parms_position (t1
, t2
))
1185 t1_typedef_variant_p
= typedef_variant_p (t1
);
1186 t2_typedef_variant_p
= typedef_variant_p (t2
);
1188 /* Either T1 or T2 must be a typedef. */
1189 if (!t1_typedef_variant_p
&& !t2_typedef_variant_p
)
1192 if (!t1_typedef_variant_p
|| !t2_typedef_variant_p
)
1193 /* Either T1 or T2 is not a typedef so we cannot compare the
1194 the template parms of the typedefs of T1 and T2.
1195 At this point, if the main variant type of T1 and T2 are equal
1196 it means the two types can't be incompatible, from the perspective
1197 of this function. */
1198 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1201 /* So if we reach this point, it means either T1 or T2 is a typedef variant.
1202 Let's compare their template parameters. */
1204 tparms1
= get_template_parms_of_dependent_type (t1
);
1205 tparms2
= get_template_parms_of_dependent_type (t2
);
1207 /* If T2 is a template type parm and if we could not get the template
1208 parms it belongs to, that means we have not finished parsing the
1209 full set of template parameters of the template declaration it
1210 belongs to yet. If we could get the template parms T1 belongs to,
1211 that mostly means T1 and T2 belongs to templates that are
1212 different and incompatible. */
1213 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
1214 && (tparms1
== NULL_TREE
|| tparms2
== NULL_TREE
)
1215 && tparms1
!= tparms2
)
1218 if (tparms1
== NULL_TREE
1219 || tparms2
== NULL_TREE
1220 || tparms1
== tparms2
)
1223 /* And now compare the mighty template parms! */
1224 return !comp_template_parms (tparms1
, tparms2
);
1227 /* Subroutine in comptypes. */
1230 structural_comptypes (tree t1
, tree t2
, int strict
)
1235 /* Suppress errors caused by previously reported errors. */
1236 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1239 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1241 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1242 current instantiation. */
1243 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1244 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1246 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1247 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1249 if (TYPE_PTRMEMFUNC_P (t1
))
1250 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1251 if (TYPE_PTRMEMFUNC_P (t2
))
1252 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1254 /* Different classes of types can't be compatible. */
1255 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1258 /* Qualifiers must match. For array types, we will check when we
1259 recur on the array element types. */
1260 if (TREE_CODE (t1
) != ARRAY_TYPE
1261 && cp_type_quals (t1
) != cp_type_quals (t2
))
1263 if (TREE_CODE (t1
) == FUNCTION_TYPE
1264 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1266 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1269 /* If T1 and T2 are dependent typedefs then check upfront that
1270 the template parameters of their typedef DECLs match before
1271 going down checking their subtypes. */
1272 if (incompatible_dependent_types_p (t1
, t2
))
1275 /* Allow for two different type nodes which have essentially the same
1276 definition. Note that we already checked for equality of the type
1277 qualifiers (just above). */
1279 if (TREE_CODE (t1
) != ARRAY_TYPE
1280 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1284 /* Compare the types. Break out if they could be the same. */
1285 switch (TREE_CODE (t1
))
1289 /* All void and bool types are the same. */
1293 case FIXED_POINT_TYPE
:
1295 /* With these nodes, we can't determine type equivalence by
1296 looking at what is stored in the nodes themselves, because
1297 two nodes might have different TYPE_MAIN_VARIANTs but still
1298 represent the same type. For example, wchar_t and int could
1299 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1300 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1301 and are distinct types. On the other hand, int and the
1304 typedef int INT __attribute((may_alias));
1306 have identical properties, different TYPE_MAIN_VARIANTs, but
1307 represent the same type. The canonical type system keeps
1308 track of equivalence in this case, so we fall back on it. */
1309 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1311 case TEMPLATE_TEMPLATE_PARM
:
1312 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1313 if (!comp_template_parms_position (t1
, t2
))
1315 if (!comp_template_parms
1316 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1317 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1319 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1321 /* Don't check inheritance. */
1322 strict
= COMPARE_STRICT
;
1327 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1328 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1329 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1330 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1333 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1335 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1341 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1342 strict
& ~COMPARE_REDECLARATION
))
1344 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1348 case REFERENCE_TYPE
:
1349 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1351 /* fall through to checks for pointer types */
1354 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1355 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
)
1356 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1362 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1364 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1369 /* Target types must match incl. qualifiers. */
1370 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1374 case TEMPLATE_TYPE_PARM
:
1375 /* If incompatible_dependent_types_p called earlier didn't decide
1376 T1 and T2 were different, they might be equal. */
1380 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1381 TYPENAME_TYPE_FULLNAME (t2
)))
1383 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1387 case UNBOUND_CLASS_TEMPLATE
:
1388 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1390 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1395 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1400 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1401 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1405 case TYPE_PACK_EXPANSION
:
1406 return same_type_p (PACK_EXPANSION_PATTERN (t1
),
1407 PACK_EXPANSION_PATTERN (t2
));
1410 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1411 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1412 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1413 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1414 || (DECLTYPE_FOR_LAMBDA_RETURN (t1
)
1415 != DECLTYPE_FOR_LAMBDA_RETURN (t2
))
1416 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1417 DECLTYPE_TYPE_EXPR (t2
)))
1425 /* If we get here, we know that from a target independent POV the
1426 types are the same. Make sure the target attributes are also
1428 return targetm
.comp_type_attributes (t1
, t2
);
1431 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1432 is a bitwise-or of the COMPARE_* flags. */
1435 comptypes (tree t1
, tree t2
, int strict
)
1437 if (strict
== COMPARE_STRICT
)
1442 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1445 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1446 /* At least one of the types requires structural equality, so
1447 perform a deep check. */
1448 return structural_comptypes (t1
, t2
, strict
);
1450 #ifdef ENABLE_CHECKING
1451 if (USE_CANONICAL_TYPES
)
1453 bool result
= structural_comptypes (t1
, t2
, strict
);
1455 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1456 /* The two types are structurally equivalent, but their
1457 canonical types were different. This is a failure of the
1458 canonical type propagation code.*/
1460 ("canonical types differ for identical types %T and %T",
1462 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1463 /* Two types are structurally different, but the canonical
1464 types are the same. This means we were over-eager in
1465 assigning canonical types. */
1467 ("same canonical type node for different types %T and %T",
1473 if (USE_CANONICAL_TYPES
)
1474 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1477 return structural_comptypes (t1
, t2
, strict
);
1479 else if (strict
== COMPARE_STRUCTURAL
)
1480 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1482 return structural_comptypes (t1
, t2
, strict
);
1485 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1488 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1490 int q1
= cp_type_quals (type1
);
1491 int q2
= cp_type_quals (type2
);
1493 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1494 return (q1
& q2
) == q2
;
1497 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1498 more cv-qualified that TYPE1, and 0 otherwise. */
1501 comp_cv_qualification (const_tree type1
, const_tree type2
)
1503 int q1
= cp_type_quals (type1
);
1504 int q2
= cp_type_quals (type2
);
1509 if ((q1
& q2
) == q2
)
1511 else if ((q1
& q2
) == q1
)
1517 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1518 subset of the cv-qualification signature of TYPE2, and the types
1519 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1522 comp_cv_qual_signature (tree type1
, tree type2
)
1524 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1526 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1532 /* Subroutines of `comptypes'. */
1534 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1535 equivalent in the sense that functions with those parameter types
1536 can have equivalent types. The two lists must be equivalent,
1537 element by element. */
1540 compparms (const_tree parms1
, const_tree parms2
)
1544 /* An unspecified parmlist matches any specified parmlist
1545 whose argument types don't need default promotions. */
1547 for (t1
= parms1
, t2
= parms2
;
1549 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1551 /* If one parmlist is shorter than the other,
1552 they fail to match. */
1555 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1562 /* Process a sizeof or alignof expression where the operand is a
1566 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1571 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1572 if (type
== error_mark_node
)
1573 return error_mark_node
;
1575 type
= non_reference (type
);
1576 if (TREE_CODE (type
) == METHOD_TYPE
)
1579 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
1580 "invalid application of %qs to a member function",
1581 operator_name_info
[(int) op
].name
);
1582 value
= size_one_node
;
1585 dependent_p
= dependent_type_p (type
);
1587 complete_type (type
);
1589 /* VLA types will have a non-constant size. In the body of an
1590 uninstantiated template, we don't need to try to compute the
1591 value, because the sizeof expression is not an integral
1592 constant expression in that case. And, if we do try to
1593 compute the value, we'll likely end up with SAVE_EXPRs, which
1594 the template substitution machinery does not expect to see. */
1595 || (processing_template_decl
1596 && COMPLETE_TYPE_P (type
)
1597 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1599 value
= build_min (op
, size_type_node
, type
);
1600 TREE_READONLY (value
) = 1;
1604 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1609 /* Return the size of the type, without producing any warnings for
1610 types whose size cannot be taken. This routine should be used only
1611 in some other routine that has already produced a diagnostic about
1612 using the size of such a type. */
1614 cxx_sizeof_nowarn (tree type
)
1616 if (TREE_CODE (type
) == FUNCTION_TYPE
1617 || TREE_CODE (type
) == VOID_TYPE
1618 || TREE_CODE (type
) == ERROR_MARK
)
1619 return size_one_node
;
1620 else if (!COMPLETE_TYPE_P (type
))
1621 return size_zero_node
;
1623 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1626 /* Process a sizeof expression where the operand is an expression. */
1629 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1631 if (e
== error_mark_node
)
1632 return error_mark_node
;
1634 if (processing_template_decl
)
1636 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1637 TREE_SIDE_EFFECTS (e
) = 0;
1638 TREE_READONLY (e
) = 1;
1643 /* To get the size of a static data member declared as an array of
1644 unknown bound, we need to instantiate it. */
1645 if (TREE_CODE (e
) == VAR_DECL
1646 && VAR_HAD_UNKNOWN_BOUND (e
)
1647 && DECL_TEMPLATE_INSTANTIATION (e
))
1648 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1650 e
= mark_type_use (e
);
1652 if (TREE_CODE (e
) == COMPONENT_REF
1653 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1654 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1656 if (complain
& tf_error
)
1657 error ("invalid application of %<sizeof%> to a bit-field");
1659 return error_mark_node
;
1662 else if (is_overloaded_fn (e
))
1664 if (complain
& tf_error
)
1665 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1668 return error_mark_node
;
1671 else if (type_unknown_p (e
))
1673 if (complain
& tf_error
)
1674 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1676 return error_mark_node
;
1682 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1685 /* Implement the __alignof keyword: Return the minimum required
1686 alignment of E, measured in bytes. For VAR_DECL's and
1687 FIELD_DECL's return DECL_ALIGN (which can be set from an
1688 "aligned" __attribute__ specification). */
1691 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1695 if (e
== error_mark_node
)
1696 return error_mark_node
;
1698 if (processing_template_decl
)
1700 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1701 TREE_SIDE_EFFECTS (e
) = 0;
1702 TREE_READONLY (e
) = 1;
1707 e
= mark_type_use (e
);
1709 if (TREE_CODE (e
) == VAR_DECL
)
1710 t
= size_int (DECL_ALIGN_UNIT (e
));
1711 else if (TREE_CODE (e
) == COMPONENT_REF
1712 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1713 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1715 if (complain
& tf_error
)
1716 error ("invalid application of %<__alignof%> to a bit-field");
1718 return error_mark_node
;
1721 else if (TREE_CODE (e
) == COMPONENT_REF
1722 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1723 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1724 else if (is_overloaded_fn (e
))
1726 if (complain
& tf_error
)
1727 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1730 return error_mark_node
;
1731 if (TREE_CODE (e
) == FUNCTION_DECL
)
1732 t
= size_int (DECL_ALIGN_UNIT (e
));
1736 else if (type_unknown_p (e
))
1738 if (complain
& tf_error
)
1739 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1741 return error_mark_node
;
1745 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1746 complain
& tf_error
);
1748 return fold_convert (size_type_node
, t
);
1751 /* Process a sizeof or alignof expression E with code OP where the operand
1752 is an expression. */
1755 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1757 if (op
== SIZEOF_EXPR
)
1758 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1760 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1763 /* EXPR is being used in a context that is not a function call.
1768 The expression can be used only as the left-hand operand of a
1769 member function call.
1771 [expr.mptr.operator]
1773 If the result of .* or ->* is a function, then that result can be
1774 used only as the operand for the function call operator ().
1776 by issuing an error message if appropriate. Returns true iff EXPR
1777 violates these rules. */
1780 invalid_nonstatic_memfn_p (const_tree expr
, tsubst_flags_t complain
)
1782 if (expr
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1784 if (complain
& tf_error
)
1785 error ("invalid use of non-static member function");
1791 /* If EXP is a reference to a bitfield, and the type of EXP does not
1792 match the declared type of the bitfield, return the declared type
1793 of the bitfield. Otherwise, return NULL_TREE. */
1796 is_bitfield_expr_with_lowered_type (const_tree exp
)
1798 switch (TREE_CODE (exp
))
1801 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1802 ? TREE_OPERAND (exp
, 1)
1803 : TREE_OPERAND (exp
, 0)))
1805 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1808 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1812 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1818 field
= TREE_OPERAND (exp
, 1);
1819 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1821 if (same_type_ignoring_top_level_qualifiers_p
1822 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1824 return DECL_BIT_FIELD_TYPE (field
);
1828 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1829 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1830 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1838 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1839 bitfield with a lowered type, the type of EXP is returned, rather
1843 unlowered_expr_type (const_tree exp
)
1847 type
= is_bitfield_expr_with_lowered_type (exp
);
1849 type
= TREE_TYPE (exp
);
1854 /* Perform the conversions in [expr] that apply when an lvalue appears
1855 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1856 function-to-pointer conversions. In addition, manifest constants
1857 are replaced by their values, and bitfield references are converted
1858 to their declared types. Note that this function does not perform the
1859 lvalue-to-rvalue conversion for class types. If you need that conversion
1860 to for class types, then you probably need to use force_rvalue.
1862 Although the returned value is being used as an rvalue, this
1863 function does not wrap the returned expression in a
1864 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1865 that the return value is no longer an lvalue. */
1868 decay_conversion (tree exp
)
1871 enum tree_code code
;
1873 type
= TREE_TYPE (exp
);
1874 if (type
== error_mark_node
)
1875 return error_mark_node
;
1877 exp
= mark_rvalue_use (exp
);
1879 exp
= resolve_nondeduced_context (exp
);
1880 if (type_unknown_p (exp
))
1882 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1883 return error_mark_node
;
1886 exp
= decl_constant_value (exp
);
1887 if (error_operand_p (exp
))
1888 return error_mark_node
;
1890 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1891 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1892 code
= TREE_CODE (type
);
1893 if (code
== VOID_TYPE
)
1895 error ("void value not ignored as it ought to be");
1896 return error_mark_node
;
1898 if (invalid_nonstatic_memfn_p (exp
, tf_warning_or_error
))
1899 return error_mark_node
;
1900 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1901 return cp_build_unary_op (ADDR_EXPR
, exp
, 0, tf_warning_or_error
);
1902 if (code
== ARRAY_TYPE
)
1907 if (TREE_CODE (exp
) == INDIRECT_REF
)
1908 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1909 TREE_OPERAND (exp
, 0));
1911 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1913 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1914 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1915 TREE_OPERAND (exp
, 0), op1
);
1919 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1921 error ("invalid use of non-lvalue array");
1922 return error_mark_node
;
1925 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1927 if (TREE_CODE (exp
) == VAR_DECL
)
1929 if (!cxx_mark_addressable (exp
))
1930 return error_mark_node
;
1931 adr
= build_nop (ptrtype
, build_address (exp
));
1934 /* This way is better for a COMPONENT_REF since it can
1935 simplify the offset for a component. */
1936 adr
= cp_build_unary_op (ADDR_EXPR
, exp
, 1, tf_warning_or_error
);
1937 return cp_convert (ptrtype
, adr
);
1940 /* If a bitfield is used in a context where integral promotion
1941 applies, then the caller is expected to have used
1942 default_conversion. That function promotes bitfields correctly
1943 before calling this function. At this point, if we have a
1944 bitfield referenced, we may assume that is not subject to
1945 promotion, and that, therefore, the type of the resulting rvalue
1946 is the declared type of the bitfield. */
1947 exp
= convert_bitfield_to_declared_type (exp
);
1949 /* We do not call rvalue() here because we do not want to wrap EXP
1950 in a NON_LVALUE_EXPR. */
1954 Non-class rvalues always have cv-unqualified types. */
1955 type
= TREE_TYPE (exp
);
1956 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
1957 exp
= build_nop (cv_unqualified (type
), exp
);
1962 /* Perform preparatory conversions, as part of the "usual arithmetic
1963 conversions". In particular, as per [expr]:
1965 Whenever an lvalue expression appears as an operand of an
1966 operator that expects the rvalue for that operand, the
1967 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1968 standard conversions are applied to convert the expression to an
1971 In addition, we perform integral promotions here, as those are
1972 applied to both operands to a binary operator before determining
1973 what additional conversions should apply. */
1976 default_conversion (tree exp
)
1978 /* Check for target-specific promotions. */
1979 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
1981 exp
= cp_convert (promoted_type
, exp
);
1982 /* Perform the integral promotions first so that bitfield
1983 expressions (which may promote to "int", even if the bitfield is
1984 declared "unsigned") are promoted correctly. */
1985 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
1986 exp
= perform_integral_promotions (exp
);
1987 /* Perform the other conversions. */
1988 exp
= decay_conversion (exp
);
1993 /* EXPR is an expression with an integral or enumeration type.
1994 Perform the integral promotions in [conv.prom], and return the
1998 perform_integral_promotions (tree expr
)
2003 expr
= mark_rvalue_use (expr
);
2007 If the bitfield has an enumerated type, it is treated as any
2008 other value of that type for promotion purposes. */
2009 type
= is_bitfield_expr_with_lowered_type (expr
);
2010 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
2011 type
= TREE_TYPE (expr
);
2012 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
2013 promoted_type
= type_promotes_to (type
);
2014 if (type
!= promoted_type
)
2015 expr
= cp_convert (promoted_type
, expr
);
2019 /* Returns nonzero iff exp is a STRING_CST or the result of applying
2020 decay_conversion to one. */
2023 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
2027 if (TREE_CODE (totype
) != POINTER_TYPE
)
2030 t
= TREE_TYPE (totype
);
2031 if (!same_type_p (t
, char_type_node
)
2032 && !same_type_p (t
, char16_type_node
)
2033 && !same_type_p (t
, char32_type_node
)
2034 && !same_type_p (t
, wchar_type_node
))
2037 if (TREE_CODE (exp
) == STRING_CST
)
2039 /* Make sure that we don't try to convert between char and wide chars. */
2040 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
2045 /* Is this a string constant which has decayed to 'const char *'? */
2046 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
2047 if (!same_type_p (TREE_TYPE (exp
), t
))
2050 if (TREE_CODE (exp
) != ADDR_EXPR
2051 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2055 /* This warning is not very useful, as it complains about printf. */
2057 warning (OPT_Wwrite_strings
,
2058 "deprecated conversion from string constant to %qT",
2064 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2065 can, for example, use as an lvalue. This code used to be in
2066 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2067 expressions, where we're dealing with aggregates. But now it's again only
2068 called from unary_complex_lvalue. The case (in particular) that led to
2069 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2073 rationalize_conditional_expr (enum tree_code code
, tree t
,
2074 tsubst_flags_t complain
)
2076 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2077 the first operand is always the one to be used if both operands
2078 are equal, so we know what conditional expression this used to be. */
2079 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2081 tree op0
= TREE_OPERAND (t
, 0);
2082 tree op1
= TREE_OPERAND (t
, 1);
2084 /* The following code is incorrect if either operand side-effects. */
2085 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2086 && !TREE_SIDE_EFFECTS (op1
));
2088 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
2089 ? LE_EXPR
: GE_EXPR
),
2090 op0
, TREE_CODE (op0
),
2091 op1
, TREE_CODE (op1
),
2092 /*overloaded_p=*/NULL
,
2094 cp_build_unary_op (code
, op0
, 0, complain
),
2095 cp_build_unary_op (code
, op1
, 0, complain
),
2100 build_conditional_expr (TREE_OPERAND (t
, 0),
2101 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2103 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2108 /* Given the TYPE of an anonymous union field inside T, return the
2109 FIELD_DECL for the field. If not found return NULL_TREE. Because
2110 anonymous unions can nest, we must also search all anonymous unions
2111 that are directly reachable. */
2114 lookup_anon_field (tree t
, tree type
)
2118 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
2120 if (TREE_STATIC (field
))
2122 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2125 /* If we find it directly, return the field. */
2126 if (DECL_NAME (field
) == NULL_TREE
2127 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2132 /* Otherwise, it could be nested, search harder. */
2133 if (DECL_NAME (field
) == NULL_TREE
2134 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2136 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2144 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2145 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2146 non-NULL, it indicates the path to the base used to name MEMBER.
2147 If PRESERVE_REFERENCE is true, the expression returned will have
2148 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2149 returned will have the type referred to by the reference.
2151 This function does not perform access control; that is either done
2152 earlier by the parser when the name of MEMBER is resolved to MEMBER
2153 itself, or later when overload resolution selects one of the
2154 functions indicated by MEMBER. */
2157 build_class_member_access_expr (tree object
, tree member
,
2158 tree access_path
, bool preserve_reference
,
2159 tsubst_flags_t complain
)
2163 tree result
= NULL_TREE
;
2165 if (error_operand_p (object
) || error_operand_p (member
))
2166 return error_mark_node
;
2168 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2172 The type of the first expression shall be "class object" (of a
2174 object_type
= TREE_TYPE (object
);
2175 if (!currently_open_class (object_type
)
2176 && !complete_type_or_else (object_type
, object
))
2177 return error_mark_node
;
2178 if (!CLASS_TYPE_P (object_type
))
2180 if (complain
& tf_error
)
2181 error ("request for member %qD in %qE, which is of non-class type %qT",
2182 member
, object
, object_type
);
2183 return error_mark_node
;
2186 /* The standard does not seem to actually say that MEMBER must be a
2187 member of OBJECT_TYPE. However, that is clearly what is
2189 if (DECL_P (member
))
2191 member_scope
= DECL_CLASS_CONTEXT (member
);
2193 if (TREE_DEPRECATED (member
))
2194 warn_deprecated_use (member
, NULL_TREE
);
2197 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2198 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2199 presently be the anonymous union. Go outwards until we find a
2200 type related to OBJECT_TYPE. */
2201 while (ANON_AGGR_TYPE_P (member_scope
)
2202 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2204 member_scope
= TYPE_CONTEXT (member_scope
);
2205 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2207 if (complain
& tf_error
)
2209 if (TREE_CODE (member
) == FIELD_DECL
)
2210 error ("invalid use of nonstatic data member %qE", member
);
2212 error ("%qD is not a member of %qT", member
, object_type
);
2214 return error_mark_node
;
2217 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2218 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2219 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2221 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2223 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2226 /* In [expr.ref], there is an explicit list of the valid choices for
2227 MEMBER. We check for each of those cases here. */
2228 if (TREE_CODE (member
) == VAR_DECL
)
2230 /* A static data member. */
2232 mark_exp_read (object
);
2233 /* If OBJECT has side-effects, they are supposed to occur. */
2234 if (TREE_SIDE_EFFECTS (object
))
2235 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2237 else if (TREE_CODE (member
) == FIELD_DECL
)
2239 /* A non-static data member. */
2244 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
2245 && integer_zerop (TREE_OPERAND (object
, 0)));
2247 /* Convert OBJECT to the type of MEMBER. */
2248 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2249 TYPE_MAIN_VARIANT (member_scope
)))
2254 binfo
= lookup_base (access_path
? access_path
: object_type
,
2255 member_scope
, ba_unique
, &kind
);
2256 if (binfo
== error_mark_node
)
2257 return error_mark_node
;
2259 /* It is invalid to try to get to a virtual base of a
2260 NULL object. The most common cause is invalid use of
2262 if (null_object_p
&& kind
== bk_via_virtual
)
2264 if (complain
& tf_error
)
2266 error ("invalid access to non-static data member %qD of "
2269 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2271 return error_mark_node
;
2274 /* Convert to the base. */
2275 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2277 /* If we found the base successfully then we should be able
2278 to convert to it successfully. */
2279 gcc_assert (object
!= error_mark_node
);
2282 /* Complain about other invalid uses of offsetof, even though they will
2283 give the right answer. Note that we complain whether or not they
2284 actually used the offsetof macro, since there's no way to know at this
2285 point. So we just give a warning, instead of a pedwarn. */
2286 /* Do not produce this warning for base class field references, because
2287 we know for a fact that didn't come from offsetof. This does occur
2288 in various testsuite cases where a null object is passed where a
2289 vtable access is required. */
2290 if (null_object_p
&& warn_invalid_offsetof
2291 && CLASSTYPE_NON_STD_LAYOUT (object_type
)
2292 && !DECL_FIELD_IS_BASE (member
)
2293 && cp_unevaluated_operand
== 0
2294 && (complain
& tf_warning
))
2296 warning (OPT_Winvalid_offsetof
,
2297 "invalid access to non-static data member %qD "
2298 " of NULL object", member
);
2299 warning (OPT_Winvalid_offsetof
,
2300 "(perhaps the %<offsetof%> macro was used incorrectly)");
2303 /* If MEMBER is from an anonymous aggregate, we have converted
2304 OBJECT so that it refers to the class containing the
2305 anonymous union. Generate a reference to the anonymous union
2306 itself, and recur to find MEMBER. */
2307 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2308 /* When this code is called from build_field_call, the
2309 object already has the type of the anonymous union.
2310 That is because the COMPONENT_REF was already
2311 constructed, and was then disassembled before calling
2312 build_field_call. After the function-call code is
2313 cleaned up, this waste can be eliminated. */
2314 && (!same_type_ignoring_top_level_qualifiers_p
2315 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2317 tree anonymous_union
;
2319 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2320 DECL_CONTEXT (member
));
2321 object
= build_class_member_access_expr (object
,
2323 /*access_path=*/NULL_TREE
,
2328 /* Compute the type of the field, as described in [expr.ref]. */
2329 type_quals
= TYPE_UNQUALIFIED
;
2330 member_type
= TREE_TYPE (member
);
2331 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2333 type_quals
= (cp_type_quals (member_type
)
2334 | cp_type_quals (object_type
));
2336 /* A field is const (volatile) if the enclosing object, or the
2337 field itself, is const (volatile). But, a mutable field is
2338 not const, even within a const object. */
2339 if (DECL_MUTABLE_P (member
))
2340 type_quals
&= ~TYPE_QUAL_CONST
;
2341 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2344 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
2346 result
= fold_if_not_in_template (result
);
2348 /* Mark the expression const or volatile, as appropriate. Even
2349 though we've dealt with the type above, we still have to mark the
2350 expression itself. */
2351 if (type_quals
& TYPE_QUAL_CONST
)
2352 TREE_READONLY (result
) = 1;
2353 if (type_quals
& TYPE_QUAL_VOLATILE
)
2354 TREE_THIS_VOLATILE (result
) = 1;
2356 else if (BASELINK_P (member
))
2358 /* The member is a (possibly overloaded) member function. */
2362 /* If the MEMBER is exactly one static member function, then we
2363 know the type of the expression. Otherwise, we must wait
2364 until overload resolution has been performed. */
2365 functions
= BASELINK_FUNCTIONS (member
);
2366 if (TREE_CODE (functions
) == FUNCTION_DECL
2367 && DECL_STATIC_FUNCTION_P (functions
))
2368 type
= TREE_TYPE (functions
);
2370 type
= unknown_type_node
;
2371 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2372 base. That will happen when the function is called. */
2373 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2375 else if (TREE_CODE (member
) == CONST_DECL
)
2377 /* The member is an enumerator. */
2379 /* If OBJECT has side-effects, they are supposed to occur. */
2380 if (TREE_SIDE_EFFECTS (object
))
2381 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2386 if (complain
& tf_error
)
2387 error ("invalid use of %qD", member
);
2388 return error_mark_node
;
2391 if (!preserve_reference
)
2394 If E2 is declared to have type "reference to T", then ... the
2395 type of E1.E2 is T. */
2396 result
= convert_from_reference (result
);
2401 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2402 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2405 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2407 tree object_type
= TREE_TYPE (object
);
2408 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2411 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2413 error ("qualified type %qT does not match destructor name ~%qT",
2415 return error_mark_node
;
2417 if (TREE_CODE (dtor_type
) == IDENTIFIER_NODE
)
2419 /* In a template, names we can't find a match for are still accepted
2420 destructor names, and we check them here. */
2421 if (check_dtor_name (object_type
, dtor_type
))
2422 dtor_type
= object_type
;
2425 error ("object type %qT does not match destructor name ~%qT",
2426 object_type
, dtor_type
);
2427 return error_mark_node
;
2431 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2433 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2434 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2435 return error_mark_node
;
2437 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2438 /*protect=*/1, /*want_type=*/false);
2439 expr
= (adjust_result_of_qualified_name_lookup
2440 (expr
, dtor_type
, object_type
));
2444 /* An expression of the form "A::template B" has been resolved to
2445 DECL. Issue a diagnostic if B is not a template or template
2449 check_template_keyword (tree decl
)
2451 /* The standard says:
2455 If a name prefixed by the keyword template is not a member
2456 template, the program is ill-formed.
2458 DR 228 removed the restriction that the template be a member
2461 DR 96, if accepted would add the further restriction that explicit
2462 template arguments must be provided if the template keyword is
2463 used, but, as of 2005-10-16, that DR is still in "drafting". If
2464 this DR is accepted, then the semantic checks here can be
2465 simplified, as the entity named must in fact be a template
2466 specialization, rather than, as at present, a set of overloaded
2467 functions containing at least one template function. */
2468 if (TREE_CODE (decl
) != TEMPLATE_DECL
2469 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2471 if (!is_overloaded_fn (decl
))
2472 permerror (input_location
, "%qD is not a template", decl
);
2477 if (BASELINK_P (fns
))
2478 fns
= BASELINK_FUNCTIONS (fns
);
2481 tree fn
= OVL_CURRENT (fns
);
2482 if (TREE_CODE (fn
) == TEMPLATE_DECL
2483 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2485 if (TREE_CODE (fn
) == FUNCTION_DECL
2486 && DECL_USE_TEMPLATE (fn
)
2487 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2489 fns
= OVL_NEXT (fns
);
2492 permerror (input_location
, "%qD is not a template", decl
);
2497 /* This function is called by the parser to process a class member
2498 access expression of the form OBJECT.NAME. NAME is a node used by
2499 the parser to represent a name; it is not yet a DECL. It may,
2500 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2501 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2502 there is no reason to do the lookup twice, so the parser keeps the
2503 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2504 be a template via the use of the "A::template B" syntax. */
2507 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2508 tsubst_flags_t complain
)
2513 tree access_path
= NULL_TREE
;
2514 tree orig_object
= object
;
2515 tree orig_name
= name
;
2517 if (object
== error_mark_node
|| name
== error_mark_node
)
2518 return error_mark_node
;
2520 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2521 if (!objc_is_public (object
, name
))
2522 return error_mark_node
;
2524 object_type
= TREE_TYPE (object
);
2526 if (processing_template_decl
)
2528 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2529 dependent_type_p (object_type
)
2530 /* If NAME is just an IDENTIFIER_NODE, then the expression
2532 || TREE_CODE (object
) == IDENTIFIER_NODE
2533 /* If NAME is "f<args>", where either 'f' or 'args' is
2534 dependent, then the expression is dependent. */
2535 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2536 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2537 TREE_OPERAND (name
, 1)))
2538 /* If NAME is "T::X" where "T" is dependent, then the
2539 expression is dependent. */
2540 || (TREE_CODE (name
) == SCOPE_REF
2541 && TYPE_P (TREE_OPERAND (name
, 0))
2542 && dependent_type_p (TREE_OPERAND (name
, 0))))
2543 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2544 object
= build_non_dependent_expr (object
);
2549 The type of the first expression shall be "class object" (of a
2551 if (!currently_open_class (object_type
)
2552 && !complete_type_or_else (object_type
, object
))
2553 return error_mark_node
;
2554 if (!CLASS_TYPE_P (object_type
))
2556 if (complain
& tf_error
)
2557 error ("request for member %qD in %qE, which is of non-class type %qT",
2558 name
, object
, object_type
);
2559 return error_mark_node
;
2562 if (BASELINK_P (name
))
2563 /* A member function that has already been looked up. */
2567 bool is_template_id
= false;
2568 tree template_args
= NULL_TREE
;
2571 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2573 is_template_id
= true;
2574 template_args
= TREE_OPERAND (name
, 1);
2575 name
= TREE_OPERAND (name
, 0);
2577 if (TREE_CODE (name
) == OVERLOAD
)
2578 name
= DECL_NAME (get_first_fn (name
));
2579 else if (DECL_P (name
))
2580 name
= DECL_NAME (name
);
2583 if (TREE_CODE (name
) == SCOPE_REF
)
2585 /* A qualified name. The qualifying class or namespace `S'
2586 has already been looked up; it is either a TYPE or a
2588 scope
= TREE_OPERAND (name
, 0);
2589 name
= TREE_OPERAND (name
, 1);
2591 /* If SCOPE is a namespace, then the qualified name does not
2592 name a member of OBJECT_TYPE. */
2593 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2595 if (complain
& tf_error
)
2596 error ("%<%D::%D%> is not a member of %qT",
2597 scope
, name
, object_type
);
2598 return error_mark_node
;
2601 gcc_assert (CLASS_TYPE_P (scope
));
2602 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2603 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2605 if (constructor_name_p (name
, scope
))
2607 if (complain
& tf_error
)
2608 error ("cannot call constructor %<%T::%D%> directly",
2610 return error_mark_node
;
2613 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2614 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2615 if (access_path
== error_mark_node
)
2616 return error_mark_node
;
2619 if (complain
& tf_error
)
2620 error ("%qT is not a base of %qT", scope
, object_type
);
2621 return error_mark_node
;
2627 access_path
= object_type
;
2630 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2631 member
= lookup_destructor (object
, scope
, name
);
2634 /* Look up the member. */
2635 member
= lookup_member (access_path
, name
, /*protect=*/1,
2636 /*want_type=*/false);
2637 if (member
== NULL_TREE
)
2639 if (complain
& tf_error
)
2640 error ("%qD has no member named %qE", object_type
, name
);
2641 return error_mark_node
;
2643 if (member
== error_mark_node
)
2644 return error_mark_node
;
2649 tree templ
= member
;
2651 if (BASELINK_P (templ
))
2652 templ
= lookup_template_function (templ
, template_args
);
2655 if (complain
& tf_error
)
2656 error ("%qD is not a member template function", name
);
2657 return error_mark_node
;
2662 if (TREE_DEPRECATED (member
))
2663 warn_deprecated_use (member
, NULL_TREE
);
2666 check_template_keyword (member
);
2668 expr
= build_class_member_access_expr (object
, member
, access_path
,
2669 /*preserve_reference=*/false,
2671 if (processing_template_decl
&& expr
!= error_mark_node
)
2673 if (BASELINK_P (member
))
2675 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2676 BASELINK_QUALIFIED_P (member
) = 1;
2679 return build_min_non_dep (COMPONENT_REF
, expr
,
2680 orig_object
, orig_name
,
2687 /* Return an expression for the MEMBER_NAME field in the internal
2688 representation of PTRMEM, a pointer-to-member function. (Each
2689 pointer-to-member function type gets its own RECORD_TYPE so it is
2690 more convenient to access the fields by name than by FIELD_DECL.)
2691 This routine converts the NAME to a FIELD_DECL and then creates the
2692 node for the complete expression. */
2695 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2701 /* This code is a stripped down version of
2702 build_class_member_access_expr. It does not work to use that
2703 routine directly because it expects the object to be of class
2705 ptrmem_type
= TREE_TYPE (ptrmem
);
2706 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2707 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2708 /*want_type=*/false);
2709 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2710 cp_type_quals (ptrmem_type
));
2711 return fold_build3_loc (input_location
,
2712 COMPONENT_REF
, member_type
,
2713 ptrmem
, member
, NULL_TREE
);
2716 /* Given an expression PTR for a pointer, return an expression
2717 for the value pointed to.
2718 ERRORSTRING is the name of the operator to appear in error messages.
2720 This function may need to overload OPERATOR_FNNAME.
2721 Must also handle REFERENCE_TYPEs for C++. */
2724 build_x_indirect_ref (tree expr
, ref_operator errorstring
,
2725 tsubst_flags_t complain
)
2727 tree orig_expr
= expr
;
2730 if (processing_template_decl
)
2732 /* Retain the type if we know the operand is a pointer so that
2733 describable_type doesn't make auto deduction break. */
2734 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2735 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2736 if (type_dependent_expression_p (expr
))
2737 return build_min_nt (INDIRECT_REF
, expr
);
2738 expr
= build_non_dependent_expr (expr
);
2741 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2742 NULL_TREE
, /*overloaded_p=*/NULL
, complain
);
2744 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2746 if (processing_template_decl
&& rval
!= error_mark_node
)
2747 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2752 /* Helper function called from c-common. */
2754 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2755 tree ptr
, ref_operator errorstring
)
2757 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2761 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2762 tsubst_flags_t complain
)
2766 if (ptr
== error_mark_node
)
2767 return error_mark_node
;
2769 if (ptr
== current_class_ptr
)
2770 return current_class_ref
;
2772 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2773 ? ptr
: decay_conversion (ptr
));
2774 type
= TREE_TYPE (pointer
);
2776 if (POINTER_TYPE_P (type
))
2780 If the type of the expression is "pointer to T," the type
2781 of the result is "T." */
2782 tree t
= TREE_TYPE (type
);
2784 if (CONVERT_EXPR_P (ptr
)
2785 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2787 /* If a warning is issued, mark it to avoid duplicates from
2788 the backend. This only needs to be done at
2789 warn_strict_aliasing > 2. */
2790 if (warn_strict_aliasing
> 2)
2791 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2792 type
, TREE_OPERAND (ptr
, 0)))
2793 TREE_NO_WARNING (ptr
) = 1;
2796 if (VOID_TYPE_P (t
))
2798 /* A pointer to incomplete type (other than cv void) can be
2799 dereferenced [expr.unary.op]/1 */
2800 if (complain
& tf_error
)
2801 error ("%qT is not a pointer-to-object type", type
);
2802 return error_mark_node
;
2804 else if (TREE_CODE (pointer
) == ADDR_EXPR
2805 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2806 /* The POINTER was something like `&x'. We simplify `*&x' to
2808 return TREE_OPERAND (pointer
, 0);
2811 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2813 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2814 so that we get the proper error message if the result is used
2815 to assign to. Also, &* is supposed to be a no-op. */
2816 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2817 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2818 TREE_SIDE_EFFECTS (ref
)
2819 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2823 else if (!(complain
& tf_error
))
2824 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2826 /* `pointer' won't be an error_mark_node if we were given a
2827 pointer to member, so it's cool to check for this here. */
2828 else if (TYPE_PTR_TO_MEMBER_P (type
))
2829 switch (errorstring
)
2831 case RO_ARRAY_INDEXING
:
2832 error ("invalid use of array indexing on pointer to member");
2835 error ("invalid use of unary %<*%> on pointer to member");
2837 case RO_IMPLICIT_CONVERSION
:
2838 error ("invalid use of implicit conversion on pointer to member");
2843 else if (pointer
!= error_mark_node
)
2844 switch (errorstring
)
2847 error ("invalid type argument");
2849 case RO_ARRAY_INDEXING
:
2850 error ("invalid type argument of array indexing");
2853 error ("invalid type argument of unary %<*%>");
2855 case RO_IMPLICIT_CONVERSION
:
2856 error ("invalid type argument of implicit conversion");
2861 return error_mark_node
;
2864 /* This handles expressions of the form "a[i]", which denotes
2867 This is logically equivalent in C to *(a+i), but we may do it differently.
2868 If A is a variable or a member, we generate a primitive ARRAY_REF.
2869 This avoids forcing the array out of registers, and can work on
2870 arrays that are not lvalues (for example, members of structures returned
2873 If INDEX is of some user-defined type, it must be converted to
2874 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2875 will inherit the type of the array, which will be some pointer type.
2877 LOC is the location to use in building the array reference. */
2880 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
2881 tsubst_flags_t complain
)
2887 if (complain
& tf_error
)
2888 error_at (loc
, "subscript missing in array reference");
2889 return error_mark_node
;
2892 if (TREE_TYPE (array
) == error_mark_node
2893 || TREE_TYPE (idx
) == error_mark_node
)
2894 return error_mark_node
;
2896 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2898 switch (TREE_CODE (array
))
2902 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2904 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2905 TREE_OPERAND (array
, 0), value
);
2906 SET_EXPR_LOCATION (ret
, loc
);
2911 ret
= build_conditional_expr
2912 (TREE_OPERAND (array
, 0),
2913 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2915 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
2917 tf_warning_or_error
);
2918 protected_set_expr_location (ret
, loc
);
2925 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2929 warn_array_subscript_with_type_char (idx
);
2931 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2933 if (complain
& tf_error
)
2934 error_at (loc
, "array subscript is not an integer");
2935 return error_mark_node
;
2938 /* Apply integral promotions *after* noticing character types.
2939 (It is unclear why we do these promotions -- the standard
2940 does not say that we should. In fact, the natural thing would
2941 seem to be to convert IDX to ptrdiff_t; we're performing
2942 pointer arithmetic.) */
2943 idx
= perform_integral_promotions (idx
);
2945 /* An array that is indexed by a non-constant
2946 cannot be stored in a register; we must be able to do
2947 address arithmetic on its address.
2948 Likewise an array of elements of variable size. */
2949 if (TREE_CODE (idx
) != INTEGER_CST
2950 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2951 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2954 if (!cxx_mark_addressable (array
))
2955 return error_mark_node
;
2958 /* An array that is indexed by a constant value which is not within
2959 the array bounds cannot be stored in a register either; because we
2960 would get a crash in store_bit_field/extract_bit_field when trying
2961 to access a non-existent part of the register. */
2962 if (TREE_CODE (idx
) == INTEGER_CST
2963 && TYPE_DOMAIN (TREE_TYPE (array
))
2964 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
2966 if (!cxx_mark_addressable (array
))
2967 return error_mark_node
;
2970 if (!lvalue_p (array
) && (complain
& tf_error
))
2971 pedwarn (loc
, OPT_pedantic
,
2972 "ISO C++ forbids subscripting non-lvalue array");
2974 /* Note in C++ it is valid to subscript a `register' array, since
2975 it is valid to take the address of something with that
2976 storage specification. */
2980 while (TREE_CODE (foo
) == COMPONENT_REF
)
2981 foo
= TREE_OPERAND (foo
, 0);
2982 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
)
2983 && (complain
& tf_warning
))
2984 warning_at (loc
, OPT_Wextra
,
2985 "subscripting array declared %<register%>");
2988 type
= TREE_TYPE (TREE_TYPE (array
));
2989 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
2990 /* Array ref is const/volatile if the array elements are
2991 or if the array is.. */
2992 TREE_READONLY (rval
)
2993 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
2994 TREE_SIDE_EFFECTS (rval
)
2995 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
2996 TREE_THIS_VOLATILE (rval
)
2997 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
2998 ret
= require_complete_type (fold_if_not_in_template (rval
));
2999 protected_set_expr_location (ret
, loc
);
3004 tree ar
= default_conversion (array
);
3005 tree ind
= default_conversion (idx
);
3007 /* Put the integer in IND to simplify error checking. */
3008 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
3015 if (ar
== error_mark_node
)
3018 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
3020 if (complain
& tf_error
)
3021 error_at (loc
, "subscripted value is neither array nor pointer");
3022 return error_mark_node
;
3024 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
3026 if (complain
& tf_error
)
3027 error_at (loc
, "array subscript is not an integer");
3028 return error_mark_node
;
3031 warn_array_subscript_with_type_char (idx
);
3033 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
3038 protected_set_expr_location (ret
, loc
);
3043 /* Entry point for Obj-C++. */
3046 build_array_ref (location_t loc
, tree array
, tree idx
)
3048 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
3051 /* Resolve a pointer to member function. INSTANCE is the object
3052 instance to use, if the member points to a virtual member.
3054 This used to avoid checking for virtual functions if basetype
3055 has no virtual functions, according to an earlier ANSI draft.
3056 With the final ISO C++ rules, such an optimization is
3057 incorrect: A pointer to a derived member can be static_cast
3058 to pointer-to-base-member, as long as the dynamic object
3059 later has the right member. */
3062 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
3064 if (TREE_CODE (function
) == OFFSET_REF
)
3065 function
= TREE_OPERAND (function
, 1);
3067 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3069 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
3070 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3072 tree instance_ptr
= *instance_ptrptr
;
3073 tree instance_save_expr
= 0;
3074 if (instance_ptr
== error_mark_node
)
3076 if (TREE_CODE (function
) == PTRMEM_CST
)
3078 /* Extracting the function address from a pmf is only
3079 allowed with -Wno-pmf-conversions. It only works for
3081 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
3082 e1
= convert (fntype
, e1
);
3087 error ("object missing in use of %qE", function
);
3088 return error_mark_node
;
3092 if (TREE_SIDE_EFFECTS (instance_ptr
))
3093 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3095 if (TREE_SIDE_EFFECTS (function
))
3096 function
= save_expr (function
);
3098 /* Start by extracting all the information from the PMF itself. */
3099 e3
= pfn_from_ptrmemfunc (function
);
3100 delta
= delta_from_ptrmemfunc (function
);
3101 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3102 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3104 case ptrmemfunc_vbit_in_pfn
:
3105 e1
= cp_build_binary_op (input_location
,
3106 BIT_AND_EXPR
, idx
, integer_one_node
,
3107 tf_warning_or_error
);
3108 idx
= cp_build_binary_op (input_location
,
3109 MINUS_EXPR
, idx
, integer_one_node
,
3110 tf_warning_or_error
);
3113 case ptrmemfunc_vbit_in_delta
:
3114 e1
= cp_build_binary_op (input_location
,
3115 BIT_AND_EXPR
, delta
, integer_one_node
,
3116 tf_warning_or_error
);
3117 delta
= cp_build_binary_op (input_location
,
3118 RSHIFT_EXPR
, delta
, integer_one_node
,
3119 tf_warning_or_error
);
3126 /* Convert down to the right base before using the instance. A
3127 special case is that in a pointer to member of class C, C may
3128 be incomplete. In that case, the function will of course be
3129 a member of C, and no conversion is required. In fact,
3130 lookup_base will fail in that case, because incomplete
3131 classes do not have BINFOs. */
3132 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3133 if (!same_type_ignoring_top_level_qualifiers_p
3134 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3136 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3137 basetype
, ba_check
, NULL
);
3138 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3140 if (instance_ptr
== error_mark_node
)
3141 return error_mark_node
;
3143 /* ...and then the delta in the PMF. */
3144 instance_ptr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (instance_ptr
),
3145 instance_ptr
, fold_convert (sizetype
, delta
));
3147 /* Hand back the adjusted 'this' argument to our caller. */
3148 *instance_ptrptr
= instance_ptr
;
3150 /* Next extract the vtable pointer from the object. */
3151 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3153 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, tf_warning_or_error
);
3154 /* If the object is not dynamic the access invokes undefined
3155 behavior. As it is not executed in this case silence the
3156 spurious warnings it may provoke. */
3157 TREE_NO_WARNING (vtbl
) = 1;
3159 /* Finally, extract the function pointer from the vtable. */
3160 e2
= fold_build2_loc (input_location
,
3161 POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
,
3162 fold_convert (sizetype
, idx
));
3163 e2
= cp_build_indirect_ref (e2
, RO_NULL
, tf_warning_or_error
);
3164 TREE_CONSTANT (e2
) = 1;
3166 /* When using function descriptors, the address of the
3167 vtable entry is treated as a function pointer. */
3168 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3169 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3170 cp_build_unary_op (ADDR_EXPR
, e2
, /*noconvert=*/1,
3171 tf_warning_or_error
));
3173 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3174 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
3176 /* Make sure this doesn't get evaluated first inside one of the
3177 branches of the COND_EXPR. */
3178 if (instance_save_expr
)
3179 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3180 instance_save_expr
, e1
);
3187 /* Used by the C-common bits. */
3189 build_function_call (location_t loc ATTRIBUTE_UNUSED
,
3190 tree function
, tree params
)
3192 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3195 /* Used by the C-common bits. */
3197 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED
,
3198 tree function
, VEC(tree
,gc
) *params
,
3199 VEC(tree
,gc
) *origtypes ATTRIBUTE_UNUSED
)
3201 VEC(tree
,gc
) *orig_params
= params
;
3202 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3203 tf_warning_or_error
);
3205 /* cp_build_function_call_vec can reallocate PARAMS by adding
3206 default arguments. That should never happen here. Verify
3208 gcc_assert (params
== orig_params
);
3213 /* Build a function call using a tree list of arguments. */
3216 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3221 vec
= make_tree_vector ();
3222 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3223 VEC_safe_push (tree
, gc
, vec
, TREE_VALUE (params
));
3224 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3225 release_tree_vector (vec
);
3229 /* Build a function call using varargs. */
3232 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3238 vec
= make_tree_vector ();
3239 va_start (args
, complain
);
3240 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3241 VEC_safe_push (tree
, gc
, vec
, t
);
3243 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3244 release_tree_vector (vec
);
3248 /* Build a function call using a vector of arguments. PARAMS may be
3249 NULL if there are no parameters. This changes the contents of
3253 cp_build_function_call_vec (tree function
, VEC(tree
,gc
) **params
,
3254 tsubst_flags_t complain
)
3256 tree fntype
, fndecl
;
3258 tree original
= function
;
3262 VEC(tree
,gc
) *allocated
= NULL
;
3265 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3266 expressions, like those used for ObjC messenger dispatches. */
3267 if (params
!= NULL
&& !VEC_empty (tree
, *params
))
3268 function
= objc_rewrite_function_call (function
,
3269 VEC_index (tree
, *params
, 0));
3271 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3272 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3273 if (TREE_CODE (function
) == NOP_EXPR
3274 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3275 function
= TREE_OPERAND (function
, 0);
3277 if (TREE_CODE (function
) == FUNCTION_DECL
)
3279 mark_used (function
);
3282 /* Convert anything with function type to a pointer-to-function. */
3283 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
3284 pedwarn (input_location
, OPT_pedantic
,
3285 "ISO C++ forbids calling %<::main%> from within program");
3287 function
= build_addr_func (function
);
3293 function
= build_addr_func (function
);
3296 if (function
== error_mark_node
)
3297 return error_mark_node
;
3299 fntype
= TREE_TYPE (function
);
3301 if (TYPE_PTRMEMFUNC_P (fntype
))
3303 if (complain
& tf_error
)
3304 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3305 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3306 original
, original
);
3307 return error_mark_node
;
3310 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
3311 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3313 if (!((TREE_CODE (fntype
) == POINTER_TYPE
3314 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
3316 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3318 if (complain
& tf_error
)
3319 error ("%qE cannot be used as a function", original
);
3320 return error_mark_node
;
3323 /* fntype now gets the type of function pointed to. */
3324 fntype
= TREE_TYPE (fntype
);
3325 parm_types
= TYPE_ARG_TYPES (fntype
);
3329 allocated
= make_tree_vector ();
3330 params
= &allocated
;
3333 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3336 return error_mark_node
;
3338 argarray
= VEC_address (tree
, *params
);
3340 /* Check for errors in format strings and inappropriately
3342 check_function_arguments (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
,
3345 ret
= build_cxx_call (function
, nargs
, argarray
);
3347 if (allocated
!= NULL
)
3348 release_tree_vector (allocated
);
3353 /* Subroutine of convert_arguments.
3354 Warn about wrong number of args are genereted. */
3357 warn_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3361 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3363 if (DECL_NAME (fndecl
) == NULL_TREE
3364 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3367 ? G_("too many arguments to constructor %q#D")
3368 : G_("too few arguments to constructor %q#D"),
3373 ? G_("too many arguments to member function %q#D")
3374 : G_("too few arguments to member function %q#D"),
3380 ? G_("too many arguments to function %q#D")
3381 : G_("too few arguments to function %q#D"),
3383 inform (DECL_SOURCE_LOCATION (fndecl
),
3387 error_at (loc
, too_many_p
? G_("too many arguments to function")
3388 : G_("too few arguments to function"));
3391 /* Convert the actual parameter expressions in the list VALUES to the
3392 types in the list TYPELIST. The converted expressions are stored
3393 back in the VALUES vector.
3394 If parmdecls is exhausted, or when an element has NULL as its type,
3395 perform the default conversions.
3397 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3399 This is also where warnings about wrong number of args are generated.
3401 Returns the actual number of arguments processed (which might be less
3402 than the length of the vector), or -1 on error.
3404 In C++, unspecified trailing parameters can be filled in with their
3405 default arguments, if such were specified. Do so here. */
3408 convert_arguments (tree typelist
, VEC(tree
,gc
) **values
, tree fndecl
,
3409 int flags
, tsubst_flags_t complain
)
3414 /* Argument passing is always copy-initialization. */
3415 flags
|= LOOKUP_ONLYCONVERTING
;
3417 for (i
= 0, typetail
= typelist
;
3418 i
< VEC_length (tree
, *values
);
3421 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3422 tree val
= VEC_index (tree
, *values
, i
);
3424 if (val
== error_mark_node
|| type
== error_mark_node
)
3427 if (type
== void_type_node
)
3429 if (complain
& tf_error
)
3431 warn_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3438 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3439 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3440 if (TREE_CODE (val
) == NOP_EXPR
3441 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3442 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3443 val
= TREE_OPERAND (val
, 0);
3445 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3447 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3448 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3449 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3450 val
= decay_conversion (val
);
3453 if (val
== error_mark_node
)
3458 /* Formal parm type is specified by a function prototype. */
3461 if (!COMPLETE_TYPE_P (complete_type (type
)))
3463 if (complain
& tf_error
)
3466 error ("parameter %P of %qD has incomplete type %qT",
3469 error ("parameter %P has incomplete type %qT", i
, type
);
3471 parmval
= error_mark_node
;
3475 parmval
= convert_for_initialization
3476 (NULL_TREE
, type
, val
, flags
,
3477 "argument passing", fndecl
, i
, complain
);
3478 parmval
= convert_for_arg_passing (type
, parmval
);
3481 if (parmval
== error_mark_node
)
3484 VEC_replace (tree
, *values
, i
, parmval
);
3488 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3489 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3490 /* Don't do ellipsis conversion for __built_in_constant_p
3491 as this will result in spurious errors for non-trivial
3493 val
= require_complete_type (val
);
3495 val
= convert_arg_to_ellipsis (val
);
3497 VEC_replace (tree
, *values
, i
, val
);
3501 typetail
= TREE_CHAIN (typetail
);
3504 if (typetail
!= 0 && typetail
!= void_list_node
)
3506 /* See if there are default arguments that can be used. Because
3507 we hold default arguments in the FUNCTION_TYPE (which is so
3508 wrong), we can see default parameters here from deduced
3509 contexts (and via typeof) for indirect function calls.
3510 Fortunately we know whether we have a function decl to
3511 provide default arguments in a language conformant
3513 if (fndecl
&& TREE_PURPOSE (typetail
)
3514 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3516 for (; typetail
!= void_list_node
; ++i
)
3519 = convert_default_arg (TREE_VALUE (typetail
),
3520 TREE_PURPOSE (typetail
),
3523 if (parmval
== error_mark_node
)
3526 VEC_safe_push (tree
, gc
, *values
, parmval
);
3527 typetail
= TREE_CHAIN (typetail
);
3528 /* ends with `...'. */
3529 if (typetail
== NULL_TREE
)
3535 if (complain
& tf_error
)
3536 warn_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3544 /* Build a binary-operation expression, after performing default
3545 conversions on the operands. CODE is the kind of expression to
3546 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3547 are the tree codes which correspond to ARG1 and ARG2 when issuing
3548 warnings about possibly misplaced parentheses. They may differ
3549 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3550 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3551 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3552 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3553 ARG2_CODE as ERROR_MARK. */
3556 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3557 tree arg2
, enum tree_code arg2_code
, bool *overloaded_p
,
3558 tsubst_flags_t complain
)
3567 if (processing_template_decl
)
3569 if (type_dependent_expression_p (arg1
)
3570 || type_dependent_expression_p (arg2
))
3571 return build_min_nt (code
, arg1
, arg2
);
3572 arg1
= build_non_dependent_expr (arg1
);
3573 arg2
= build_non_dependent_expr (arg2
);
3576 if (code
== DOTSTAR_EXPR
)
3577 expr
= build_m_component_ref (arg1
, arg2
);
3579 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3580 overloaded_p
, complain
);
3582 /* Check for cases such as x+y<<z which users are likely to
3583 misinterpret. But don't warn about obj << x + y, since that is a
3584 common idiom for I/O. */
3585 if (warn_parentheses
3586 && (complain
& tf_warning
)
3587 && !processing_template_decl
3588 && !error_operand_p (arg1
)
3589 && !error_operand_p (arg2
)
3590 && (code
!= LSHIFT_EXPR
3591 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3592 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3594 if (processing_template_decl
&& expr
!= error_mark_node
)
3595 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3600 /* Build and return an ARRAY_REF expression. */
3603 build_x_array_ref (tree arg1
, tree arg2
, tsubst_flags_t complain
)
3605 tree orig_arg1
= arg1
;
3606 tree orig_arg2
= arg2
;
3609 if (processing_template_decl
)
3611 if (type_dependent_expression_p (arg1
)
3612 || type_dependent_expression_p (arg2
))
3613 return build_min_nt (ARRAY_REF
, arg1
, arg2
,
3614 NULL_TREE
, NULL_TREE
);
3615 arg1
= build_non_dependent_expr (arg1
);
3616 arg2
= build_non_dependent_expr (arg2
);
3619 expr
= build_new_op (ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3620 /*overloaded_p=*/NULL
, complain
);
3622 if (processing_template_decl
&& expr
!= error_mark_node
)
3623 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3624 NULL_TREE
, NULL_TREE
);
3628 /* For the c-common bits. */
3630 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3631 int convert_p ATTRIBUTE_UNUSED
)
3633 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3637 /* Build a binary-operation expression without default conversions.
3638 CODE is the kind of expression to build.
3639 LOCATION is the location_t of the operator in the source code.
3640 This function differs from `build' in several ways:
3641 the data type of the result is computed and recorded in it,
3642 warnings are generated if arg data types are invalid,
3643 special handling for addition and subtraction of pointers is known,
3644 and some optimization is done (operations on narrow ints
3645 are done in the narrower type when that gives the same result).
3646 Constant folding is also done before the result is returned.
3648 Note that the operands will never have enumeral types
3649 because either they have just had the default conversions performed
3650 or they have both just been converted to some other type in which
3651 the arithmetic is to be done.
3653 C++: must do special pointer arithmetic when implementing
3654 multiple inheritance, and deal with pointer to member functions. */
3657 cp_build_binary_op (location_t location
,
3658 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3659 tsubst_flags_t complain
)
3662 enum tree_code code0
, code1
;
3664 const char *invalid_op_diag
;
3666 /* Expression code to give to the expression when it is built.
3667 Normally this is CODE, which is what the caller asked for,
3668 but in some special cases we change it. */
3669 enum tree_code resultcode
= code
;
3671 /* Data type in which the computation is to be performed.
3672 In the simplest cases this is the common type of the arguments. */
3673 tree result_type
= NULL
;
3675 /* Nonzero means operands have already been type-converted
3676 in whatever way is necessary.
3677 Zero means they need to be converted to RESULT_TYPE. */
3680 /* Nonzero means create the expression with this type, rather than
3682 tree build_type
= 0;
3684 /* Nonzero means after finally constructing the expression
3685 convert it to this type. */
3686 tree final_type
= 0;
3690 /* Nonzero if this is an operation like MIN or MAX which can
3691 safely be computed in short if both args are promoted shorts.
3692 Also implies COMMON.
3693 -1 indicates a bitwise operation; this makes a difference
3694 in the exact conditions for when it is safe to do the operation
3695 in a narrower mode. */
3698 /* Nonzero if this is a comparison operation;
3699 if both args are promoted shorts, compare the original shorts.
3700 Also implies COMMON. */
3701 int short_compare
= 0;
3703 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3706 /* True if both operands have arithmetic type. */
3707 bool arithmetic_types_p
;
3709 /* Apply default conversions. */
3713 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3714 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3715 || code
== TRUTH_XOR_EXPR
)
3717 if (!really_overloaded_fn (op0
))
3718 op0
= decay_conversion (op0
);
3719 if (!really_overloaded_fn (op1
))
3720 op1
= decay_conversion (op1
);
3724 if (!really_overloaded_fn (op0
))
3725 op0
= default_conversion (op0
);
3726 if (!really_overloaded_fn (op1
))
3727 op1
= default_conversion (op1
);
3730 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3731 STRIP_TYPE_NOPS (op0
);
3732 STRIP_TYPE_NOPS (op1
);
3734 /* DTRT if one side is an overloaded function, but complain about it. */
3735 if (type_unknown_p (op0
))
3737 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3738 if (t
!= error_mark_node
)
3740 if (complain
& tf_error
)
3741 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3746 if (type_unknown_p (op1
))
3748 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3749 if (t
!= error_mark_node
)
3751 if (complain
& tf_error
)
3752 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3758 type0
= TREE_TYPE (op0
);
3759 type1
= TREE_TYPE (op1
);
3761 /* The expression codes of the data types of the arguments tell us
3762 whether the arguments are integers, floating, pointers, etc. */
3763 code0
= TREE_CODE (type0
);
3764 code1
= TREE_CODE (type1
);
3766 /* If an error was already reported for one of the arguments,
3767 avoid reporting another error. */
3768 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3769 return error_mark_node
;
3771 if ((invalid_op_diag
3772 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3774 error (invalid_op_diag
);
3775 return error_mark_node
;
3778 /* Issue warnings about peculiar, but valid, uses of NULL. */
3779 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3780 /* It's reasonable to use pointer values as operands of &&
3781 and ||, so NULL is no exception. */
3782 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3783 && ( /* Both are NULL (or 0) and the operation was not a
3784 comparison or a pointer subtraction. */
3785 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3786 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
3787 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3788 || (!null_ptr_cst_p (orig_op0
)
3789 && !TYPE_PTR_P (type0
) && !TYPE_PTR_TO_MEMBER_P (type0
))
3790 || (!null_ptr_cst_p (orig_op1
)
3791 && !TYPE_PTR_P (type1
) && !TYPE_PTR_TO_MEMBER_P (type1
)))
3792 && (complain
& tf_warning
))
3793 /* Some sort of arithmetic operation involving NULL was
3795 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3800 /* Subtraction of two similar pointers.
3801 We must subtract them as integers, then divide by object size. */
3802 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3803 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3805 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3806 /* In all other cases except pointer - int, the usual arithmetic
3808 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3813 /* The pointer - int case is just like pointer + int; fall
3816 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3817 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3821 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3822 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3823 if (processing_template_decl
)
3825 result_type
= TREE_TYPE (ptr_operand
);
3828 return cp_pointer_int_sum (code
,
3839 case TRUNC_DIV_EXPR
:
3841 case FLOOR_DIV_EXPR
:
3842 case ROUND_DIV_EXPR
:
3843 case EXACT_DIV_EXPR
:
3844 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3845 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3846 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3847 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3849 enum tree_code tcode0
= code0
, tcode1
= code1
;
3851 warn_for_div_by_zero (location
, op1
);
3853 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3854 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3855 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3856 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3858 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3859 resultcode
= RDIV_EXPR
;
3861 /* When dividing two signed integers, we have to promote to int.
3862 unless we divide by a constant != -1. Note that default
3863 conversion will have been performed on the operands at this
3864 point, so we have to dig out the original type to find out if
3866 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3867 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3868 || (TREE_CODE (op1
) == INTEGER_CST
3869 && ! integer_all_onesp (op1
)));
3878 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3879 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3880 && !VECTOR_FLOAT_TYPE_P (type0
)
3881 && !VECTOR_FLOAT_TYPE_P (type1
)))
3885 case TRUNC_MOD_EXPR
:
3886 case FLOOR_MOD_EXPR
:
3887 warn_for_div_by_zero (location
, op1
);
3889 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3890 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
3891 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
3893 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3895 /* Although it would be tempting to shorten always here, that loses
3896 on some targets, since the modulo instruction is undefined if the
3897 quotient can't be represented in the computation mode. We shorten
3898 only if unsigned or if dividing by something we know != -1. */
3899 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3900 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3901 || (TREE_CODE (op1
) == INTEGER_CST
3902 && ! integer_all_onesp (op1
)));
3907 case TRUTH_ANDIF_EXPR
:
3908 case TRUTH_ORIF_EXPR
:
3909 case TRUTH_AND_EXPR
:
3911 result_type
= boolean_type_node
;
3914 /* Shift operations: result has same type as first operand;
3915 always convert second operand to int.
3916 Also set SHORT_SHIFT if shifting rightward. */
3919 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3921 result_type
= type0
;
3922 if (TREE_CODE (op1
) == INTEGER_CST
)
3924 if (tree_int_cst_lt (op1
, integer_zero_node
))
3926 if ((complain
& tf_warning
)
3927 && c_inhibit_evaluation_warnings
== 0)
3928 warning (0, "right shift count is negative");
3932 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3933 && (complain
& tf_warning
)
3934 && c_inhibit_evaluation_warnings
== 0)
3935 warning (0, "right shift count >= width of type");
3938 /* Convert the shift-count to an integer, regardless of
3939 size of value being shifted. */
3940 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3941 op1
= cp_convert (integer_type_node
, op1
);
3942 /* Avoid converting op1 to result_type later. */
3948 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3950 result_type
= type0
;
3951 if (TREE_CODE (op1
) == INTEGER_CST
)
3953 if (tree_int_cst_lt (op1
, integer_zero_node
))
3955 if ((complain
& tf_warning
)
3956 && c_inhibit_evaluation_warnings
== 0)
3957 warning (0, "left shift count is negative");
3959 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3961 if ((complain
& tf_warning
)
3962 && c_inhibit_evaluation_warnings
== 0)
3963 warning (0, "left shift count >= width of type");
3966 /* Convert the shift-count to an integer, regardless of
3967 size of value being shifted. */
3968 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3969 op1
= cp_convert (integer_type_node
, op1
);
3970 /* Avoid converting op1 to result_type later. */
3977 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3979 result_type
= type0
;
3980 if (TREE_CODE (op1
) == INTEGER_CST
)
3982 if (tree_int_cst_lt (op1
, integer_zero_node
))
3984 if (complain
& tf_warning
)
3985 warning (0, (code
== LROTATE_EXPR
)
3986 ? G_("left rotate count is negative")
3987 : G_("right rotate count is negative"));
3989 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3991 if (complain
& tf_warning
)
3992 warning (0, (code
== LROTATE_EXPR
)
3993 ? G_("left rotate count >= width of type")
3994 : G_("right rotate count >= width of type"));
3997 /* Convert the shift-count to an integer, regardless of
3998 size of value being shifted. */
3999 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
4000 op1
= cp_convert (integer_type_node
, op1
);
4006 if ((complain
& tf_warning
)
4007 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
4008 warning (OPT_Wfloat_equal
,
4009 "comparing floating point with == or != is unsafe");
4010 if ((complain
& tf_warning
)
4011 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
4012 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
4013 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4015 build_type
= boolean_type_node
;
4016 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4017 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
4018 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4019 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
4021 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4022 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
4023 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4024 CPO_COMPARISON
, complain
);
4025 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
4026 && null_ptr_cst_p (op1
))
4028 if (TREE_CODE (op0
) == ADDR_EXPR
4029 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
4031 if (complain
& tf_warning
)
4032 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4033 TREE_OPERAND (op0
, 0));
4035 result_type
= type0
;
4037 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
4038 && null_ptr_cst_p (op0
))
4040 if (TREE_CODE (op1
) == ADDR_EXPR
4041 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
4043 if (complain
& tf_warning
)
4044 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4045 TREE_OPERAND (op1
, 0));
4047 result_type
= type1
;
4049 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4050 /* One of the operands must be of nullptr_t type. */
4051 result_type
= TREE_TYPE (nullptr_node
);
4052 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4054 result_type
= type0
;
4055 if (complain
& tf_error
)
4056 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4058 return error_mark_node
;
4060 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4062 result_type
= type1
;
4063 if (complain
& tf_error
)
4064 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4066 return error_mark_node
;
4068 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
4070 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4071 == ptrmemfunc_vbit_in_delta
)
4073 tree pfn0
= pfn_from_ptrmemfunc (op0
);
4074 tree delta0
= delta_from_ptrmemfunc (op0
);
4075 tree e1
= cp_build_binary_op (location
,
4078 fold_convert (TREE_TYPE (pfn0
),
4081 tree e2
= cp_build_binary_op (location
,
4086 e2
= cp_build_binary_op (location
,
4087 EQ_EXPR
, e2
, integer_zero_node
,
4089 op0
= cp_build_binary_op (location
,
4090 TRUTH_ANDIF_EXPR
, e1
, e2
,
4092 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
4096 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4097 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
4099 result_type
= TREE_TYPE (op0
);
4101 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4102 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4103 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4106 /* E will be the final comparison. */
4108 /* E1 and E2 are for scratch. */
4116 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4117 CPO_COMPARISON
, complain
);
4119 if (!same_type_p (TREE_TYPE (op0
), type
))
4120 op0
= cp_convert_and_check (type
, op0
);
4121 if (!same_type_p (TREE_TYPE (op1
), type
))
4122 op1
= cp_convert_and_check (type
, op1
);
4124 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4125 return error_mark_node
;
4127 if (TREE_SIDE_EFFECTS (op0
))
4128 op0
= save_expr (op0
);
4129 if (TREE_SIDE_EFFECTS (op1
))
4130 op1
= save_expr (op1
);
4132 pfn0
= pfn_from_ptrmemfunc (op0
);
4133 pfn1
= pfn_from_ptrmemfunc (op1
);
4134 delta0
= delta_from_ptrmemfunc (op0
);
4135 delta1
= delta_from_ptrmemfunc (op1
);
4136 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4137 == ptrmemfunc_vbit_in_delta
)
4142 && ((op0.delta == op1.delta)
4143 || (!op0.pfn && op0.delta & 1 == 0
4144 && op1.delta & 1 == 0))
4146 The reason for the `!op0.pfn' bit is that a NULL
4147 pointer-to-member is any member with a zero PFN and
4148 LSB of the DELTA field is 0. */
4150 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4154 e1
= cp_build_binary_op (location
,
4155 EQ_EXPR
, e1
, integer_zero_node
,
4157 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4161 e2
= cp_build_binary_op (location
,
4162 EQ_EXPR
, e2
, integer_zero_node
,
4164 e1
= cp_build_binary_op (location
,
4165 TRUTH_ANDIF_EXPR
, e2
, e1
,
4167 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4169 fold_convert (TREE_TYPE (pfn0
),
4172 e2
= cp_build_binary_op (location
,
4173 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4174 e1
= cp_build_binary_op (location
,
4175 EQ_EXPR
, delta0
, delta1
, complain
);
4176 e1
= cp_build_binary_op (location
,
4177 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4184 && (!op0.pfn || op0.delta == op1.delta))
4186 The reason for the `!op0.pfn' bit is that a NULL
4187 pointer-to-member is any member with a zero PFN; the
4188 DELTA field is unspecified. */
4190 e1
= cp_build_binary_op (location
,
4191 EQ_EXPR
, delta0
, delta1
, complain
);
4192 e2
= cp_build_binary_op (location
,
4195 fold_convert (TREE_TYPE (pfn0
),
4198 e1
= cp_build_binary_op (location
,
4199 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4201 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4202 e
= cp_build_binary_op (location
,
4203 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4204 if (code
== EQ_EXPR
)
4206 return cp_build_binary_op (location
,
4207 EQ_EXPR
, e
, integer_zero_node
, complain
);
4211 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4212 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4214 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4215 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4223 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4224 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4226 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4227 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4228 CPO_COMPARISON
, complain
);
4235 if (TREE_CODE (orig_op0
) == STRING_CST
4236 || TREE_CODE (orig_op1
) == STRING_CST
)
4238 if (complain
& tf_warning
)
4239 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4242 build_type
= boolean_type_node
;
4243 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4244 || code0
== ENUMERAL_TYPE
)
4245 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4246 || code1
== ENUMERAL_TYPE
))
4248 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4249 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4250 CPO_COMPARISON
, complain
);
4251 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4252 result_type
= type0
;
4253 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4254 result_type
= type1
;
4255 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4256 /* One of the operands must be of nullptr_t type. */
4257 result_type
= TREE_TYPE (nullptr_node
);
4258 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4260 result_type
= type0
;
4261 if (complain
& tf_error
)
4262 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4264 return error_mark_node
;
4266 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4268 result_type
= type1
;
4269 if (complain
& tf_error
)
4270 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4272 return error_mark_node
;
4276 case UNORDERED_EXPR
:
4283 build_type
= integer_type_node
;
4284 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4286 if (complain
& tf_error
)
4287 error ("unordered comparison on non-floating point argument");
4288 return error_mark_node
;
4297 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4298 || code0
== ENUMERAL_TYPE
)
4299 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4300 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4301 arithmetic_types_p
= 1;
4304 arithmetic_types_p
= 0;
4305 /* Vector arithmetic is only allowed when both sides are vectors. */
4306 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4308 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4309 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4312 binary_op_error (location
, code
, type0
, type1
);
4313 return error_mark_node
;
4315 arithmetic_types_p
= 1;
4318 /* Determine the RESULT_TYPE, if it is not already known. */
4320 && arithmetic_types_p
4321 && (shorten
|| common
|| short_compare
))
4322 result_type
= cp_common_type (type0
, type1
);
4326 if (complain
& tf_error
)
4327 error ("invalid operands of types %qT and %qT to binary %qO",
4328 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4329 return error_mark_node
;
4332 /* If we're in a template, the only thing we need to know is the
4334 if (processing_template_decl
)
4336 /* Since the middle-end checks the type when doing a build2, we
4337 need to build the tree in pieces. This built tree will never
4338 get out of the front-end as we replace it when instantiating
4340 tree tmp
= build2 (resultcode
,
4341 build_type
? build_type
: result_type
,
4343 TREE_OPERAND (tmp
, 0) = op0
;
4347 if (arithmetic_types_p
)
4349 bool first_complex
= (code0
== COMPLEX_TYPE
);
4350 bool second_complex
= (code1
== COMPLEX_TYPE
);
4351 int none_complex
= (!first_complex
&& !second_complex
);
4353 /* Adapted from patch for c/24581. */
4354 if (first_complex
!= second_complex
4355 && (code
== PLUS_EXPR
4356 || code
== MINUS_EXPR
4357 || code
== MULT_EXPR
4358 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4359 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4360 && flag_signed_zeros
)
4362 /* An operation on mixed real/complex operands must be
4363 handled specially, but the language-independent code can
4364 more easily optimize the plain complex arithmetic if
4365 -fno-signed-zeros. */
4366 tree real_type
= TREE_TYPE (result_type
);
4370 if (TREE_TYPE (op0
) != result_type
)
4371 op0
= cp_convert_and_check (result_type
, op0
);
4372 if (TREE_TYPE (op1
) != real_type
)
4373 op1
= cp_convert_and_check (real_type
, op1
);
4377 if (TREE_TYPE (op0
) != real_type
)
4378 op0
= cp_convert_and_check (real_type
, op0
);
4379 if (TREE_TYPE (op1
) != result_type
)
4380 op1
= cp_convert_and_check (result_type
, op1
);
4382 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4383 return error_mark_node
;
4386 op0
= save_expr (op0
);
4387 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4388 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4392 case TRUNC_DIV_EXPR
:
4393 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4397 real
= build2 (resultcode
, real_type
, real
, op1
);
4405 op1
= save_expr (op1
);
4406 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4407 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4411 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4414 real
= build2 (resultcode
, real_type
, op0
, real
);
4417 real
= build2 (resultcode
, real_type
, op0
, real
);
4418 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4424 return build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4427 /* For certain operations (which identify themselves by shorten != 0)
4428 if both args were extended from the same smaller type,
4429 do the arithmetic in that type and then extend.
4431 shorten !=0 and !=1 indicates a bitwise operation.
4432 For them, this optimization is safe only if
4433 both args are zero-extended or both are sign-extended.
4434 Otherwise, we might change the result.
4435 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4436 but calculated in (unsigned short) it would be (unsigned short)-1. */
4438 if (shorten
&& none_complex
)
4440 final_type
= result_type
;
4441 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4445 /* Comparison operations are shortened too but differently.
4446 They identify themselves by setting short_compare = 1. */
4450 /* Don't write &op0, etc., because that would prevent op0
4451 from being kept in a register.
4452 Instead, make copies of the our local variables and
4453 pass the copies by reference, then copy them back afterward. */
4454 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4455 enum tree_code xresultcode
= resultcode
;
4457 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4459 return cp_convert (boolean_type_node
, val
);
4460 op0
= xop0
, op1
= xop1
;
4462 resultcode
= xresultcode
;
4465 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4466 && warn_sign_compare
4467 && !TREE_NO_WARNING (orig_op0
)
4468 && !TREE_NO_WARNING (orig_op1
)
4469 /* Do not warn until the template is instantiated; we cannot
4470 bound the ranges of the arguments until that point. */
4471 && !processing_template_decl
4472 && (complain
& tf_warning
)
4473 && c_inhibit_evaluation_warnings
== 0)
4475 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4476 result_type
, resultcode
);
4480 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4481 Then the expression will be built.
4482 It will be given type FINAL_TYPE if that is nonzero;
4483 otherwise, it will be given type RESULT_TYPE. */
4486 if (TREE_TYPE (op0
) != result_type
)
4487 op0
= cp_convert_and_check (result_type
, op0
);
4488 if (TREE_TYPE (op1
) != result_type
)
4489 op1
= cp_convert_and_check (result_type
, op1
);
4491 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4492 return error_mark_node
;
4495 if (build_type
== NULL_TREE
)
4496 build_type
= result_type
;
4498 result
= build2 (resultcode
, build_type
, op0
, op1
);
4499 result
= fold_if_not_in_template (result
);
4500 if (final_type
!= 0)
4501 result
= cp_convert (final_type
, result
);
4503 if (TREE_OVERFLOW_P (result
)
4504 && !TREE_OVERFLOW_P (op0
)
4505 && !TREE_OVERFLOW_P (op1
))
4506 overflow_warning (location
, result
);
4511 /* Return a tree for the sum or difference (RESULTCODE says which)
4512 of pointer PTROP and integer INTOP. */
4515 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4517 tree res_type
= TREE_TYPE (ptrop
);
4519 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4520 in certain circumstance (when it's valid to do so). So we need
4521 to make sure it's complete. We don't need to check here, if we
4522 can actually complete it at all, as those checks will be done in
4523 pointer_int_sum() anyway. */
4524 complete_type (TREE_TYPE (res_type
));
4526 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4527 fold_if_not_in_template (intop
));
4530 /* Return a tree for the difference of pointers OP0 and OP1.
4531 The resulting tree has type int. */
4534 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4537 tree restype
= ptrdiff_type_node
;
4538 tree target_type
= TREE_TYPE (ptrtype
);
4540 if (!complete_type_or_else (target_type
, NULL_TREE
))
4541 return error_mark_node
;
4543 if (TREE_CODE (target_type
) == VOID_TYPE
)
4544 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4545 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4546 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4547 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4548 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4550 /* First do the subtraction as integers;
4551 then drop through to build the divide operator. */
4553 op0
= cp_build_binary_op (input_location
,
4555 cp_convert (restype
, op0
),
4556 cp_convert (restype
, op1
),
4557 tf_warning_or_error
);
4559 /* This generates an error if op1 is a pointer to an incomplete type. */
4560 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4561 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4563 op1
= (TYPE_PTROB_P (ptrtype
)
4564 ? size_in_bytes (target_type
)
4565 : integer_one_node
);
4567 /* Do the division. */
4569 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4570 return fold_if_not_in_template (result
);
4573 /* Construct and perhaps optimize a tree representation
4574 for a unary operation. CODE, a tree_code, specifies the operation
4575 and XARG is the operand. */
4578 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4580 tree orig_expr
= xarg
;
4584 if (processing_template_decl
)
4586 if (type_dependent_expression_p (xarg
))
4587 return build_min_nt (code
, xarg
, NULL_TREE
);
4589 xarg
= build_non_dependent_expr (xarg
);
4594 /* [expr.unary.op] says:
4596 The address of an object of incomplete type can be taken.
4598 (And is just the ordinary address operator, not an overloaded
4599 "operator &".) However, if the type is a template
4600 specialization, we must complete the type at this point so that
4601 an overloaded "operator &" will be available if required. */
4602 if (code
== ADDR_EXPR
4603 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4604 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4605 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4606 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4607 /* Don't look for a function. */;
4609 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4610 /*overloaded_p=*/NULL
, complain
);
4611 if (!exp
&& code
== ADDR_EXPR
)
4613 if (is_overloaded_fn (xarg
))
4615 tree fn
= get_first_fn (xarg
);
4616 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4618 error (DECL_CONSTRUCTOR_P (fn
)
4619 ? G_("taking address of constructor %qE")
4620 : G_("taking address of destructor %qE"),
4622 return error_mark_node
;
4626 /* A pointer to member-function can be formed only by saying
4628 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4629 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4631 if (TREE_CODE (xarg
) != OFFSET_REF
4632 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4634 error ("invalid use of %qE to form a pointer-to-member-function",
4636 if (TREE_CODE (xarg
) != OFFSET_REF
)
4637 inform (input_location
, " a qualified-id is required");
4638 return error_mark_node
;
4642 error ("parentheses around %qE cannot be used to form a"
4643 " pointer-to-member-function",
4645 PTRMEM_OK_P (xarg
) = 1;
4649 if (TREE_CODE (xarg
) == OFFSET_REF
)
4651 ptrmem
= PTRMEM_OK_P (xarg
);
4653 if (!ptrmem
&& !flag_ms_extensions
4654 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4656 /* A single non-static member, make sure we don't allow a
4657 pointer-to-member. */
4658 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4659 TREE_OPERAND (xarg
, 0),
4660 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4661 PTRMEM_OK_P (xarg
) = ptrmem
;
4664 else if (TREE_CODE (xarg
) == TARGET_EXPR
&& (complain
& tf_warning
))
4665 warning (0, "taking address of temporary");
4666 exp
= cp_build_unary_op (ADDR_EXPR
, xarg
, 0, complain
);
4669 if (processing_template_decl
&& exp
!= error_mark_node
)
4670 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4671 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4672 if (TREE_CODE (exp
) == ADDR_EXPR
)
4673 PTRMEM_OK_P (exp
) = ptrmem
;
4677 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4678 constants, where a null value is represented by an INTEGER_CST of
4682 cp_truthvalue_conversion (tree expr
)
4684 tree type
= TREE_TYPE (expr
);
4685 if (TYPE_PTRMEM_P (type
))
4686 return build_binary_op (EXPR_LOCATION (expr
),
4687 NE_EXPR
, expr
, integer_zero_node
, 1);
4689 return c_common_truthvalue_conversion (input_location
, expr
);
4692 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4695 condition_conversion (tree expr
)
4698 if (processing_template_decl
)
4700 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4701 tf_warning_or_error
, LOOKUP_NORMAL
);
4702 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4706 /* Returns the address of T. This function will fold away
4707 ADDR_EXPR of INDIRECT_REF. */
4710 build_address (tree t
)
4712 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4713 return error_mark_node
;
4714 t
= build_fold_addr_expr (t
);
4715 if (TREE_CODE (t
) != ADDR_EXPR
)
4720 /* Returns the address of T with type TYPE. */
4723 build_typed_address (tree t
, tree type
)
4725 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4726 return error_mark_node
;
4727 t
= build_fold_addr_expr_with_type (t
, type
);
4728 if (TREE_CODE (t
) != ADDR_EXPR
)
4733 /* Return a NOP_EXPR converting EXPR to TYPE. */
4736 build_nop (tree type
, tree expr
)
4738 if (type
== error_mark_node
|| error_operand_p (expr
))
4740 return build1 (NOP_EXPR
, type
, expr
);
4743 /* C++: Must handle pointers to members.
4745 Perhaps type instantiation should be extended to handle conversion
4746 from aggregates to types we don't yet know we want? (Or are those
4747 cases typically errors which should be reported?)
4749 NOCONVERT nonzero suppresses the default promotions
4750 (such as from short to int). */
4753 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
4754 tsubst_flags_t complain
)
4756 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4759 const char *errstring
= NULL
;
4761 const char *invalid_op_diag
;
4763 if (error_operand_p (arg
))
4764 return error_mark_node
;
4766 if ((invalid_op_diag
4767 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
4772 error (invalid_op_diag
);
4773 return error_mark_node
;
4778 case UNARY_PLUS_EXPR
:
4781 int flags
= WANT_ARITH
| WANT_ENUM
;
4782 /* Unary plus (but not unary minus) is allowed on pointers. */
4783 if (code
== UNARY_PLUS_EXPR
)
4784 flags
|= WANT_POINTER
;
4785 arg
= build_expr_type_conversion (flags
, arg
, true);
4787 errstring
= (code
== NEGATE_EXPR
4788 ? _("wrong type argument to unary minus")
4789 : _("wrong type argument to unary plus"));
4792 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4793 arg
= perform_integral_promotions (arg
);
4795 /* Make sure the result is not an lvalue: a unary plus or minus
4796 expression is always a rvalue. */
4803 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4807 arg
= default_conversion (arg
);
4809 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
4810 | WANT_VECTOR_OR_COMPLEX
,
4812 errstring
= _("wrong type argument to bit-complement");
4813 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4814 arg
= perform_integral_promotions (arg
);
4818 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4819 errstring
= _("wrong type argument to abs");
4820 else if (!noconvert
)
4821 arg
= default_conversion (arg
);
4825 /* Conjugating a real value is a no-op, but allow it anyway. */
4826 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4827 errstring
= _("wrong type argument to conjugation");
4828 else if (!noconvert
)
4829 arg
= default_conversion (arg
);
4832 case TRUTH_NOT_EXPR
:
4833 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
4835 val
= invert_truthvalue_loc (input_location
, arg
);
4836 if (arg
!= error_mark_node
)
4838 errstring
= _("in argument to unary !");
4845 if (TREE_CODE (arg
) == COMPLEX_CST
)
4846 return TREE_REALPART (arg
);
4847 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4849 arg
= build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4850 return fold_if_not_in_template (arg
);
4856 if (TREE_CODE (arg
) == COMPLEX_CST
)
4857 return TREE_IMAGPART (arg
);
4858 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4860 arg
= build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4861 return fold_if_not_in_template (arg
);
4864 return cp_convert (TREE_TYPE (arg
), integer_zero_node
);
4866 case PREINCREMENT_EXPR
:
4867 case POSTINCREMENT_EXPR
:
4868 case PREDECREMENT_EXPR
:
4869 case POSTDECREMENT_EXPR
:
4870 /* Handle complex lvalues (when permitted)
4871 by reduction to simpler cases. */
4873 val
= unary_complex_lvalue (code
, arg
);
4877 arg
= mark_lvalue_use (arg
);
4879 /* Increment or decrement the real part of the value,
4880 and don't change the imaginary part. */
4881 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4885 arg
= stabilize_reference (arg
);
4886 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
4887 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
4888 real
= cp_build_unary_op (code
, real
, 1, complain
);
4889 if (real
== error_mark_node
|| imag
== error_mark_node
)
4890 return error_mark_node
;
4891 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
4895 /* Report invalid types. */
4897 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
4900 if (code
== PREINCREMENT_EXPR
)
4901 errstring
= _("no pre-increment operator for type");
4902 else if (code
== POSTINCREMENT_EXPR
)
4903 errstring
= _("no post-increment operator for type");
4904 else if (code
== PREDECREMENT_EXPR
)
4905 errstring
= _("no pre-decrement operator for type");
4907 errstring
= _("no post-decrement operator for type");
4910 else if (arg
== error_mark_node
)
4911 return error_mark_node
;
4913 /* Report something read-only. */
4915 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
4916 || TREE_READONLY (arg
))
4918 if (complain
& tf_error
)
4919 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
4920 || code
== POSTINCREMENT_EXPR
)
4921 ? REK_INCREMENT
: REK_DECREMENT
));
4923 return error_mark_node
;
4928 tree declared_type
= unlowered_expr_type (arg
);
4930 argtype
= TREE_TYPE (arg
);
4932 /* ARM $5.2.5 last annotation says this should be forbidden. */
4933 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
4935 if (complain
& tf_error
)
4936 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
4937 ? G_("ISO C++ forbids incrementing an enum")
4938 : G_("ISO C++ forbids decrementing an enum"));
4940 return error_mark_node
;
4943 /* Compute the increment. */
4945 if (TREE_CODE (argtype
) == POINTER_TYPE
)
4947 tree type
= complete_type (TREE_TYPE (argtype
));
4949 if (!COMPLETE_OR_VOID_TYPE_P (type
))
4951 if (complain
& tf_error
)
4952 error (((code
== PREINCREMENT_EXPR
4953 || code
== POSTINCREMENT_EXPR
))
4954 ? G_("cannot increment a pointer to incomplete type %qT")
4955 : G_("cannot decrement a pointer to incomplete type %qT"),
4956 TREE_TYPE (argtype
));
4958 return error_mark_node
;
4960 else if ((pedantic
|| warn_pointer_arith
)
4961 && !TYPE_PTROB_P (argtype
))
4963 if (complain
& tf_error
)
4964 permerror (input_location
, (code
== PREINCREMENT_EXPR
4965 || code
== POSTINCREMENT_EXPR
)
4966 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
4967 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
4970 return error_mark_node
;
4973 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
4976 inc
= integer_one_node
;
4978 inc
= cp_convert (argtype
, inc
);
4980 /* Complain about anything else that is not a true lvalue. */
4981 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
4982 || code
== POSTINCREMENT_EXPR
)
4983 ? lv_increment
: lv_decrement
),
4985 return error_mark_node
;
4987 /* Forbid using -- on `bool'. */
4988 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
4990 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
4992 if (complain
& tf_error
)
4993 error ("invalid use of Boolean expression as operand "
4994 "to %<operator--%>");
4995 return error_mark_node
;
4997 val
= boolean_increment (code
, arg
);
5000 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
5002 TREE_SIDE_EFFECTS (val
) = 1;
5007 /* Note that this operation never does default_conversion
5008 regardless of NOCONVERT. */
5010 argtype
= lvalue_type (arg
);
5012 arg
= mark_lvalue_use (arg
);
5014 if (TREE_CODE (arg
) == OFFSET_REF
)
5017 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
5019 tree type
= build_pointer_type (TREE_TYPE (argtype
));
5020 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5023 else if (pedantic
&& DECL_MAIN_P (arg
))
5026 /* Apparently a lot of autoconf scripts for C++ packages do this,
5027 so only complain if -pedantic. */
5028 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
5029 pedwarn (input_location
, OPT_pedantic
,
5030 "ISO C++ forbids taking address of function %<::main%>");
5031 else if (flag_pedantic_errors
)
5032 return error_mark_node
;
5035 /* Let &* cancel out to simplify resulting code. */
5036 if (TREE_CODE (arg
) == INDIRECT_REF
)
5038 /* We don't need to have `current_class_ptr' wrapped in a
5039 NON_LVALUE_EXPR node. */
5040 if (arg
== current_class_ref
)
5041 return current_class_ptr
;
5043 arg
= TREE_OPERAND (arg
, 0);
5044 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
5046 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
5047 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5050 /* Don't let this be an lvalue. */
5055 /* ??? Cope with user tricks that amount to offsetof. */
5056 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5057 && TREE_CODE (argtype
) != METHOD_TYPE
5058 && argtype
!= unknown_type_node
5059 && (val
= get_base_address (arg
))
5060 && TREE_CODE (val
) == INDIRECT_REF
5061 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
5063 tree type
= build_pointer_type (argtype
);
5064 tree op0
= fold_convert (type
, TREE_OPERAND (val
, 0));
5065 tree op1
= fold_convert (sizetype
, fold_offsetof (arg
, val
));
5066 return fold_build2 (POINTER_PLUS_EXPR
, type
, op0
, op1
);
5069 /* Uninstantiated types are all functions. Taking the
5070 address of a function is a no-op, so just return the
5073 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
5074 || !IDENTIFIER_OPNAME_P (arg
));
5076 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
5077 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
5079 /* They're trying to take the address of a unique non-static
5080 member function. This is ill-formed (except in MS-land),
5081 but let's try to DTRT.
5082 Note: We only handle unique functions here because we don't
5083 want to complain if there's a static overload; non-unique
5084 cases will be handled by instantiate_type. But we need to
5085 handle this case here to allow casts on the resulting PMF.
5086 We could defer this in non-MS mode, but it's easier to give
5087 a useful error here. */
5089 /* Inside constant member functions, the `this' pointer
5090 contains an extra const qualifier. TYPE_MAIN_VARIANT
5091 is used here to remove this const from the diagnostics
5092 and the created OFFSET_REF. */
5093 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
5094 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
5097 if (! flag_ms_extensions
)
5099 tree name
= DECL_NAME (fn
);
5100 if (!(complain
& tf_error
))
5101 return error_mark_node
;
5102 else if (current_class_type
5103 && TREE_OPERAND (arg
, 0) == current_class_ref
)
5104 /* An expression like &memfn. */
5105 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
5106 " or parenthesized non-static member function to form"
5107 " a pointer to member function. Say %<&%T::%D%>",
5110 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
5111 " function to form a pointer to member function."
5115 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
5119 if (type_unknown_p (arg
))
5120 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
5122 /* Handle complex lvalues (when permitted)
5123 by reduction to simpler cases. */
5124 val
= unary_complex_lvalue (code
, arg
);
5128 switch (TREE_CODE (arg
))
5132 case FIX_TRUNC_EXPR
:
5133 /* Even if we're not being pedantic, we cannot allow this
5134 extension when we're instantiating in a SFINAE
5136 if (! lvalue_p (arg
) && complain
== tf_none
)
5138 if (complain
& tf_error
)
5139 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
5141 return error_mark_node
;
5146 arg
= BASELINK_FUNCTIONS (arg
);
5150 arg
= OVL_CURRENT (arg
);
5154 /* Turn a reference to a non-static data member into a
5155 pointer-to-member. */
5160 if (!PTRMEM_OK_P (arg
))
5161 return cp_build_unary_op (code
, arg
, 0, complain
);
5163 t
= TREE_OPERAND (arg
, 1);
5164 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
5166 if (complain
& tf_error
)
5167 error ("cannot create pointer to reference member %qD", t
);
5168 return error_mark_node
;
5171 type
= build_ptrmem_type (context_for_name_lookup (t
),
5173 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
5181 /* Anything not already handled and not a true memory reference
5183 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5184 && TREE_CODE (argtype
) != METHOD_TYPE
5185 && TREE_CODE (arg
) != OFFSET_REF
5186 && !lvalue_or_else (arg
, lv_addressof
, complain
))
5187 return error_mark_node
;
5189 if (argtype
!= error_mark_node
)
5190 argtype
= build_pointer_type (argtype
);
5192 /* In a template, we are processing a non-dependent expression
5193 so we can just form an ADDR_EXPR with the correct type. */
5194 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
5196 val
= build_address (arg
);
5197 if (TREE_CODE (arg
) == OFFSET_REF
)
5198 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
5200 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
5202 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
5204 /* We can only get here with a single static member
5206 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
5207 && DECL_STATIC_FUNCTION_P (fn
));
5209 val
= build_address (fn
);
5210 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
5211 /* Do not lose object's side effects. */
5212 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
5213 TREE_OPERAND (arg
, 0), val
);
5215 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
5217 if (complain
& tf_error
)
5218 error ("attempt to take address of bit-field structure member %qD",
5219 TREE_OPERAND (arg
, 1));
5220 return error_mark_node
;
5224 tree object
= TREE_OPERAND (arg
, 0);
5225 tree field
= TREE_OPERAND (arg
, 1);
5226 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5227 (TREE_TYPE (object
), decl_type_context (field
)));
5228 val
= build_address (arg
);
5231 if (TREE_CODE (argtype
) == POINTER_TYPE
5232 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
5234 build_ptrmemfunc_type (argtype
);
5235 val
= build_ptrmemfunc (argtype
, val
, 0,
5236 /*c_cast_p=*/false);
5248 argtype
= TREE_TYPE (arg
);
5249 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5252 if (complain
& tf_error
)
5253 error ("%s", errstring
);
5254 return error_mark_node
;
5257 /* Hook for the c-common bits that build a unary op. */
5259 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5260 enum tree_code code
, tree xarg
, int noconvert
)
5262 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5265 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5266 for certain kinds of expressions which are not really lvalues
5267 but which we can accept as lvalues.
5269 If ARG is not a kind of expression we can handle, return
5273 unary_complex_lvalue (enum tree_code code
, tree arg
)
5275 /* Inside a template, making these kinds of adjustments is
5276 pointless; we are only concerned with the type of the
5278 if (processing_template_decl
)
5281 /* Handle (a, b) used as an "lvalue". */
5282 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5284 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5285 tf_warning_or_error
);
5286 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5287 TREE_OPERAND (arg
, 0), real_result
);
5290 /* Handle (a ? b : c) used as an "lvalue". */
5291 if (TREE_CODE (arg
) == COND_EXPR
5292 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5293 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5295 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5296 if (TREE_CODE (arg
) == MODIFY_EXPR
5297 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5298 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5300 tree lvalue
= TREE_OPERAND (arg
, 0);
5301 if (TREE_SIDE_EFFECTS (lvalue
))
5303 lvalue
= stabilize_reference (lvalue
);
5304 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5305 lvalue
, TREE_OPERAND (arg
, 1));
5307 return unary_complex_lvalue
5308 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5311 if (code
!= ADDR_EXPR
)
5314 /* Handle (a = b) used as an "lvalue" for `&'. */
5315 if (TREE_CODE (arg
) == MODIFY_EXPR
5316 || TREE_CODE (arg
) == INIT_EXPR
)
5318 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5319 tf_warning_or_error
);
5320 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5322 TREE_NO_WARNING (arg
) = 1;
5326 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5327 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5328 || TREE_CODE (arg
) == OFFSET_REF
)
5331 /* We permit compiler to make function calls returning
5332 objects of aggregate type look like lvalues. */
5336 if (TREE_CODE (targ
) == SAVE_EXPR
)
5337 targ
= TREE_OPERAND (targ
, 0);
5339 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5341 if (TREE_CODE (arg
) == SAVE_EXPR
)
5344 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
5345 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5348 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5349 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5350 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5353 /* Don't let anything else be handled specially. */
5357 /* Mark EXP saying that we need to be able to take the
5358 address of it; it should not be allocated in a register.
5359 Value is true if successful.
5361 C++: we do not allow `current_class_ptr' to be addressable. */
5364 cxx_mark_addressable (tree exp
)
5369 switch (TREE_CODE (x
))
5376 x
= TREE_OPERAND (x
, 0);
5380 if (x
== current_class_ptr
)
5382 error ("cannot take the address of %<this%>, which is an rvalue expression");
5383 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5389 /* Caller should not be trying to mark initialized
5390 constant fields addressable. */
5391 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5392 || DECL_IN_AGGR_P (x
) == 0
5394 || DECL_EXTERNAL (x
));
5399 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5400 && !DECL_ARTIFICIAL (x
))
5402 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5405 ("address of explicit register variable %qD requested", x
);
5408 else if (extra_warnings
)
5410 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5412 TREE_ADDRESSABLE (x
) = 1;
5416 TREE_ADDRESSABLE (x
) = 1;
5420 TREE_ADDRESSABLE (x
) = 1;
5424 TREE_ADDRESSABLE (x
) = 1;
5425 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5433 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5436 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5437 tsubst_flags_t complain
)
5439 tree orig_ifexp
= ifexp
;
5440 tree orig_op1
= op1
;
5441 tree orig_op2
= op2
;
5444 if (processing_template_decl
)
5446 /* The standard says that the expression is type-dependent if
5447 IFEXP is type-dependent, even though the eventual type of the
5448 expression doesn't dependent on IFEXP. */
5449 if (type_dependent_expression_p (ifexp
)
5450 /* As a GNU extension, the middle operand may be omitted. */
5451 || (op1
&& type_dependent_expression_p (op1
))
5452 || type_dependent_expression_p (op2
))
5453 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5454 ifexp
= build_non_dependent_expr (ifexp
);
5456 op1
= build_non_dependent_expr (op1
);
5457 op2
= build_non_dependent_expr (op2
);
5460 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5461 if (processing_template_decl
&& expr
!= error_mark_node
)
5462 return build_min_non_dep (COND_EXPR
, expr
,
5463 orig_ifexp
, orig_op1
, orig_op2
);
5467 /* Given a list of expressions, return a compound expression
5468 that performs them all and returns the value of the last of them. */
5470 tree
build_x_compound_expr_from_list (tree list
, const char *msg
)
5472 tree expr
= TREE_VALUE (list
);
5474 if (TREE_CHAIN (list
))
5477 permerror (input_location
, "%s expression list treated as compound expression", msg
);
5479 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5480 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5481 tf_warning_or_error
);
5487 /* Like build_x_compound_expr_from_list, but using a VEC. */
5490 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5492 if (VEC_empty (tree
, vec
))
5494 else if (VEC_length (tree
, vec
) == 1)
5495 return VEC_index (tree
, vec
, 0);
5503 permerror (input_location
,
5504 "%s expression list treated as compound expression",
5507 expr
= VEC_index (tree
, vec
, 0);
5508 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5509 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5515 /* Handle overloading of the ',' operator when needed. */
5518 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5521 tree orig_op1
= op1
;
5522 tree orig_op2
= op2
;
5524 if (processing_template_decl
)
5526 if (type_dependent_expression_p (op1
)
5527 || type_dependent_expression_p (op2
))
5528 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5529 op1
= build_non_dependent_expr (op1
);
5530 op2
= build_non_dependent_expr (op2
);
5533 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5534 /*overloaded_p=*/NULL
, complain
);
5536 result
= cp_build_compound_expr (op1
, op2
, complain
);
5538 if (processing_template_decl
&& result
!= error_mark_node
)
5539 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5544 /* Like cp_build_compound_expr, but for the c-common bits. */
5547 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5549 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5552 /* Build a compound expression. */
5555 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5557 lhs
= convert_to_void (lhs
, "left-hand operand of comma", complain
);
5559 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5560 return error_mark_node
;
5562 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5564 /* If the rhs is a TARGET_EXPR, then build the compound
5565 expression inside the target_expr's initializer. This
5566 helps the compiler to eliminate unnecessary temporaries. */
5567 tree init
= TREE_OPERAND (rhs
, 1);
5569 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5570 TREE_OPERAND (rhs
, 1) = init
;
5575 if (type_unknown_p (rhs
))
5577 error ("no context to resolve type of %qE", rhs
);
5578 return error_mark_node
;
5581 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5584 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5585 casts away constness. CAST gives the type of cast.
5587 ??? This function warns for casting away any qualifier not just
5588 const. We would like to specify exactly what qualifiers are casted
5593 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5594 enum tree_code cast
)
5596 /* C-style casts are allowed to cast away constness. With
5597 WARN_CAST_QUAL, we still want to issue a warning. */
5598 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5601 if (!casts_away_constness (src_type
, dest_type
))
5607 warning (OPT_Wcast_qual
,
5608 "cast from type %qT to type %qT casts away qualifiers",
5609 src_type
, dest_type
);
5612 case STATIC_CAST_EXPR
:
5613 error ("static_cast from type %qT to type %qT casts away qualifiers",
5614 src_type
, dest_type
);
5617 case REINTERPRET_CAST_EXPR
:
5618 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5619 src_type
, dest_type
);
5626 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5627 (another pointer-to-member type in the same hierarchy) and return
5628 the converted expression. If ALLOW_INVERSE_P is permitted, a
5629 pointer-to-derived may be converted to pointer-to-base; otherwise,
5630 only the other direction is permitted. If C_CAST_P is true, this
5631 conversion is taking place as part of a C-style cast. */
5634 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5637 if (TYPE_PTRMEM_P (type
))
5641 if (TREE_CODE (expr
) == PTRMEM_CST
)
5642 expr
= cplus_expand_constant (expr
);
5643 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5644 TYPE_PTRMEM_CLASS_TYPE (type
),
5647 if (!integer_zerop (delta
))
5649 tree cond
, op1
, op2
;
5651 cond
= cp_build_binary_op (input_location
,
5654 build_int_cst (TREE_TYPE (expr
), -1),
5655 tf_warning_or_error
);
5656 op1
= build_nop (ptrdiff_type_node
, expr
);
5657 op2
= cp_build_binary_op (input_location
,
5658 PLUS_EXPR
, op1
, delta
,
5659 tf_warning_or_error
);
5661 expr
= fold_build3_loc (input_location
,
5662 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5666 return build_nop (type
, expr
);
5669 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5670 allow_inverse_p
, c_cast_p
);
5673 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
5674 a version of EXPR that has TREE_OVERFLOW set if it is set in ORIG.
5675 Otherwise, return EXPR unchanged. */
5678 ignore_overflows (tree expr
, tree orig
)
5680 if (TREE_CODE (expr
) == INTEGER_CST
5681 && CONSTANT_CLASS_P (orig
)
5682 && TREE_CODE (orig
) != STRING_CST
5683 && TREE_OVERFLOW (expr
) != TREE_OVERFLOW (orig
))
5685 if (!TREE_OVERFLOW (orig
))
5686 /* Ensure constant sharing. */
5687 expr
= build_int_cst_wide (TREE_TYPE (expr
),
5688 TREE_INT_CST_LOW (expr
),
5689 TREE_INT_CST_HIGH (expr
));
5692 /* Avoid clobbering a shared constant. */
5693 expr
= copy_node (expr
);
5694 TREE_OVERFLOW (expr
) = TREE_OVERFLOW (orig
);
5700 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5701 this static_cast is being attempted as one of the possible casts
5702 allowed by a C-style cast. (In that case, accessibility of base
5703 classes is not considered, and it is OK to cast away
5704 constness.) Return the result of the cast. *VALID_P is set to
5705 indicate whether or not the cast was valid. */
5708 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5709 bool *valid_p
, tsubst_flags_t complain
)
5715 /* Assume the cast is valid. */
5718 intype
= TREE_TYPE (expr
);
5720 /* Save casted types in the function's used types hash table. */
5721 used_types_insert (type
);
5723 /* [expr.static.cast]
5725 An lvalue of type "cv1 B", where B is a class type, can be cast
5726 to type "reference to cv2 D", where D is a class derived (clause
5727 _class.derived_) from B, if a valid standard conversion from
5728 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5729 same cv-qualification as, or greater cv-qualification than, cv1,
5730 and B is not a virtual base class of D. */
5731 /* We check this case before checking the validity of "TYPE t =
5732 EXPR;" below because for this case:
5735 struct D : public B { D(const B&); };
5737 void f() { static_cast<const D&>(b); }
5739 we want to avoid constructing a new D. The standard is not
5740 completely clear about this issue, but our interpretation is
5741 consistent with other compilers. */
5742 if (TREE_CODE (type
) == REFERENCE_TYPE
5743 && CLASS_TYPE_P (TREE_TYPE (type
))
5744 && CLASS_TYPE_P (intype
)
5745 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5746 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5747 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5748 build_pointer_type (TYPE_MAIN_VARIANT
5749 (TREE_TYPE (type
))))
5751 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5755 /* There is a standard conversion from "D*" to "B*" even if "B"
5756 is ambiguous or inaccessible. If this is really a
5757 static_cast, then we check both for inaccessibility and
5758 ambiguity. However, if this is a static_cast being performed
5759 because the user wrote a C-style cast, then accessibility is
5761 base
= lookup_base (TREE_TYPE (type
), intype
,
5762 c_cast_p
? ba_unique
: ba_check
,
5765 /* Convert from "B*" to "D*". This function will check that "B"
5766 is not a virtual base of "D". */
5767 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5768 base
, /*nonnull=*/false);
5769 /* Convert the pointer to a reference -- but then remember that
5770 there are no expressions with reference type in C++. */
5771 return convert_from_reference (cp_fold_convert (type
, expr
));
5774 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5775 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5776 if (TREE_CODE (type
) == REFERENCE_TYPE
5777 && TYPE_REF_IS_RVALUE (type
)
5778 && real_lvalue_p (expr
)
5779 && reference_related_p (TREE_TYPE (type
), intype
)
5780 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5782 expr
= build_typed_address (expr
, type
);
5783 return convert_from_reference (expr
);
5788 /* Resolve overloaded address here rather than once in
5789 implicit_conversion and again in the inverse code below. */
5790 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5792 expr
= instantiate_type (type
, expr
, complain
);
5793 intype
= TREE_TYPE (expr
);
5796 /* [expr.static.cast]
5798 An expression e can be explicitly converted to a type T using a
5799 static_cast of the form static_cast<T>(e) if the declaration T
5800 t(e);" is well-formed, for some invented temporary variable
5802 result
= perform_direct_initialization_if_possible (type
, expr
,
5803 c_cast_p
, complain
);
5806 result
= convert_from_reference (result
);
5808 /* Ignore any integer overflow caused by the cast. */
5809 result
= ignore_overflows (result
, orig
);
5811 /* [expr.static.cast]
5813 If T is a reference type, the result is an lvalue; otherwise,
5814 the result is an rvalue. */
5815 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5816 result
= rvalue (result
);
5820 /* [expr.static.cast]
5822 Any expression can be explicitly converted to type cv void. */
5823 if (TREE_CODE (type
) == VOID_TYPE
)
5824 return convert_to_void (expr
, /*implicit=*/NULL
, complain
);
5826 /* [expr.static.cast]
5828 The inverse of any standard conversion sequence (clause _conv_),
5829 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5830 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5831 (_conv.bool_) conversions, can be performed explicitly using
5832 static_cast subject to the restriction that the explicit
5833 conversion does not cast away constness (_expr.const.cast_), and
5834 the following additional rules for specific cases: */
5835 /* For reference, the conversions not excluded are: integral
5836 promotions, floating point promotion, integral conversions,
5837 floating point conversions, floating-integral conversions,
5838 pointer conversions, and pointer to member conversions. */
5841 A value of integral _or enumeration_ type can be explicitly
5842 converted to an enumeration type. */
5843 /* The effect of all that is that any conversion between any two
5844 types which are integral, floating, or enumeration types can be
5846 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5847 || SCALAR_FLOAT_TYPE_P (type
))
5848 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5849 || SCALAR_FLOAT_TYPE_P (intype
)))
5851 expr
= ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5853 /* Ignore any integer overflow caused by the cast. */
5854 expr
= ignore_overflows (expr
, orig
);
5858 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5859 && CLASS_TYPE_P (TREE_TYPE (type
))
5860 && CLASS_TYPE_P (TREE_TYPE (intype
))
5861 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5862 (TREE_TYPE (intype
))),
5863 build_pointer_type (TYPE_MAIN_VARIANT
5864 (TREE_TYPE (type
)))))
5869 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5870 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
5871 c_cast_p
? ba_unique
: ba_check
,
5873 return build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
5876 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5877 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5884 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
5885 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
5887 if (TYPE_PTRMEM_P (type
))
5889 t1
= (build_ptrmem_type
5891 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
5892 t2
= (build_ptrmem_type
5894 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
5901 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
5904 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5905 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
5910 /* [expr.static.cast]
5912 An rvalue of type "pointer to cv void" can be explicitly
5913 converted to a pointer to object type. A value of type pointer
5914 to object converted to "pointer to cv void" and back to the
5915 original pointer type will have its original value. */
5916 if (TREE_CODE (intype
) == POINTER_TYPE
5917 && VOID_TYPE_P (TREE_TYPE (intype
))
5918 && TYPE_PTROB_P (type
))
5921 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5922 return build_nop (type
, expr
);
5926 return error_mark_node
;
5929 /* Return an expression representing static_cast<TYPE>(EXPR). */
5932 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5937 if (type
== error_mark_node
|| expr
== error_mark_node
)
5938 return error_mark_node
;
5940 if (processing_template_decl
)
5942 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
5943 /* We don't know if it will or will not have side effects. */
5944 TREE_SIDE_EFFECTS (expr
) = 1;
5945 return convert_from_reference (expr
);
5948 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5949 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5950 if (TREE_CODE (type
) != REFERENCE_TYPE
5951 && TREE_CODE (expr
) == NOP_EXPR
5952 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5953 expr
= TREE_OPERAND (expr
, 0);
5955 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
5960 if (complain
& tf_error
)
5961 error ("invalid static_cast from type %qT to type %qT",
5962 TREE_TYPE (expr
), type
);
5963 return error_mark_node
;
5966 /* EXPR is an expression with member function or pointer-to-member
5967 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5968 not permitted by ISO C++, but we accept it in some modes. If we
5969 are not in one of those modes, issue a diagnostic. Return the
5970 converted expression. */
5973 convert_member_func_to_ptr (tree type
, tree expr
)
5978 intype
= TREE_TYPE (expr
);
5979 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
5980 || TREE_CODE (intype
) == METHOD_TYPE
);
5982 if (pedantic
|| warn_pmf2ptr
)
5983 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
5984 "converting from %qT to %qT", intype
, type
);
5986 if (TREE_CODE (intype
) == METHOD_TYPE
)
5987 expr
= build_addr_func (expr
);
5988 else if (TREE_CODE (expr
) == PTRMEM_CST
)
5989 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
5992 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
5993 decl
= build_address (decl
);
5994 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
5997 return build_nop (type
, expr
);
6000 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
6001 If C_CAST_P is true, this reinterpret cast is being done as part of
6002 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
6003 indicate whether or not reinterpret_cast was valid. */
6006 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6007 bool *valid_p
, tsubst_flags_t complain
)
6011 /* Assume the cast is invalid. */
6015 if (type
== error_mark_node
|| error_operand_p (expr
))
6016 return error_mark_node
;
6018 intype
= TREE_TYPE (expr
);
6020 /* Save casted types in the function's used types hash table. */
6021 used_types_insert (type
);
6023 /* [expr.reinterpret.cast]
6024 An lvalue expression of type T1 can be cast to the type
6025 "reference to T2" if an expression of type "pointer to T1" can be
6026 explicitly converted to the type "pointer to T2" using a
6027 reinterpret_cast. */
6028 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6030 if (! real_lvalue_p (expr
))
6032 if (complain
& tf_error
)
6033 error ("invalid cast of an rvalue expression of type "
6036 return error_mark_node
;
6039 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6040 "B" are related class types; the reinterpret_cast does not
6041 adjust the pointer. */
6042 if (TYPE_PTR_P (intype
)
6043 && (complain
& tf_warning
)
6044 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
6045 COMPARE_BASE
| COMPARE_DERIVED
)))
6046 warning (0, "casting %qT to %qT does not dereference pointer",
6049 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0, complain
);
6051 if (warn_strict_aliasing
> 2)
6052 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
6054 if (expr
!= error_mark_node
)
6055 expr
= build_reinterpret_cast_1
6056 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
6058 if (expr
!= error_mark_node
)
6059 /* cp_build_indirect_ref isn't right for rvalue refs. */
6060 expr
= convert_from_reference (fold_convert (type
, expr
));
6064 /* As a G++ extension, we consider conversions from member
6065 functions, and pointers to member functions to
6066 pointer-to-function and pointer-to-void types. If
6067 -Wno-pmf-conversions has not been specified,
6068 convert_member_func_to_ptr will issue an error message. */
6069 if ((TYPE_PTRMEMFUNC_P (intype
)
6070 || TREE_CODE (intype
) == METHOD_TYPE
)
6071 && TYPE_PTR_P (type
)
6072 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6073 || VOID_TYPE_P (TREE_TYPE (type
))))
6074 return convert_member_func_to_ptr (type
, expr
);
6076 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6077 array-to-pointer, and function-to-pointer conversions are
6079 expr
= decay_conversion (expr
);
6081 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6082 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6083 if (TREE_CODE (expr
) == NOP_EXPR
6084 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6085 expr
= TREE_OPERAND (expr
, 0);
6087 if (error_operand_p (expr
))
6088 return error_mark_node
;
6090 intype
= TREE_TYPE (expr
);
6092 /* [expr.reinterpret.cast]
6093 A pointer can be converted to any integral type large enough to
6094 hold it. ... A value of type std::nullptr_t can be converted to
6095 an integral type; the conversion has the same meaning and
6096 validity as a conversion of (void*)0 to the integral type. */
6097 if (CP_INTEGRAL_TYPE_P (type
)
6098 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
6100 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
6102 if (complain
& tf_error
)
6103 permerror (input_location
, "cast from %qT to %qT loses precision",
6106 return error_mark_node
;
6108 if (NULLPTR_TYPE_P (intype
))
6109 return build_int_cst (type
, 0);
6111 /* [expr.reinterpret.cast]
6112 A value of integral or enumeration type can be explicitly
6113 converted to a pointer. */
6114 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6117 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6118 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6119 return fold_if_not_in_template (build_nop (type
, expr
));
6120 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6121 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6126 check_for_casting_away_constness (intype
, type
, REINTERPRET_CAST_EXPR
);
6127 /* Warn about possible alignment problems. */
6128 if (STRICT_ALIGNMENT
&& warn_cast_align
6129 && (complain
& tf_warning
)
6130 && !VOID_TYPE_P (type
)
6131 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6132 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6133 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6134 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6135 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6136 "increases required alignment of target type", intype
, type
);
6138 /* We need to strip nops here, because the front end likes to
6139 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6141 if (warn_strict_aliasing
<= 2)
6142 strict_aliasing_warning (intype
, type
, sexpr
);
6144 return fold_if_not_in_template (build_nop (type
, expr
));
6146 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6147 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6149 if (pedantic
&& (complain
& tf_warning
))
6150 /* Only issue a warning, as we have always supported this
6151 where possible, and it is necessary in some cases. DR 195
6152 addresses this issue, but as of 2004/10/26 is still in
6154 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6155 return fold_if_not_in_template (build_nop (type
, expr
));
6157 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6158 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6159 else if (TREE_CODE (intype
) == VECTOR_TYPE
6160 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6161 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6166 if (complain
& tf_error
)
6167 error ("invalid cast from type %qT to type %qT", intype
, type
);
6168 return error_mark_node
;
6171 return cp_convert (type
, expr
);
6175 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6177 if (type
== error_mark_node
|| expr
== error_mark_node
)
6178 return error_mark_node
;
6180 if (processing_template_decl
)
6182 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6184 if (!TREE_SIDE_EFFECTS (t
)
6185 && type_dependent_expression_p (expr
))
6186 /* There might turn out to be side effects inside expr. */
6187 TREE_SIDE_EFFECTS (t
) = 1;
6188 return convert_from_reference (t
);
6191 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6192 /*valid_p=*/NULL
, complain
);
6195 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6196 return an appropriate expression. Otherwise, return
6197 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6198 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6199 performing a C-style cast, its value upon return will indicate
6200 whether or not the conversion succeeded. */
6203 build_const_cast_1 (tree dst_type
, tree expr
, bool complain
,
6207 tree reference_type
;
6209 /* Callers are responsible for handling error_mark_node as a
6210 destination type. */
6211 gcc_assert (dst_type
!= error_mark_node
);
6212 /* In a template, callers should be building syntactic
6213 representations of casts, not using this machinery. */
6214 gcc_assert (!processing_template_decl
);
6216 /* Assume the conversion is invalid. */
6220 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6223 error ("invalid use of const_cast with type %qT, "
6224 "which is not a pointer, "
6225 "reference, nor a pointer-to-data-member type", dst_type
);
6226 return error_mark_node
;
6229 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6232 error ("invalid use of const_cast with type %qT, which is a pointer "
6233 "or reference to a function type", dst_type
);
6234 return error_mark_node
;
6237 /* Save casted types in the function's used types hash table. */
6238 used_types_insert (dst_type
);
6240 src_type
= TREE_TYPE (expr
);
6241 /* Expressions do not really have reference types. */
6242 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6243 src_type
= TREE_TYPE (src_type
);
6245 /* [expr.const.cast]
6247 An lvalue of type T1 can be explicitly converted to an lvalue of
6248 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6249 types) if a pointer to T1 can be explicitly converted to the type
6250 pointer to T2 using a const_cast. */
6251 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6253 reference_type
= dst_type
;
6254 if (! real_lvalue_p (expr
))
6257 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6258 src_type
, dst_type
);
6259 return error_mark_node
;
6261 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6262 src_type
= build_pointer_type (src_type
);
6266 reference_type
= NULL_TREE
;
6267 /* If the destination type is not a reference type, the
6268 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6269 conversions are performed. */
6270 src_type
= type_decays_to (src_type
);
6271 if (src_type
== error_mark_node
)
6272 return error_mark_node
;
6275 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6276 && comp_ptr_ttypes_const (dst_type
, src_type
))
6281 /* This cast is actually a C-style cast. Issue a warning if
6282 the user is making a potentially unsafe cast. */
6283 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
);
6287 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0,
6288 complain
? tf_warning_or_error
: tf_none
);
6289 expr
= build_nop (reference_type
, expr
);
6290 return convert_from_reference (expr
);
6294 expr
= decay_conversion (expr
);
6295 /* build_c_cast puts on a NOP_EXPR to make the result not an
6296 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6297 non-lvalue context. */
6298 if (TREE_CODE (expr
) == NOP_EXPR
6299 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6300 expr
= TREE_OPERAND (expr
, 0);
6301 return build_nop (dst_type
, expr
);
6306 error ("invalid const_cast from type %qT to type %qT",
6307 src_type
, dst_type
);
6308 return error_mark_node
;
6312 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6314 if (type
== error_mark_node
|| error_operand_p (expr
))
6315 return error_mark_node
;
6317 if (processing_template_decl
)
6319 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6321 if (!TREE_SIDE_EFFECTS (t
)
6322 && type_dependent_expression_p (expr
))
6323 /* There might turn out to be side effects inside expr. */
6324 TREE_SIDE_EFFECTS (t
) = 1;
6325 return convert_from_reference (t
);
6328 return build_const_cast_1 (type
, expr
, complain
& tf_error
,
6332 /* Like cp_build_c_cast, but for the c-common bits. */
6335 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6337 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6340 /* Build an expression representing an explicit C-style cast to type
6341 TYPE of expression EXPR. */
6344 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6350 if (type
== error_mark_node
|| error_operand_p (expr
))
6351 return error_mark_node
;
6353 if (processing_template_decl
)
6355 tree t
= build_min (CAST_EXPR
, type
,
6356 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6357 /* We don't know if it will or will not have side effects. */
6358 TREE_SIDE_EFFECTS (t
) = 1;
6359 return convert_from_reference (t
);
6362 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6363 'Class') should always be retained, because this information aids
6364 in method lookup. */
6365 if (objc_is_object_ptr (type
)
6366 && objc_is_object_ptr (TREE_TYPE (expr
)))
6367 return build_nop (type
, expr
);
6369 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6370 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6371 if (TREE_CODE (type
) != REFERENCE_TYPE
6372 && TREE_CODE (value
) == NOP_EXPR
6373 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6374 value
= TREE_OPERAND (value
, 0);
6376 if (TREE_CODE (type
) == ARRAY_TYPE
)
6378 /* Allow casting from T1* to T2[] because Cfront allows it.
6379 NIHCL uses it. It is not valid ISO C++ however. */
6380 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6382 if (complain
& tf_error
)
6383 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6385 return error_mark_node
;
6386 type
= build_pointer_type (TREE_TYPE (type
));
6390 if (complain
& tf_error
)
6391 error ("ISO C++ forbids casting to an array type %qT", type
);
6392 return error_mark_node
;
6396 if (TREE_CODE (type
) == FUNCTION_TYPE
6397 || TREE_CODE (type
) == METHOD_TYPE
)
6399 if (complain
& tf_error
)
6400 error ("invalid cast to function type %qT", type
);
6401 return error_mark_node
;
6404 if (TREE_CODE (type
) == POINTER_TYPE
6405 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
6406 /* Casting to an integer of smaller size is an error detected elsewhere. */
6407 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
6408 /* Don't warn about converting any constant. */
6409 && !TREE_CONSTANT (value
))
6410 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
6411 "cast to pointer from integer of different size");
6413 /* A C-style cast can be a const_cast. */
6414 result
= build_const_cast_1 (type
, value
, /*complain=*/false,
6419 /* Or a static cast. */
6420 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6421 &valid_p
, complain
);
6422 /* Or a reinterpret_cast. */
6424 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6425 &valid_p
, complain
);
6426 /* The static_cast or reinterpret_cast may be followed by a
6429 /* A valid cast may result in errors if, for example, a
6430 conversion to am ambiguous base class is required. */
6431 && !error_operand_p (result
))
6435 /* Non-class rvalues always have cv-unqualified type. */
6436 if (!CLASS_TYPE_P (type
))
6437 type
= TYPE_MAIN_VARIANT (type
);
6438 result_type
= TREE_TYPE (result
);
6439 if (!CLASS_TYPE_P (result_type
))
6440 result_type
= TYPE_MAIN_VARIANT (result_type
);
6441 /* If the type of RESULT does not match TYPE, perform a
6442 const_cast to make it match. If the static_cast or
6443 reinterpret_cast succeeded, we will differ by at most
6444 cv-qualification, so the follow-on const_cast is guaranteed
6446 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6448 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6449 gcc_assert (valid_p
);
6454 return error_mark_node
;
6457 /* For use from the C common bits. */
6459 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6460 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6461 enum tree_code modifycode
,
6462 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6463 tree rhs_origtype ATTRIBUTE_UNUSED
)
6465 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6468 /* Build an assignment expression of lvalue LHS from value RHS.
6469 MODIFYCODE is the code for a binary operator that we use
6470 to combine the old value of LHS with RHS to get the new value.
6471 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6473 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6476 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6477 tsubst_flags_t complain
)
6481 tree lhstype
= TREE_TYPE (lhs
);
6482 tree olhstype
= lhstype
;
6483 bool plain_assign
= (modifycode
== NOP_EXPR
);
6485 /* Avoid duplicate error messages from operands that had errors. */
6486 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6487 return error_mark_node
;
6489 /* Handle control structure constructs used as "lvalues". */
6490 switch (TREE_CODE (lhs
))
6492 /* Handle --foo = 5; as these are valid constructs in C++. */
6493 case PREDECREMENT_EXPR
:
6494 case PREINCREMENT_EXPR
:
6495 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6496 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6497 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6498 TREE_OPERAND (lhs
, 1));
6499 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6500 modifycode
, rhs
, complain
);
6501 if (newrhs
== error_mark_node
)
6502 return error_mark_node
;
6503 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6505 /* Handle (a, b) used as an "lvalue". */
6507 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6508 modifycode
, rhs
, complain
);
6509 if (newrhs
== error_mark_node
)
6510 return error_mark_node
;
6511 return build2 (COMPOUND_EXPR
, lhstype
,
6512 TREE_OPERAND (lhs
, 0), newrhs
);
6515 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6516 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6517 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6518 TREE_OPERAND (lhs
, 1));
6519 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6521 if (newrhs
== error_mark_node
)
6522 return error_mark_node
;
6523 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6527 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6528 when neither operand has side-effects. */
6529 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6530 return error_mark_node
;
6532 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6533 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6535 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6536 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6538 TREE_OPERAND (lhs
, 0),
6539 TREE_OPERAND (lhs
, 1)),
6540 TREE_OPERAND (lhs
, 0),
6541 TREE_OPERAND (lhs
, 1));
6544 /* Handle (a ? b : c) used as an "lvalue". */
6547 /* Produce (a ? (b = rhs) : (c = rhs))
6548 except that the RHS goes through a save-expr
6549 so the code to compute it is only emitted once. */
6551 tree preeval
= NULL_TREE
;
6553 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6555 if (complain
& tf_error
)
6556 error ("void value not ignored as it ought to be");
6557 return error_mark_node
;
6560 rhs
= stabilize_expr (rhs
, &preeval
);
6562 /* Check this here to avoid odd errors when trying to convert
6563 a throw to the type of the COND_EXPR. */
6564 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6565 return error_mark_node
;
6567 cond
= build_conditional_expr
6568 (TREE_OPERAND (lhs
, 0),
6569 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6570 modifycode
, rhs
, complain
),
6571 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6572 modifycode
, rhs
, complain
),
6575 if (cond
== error_mark_node
)
6577 /* Make sure the code to compute the rhs comes out
6578 before the split. */
6580 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6588 if (modifycode
== INIT_EXPR
)
6590 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6591 /* Do the default thing. */;
6592 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6594 /* Compound literal. */
6595 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6596 /* Call convert to generate an error; see PR 11063. */
6597 rhs
= convert (lhstype
, rhs
);
6598 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6599 TREE_SIDE_EFFECTS (result
) = 1;
6602 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6603 /* Do the default thing. */;
6606 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6607 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6608 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6610 release_tree_vector (rhs_vec
);
6611 if (result
== NULL_TREE
)
6612 return error_mark_node
;
6618 lhs
= require_complete_type (lhs
);
6619 if (lhs
== error_mark_node
)
6620 return error_mark_node
;
6622 if (modifycode
== NOP_EXPR
)
6624 /* `operator=' is not an inheritable operator. */
6625 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6626 /* Do the default thing. */;
6629 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6630 lhs
, rhs
, make_node (NOP_EXPR
),
6631 /*overloaded_p=*/NULL
,
6633 if (result
== NULL_TREE
)
6634 return error_mark_node
;
6641 /* A binary op has been requested. Combine the old LHS
6642 value with the RHS producing the value we should actually
6643 store into the LHS. */
6644 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6645 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6646 || MAYBE_CLASS_TYPE_P (lhstype
)));
6648 lhs
= stabilize_reference (lhs
);
6649 newrhs
= cp_build_binary_op (input_location
,
6650 modifycode
, lhs
, rhs
,
6652 if (newrhs
== error_mark_node
)
6654 if (complain
& tf_error
)
6655 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6656 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6657 return error_mark_node
;
6660 /* Now it looks like a plain assignment. */
6661 modifycode
= NOP_EXPR
;
6663 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6664 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6667 /* The left-hand side must be an lvalue. */
6668 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6669 return error_mark_node
;
6671 /* Warn about modifying something that is `const'. Don't warn if
6672 this is initialization. */
6673 if (modifycode
!= INIT_EXPR
6674 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6675 /* Functions are not modifiable, even though they are
6677 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6678 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6679 /* If it's an aggregate and any field is const, then it is
6680 effectively const. */
6681 || (CLASS_TYPE_P (lhstype
)
6682 && C_TYPE_FIELDS_READONLY (lhstype
))))
6684 if (complain
& tf_error
)
6685 readonly_error (lhs
, REK_ASSIGNMENT
);
6687 return error_mark_node
;
6690 /* If storing into a structure or union member, it may have been given a
6691 lowered bitfield type. We need to convert to the declared type first,
6692 so retrieve it now. */
6694 olhstype
= unlowered_expr_type (lhs
);
6696 /* Convert new value to destination type. */
6698 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6702 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6704 if (modifycode
!= INIT_EXPR
)
6706 if (complain
& tf_error
)
6707 error ("assigning to an array from an initializer list");
6708 return error_mark_node
;
6710 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6711 return error_mark_node
;
6712 newrhs
= digest_init (lhstype
, newrhs
);
6715 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6716 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6718 if (complain
& tf_error
)
6719 error ("incompatible types in assignment of %qT to %qT",
6720 TREE_TYPE (rhs
), lhstype
);
6721 return error_mark_node
;
6724 /* Allow array assignment in compiler-generated code. */
6725 else if (!current_function_decl
6726 || !DECL_ARTIFICIAL (current_function_decl
))
6728 /* This routine is used for both initialization and assignment.
6729 Make sure the diagnostic message differentiates the context. */
6730 if (complain
& tf_error
)
6732 if (modifycode
== INIT_EXPR
)
6733 error ("array used as initializer");
6735 error ("invalid array assignment");
6737 return error_mark_node
;
6740 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6741 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6742 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6743 /*explicit_value_init_p=*/false,
6744 from_array
, complain
);
6747 if (modifycode
== INIT_EXPR
)
6748 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6749 LOOKUP_ONLYCONVERTING. */
6750 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6751 "initialization", NULL_TREE
, 0,
6754 newrhs
= convert_for_assignment (olhstype
, newrhs
, "assignment",
6755 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6757 if (!same_type_p (lhstype
, olhstype
))
6758 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6760 if (modifycode
!= INIT_EXPR
)
6762 if (TREE_CODE (newrhs
) == CALL_EXPR
6763 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6764 newrhs
= build_cplus_new (lhstype
, newrhs
);
6766 /* Can't initialize directly from a TARGET_EXPR, since that would
6767 cause the lhs to be constructed twice, and possibly result in
6768 accidental self-initialization. So we force the TARGET_EXPR to be
6769 expanded without a target. */
6770 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6771 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6772 TREE_OPERAND (newrhs
, 0));
6775 if (newrhs
== error_mark_node
)
6776 return error_mark_node
;
6778 if (c_dialect_objc () && flag_objc_gc
)
6780 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6786 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6787 lhstype
, lhs
, newrhs
);
6789 TREE_SIDE_EFFECTS (result
) = 1;
6791 TREE_NO_WARNING (result
) = 1;
6797 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6798 tsubst_flags_t complain
)
6800 if (processing_template_decl
)
6801 return build_min_nt (MODOP_EXPR
, lhs
,
6802 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6804 if (modifycode
!= NOP_EXPR
)
6806 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6807 make_node (modifycode
),
6808 /*overloaded_p=*/NULL
,
6812 TREE_NO_WARNING (rval
) = 1;
6816 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6819 /* Helper function for get_delta_difference which assumes FROM is a base
6820 class of TO. Returns a delta for the conversion of pointer-to-member
6821 of FROM to pointer-to-member of TO. If the conversion is invalid,
6822 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6823 If C_CAST_P is true, this conversion is taking place as part of a C-style
6827 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
)
6832 binfo
= lookup_base (to
, from
, c_cast_p
? ba_unique
: ba_check
, &kind
);
6833 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6835 error (" in pointer to member function conversion");
6836 return size_zero_node
;
6840 if (kind
!= bk_via_virtual
)
6841 return BINFO_OFFSET (binfo
);
6843 /* FROM is a virtual base class of TO. Issue an error or warning
6844 depending on whether or not this is a reinterpret cast. */
6846 error ("pointer to member conversion via virtual base %qT",
6847 BINFO_TYPE (binfo_from_vbase (binfo
)));
6849 return size_zero_node
;
6856 /* Get difference in deltas for different pointer to member function
6857 types. Returns an integer constant of type PTRDIFF_TYPE_NODE. If
6858 the conversion is invalid, the constant is zero. If
6859 ALLOW_INVERSE_P is true, then allow reverse conversions as well.
6860 If C_CAST_P is true this conversion is taking place as part of a
6863 Note that the naming of FROM and TO is kind of backwards; the return
6864 value is what we add to a TO in order to get a FROM. They are named
6865 this way because we call this function to find out how to convert from
6866 a pointer to member of FROM to a pointer to member of TO. */
6869 get_delta_difference (tree from
, tree to
,
6870 bool allow_inverse_p
,
6875 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
6876 /* Pointer to member of incomplete class is permitted*/
6877 result
= size_zero_node
;
6879 result
= get_delta_difference_1 (from
, to
, c_cast_p
);
6883 if (!allow_inverse_p
)
6885 error_not_base_type (from
, to
);
6886 error (" in pointer to member conversion");
6887 result
= size_zero_node
;
6891 result
= get_delta_difference_1 (to
, from
, c_cast_p
);
6894 result
= size_diffop_loc (input_location
,
6895 size_zero_node
, result
);
6898 error_not_base_type (from
, to
);
6899 error (" in pointer to member conversion");
6900 result
= size_zero_node
;
6905 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
6909 /* Return a constructor for the pointer-to-member-function TYPE using
6910 the other components as specified. */
6913 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
6918 VEC(constructor_elt
, gc
) *v
;
6920 /* Pull the FIELD_DECLs out of the type. */
6921 pfn_field
= TYPE_FIELDS (type
);
6922 delta_field
= TREE_CHAIN (pfn_field
);
6924 /* Make sure DELTA has the type we want. */
6925 delta
= convert_and_check (delta_type_node
, delta
);
6927 /* Convert to the correct target type if necessary. */
6928 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
6930 /* Finish creating the initializer. */
6931 v
= VEC_alloc(constructor_elt
, gc
, 2);
6932 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
6933 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
6934 u
= build_constructor (type
, v
);
6935 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
6936 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
6937 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
6939 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
6944 /* Build a constructor for a pointer to member function. It can be
6945 used to initialize global variables, local variable, or used
6946 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6949 If FORCE is nonzero, then force this conversion, even if
6950 we would rather not do it. Usually set when using an explicit
6951 cast. A C-style cast is being processed iff C_CAST_P is true.
6953 Return error_mark_node, if something goes wrong. */
6956 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
)
6962 if (error_operand_p (pfn
))
6963 return error_mark_node
;
6965 pfn_type
= TREE_TYPE (pfn
);
6966 to_type
= build_ptrmemfunc_type (type
);
6968 /* Handle multiple conversions of pointer to member functions. */
6969 if (TYPE_PTRMEMFUNC_P (pfn_type
))
6971 tree delta
= NULL_TREE
;
6972 tree npfn
= NULL_TREE
;
6976 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
6977 error ("invalid conversion to type %qT from type %qT",
6980 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
6981 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
6985 /* We don't have to do any conversion to convert a
6986 pointer-to-member to its own type. But, we don't want to
6987 just return a PTRMEM_CST if there's an explicit cast; that
6988 cast should make the expression an invalid template argument. */
6989 if (TREE_CODE (pfn
) != PTRMEM_CST
)
6991 if (same_type_p (to_type
, pfn_type
))
6993 else if (integer_zerop (n
))
6994 return build_reinterpret_cast (to_type
, pfn
,
6995 tf_warning_or_error
);
6998 if (TREE_SIDE_EFFECTS (pfn
))
6999 pfn
= save_expr (pfn
);
7001 /* Obtain the function pointer and the current DELTA. */
7002 if (TREE_CODE (pfn
) == PTRMEM_CST
)
7003 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
7006 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
7007 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
7010 /* Just adjust the DELTA field. */
7011 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7012 (TREE_TYPE (delta
), ptrdiff_type_node
));
7013 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
7014 n
= cp_build_binary_op (input_location
,
7015 LSHIFT_EXPR
, n
, integer_one_node
,
7016 tf_warning_or_error
);
7017 delta
= cp_build_binary_op (input_location
,
7018 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
7019 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
7022 /* Handle null pointer to member function conversions. */
7023 if (integer_zerop (pfn
))
7025 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
7026 return build_ptrmemfunc1 (to_type
,
7031 if (type_unknown_p (pfn
))
7032 return instantiate_type (type
, pfn
, tf_warning_or_error
);
7034 fn
= TREE_OPERAND (pfn
, 0);
7035 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7036 /* In a template, we will have preserved the
7038 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
7039 return make_ptrmem_cst (to_type
, fn
);
7042 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7045 ??? There is no consistency as to the types returned for the above
7046 values. Some code acts as if it were a sizetype and some as if it were
7047 integer_type_node. */
7050 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
7052 tree type
= TREE_TYPE (cst
);
7053 tree fn
= PTRMEM_CST_MEMBER (cst
);
7054 tree ptr_class
, fn_class
;
7056 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7058 /* The class that the function belongs to. */
7059 fn_class
= DECL_CONTEXT (fn
);
7061 /* The class that we're creating a pointer to member of. */
7062 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
7064 /* First, calculate the adjustment to the function's class. */
7065 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
7068 if (!DECL_VIRTUAL_P (fn
))
7069 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
7072 /* If we're dealing with a virtual function, we have to adjust 'this'
7073 again, to point to the base which provides the vtable entry for
7074 fn; the call will do the opposite adjustment. */
7075 tree orig_class
= DECL_CONTEXT (fn
);
7076 tree binfo
= binfo_or_else (orig_class
, fn_class
);
7077 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7078 *delta
, BINFO_OFFSET (binfo
));
7079 *delta
= fold_if_not_in_template (*delta
);
7081 /* We set PFN to the vtable offset at which the function can be
7082 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7083 case delta is shifted left, and then incremented). */
7084 *pfn
= DECL_VINDEX (fn
);
7085 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
7086 TYPE_SIZE_UNIT (vtable_entry_type
));
7087 *pfn
= fold_if_not_in_template (*pfn
);
7089 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
7091 case ptrmemfunc_vbit_in_pfn
:
7092 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
7094 *pfn
= fold_if_not_in_template (*pfn
);
7097 case ptrmemfunc_vbit_in_delta
:
7098 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
7099 *delta
, integer_one_node
);
7100 *delta
= fold_if_not_in_template (*delta
);
7101 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7102 *delta
, integer_one_node
);
7103 *delta
= fold_if_not_in_template (*delta
);
7110 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
7111 *pfn
= fold_if_not_in_template (*pfn
);
7115 /* Return an expression for PFN from the pointer-to-member function
7119 pfn_from_ptrmemfunc (tree t
)
7121 if (TREE_CODE (t
) == PTRMEM_CST
)
7126 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7131 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
7134 /* Return an expression for DELTA from the pointer-to-member function
7138 delta_from_ptrmemfunc (tree t
)
7140 if (TREE_CODE (t
) == PTRMEM_CST
)
7145 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7150 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7153 /* Convert value RHS to type TYPE as preparation for an assignment to
7154 an lvalue of type TYPE. ERRTYPE is a string to use in error
7155 messages: "assignment", "return", etc. If FNDECL is non-NULL, we
7156 are doing the conversion in order to pass the PARMNUMth argument of
7160 convert_for_assignment (tree type
, tree rhs
,
7161 const char *errtype
, tree fndecl
, int parmnum
,
7162 tsubst_flags_t complain
, int flags
)
7165 enum tree_code coder
;
7167 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7168 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7169 rhs
= TREE_OPERAND (rhs
, 0);
7171 rhstype
= TREE_TYPE (rhs
);
7172 coder
= TREE_CODE (rhstype
);
7174 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7175 && vector_types_convertible_p (type
, rhstype
, true))
7176 return convert (type
, rhs
);
7178 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7179 return error_mark_node
;
7180 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7181 return error_mark_node
;
7183 /* The RHS of an assignment cannot have void type. */
7184 if (coder
== VOID_TYPE
)
7186 if (complain
& tf_error
)
7187 error ("void value not ignored as it ought to be");
7188 return error_mark_node
;
7191 /* Simplify the RHS if possible. */
7192 if (TREE_CODE (rhs
) == CONST_DECL
)
7193 rhs
= DECL_INITIAL (rhs
);
7195 if (c_dialect_objc ())
7198 tree rname
= fndecl
;
7200 if (!strcmp (errtype
, "assignment"))
7202 else if (!strcmp (errtype
, "initialization"))
7206 tree selector
= objc_message_selector ();
7210 if (selector
&& parmno
> 1)
7217 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7218 return convert (type
, rhs
);
7223 The expression is implicitly converted (clause _conv_) to the
7224 cv-unqualified type of the left operand.
7226 We allow bad conversions here because by the time we get to this point
7227 we are committed to doing the conversion. If we end up doing a bad
7228 conversion, convert_like will complain. */
7229 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7231 /* When -Wno-pmf-conversions is use, we just silently allow
7232 conversions from pointers-to-members to plain pointers. If
7233 the conversion doesn't work, cp_convert will complain. */
7235 && TYPE_PTR_P (type
)
7236 && TYPE_PTRMEMFUNC_P (rhstype
))
7237 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7240 if (complain
& tf_error
)
7242 /* If the right-hand side has unknown type, then it is an
7243 overloaded function. Call instantiate_type to get error
7245 if (rhstype
== unknown_type_node
)
7246 instantiate_type (type
, rhs
, tf_warning_or_error
);
7248 error ("cannot convert %qT to %qT for argument %qP to %qD",
7249 rhstype
, type
, parmnum
, fndecl
);
7251 error ("cannot convert %qT to %qT in %s", rhstype
, type
,
7254 return error_mark_node
;
7257 if (warn_missing_format_attribute
)
7259 const enum tree_code codel
= TREE_CODE (type
);
7260 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7262 && check_missing_format_attribute (type
, rhstype
)
7263 && (complain
& tf_warning
))
7264 warning (OPT_Wmissing_format_attribute
,
7265 "%s might be a candidate for a format attribute",
7269 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7271 if (warn_parentheses
7272 && TREE_CODE (type
) == BOOLEAN_TYPE
7273 && TREE_CODE (rhs
) == MODIFY_EXPR
7274 && !TREE_NO_WARNING (rhs
)
7275 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7276 && (complain
& tf_warning
))
7278 location_t loc
= EXPR_HAS_LOCATION (rhs
)
7279 ? EXPR_LOCATION (rhs
) : input_location
;
7281 warning_at (loc
, OPT_Wparentheses
,
7282 "suggest parentheses around assignment used as truth value");
7283 TREE_NO_WARNING (rhs
) = 1;
7286 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7290 /* Convert RHS to be of type TYPE.
7291 If EXP is nonzero, it is the target of the initialization.
7292 ERRTYPE is a string to use in error messages.
7294 Two major differences between the behavior of
7295 `convert_for_assignment' and `convert_for_initialization'
7296 are that references are bashed in the former, while
7297 copied in the latter, and aggregates are assigned in
7298 the former (operator=) while initialized in the
7301 If using constructor make sure no conversion operator exists, if one does
7302 exist, an ambiguity exists.
7304 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7307 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7308 const char *errtype
, tree fndecl
, int parmnum
,
7309 tsubst_flags_t complain
)
7311 enum tree_code codel
= TREE_CODE (type
);
7313 enum tree_code coder
;
7315 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7316 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7317 if (TREE_CODE (rhs
) == NOP_EXPR
7318 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7319 && codel
!= REFERENCE_TYPE
)
7320 rhs
= TREE_OPERAND (rhs
, 0);
7322 if (type
== error_mark_node
7323 || rhs
== error_mark_node
7324 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7325 return error_mark_node
;
7327 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7328 && TREE_CODE (type
) != ARRAY_TYPE
7329 && (TREE_CODE (type
) != REFERENCE_TYPE
7330 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7331 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7332 && (TREE_CODE (type
) != REFERENCE_TYPE
7333 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7334 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7335 rhs
= decay_conversion (rhs
);
7337 rhstype
= TREE_TYPE (rhs
);
7338 coder
= TREE_CODE (rhstype
);
7340 if (coder
== ERROR_MARK
)
7341 return error_mark_node
;
7343 /* We accept references to incomplete types, so we can
7344 return here before checking if RHS is of complete type. */
7346 if (codel
== REFERENCE_TYPE
)
7348 /* This should eventually happen in convert_arguments. */
7349 int savew
= 0, savee
= 0;
7352 savew
= warningcount
, savee
= errorcount
;
7353 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7354 /*cleanup=*/NULL
, complain
);
7357 if (warningcount
> savew
)
7358 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7359 else if (errorcount
> savee
)
7360 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7366 exp
= require_complete_type (exp
);
7367 if (exp
== error_mark_node
)
7368 return error_mark_node
;
7370 rhstype
= non_reference (rhstype
);
7372 type
= complete_type (type
);
7374 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7375 /* Don't try to do copy-initialization if we already have
7376 direct-initialization. */
7379 if (MAYBE_CLASS_TYPE_P (type
))
7380 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
7382 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7386 /* If RETVAL is the address of, or a reference to, a local variable or
7387 temporary give an appropriate warning. */
7390 maybe_warn_about_returning_address_of_local (tree retval
)
7392 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7393 tree whats_returned
= retval
;
7397 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7398 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7399 else if (CONVERT_EXPR_P (whats_returned
)
7400 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7401 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7406 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7408 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7410 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7412 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7413 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7415 warning (0, "returning reference to temporary");
7418 if (TREE_CODE (whats_returned
) == VAR_DECL
7419 && DECL_NAME (whats_returned
)
7420 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7422 warning (0, "reference to non-lvalue returned");
7427 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7428 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7429 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7431 if (DECL_P (whats_returned
)
7432 && DECL_NAME (whats_returned
)
7433 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7434 && !(TREE_STATIC (whats_returned
)
7435 || TREE_PUBLIC (whats_returned
)))
7437 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7438 warning (0, "reference to local variable %q+D returned",
7441 warning (0, "address of local variable %q+D returned",
7447 /* Check that returning RETVAL from the current function is valid.
7448 Return an expression explicitly showing all conversions required to
7449 change RETVAL into the function return type, and to assign it to
7450 the DECL_RESULT for the function. Set *NO_WARNING to true if
7451 code reaches end of non-void function warning shouldn't be issued
7452 on this RETURN_EXPR. */
7455 check_return_expr (tree retval
, bool *no_warning
)
7458 /* The type actually returned by the function, after any
7461 int fn_returns_value_p
;
7462 bool named_return_value_okay_p
;
7464 *no_warning
= false;
7466 /* A `volatile' function is one that isn't supposed to return, ever.
7467 (This is a G++ extension, used to get better code for functions
7468 that call the `volatile' function.) */
7469 if (TREE_THIS_VOLATILE (current_function_decl
))
7470 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7472 /* Check for various simple errors. */
7473 if (DECL_DESTRUCTOR_P (current_function_decl
))
7476 error ("returning a value from a destructor");
7479 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7481 if (in_function_try_handler
)
7482 /* If a return statement appears in a handler of the
7483 function-try-block of a constructor, the program is ill-formed. */
7484 error ("cannot return from a handler of a function-try-block of a constructor");
7486 /* You can't return a value from a constructor. */
7487 error ("returning a value from a constructor");
7491 /* As an extension, deduce lambda return type from a return statement
7492 anywhere in the body. */
7493 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7495 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7496 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7498 tree type
= lambda_return_type (retval
);
7499 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7501 if (VOID_TYPE_P (type
))
7503 else if (oldtype
== NULL_TREE
)
7505 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7506 "can only be deduced when the return statement is "
7507 "the only statement in the function body");
7508 apply_lambda_return_type (lambda
, type
);
7510 else if (!same_type_p (type
, oldtype
))
7511 error ("inconsistent types %qT and %qT deduced for "
7512 "lambda return type", type
, oldtype
);
7516 if (processing_template_decl
)
7518 current_function_returns_value
= 1;
7519 if (check_for_bare_parameter_packs (retval
))
7520 retval
= error_mark_node
;
7524 /* When no explicit return-value is given in a function with a named
7525 return value, the named return value is used. */
7526 result
= DECL_RESULT (current_function_decl
);
7527 valtype
= TREE_TYPE (result
);
7528 gcc_assert (valtype
!= NULL_TREE
);
7529 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7530 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7533 /* Check for a return statement with no return value in a function
7534 that's supposed to return a value. */
7535 if (!retval
&& fn_returns_value_p
)
7537 permerror (input_location
, "return-statement with no value, in function returning %qT",
7539 /* Clear this, so finish_function won't say that we reach the
7540 end of a non-void function (which we don't, we gave a
7542 current_function_returns_null
= 0;
7543 /* And signal caller that TREE_NO_WARNING should be set on the
7544 RETURN_EXPR to avoid control reaches end of non-void function
7545 warnings in tree-cfg.c. */
7548 /* Check for a return statement with a value in a function that
7549 isn't supposed to return a value. */
7550 else if (retval
&& !fn_returns_value_p
)
7552 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7553 /* You can return a `void' value from a function of `void'
7554 type. In that case, we have to evaluate the expression for
7555 its side-effects. */
7556 finish_expr_stmt (retval
);
7558 permerror (input_location
, "return-statement with a value, in function "
7559 "returning 'void'");
7560 current_function_returns_null
= 1;
7562 /* There's really no value to return, after all. */
7566 /* Remember that this function can sometimes return without a
7568 current_function_returns_null
= 1;
7570 /* Remember that this function did return a value. */
7571 current_function_returns_value
= 1;
7573 /* Check for erroneous operands -- but after giving ourselves a
7574 chance to provide an error about returning a value from a void
7576 if (error_operand_p (retval
))
7578 current_function_return_value
= error_mark_node
;
7579 return error_mark_node
;
7582 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7583 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7584 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7585 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7587 && retval
&& null_ptr_cst_p (retval
))
7588 warning (0, "%<operator new%> must not return NULL unless it is "
7589 "declared %<throw()%> (or -fcheck-new is in effect)");
7591 /* Effective C++ rule 15. See also start_function. */
7593 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7597 /* The function return type must be a reference to the current
7599 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7600 && same_type_ignoring_top_level_qualifiers_p
7601 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7603 /* Returning '*this' is obviously OK. */
7604 if (retval
== current_class_ref
)
7606 /* If we are calling a function whose return type is the same of
7607 the current class reference, it is ok. */
7608 else if (TREE_CODE (retval
) == INDIRECT_REF
7609 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7614 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7617 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7619 [...] For a function with a class return type, if the expression
7620 in the return statement is the name of a local object, and the cv-
7621 unqualified type of the local object is the same as the function
7622 return type, an implementation is permitted to omit creating the tem-
7623 porary object to hold the function return value [...]
7625 So, if this is a value-returning function that always returns the same
7626 local variable, remember it.
7628 It might be nice to be more flexible, and choose the first suitable
7629 variable even if the function sometimes returns something else, but
7630 then we run the risk of clobbering the variable we chose if the other
7631 returned expression uses the chosen variable somehow. And people expect
7632 this restriction, anyway. (jason 2000-11-19)
7634 See finish_function and finalize_nrv for the rest of this optimization. */
7636 named_return_value_okay_p
=
7637 (retval
!= NULL_TREE
7638 /* Must be a local, automatic variable. */
7639 && TREE_CODE (retval
) == VAR_DECL
7640 && DECL_CONTEXT (retval
) == current_function_decl
7641 && ! TREE_STATIC (retval
)
7642 && ! DECL_ANON_UNION_VAR_P (retval
)
7643 && (DECL_ALIGN (retval
)
7644 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7645 /* The cv-unqualified type of the returned value must be the
7646 same as the cv-unqualified return type of the
7648 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7650 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7651 /* And the returned value must be non-volatile. */
7652 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7654 if (fn_returns_value_p
&& flag_elide_constructors
)
7656 if (named_return_value_okay_p
7657 && (current_function_return_value
== NULL_TREE
7658 || current_function_return_value
== retval
))
7659 current_function_return_value
= retval
;
7661 current_function_return_value
= error_mark_node
;
7664 /* We don't need to do any conversions when there's nothing being
7669 /* Do any required conversions. */
7670 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7671 /* No conversions are required. */
7675 /* The type the function is declared to return. */
7676 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7677 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7679 /* The functype's return type will have been set to void, if it
7680 was an incomplete type. Just treat this as 'return;' */
7681 if (VOID_TYPE_P (functype
))
7682 return error_mark_node
;
7684 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7685 treated as an rvalue for the purposes of overload resolution to
7686 favor move constructors over copy constructors. */
7687 if ((cxx_dialect
!= cxx98
)
7688 && named_return_value_okay_p
7689 /* The variable must not have the `volatile' qualifier. */
7690 && !CP_TYPE_VOLATILE_P (TREE_TYPE (retval
))
7691 /* The return type must be a class type. */
7692 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7693 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7695 /* First convert the value to the function's return type, then
7696 to the type of return value's location to handle the
7697 case that functype is smaller than the valtype. */
7698 retval
= convert_for_initialization
7699 (NULL_TREE
, functype
, retval
, flags
, "return", NULL_TREE
, 0,
7700 tf_warning_or_error
);
7701 retval
= convert (valtype
, retval
);
7703 /* If the conversion failed, treat this just like `return;'. */
7704 if (retval
== error_mark_node
)
7706 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7707 else if (! cfun
->returns_struct
7708 && TREE_CODE (retval
) == TARGET_EXPR
7709 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7710 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7711 TREE_OPERAND (retval
, 0));
7713 maybe_warn_about_returning_address_of_local (retval
);
7716 /* Actually copy the value returned into the appropriate location. */
7717 if (retval
&& retval
!= result
)
7718 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7724 /* Returns nonzero if the pointer-type FROM can be converted to the
7725 pointer-type TO via a qualification conversion. If CONSTP is -1,
7726 then we return nonzero if the pointers are similar, and the
7727 cv-qualification signature of FROM is a proper subset of that of TO.
7729 If CONSTP is positive, then all outer pointers have been
7733 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7735 bool to_more_cv_qualified
= false;
7736 bool is_opaque_pointer
= false;
7738 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7740 if (TREE_CODE (to
) != TREE_CODE (from
))
7743 if (TREE_CODE (from
) == OFFSET_TYPE
7744 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7745 TYPE_OFFSET_BASETYPE (to
)))
7748 /* Const and volatile mean something different for function types,
7749 so the usual checks are not appropriate. */
7750 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7752 /* In Objective-C++, some types may have been 'volatilized' by
7753 the compiler for EH; when comparing them here, the volatile
7754 qualification must be ignored. */
7755 bool objc_quals_match
= objc_type_quals_match (to
, from
);
7757 if (!at_least_as_qualified_p (to
, from
) && !objc_quals_match
)
7760 if (!at_least_as_qualified_p (from
, to
) && !objc_quals_match
)
7764 to_more_cv_qualified
= true;
7768 constp
&= TYPE_READONLY (to
);
7771 if (TREE_CODE (to
) == VECTOR_TYPE
)
7772 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7774 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
7775 return ((constp
>= 0 || to_more_cv_qualified
)
7776 && (is_opaque_pointer
7777 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
7781 /* When comparing, say, char ** to char const **, this function takes
7782 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7783 types to this function. */
7786 comp_ptr_ttypes (tree to
, tree from
)
7788 return comp_ptr_ttypes_real (to
, from
, 1);
7791 /* Returns true iff FNTYPE is a non-class type that involves
7792 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7793 if a parameter type is ill-formed. */
7796 error_type_p (const_tree type
)
7800 switch (TREE_CODE (type
))
7806 case REFERENCE_TYPE
:
7808 return error_type_p (TREE_TYPE (type
));
7812 if (error_type_p (TREE_TYPE (type
)))
7814 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7815 if (error_type_p (TREE_VALUE (t
)))
7820 if (TYPE_PTRMEMFUNC_P (type
))
7821 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
7829 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7830 type or inheritance-related types, regardless of cv-quals. */
7833 ptr_reasonably_similar (const_tree to
, const_tree from
)
7835 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7837 /* Any target type is similar enough to void. */
7838 if (TREE_CODE (to
) == VOID_TYPE
)
7839 return !error_type_p (from
);
7840 if (TREE_CODE (from
) == VOID_TYPE
)
7841 return !error_type_p (to
);
7843 if (TREE_CODE (to
) != TREE_CODE (from
))
7846 if (TREE_CODE (from
) == OFFSET_TYPE
7847 && comptypes (TYPE_OFFSET_BASETYPE (to
),
7848 TYPE_OFFSET_BASETYPE (from
),
7849 COMPARE_BASE
| COMPARE_DERIVED
))
7852 if (TREE_CODE (to
) == VECTOR_TYPE
7853 && vector_types_convertible_p (to
, from
, false))
7856 if (TREE_CODE (to
) == INTEGER_TYPE
7857 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
7860 if (TREE_CODE (to
) == FUNCTION_TYPE
)
7861 return !error_type_p (to
) && !error_type_p (from
);
7863 if (TREE_CODE (to
) != POINTER_TYPE
)
7865 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
7866 COMPARE_BASE
| COMPARE_DERIVED
);
7870 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
7871 pointer-to-member types) are the same, ignoring cv-qualification at
7875 comp_ptr_ttypes_const (tree to
, tree from
)
7877 bool is_opaque_pointer
= false;
7879 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7881 if (TREE_CODE (to
) != TREE_CODE (from
))
7884 if (TREE_CODE (from
) == OFFSET_TYPE
7885 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
7886 TYPE_OFFSET_BASETYPE (to
)))
7889 if (TREE_CODE (to
) == VECTOR_TYPE
)
7890 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7892 if (TREE_CODE (to
) != POINTER_TYPE
)
7893 return (is_opaque_pointer
7894 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
7898 /* Returns the type qualifiers for this type, including the qualifiers on the
7899 elements for an array type. */
7902 cp_type_quals (const_tree type
)
7905 /* This CONST_CAST is okay because strip_array_types returns its
7906 argument unmodified and we assign it to a const_tree. */
7907 type
= strip_array_types (CONST_CAST_TREE (type
));
7908 if (type
== error_mark_node
7909 /* Quals on a FUNCTION_TYPE are memfn quals. */
7910 || TREE_CODE (type
) == FUNCTION_TYPE
)
7911 return TYPE_UNQUALIFIED
;
7912 quals
= TYPE_QUALS (type
);
7913 /* METHOD and REFERENCE_TYPEs should never have quals. */
7914 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
7915 && TREE_CODE (type
) != REFERENCE_TYPE
)
7916 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
7917 == TYPE_UNQUALIFIED
));
7921 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
7925 type_memfn_quals (const_tree type
)
7927 if (TREE_CODE (type
) == FUNCTION_TYPE
)
7928 return TYPE_QUALS (type
);
7929 else if (TREE_CODE (type
) == METHOD_TYPE
)
7930 return cp_type_quals (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))));
7935 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
7939 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
)
7941 /* Could handle METHOD_TYPE here if necessary. */
7942 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7943 if (TYPE_QUALS (type
) == memfn_quals
)
7945 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
7947 return build_qualified_type (type
, memfn_quals
);
7950 /* Returns nonzero if TYPE is const or volatile. */
7953 cv_qualified_p (const_tree type
)
7955 int quals
= cp_type_quals (type
);
7956 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
7959 /* Returns nonzero if the TYPE contains a mutable member. */
7962 cp_has_mutable_p (const_tree type
)
7964 /* This CONST_CAST is okay because strip_array_types returns its
7965 argument unmodified and we assign it to a const_tree. */
7966 type
= strip_array_types (CONST_CAST_TREE(type
));
7968 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
7971 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
7972 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
7973 approximation. In particular, consider:
7976 struct S { int i; };
7977 const S s = { f(); }
7979 Here, we will make "s" as TREE_READONLY (because it is declared
7980 "const") -- only to reverse ourselves upon seeing that the
7981 initializer is non-constant. */
7984 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
7986 tree type
= TREE_TYPE (decl
);
7988 if (type
== error_mark_node
)
7991 if (TREE_CODE (decl
) == TYPE_DECL
)
7994 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
7995 && type_quals
!= TYPE_UNQUALIFIED
));
7997 /* Avoid setting TREE_READONLY incorrectly. */
7998 if (/* If the object has a constructor, the constructor may modify
8000 TYPE_NEEDS_CONSTRUCTING (type
)
8001 /* If the type isn't complete, we don't know yet if it will need
8003 || !COMPLETE_TYPE_P (type
)
8004 /* If the type has a mutable component, that component might be
8006 || TYPE_HAS_MUTABLE_P (type
))
8007 type_quals
&= ~TYPE_QUAL_CONST
;
8009 c_apply_type_quals_to_decl (type_quals
, decl
);
8012 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8013 exemplar types such that casting T1 to T2 is casting away constness
8014 if and only if there is no implicit conversion from T1 to T2. */
8017 casts_away_constness_r (tree
*t1
, tree
*t2
)
8022 /* [expr.const.cast]
8024 For multi-level pointer to members and multi-level mixed pointers
8025 and pointers to members (conv.qual), the "member" aspect of a
8026 pointer to member level is ignored when determining if a const
8027 cv-qualifier has been cast away. */
8028 /* [expr.const.cast]
8030 For two pointer types:
8032 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8033 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8036 casting from X1 to X2 casts away constness if, for a non-pointer
8037 type T there does not exist an implicit conversion (clause
8040 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8044 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8045 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
8046 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
8048 *t1
= cp_build_qualified_type (void_type_node
,
8049 cp_type_quals (*t1
));
8050 *t2
= cp_build_qualified_type (void_type_node
,
8051 cp_type_quals (*t2
));
8055 quals1
= cp_type_quals (*t1
);
8056 quals2
= cp_type_quals (*t2
);
8058 if (TYPE_PTRMEM_P (*t1
))
8059 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
8061 *t1
= TREE_TYPE (*t1
);
8062 if (TYPE_PTRMEM_P (*t2
))
8063 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
8065 *t2
= TREE_TYPE (*t2
);
8067 casts_away_constness_r (t1
, t2
);
8068 *t1
= build_pointer_type (*t1
);
8069 *t2
= build_pointer_type (*t2
);
8070 *t1
= cp_build_qualified_type (*t1
, quals1
);
8071 *t2
= cp_build_qualified_type (*t2
, quals2
);
8074 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8077 ??? This function returns non-zero if casting away qualifiers not
8078 just const. We would like to return to the caller exactly which
8079 qualifiers are casted away to give more accurate diagnostics.
8083 casts_away_constness (tree t1
, tree t2
)
8085 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
8087 /* [expr.const.cast]
8089 Casting from an lvalue of type T1 to an lvalue of type T2
8090 using a reference cast casts away constness if a cast from an
8091 rvalue of type "pointer to T1" to the type "pointer to T2"
8092 casts away constness. */
8093 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
8094 return casts_away_constness (build_pointer_type (t1
),
8095 build_pointer_type (TREE_TYPE (t2
)));
8098 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
8099 /* [expr.const.cast]
8101 Casting from an rvalue of type "pointer to data member of X
8102 of type T1" to the type "pointer to data member of Y of type
8103 T2" casts away constness if a cast from an rvalue of type
8104 "pointer to T1" to the type "pointer to T2" casts away
8106 return casts_away_constness
8107 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
8108 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
8110 /* Casting away constness is only something that makes sense for
8111 pointer or reference types. */
8112 if (TREE_CODE (t1
) != POINTER_TYPE
8113 || TREE_CODE (t2
) != POINTER_TYPE
)
8116 /* Top-level qualifiers don't matter. */
8117 t1
= TYPE_MAIN_VARIANT (t1
);
8118 t2
= TYPE_MAIN_VARIANT (t2
);
8119 casts_away_constness_r (&t1
, &t2
);
8120 if (!can_convert (t2
, t1
))
8126 /* If T is a REFERENCE_TYPE return the type to which T refers.
8127 Otherwise, return T itself. */
8130 non_reference (tree t
)
8132 if (TREE_CODE (t
) == REFERENCE_TYPE
)
8138 /* Return nonzero if REF is an lvalue valid for this language;
8139 otherwise, print an error message and return zero. USE says
8140 how the lvalue is being used and so selects the error message. */
8143 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
8145 int win
= lvalue_p (ref
);
8147 if (!win
&& (complain
& tf_error
))