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
)
833 else if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
836 parms
= commonparms (p1
, p2
);
838 rval
= build_function_type (valtype
, parms
);
839 gcc_assert (type_memfn_quals (t1
) == type_memfn_quals (t2
));
840 rval
= apply_memfn_quals (rval
, type_memfn_quals (t1
));
841 raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
842 TYPE_RAISES_EXCEPTIONS (t2
));
843 t1
= build_exception_variant (rval
, raises
);
849 /* Get this value the long way, since TYPE_METHOD_BASETYPE
850 is just the main variant of this. */
851 tree basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2
)));
852 tree raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
853 TYPE_RAISES_EXCEPTIONS (t2
));
856 /* If this was a member function type, get back to the
857 original type of type member function (i.e., without
858 the class instance variable up front. */
859 t1
= build_function_type (TREE_TYPE (t1
),
860 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
861 t2
= build_function_type (TREE_TYPE (t2
),
862 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
863 t3
= merge_types (t1
, t2
);
864 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
865 TYPE_ARG_TYPES (t3
));
866 t1
= build_exception_variant (t3
, raises
);
871 /* There is no need to merge attributes into a TYPENAME_TYPE.
872 When the type is instantiated it will have whatever
873 attributes result from the instantiation. */
879 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
881 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
884 return cp_build_type_attribute_variant (t1
, attributes
);
887 /* Return the ARRAY_TYPE type without its domain. */
890 strip_array_domain (tree type
)
893 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
894 if (TYPE_DOMAIN (type
) == NULL_TREE
)
896 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
897 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
900 /* Wrapper around cp_common_type that is used by c-common.c and other
901 front end optimizations that remove promotions.
903 Return the common type for two arithmetic types T1 and T2 under the
904 usual arithmetic conversions. The default conversions have already
905 been applied, and enumerated types converted to their compatible
909 common_type (tree t1
, tree t2
)
911 /* If one type is nonsense, use the other */
912 if (t1
== error_mark_node
)
914 if (t2
== error_mark_node
)
917 return cp_common_type (t1
, t2
);
920 /* Return the common type of two pointer types T1 and T2. This is the
921 type for the result of most arithmetic operations if the operands
922 have the given two types.
924 We assume that comp_target_types has already been done and returned
925 nonzero; if that isn't so, this may crash. */
928 common_pointer_type (tree t1
, tree t2
)
930 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
931 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
932 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
934 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
935 CPO_CONVERSION
, tf_warning_or_error
);
938 /* Compare two exception specifier types for exactness or subsetness, if
939 allowed. Returns false for mismatch, true for match (same, or
942 [except.spec] "If a class X ... objects of class X or any class publicly
943 and unambiguously derived from X. Similarly, if a pointer type Y * ...
944 exceptions of type Y * or that are pointers to any type publicly and
945 unambiguously derived from Y. Otherwise a function only allows exceptions
946 that have the same type ..."
947 This does not mention cv qualifiers and is different to what throw
948 [except.throw] and catch [except.catch] will do. They will ignore the
949 top level cv qualifiers, and allow qualifiers in the pointer to class
952 We implement the letter of the standard. */
955 comp_except_types (tree a
, tree b
, bool exact
)
957 if (same_type_p (a
, b
))
961 if (cp_type_quals (a
) || cp_type_quals (b
))
964 if (TREE_CODE (a
) == POINTER_TYPE
965 && TREE_CODE (b
) == POINTER_TYPE
)
969 if (cp_type_quals (a
) || cp_type_quals (b
))
973 if (TREE_CODE (a
) != RECORD_TYPE
974 || TREE_CODE (b
) != RECORD_TYPE
)
977 if (PUBLICLY_UNIQUELY_DERIVED_P (a
, b
))
983 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
984 If EXACT is false, T2 can be stricter than T1 (according to 15.4/7),
985 otherwise it must be exact. Exception lists are unordered, but
986 we've already filtered out duplicates. Most lists will be in order,
987 we should try to make use of that. */
990 comp_except_specs (const_tree t1
, const_tree t2
, bool exact
)
999 if (t1
== NULL_TREE
) /* T1 is ... */
1000 return t2
== NULL_TREE
|| !exact
;
1001 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1002 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1003 if (t2
== NULL_TREE
) /* T2 is ... */
1005 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1008 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1009 Count how many we find, to determine exactness. For exact matching and
1010 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1012 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1014 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1016 tree a
= TREE_VALUE (probe
);
1017 tree b
= TREE_VALUE (t2
);
1019 if (comp_except_types (a
, b
, exact
))
1021 if (probe
== base
&& exact
)
1022 base
= TREE_CHAIN (probe
);
1027 if (probe
== NULL_TREE
)
1030 return !exact
|| base
== NULL_TREE
|| length
== list_length (t1
);
1033 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1034 [] can match [size]. */
1037 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1046 /* The type of the array elements must be the same. */
1047 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1050 d1
= TYPE_DOMAIN (t1
);
1051 d2
= TYPE_DOMAIN (t2
);
1056 /* If one of the arrays is dimensionless, and the other has a
1057 dimension, they are of different types. However, it is valid to
1065 declarations for an array object can specify
1066 array types that differ by the presence or absence of a major
1067 array bound (_dcl.array_). */
1069 return allow_redeclaration
;
1071 /* Check that the dimensions are the same. */
1073 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1075 max1
= TYPE_MAX_VALUE (d1
);
1076 max2
= TYPE_MAX_VALUE (d2
);
1077 if (processing_template_decl
&& !abi_version_at_least (2)
1078 && !value_dependent_expression_p (max1
)
1079 && !value_dependent_expression_p (max2
))
1081 /* With abi-1 we do not fold non-dependent array bounds, (and
1082 consequently mangle them incorrectly). We must therefore
1083 fold them here, to verify the domains have the same
1089 if (!cp_tree_equal (max1
, max2
))
1095 /* Compare the relative position of T1 and T2 into their respective
1096 template parameter list.
1097 T1 and T2 must be template parameter types.
1098 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1101 comp_template_parms_position (tree t1
, tree t2
)
1103 gcc_assert (t1
&& t2
1104 && TREE_CODE (t1
) == TREE_CODE (t2
)
1105 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1106 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1107 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1109 if (TEMPLATE_TYPE_IDX (t1
) != TEMPLATE_TYPE_IDX (t2
)
1110 || TEMPLATE_TYPE_LEVEL (t1
) != TEMPLATE_TYPE_LEVEL (t2
)
1111 || (TEMPLATE_TYPE_PARAMETER_PACK (t1
)
1112 != TEMPLATE_TYPE_PARAMETER_PACK (t2
)))
1118 /* Subroutine of incompatible_dependent_types_p.
1119 Return the template parameter of the dependent type T.
1120 If T is a typedef, return the template parameters of
1121 the _decl_ of the typedef. T must be a dependent type. */
1124 get_template_parms_of_dependent_type (tree t
)
1126 tree tinfo
= NULL_TREE
, tparms
= NULL_TREE
;
1128 /* First, try the obvious case of getting the
1129 template info from T itself. */
1130 if ((tinfo
= get_template_info (t
)))
1132 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
1133 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (t
);
1134 else if (typedef_variant_p (t
)
1135 && !NAMESPACE_SCOPE_P (TYPE_NAME (t
)))
1136 tinfo
= get_template_info (DECL_CONTEXT (TYPE_NAME (t
)));
1137 /* If T is a TYPENAME_TYPE which context is a template type
1138 parameter, get the template parameters from that context. */
1139 else if (TYPE_CONTEXT (t
)
1140 && TREE_CODE (TYPE_CONTEXT (t
)) == TEMPLATE_TYPE_PARM
)
1141 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (TYPE_CONTEXT (t
));
1142 else if (TYPE_CONTEXT (t
)
1143 && !NAMESPACE_SCOPE_P (t
))
1144 tinfo
= get_template_info (TYPE_CONTEXT (t
));
1147 tparms
= DECL_TEMPLATE_PARMS (TI_TEMPLATE (tinfo
));
1152 /* Subroutine of structural_comptypes.
1153 Compare the dependent types T1 and T2.
1154 Return TRUE if we are sure they can't be equal, FALSE otherwise.
1155 The whole point of this function is to support cases where either T1 or
1156 T2 is a typedef. In those cases, we need to compare the template parameters
1157 of the _decl_ of the typedef. If those don't match then we know T1
1158 and T2 cannot be equal. */
1161 incompatible_dependent_types_p (tree t1
, tree t2
)
1163 tree tparms1
= NULL_TREE
, tparms2
= NULL_TREE
;
1164 bool t1_typedef_variant_p
, t2_typedef_variant_p
;
1166 if (!uses_template_parms (t1
) || !uses_template_parms (t2
))
1169 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
)
1171 /* If T1 and T2 don't have the same relative position in their
1172 template parameters set, they can't be equal. */
1173 if (!comp_template_parms_position (t1
, t2
))
1177 t1_typedef_variant_p
= typedef_variant_p (t1
);
1178 t2_typedef_variant_p
= typedef_variant_p (t2
);
1180 /* Either T1 or T2 must be a typedef. */
1181 if (!t1_typedef_variant_p
&& !t2_typedef_variant_p
)
1184 if (!t1_typedef_variant_p
|| !t2_typedef_variant_p
)
1185 /* Either T1 or T2 is not a typedef so we cannot compare the
1186 the template parms of the typedefs of T1 and T2.
1187 At this point, if the main variant type of T1 and T2 are equal
1188 it means the two types can't be incompatible, from the perspective
1189 of this function. */
1190 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1193 /* So if we reach this point, it means either T1 or T2 is a typedef variant.
1194 Let's compare their template parameters. */
1196 tparms1
= get_template_parms_of_dependent_type (t1
);
1197 tparms2
= get_template_parms_of_dependent_type (t2
);
1199 /* If T2 is a template type parm and if we could not get the template
1200 parms it belongs to, that means we have not finished parsing the
1201 full set of template parameters of the template declaration it
1202 belongs to yet. If we could get the template parms T1 belongs to,
1203 that mostly means T1 and T2 belongs to templates that are
1204 different and incompatible. */
1205 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
1206 && (tparms1
== NULL_TREE
|| tparms2
== NULL_TREE
)
1207 && tparms1
!= tparms2
)
1210 if (tparms1
== NULL_TREE
1211 || tparms2
== NULL_TREE
1212 || tparms1
== tparms2
)
1215 /* And now compare the mighty template parms! */
1216 return !comp_template_parms (tparms1
, tparms2
);
1219 /* Subroutine in comptypes. */
1222 structural_comptypes (tree t1
, tree t2
, int strict
)
1227 /* Suppress errors caused by previously reported errors. */
1228 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1231 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1233 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1234 current instantiation. */
1235 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1236 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1238 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1239 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1241 if (TYPE_PTRMEMFUNC_P (t1
))
1242 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1243 if (TYPE_PTRMEMFUNC_P (t2
))
1244 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1246 /* Different classes of types can't be compatible. */
1247 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1250 /* Qualifiers must match. For array types, we will check when we
1251 recur on the array element types. */
1252 if (TREE_CODE (t1
) != ARRAY_TYPE
1253 && cp_type_quals (t1
) != cp_type_quals (t2
))
1255 if (TREE_CODE (t1
) == FUNCTION_TYPE
1256 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1258 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1261 /* If T1 and T2 are dependent typedefs then check upfront that
1262 the template parameters of their typedef DECLs match before
1263 going down checking their subtypes. */
1264 if (incompatible_dependent_types_p (t1
, t2
))
1267 /* Allow for two different type nodes which have essentially the same
1268 definition. Note that we already checked for equality of the type
1269 qualifiers (just above). */
1271 if (TREE_CODE (t1
) != ARRAY_TYPE
1272 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1276 /* Compare the types. Break out if they could be the same. */
1277 switch (TREE_CODE (t1
))
1281 /* All void and bool types are the same. */
1285 case FIXED_POINT_TYPE
:
1287 /* With these nodes, we can't determine type equivalence by
1288 looking at what is stored in the nodes themselves, because
1289 two nodes might have different TYPE_MAIN_VARIANTs but still
1290 represent the same type. For example, wchar_t and int could
1291 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1292 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1293 and are distinct types. On the other hand, int and the
1296 typedef int INT __attribute((may_alias));
1298 have identical properties, different TYPE_MAIN_VARIANTs, but
1299 represent the same type. The canonical type system keeps
1300 track of equivalence in this case, so we fall back on it. */
1301 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1303 case TEMPLATE_TEMPLATE_PARM
:
1304 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1305 if (!comp_template_parms_position (t1
, t2
))
1307 if (!comp_template_parms
1308 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1309 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1311 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1313 /* Don't check inheritance. */
1314 strict
= COMPARE_STRICT
;
1319 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1320 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1321 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1322 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1325 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1327 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1333 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1334 strict
& ~COMPARE_REDECLARATION
))
1336 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1340 case REFERENCE_TYPE
:
1341 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1343 /* fall through to checks for pointer types */
1346 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1347 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
)
1348 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1354 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1356 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1361 /* Target types must match incl. qualifiers. */
1362 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1366 case TEMPLATE_TYPE_PARM
:
1367 /* If incompatible_dependent_types_p called earlier didn't decide
1368 T1 and T2 were different, they might be equal. */
1372 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1373 TYPENAME_TYPE_FULLNAME (t2
)))
1375 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1379 case UNBOUND_CLASS_TEMPLATE
:
1380 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1382 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1387 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1392 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1393 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1397 case TYPE_PACK_EXPANSION
:
1398 return same_type_p (PACK_EXPANSION_PATTERN (t1
),
1399 PACK_EXPANSION_PATTERN (t2
));
1402 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1403 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1404 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1405 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1406 || (DECLTYPE_FOR_LAMBDA_RETURN (t1
)
1407 != DECLTYPE_FOR_LAMBDA_RETURN (t2
))
1408 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1409 DECLTYPE_TYPE_EXPR (t2
)))
1417 /* If we get here, we know that from a target independent POV the
1418 types are the same. Make sure the target attributes are also
1420 return targetm
.comp_type_attributes (t1
, t2
);
1423 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1424 is a bitwise-or of the COMPARE_* flags. */
1427 comptypes (tree t1
, tree t2
, int strict
)
1429 if (strict
== COMPARE_STRICT
)
1434 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1437 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1438 /* At least one of the types requires structural equality, so
1439 perform a deep check. */
1440 return structural_comptypes (t1
, t2
, strict
);
1442 #ifdef ENABLE_CHECKING
1443 if (USE_CANONICAL_TYPES
)
1445 bool result
= structural_comptypes (t1
, t2
, strict
);
1447 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1448 /* The two types are structurally equivalent, but their
1449 canonical types were different. This is a failure of the
1450 canonical type propagation code.*/
1452 ("canonical types differ for identical types %T and %T",
1454 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1455 /* Two types are structurally different, but the canonical
1456 types are the same. This means we were over-eager in
1457 assigning canonical types. */
1459 ("same canonical type node for different types %T and %T",
1465 if (USE_CANONICAL_TYPES
)
1466 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1469 return structural_comptypes (t1
, t2
, strict
);
1471 else if (strict
== COMPARE_STRUCTURAL
)
1472 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1474 return structural_comptypes (t1
, t2
, strict
);
1477 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1480 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1482 int q1
= cp_type_quals (type1
);
1483 int q2
= cp_type_quals (type2
);
1485 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1486 return (q1
& q2
) == q2
;
1489 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1490 more cv-qualified that TYPE1, and 0 otherwise. */
1493 comp_cv_qualification (const_tree type1
, const_tree type2
)
1495 int q1
= cp_type_quals (type1
);
1496 int q2
= cp_type_quals (type2
);
1501 if ((q1
& q2
) == q2
)
1503 else if ((q1
& q2
) == q1
)
1509 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1510 subset of the cv-qualification signature of TYPE2, and the types
1511 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1514 comp_cv_qual_signature (tree type1
, tree type2
)
1516 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1518 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1524 /* Subroutines of `comptypes'. */
1526 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1527 equivalent in the sense that functions with those parameter types
1528 can have equivalent types. The two lists must be equivalent,
1529 element by element. */
1532 compparms (const_tree parms1
, const_tree parms2
)
1536 /* An unspecified parmlist matches any specified parmlist
1537 whose argument types don't need default promotions. */
1539 for (t1
= parms1
, t2
= parms2
;
1541 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1543 /* If one parmlist is shorter than the other,
1544 they fail to match. */
1547 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1554 /* Process a sizeof or alignof expression where the operand is a
1558 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1563 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1564 if (type
== error_mark_node
)
1565 return error_mark_node
;
1567 type
= non_reference (type
);
1568 if (TREE_CODE (type
) == METHOD_TYPE
)
1571 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
1572 "invalid application of %qs to a member function",
1573 operator_name_info
[(int) op
].name
);
1574 value
= size_one_node
;
1577 dependent_p
= dependent_type_p (type
);
1579 complete_type (type
);
1581 /* VLA types will have a non-constant size. In the body of an
1582 uninstantiated template, we don't need to try to compute the
1583 value, because the sizeof expression is not an integral
1584 constant expression in that case. And, if we do try to
1585 compute the value, we'll likely end up with SAVE_EXPRs, which
1586 the template substitution machinery does not expect to see. */
1587 || (processing_template_decl
1588 && COMPLETE_TYPE_P (type
)
1589 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1591 value
= build_min (op
, size_type_node
, type
);
1592 TREE_READONLY (value
) = 1;
1596 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1601 /* Return the size of the type, without producing any warnings for
1602 types whose size cannot be taken. This routine should be used only
1603 in some other routine that has already produced a diagnostic about
1604 using the size of such a type. */
1606 cxx_sizeof_nowarn (tree type
)
1608 if (TREE_CODE (type
) == FUNCTION_TYPE
1609 || TREE_CODE (type
) == VOID_TYPE
1610 || TREE_CODE (type
) == ERROR_MARK
)
1611 return size_one_node
;
1612 else if (!COMPLETE_TYPE_P (type
))
1613 return size_zero_node
;
1615 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1618 /* Process a sizeof expression where the operand is an expression. */
1621 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1623 if (e
== error_mark_node
)
1624 return error_mark_node
;
1626 if (processing_template_decl
)
1628 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1629 TREE_SIDE_EFFECTS (e
) = 0;
1630 TREE_READONLY (e
) = 1;
1635 /* To get the size of a static data member declared as an array of
1636 unknown bound, we need to instantiate it. */
1637 if (TREE_CODE (e
) == VAR_DECL
1638 && VAR_HAD_UNKNOWN_BOUND (e
)
1639 && DECL_TEMPLATE_INSTANTIATION (e
))
1640 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1642 e
= mark_type_use (e
);
1644 if (TREE_CODE (e
) == COMPONENT_REF
1645 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1646 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1648 if (complain
& tf_error
)
1649 error ("invalid application of %<sizeof%> to a bit-field");
1651 return error_mark_node
;
1654 else if (is_overloaded_fn (e
))
1656 if (complain
& tf_error
)
1657 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1660 return error_mark_node
;
1663 else if (type_unknown_p (e
))
1665 if (complain
& tf_error
)
1666 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1668 return error_mark_node
;
1674 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1677 /* Implement the __alignof keyword: Return the minimum required
1678 alignment of E, measured in bytes. For VAR_DECL's and
1679 FIELD_DECL's return DECL_ALIGN (which can be set from an
1680 "aligned" __attribute__ specification). */
1683 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1687 if (e
== error_mark_node
)
1688 return error_mark_node
;
1690 if (processing_template_decl
)
1692 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1693 TREE_SIDE_EFFECTS (e
) = 0;
1694 TREE_READONLY (e
) = 1;
1699 e
= mark_type_use (e
);
1701 if (TREE_CODE (e
) == VAR_DECL
)
1702 t
= size_int (DECL_ALIGN_UNIT (e
));
1703 else if (TREE_CODE (e
) == COMPONENT_REF
1704 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1705 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1707 if (complain
& tf_error
)
1708 error ("invalid application of %<__alignof%> to a bit-field");
1710 return error_mark_node
;
1713 else if (TREE_CODE (e
) == COMPONENT_REF
1714 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1715 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1716 else if (is_overloaded_fn (e
))
1718 if (complain
& tf_error
)
1719 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1722 return error_mark_node
;
1723 if (TREE_CODE (e
) == FUNCTION_DECL
)
1724 t
= size_int (DECL_ALIGN_UNIT (e
));
1728 else if (type_unknown_p (e
))
1730 if (complain
& tf_error
)
1731 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1733 return error_mark_node
;
1737 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1738 complain
& tf_error
);
1740 return fold_convert (size_type_node
, t
);
1743 /* Process a sizeof or alignof expression E with code OP where the operand
1744 is an expression. */
1747 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1749 if (op
== SIZEOF_EXPR
)
1750 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1752 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1755 /* EXPR is being used in a context that is not a function call.
1760 The expression can be used only as the left-hand operand of a
1761 member function call.
1763 [expr.mptr.operator]
1765 If the result of .* or ->* is a function, then that result can be
1766 used only as the operand for the function call operator ().
1768 by issuing an error message if appropriate. Returns true iff EXPR
1769 violates these rules. */
1772 invalid_nonstatic_memfn_p (const_tree expr
, tsubst_flags_t complain
)
1774 if (expr
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1776 if (complain
& tf_error
)
1777 error ("invalid use of non-static member function");
1783 /* If EXP is a reference to a bitfield, and the type of EXP does not
1784 match the declared type of the bitfield, return the declared type
1785 of the bitfield. Otherwise, return NULL_TREE. */
1788 is_bitfield_expr_with_lowered_type (const_tree exp
)
1790 switch (TREE_CODE (exp
))
1793 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1794 ? TREE_OPERAND (exp
, 1)
1795 : TREE_OPERAND (exp
, 0)))
1797 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1800 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1804 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1810 field
= TREE_OPERAND (exp
, 1);
1811 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1813 if (same_type_ignoring_top_level_qualifiers_p
1814 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1816 return DECL_BIT_FIELD_TYPE (field
);
1820 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1821 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1822 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1830 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1831 bitfield with a lowered type, the type of EXP is returned, rather
1835 unlowered_expr_type (const_tree exp
)
1839 type
= is_bitfield_expr_with_lowered_type (exp
);
1841 type
= TREE_TYPE (exp
);
1846 /* Perform the conversions in [expr] that apply when an lvalue appears
1847 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1848 function-to-pointer conversions. In addition, manifest constants
1849 are replaced by their values, and bitfield references are converted
1850 to their declared types. Note that this function does not perform the
1851 lvalue-to-rvalue conversion for class types. If you need that conversion
1852 to for class types, then you probably need to use force_rvalue.
1854 Although the returned value is being used as an rvalue, this
1855 function does not wrap the returned expression in a
1856 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1857 that the return value is no longer an lvalue. */
1860 decay_conversion (tree exp
)
1863 enum tree_code code
;
1865 type
= TREE_TYPE (exp
);
1866 if (type
== error_mark_node
)
1867 return error_mark_node
;
1869 exp
= mark_rvalue_use (exp
);
1871 exp
= resolve_nondeduced_context (exp
);
1872 if (type_unknown_p (exp
))
1874 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1875 return error_mark_node
;
1878 exp
= decl_constant_value (exp
);
1879 if (error_operand_p (exp
))
1880 return error_mark_node
;
1882 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1883 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1884 code
= TREE_CODE (type
);
1885 if (code
== VOID_TYPE
)
1887 error ("void value not ignored as it ought to be");
1888 return error_mark_node
;
1890 if (invalid_nonstatic_memfn_p (exp
, tf_warning_or_error
))
1891 return error_mark_node
;
1892 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1893 return cp_build_unary_op (ADDR_EXPR
, exp
, 0, tf_warning_or_error
);
1894 if (code
== ARRAY_TYPE
)
1899 if (TREE_CODE (exp
) == INDIRECT_REF
)
1900 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1901 TREE_OPERAND (exp
, 0));
1903 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1905 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1906 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1907 TREE_OPERAND (exp
, 0), op1
);
1911 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1913 error ("invalid use of non-lvalue array");
1914 return error_mark_node
;
1917 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1919 if (TREE_CODE (exp
) == VAR_DECL
)
1921 if (!cxx_mark_addressable (exp
))
1922 return error_mark_node
;
1923 adr
= build_nop (ptrtype
, build_address (exp
));
1926 /* This way is better for a COMPONENT_REF since it can
1927 simplify the offset for a component. */
1928 adr
= cp_build_unary_op (ADDR_EXPR
, exp
, 1, tf_warning_or_error
);
1929 return cp_convert (ptrtype
, adr
);
1932 /* If a bitfield is used in a context where integral promotion
1933 applies, then the caller is expected to have used
1934 default_conversion. That function promotes bitfields correctly
1935 before calling this function. At this point, if we have a
1936 bitfield referenced, we may assume that is not subject to
1937 promotion, and that, therefore, the type of the resulting rvalue
1938 is the declared type of the bitfield. */
1939 exp
= convert_bitfield_to_declared_type (exp
);
1941 /* We do not call rvalue() here because we do not want to wrap EXP
1942 in a NON_LVALUE_EXPR. */
1946 Non-class rvalues always have cv-unqualified types. */
1947 type
= TREE_TYPE (exp
);
1948 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
1949 exp
= build_nop (cv_unqualified (type
), exp
);
1954 /* Perform preparatory conversions, as part of the "usual arithmetic
1955 conversions". In particular, as per [expr]:
1957 Whenever an lvalue expression appears as an operand of an
1958 operator that expects the rvalue for that operand, the
1959 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1960 standard conversions are applied to convert the expression to an
1963 In addition, we perform integral promotions here, as those are
1964 applied to both operands to a binary operator before determining
1965 what additional conversions should apply. */
1968 default_conversion (tree exp
)
1970 /* Check for target-specific promotions. */
1971 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
1973 exp
= cp_convert (promoted_type
, exp
);
1974 /* Perform the integral promotions first so that bitfield
1975 expressions (which may promote to "int", even if the bitfield is
1976 declared "unsigned") are promoted correctly. */
1977 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
1978 exp
= perform_integral_promotions (exp
);
1979 /* Perform the other conversions. */
1980 exp
= decay_conversion (exp
);
1985 /* EXPR is an expression with an integral or enumeration type.
1986 Perform the integral promotions in [conv.prom], and return the
1990 perform_integral_promotions (tree expr
)
1995 expr
= mark_rvalue_use (expr
);
1999 If the bitfield has an enumerated type, it is treated as any
2000 other value of that type for promotion purposes. */
2001 type
= is_bitfield_expr_with_lowered_type (expr
);
2002 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
2003 type
= TREE_TYPE (expr
);
2004 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
2005 promoted_type
= type_promotes_to (type
);
2006 if (type
!= promoted_type
)
2007 expr
= cp_convert (promoted_type
, expr
);
2011 /* Returns nonzero iff exp is a STRING_CST or the result of applying
2012 decay_conversion to one. */
2015 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
2019 if (TREE_CODE (totype
) != POINTER_TYPE
)
2022 t
= TREE_TYPE (totype
);
2023 if (!same_type_p (t
, char_type_node
)
2024 && !same_type_p (t
, char16_type_node
)
2025 && !same_type_p (t
, char32_type_node
)
2026 && !same_type_p (t
, wchar_type_node
))
2029 if (TREE_CODE (exp
) == STRING_CST
)
2031 /* Make sure that we don't try to convert between char and wide chars. */
2032 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
2037 /* Is this a string constant which has decayed to 'const char *'? */
2038 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
2039 if (!same_type_p (TREE_TYPE (exp
), t
))
2042 if (TREE_CODE (exp
) != ADDR_EXPR
2043 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2047 /* This warning is not very useful, as it complains about printf. */
2049 warning (OPT_Wwrite_strings
,
2050 "deprecated conversion from string constant to %qT",
2056 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2057 can, for example, use as an lvalue. This code used to be in
2058 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2059 expressions, where we're dealing with aggregates. But now it's again only
2060 called from unary_complex_lvalue. The case (in particular) that led to
2061 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2065 rationalize_conditional_expr (enum tree_code code
, tree t
,
2066 tsubst_flags_t complain
)
2068 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2069 the first operand is always the one to be used if both operands
2070 are equal, so we know what conditional expression this used to be. */
2071 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2073 tree op0
= TREE_OPERAND (t
, 0);
2074 tree op1
= TREE_OPERAND (t
, 1);
2076 /* The following code is incorrect if either operand side-effects. */
2077 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2078 && !TREE_SIDE_EFFECTS (op1
));
2080 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
2081 ? LE_EXPR
: GE_EXPR
),
2082 op0
, TREE_CODE (op0
),
2083 op1
, TREE_CODE (op1
),
2084 /*overloaded_p=*/NULL
,
2086 cp_build_unary_op (code
, op0
, 0, complain
),
2087 cp_build_unary_op (code
, op1
, 0, complain
),
2092 build_conditional_expr (TREE_OPERAND (t
, 0),
2093 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2095 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2100 /* Given the TYPE of an anonymous union field inside T, return the
2101 FIELD_DECL for the field. If not found return NULL_TREE. Because
2102 anonymous unions can nest, we must also search all anonymous unions
2103 that are directly reachable. */
2106 lookup_anon_field (tree t
, tree type
)
2110 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
2112 if (TREE_STATIC (field
))
2114 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2117 /* If we find it directly, return the field. */
2118 if (DECL_NAME (field
) == NULL_TREE
2119 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2124 /* Otherwise, it could be nested, search harder. */
2125 if (DECL_NAME (field
) == NULL_TREE
2126 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2128 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2136 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2137 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2138 non-NULL, it indicates the path to the base used to name MEMBER.
2139 If PRESERVE_REFERENCE is true, the expression returned will have
2140 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2141 returned will have the type referred to by the reference.
2143 This function does not perform access control; that is either done
2144 earlier by the parser when the name of MEMBER is resolved to MEMBER
2145 itself, or later when overload resolution selects one of the
2146 functions indicated by MEMBER. */
2149 build_class_member_access_expr (tree object
, tree member
,
2150 tree access_path
, bool preserve_reference
,
2151 tsubst_flags_t complain
)
2155 tree result
= NULL_TREE
;
2157 if (error_operand_p (object
) || error_operand_p (member
))
2158 return error_mark_node
;
2160 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2164 The type of the first expression shall be "class object" (of a
2166 object_type
= TREE_TYPE (object
);
2167 if (!currently_open_class (object_type
)
2168 && !complete_type_or_else (object_type
, object
))
2169 return error_mark_node
;
2170 if (!CLASS_TYPE_P (object_type
))
2172 if (complain
& tf_error
)
2173 error ("request for member %qD in %qE, which is of non-class type %qT",
2174 member
, object
, object_type
);
2175 return error_mark_node
;
2178 /* The standard does not seem to actually say that MEMBER must be a
2179 member of OBJECT_TYPE. However, that is clearly what is
2181 if (DECL_P (member
))
2183 member_scope
= DECL_CLASS_CONTEXT (member
);
2185 if (TREE_DEPRECATED (member
))
2186 warn_deprecated_use (member
, NULL_TREE
);
2189 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2190 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2191 presently be the anonymous union. Go outwards until we find a
2192 type related to OBJECT_TYPE. */
2193 while (ANON_AGGR_TYPE_P (member_scope
)
2194 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2196 member_scope
= TYPE_CONTEXT (member_scope
);
2197 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2199 if (complain
& tf_error
)
2201 if (TREE_CODE (member
) == FIELD_DECL
)
2202 error ("invalid use of nonstatic data member %qE", member
);
2204 error ("%qD is not a member of %qT", member
, object_type
);
2206 return error_mark_node
;
2209 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2210 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2211 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2213 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2215 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2218 /* In [expr.ref], there is an explicit list of the valid choices for
2219 MEMBER. We check for each of those cases here. */
2220 if (TREE_CODE (member
) == VAR_DECL
)
2222 /* A static data member. */
2224 mark_exp_read (object
);
2225 /* If OBJECT has side-effects, they are supposed to occur. */
2226 if (TREE_SIDE_EFFECTS (object
))
2227 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2229 else if (TREE_CODE (member
) == FIELD_DECL
)
2231 /* A non-static data member. */
2236 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
2237 && integer_zerop (TREE_OPERAND (object
, 0)));
2239 /* Convert OBJECT to the type of MEMBER. */
2240 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2241 TYPE_MAIN_VARIANT (member_scope
)))
2246 binfo
= lookup_base (access_path
? access_path
: object_type
,
2247 member_scope
, ba_unique
, &kind
);
2248 if (binfo
== error_mark_node
)
2249 return error_mark_node
;
2251 /* It is invalid to try to get to a virtual base of a
2252 NULL object. The most common cause is invalid use of
2254 if (null_object_p
&& kind
== bk_via_virtual
)
2256 if (complain
& tf_error
)
2258 error ("invalid access to non-static data member %qD of "
2261 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2263 return error_mark_node
;
2266 /* Convert to the base. */
2267 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2269 /* If we found the base successfully then we should be able
2270 to convert to it successfully. */
2271 gcc_assert (object
!= error_mark_node
);
2274 /* Complain about other invalid uses of offsetof, even though they will
2275 give the right answer. Note that we complain whether or not they
2276 actually used the offsetof macro, since there's no way to know at this
2277 point. So we just give a warning, instead of a pedwarn. */
2278 /* Do not produce this warning for base class field references, because
2279 we know for a fact that didn't come from offsetof. This does occur
2280 in various testsuite cases where a null object is passed where a
2281 vtable access is required. */
2282 if (null_object_p
&& warn_invalid_offsetof
2283 && CLASSTYPE_NON_STD_LAYOUT (object_type
)
2284 && !DECL_FIELD_IS_BASE (member
)
2285 && cp_unevaluated_operand
== 0
2286 && (complain
& tf_warning
))
2288 warning (OPT_Winvalid_offsetof
,
2289 "invalid access to non-static data member %qD "
2290 " of NULL object", member
);
2291 warning (OPT_Winvalid_offsetof
,
2292 "(perhaps the %<offsetof%> macro was used incorrectly)");
2295 /* If MEMBER is from an anonymous aggregate, we have converted
2296 OBJECT so that it refers to the class containing the
2297 anonymous union. Generate a reference to the anonymous union
2298 itself, and recur to find MEMBER. */
2299 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2300 /* When this code is called from build_field_call, the
2301 object already has the type of the anonymous union.
2302 That is because the COMPONENT_REF was already
2303 constructed, and was then disassembled before calling
2304 build_field_call. After the function-call code is
2305 cleaned up, this waste can be eliminated. */
2306 && (!same_type_ignoring_top_level_qualifiers_p
2307 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2309 tree anonymous_union
;
2311 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2312 DECL_CONTEXT (member
));
2313 object
= build_class_member_access_expr (object
,
2315 /*access_path=*/NULL_TREE
,
2320 /* Compute the type of the field, as described in [expr.ref]. */
2321 type_quals
= TYPE_UNQUALIFIED
;
2322 member_type
= TREE_TYPE (member
);
2323 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2325 type_quals
= (cp_type_quals (member_type
)
2326 | cp_type_quals (object_type
));
2328 /* A field is const (volatile) if the enclosing object, or the
2329 field itself, is const (volatile). But, a mutable field is
2330 not const, even within a const object. */
2331 if (DECL_MUTABLE_P (member
))
2332 type_quals
&= ~TYPE_QUAL_CONST
;
2333 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2336 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
2338 result
= fold_if_not_in_template (result
);
2340 /* Mark the expression const or volatile, as appropriate. Even
2341 though we've dealt with the type above, we still have to mark the
2342 expression itself. */
2343 if (type_quals
& TYPE_QUAL_CONST
)
2344 TREE_READONLY (result
) = 1;
2345 if (type_quals
& TYPE_QUAL_VOLATILE
)
2346 TREE_THIS_VOLATILE (result
) = 1;
2348 else if (BASELINK_P (member
))
2350 /* The member is a (possibly overloaded) member function. */
2354 /* If the MEMBER is exactly one static member function, then we
2355 know the type of the expression. Otherwise, we must wait
2356 until overload resolution has been performed. */
2357 functions
= BASELINK_FUNCTIONS (member
);
2358 if (TREE_CODE (functions
) == FUNCTION_DECL
2359 && DECL_STATIC_FUNCTION_P (functions
))
2360 type
= TREE_TYPE (functions
);
2362 type
= unknown_type_node
;
2363 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2364 base. That will happen when the function is called. */
2365 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2367 else if (TREE_CODE (member
) == CONST_DECL
)
2369 /* The member is an enumerator. */
2371 /* If OBJECT has side-effects, they are supposed to occur. */
2372 if (TREE_SIDE_EFFECTS (object
))
2373 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2378 if (complain
& tf_error
)
2379 error ("invalid use of %qD", member
);
2380 return error_mark_node
;
2383 if (!preserve_reference
)
2386 If E2 is declared to have type "reference to T", then ... the
2387 type of E1.E2 is T. */
2388 result
= convert_from_reference (result
);
2393 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2394 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2397 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2399 tree object_type
= TREE_TYPE (object
);
2400 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2403 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2405 error ("qualified type %qT does not match destructor name ~%qT",
2407 return error_mark_node
;
2409 if (TREE_CODE (dtor_type
) == IDENTIFIER_NODE
)
2411 /* In a template, names we can't find a match for are still accepted
2412 destructor names, and we check them here. */
2413 if (check_dtor_name (object_type
, dtor_type
))
2414 dtor_type
= object_type
;
2417 error ("object type %qT does not match destructor name ~%qT",
2418 object_type
, dtor_type
);
2419 return error_mark_node
;
2423 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2425 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2426 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2427 return error_mark_node
;
2429 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2430 /*protect=*/1, /*want_type=*/false);
2431 expr
= (adjust_result_of_qualified_name_lookup
2432 (expr
, dtor_type
, object_type
));
2436 /* An expression of the form "A::template B" has been resolved to
2437 DECL. Issue a diagnostic if B is not a template or template
2441 check_template_keyword (tree decl
)
2443 /* The standard says:
2447 If a name prefixed by the keyword template is not a member
2448 template, the program is ill-formed.
2450 DR 228 removed the restriction that the template be a member
2453 DR 96, if accepted would add the further restriction that explicit
2454 template arguments must be provided if the template keyword is
2455 used, but, as of 2005-10-16, that DR is still in "drafting". If
2456 this DR is accepted, then the semantic checks here can be
2457 simplified, as the entity named must in fact be a template
2458 specialization, rather than, as at present, a set of overloaded
2459 functions containing at least one template function. */
2460 if (TREE_CODE (decl
) != TEMPLATE_DECL
2461 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2463 if (!is_overloaded_fn (decl
))
2464 permerror (input_location
, "%qD is not a template", decl
);
2469 if (BASELINK_P (fns
))
2470 fns
= BASELINK_FUNCTIONS (fns
);
2473 tree fn
= OVL_CURRENT (fns
);
2474 if (TREE_CODE (fn
) == TEMPLATE_DECL
2475 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2477 if (TREE_CODE (fn
) == FUNCTION_DECL
2478 && DECL_USE_TEMPLATE (fn
)
2479 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2481 fns
= OVL_NEXT (fns
);
2484 permerror (input_location
, "%qD is not a template", decl
);
2489 /* This function is called by the parser to process a class member
2490 access expression of the form OBJECT.NAME. NAME is a node used by
2491 the parser to represent a name; it is not yet a DECL. It may,
2492 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2493 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2494 there is no reason to do the lookup twice, so the parser keeps the
2495 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2496 be a template via the use of the "A::template B" syntax. */
2499 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2500 tsubst_flags_t complain
)
2505 tree access_path
= NULL_TREE
;
2506 tree orig_object
= object
;
2507 tree orig_name
= name
;
2509 if (object
== error_mark_node
|| name
== error_mark_node
)
2510 return error_mark_node
;
2512 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2513 if (!objc_is_public (object
, name
))
2514 return error_mark_node
;
2516 object_type
= TREE_TYPE (object
);
2518 if (processing_template_decl
)
2520 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2521 dependent_type_p (object_type
)
2522 /* If NAME is just an IDENTIFIER_NODE, then the expression
2524 || TREE_CODE (object
) == IDENTIFIER_NODE
2525 /* If NAME is "f<args>", where either 'f' or 'args' is
2526 dependent, then the expression is dependent. */
2527 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2528 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2529 TREE_OPERAND (name
, 1)))
2530 /* If NAME is "T::X" where "T" is dependent, then the
2531 expression is dependent. */
2532 || (TREE_CODE (name
) == SCOPE_REF
2533 && TYPE_P (TREE_OPERAND (name
, 0))
2534 && dependent_type_p (TREE_OPERAND (name
, 0))))
2535 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2536 object
= build_non_dependent_expr (object
);
2541 The type of the first expression shall be "class object" (of a
2543 if (!currently_open_class (object_type
)
2544 && !complete_type_or_else (object_type
, object
))
2545 return error_mark_node
;
2546 if (!CLASS_TYPE_P (object_type
))
2548 if (complain
& tf_error
)
2549 error ("request for member %qD in %qE, which is of non-class type %qT",
2550 name
, object
, object_type
);
2551 return error_mark_node
;
2554 if (BASELINK_P (name
))
2555 /* A member function that has already been looked up. */
2559 bool is_template_id
= false;
2560 tree template_args
= NULL_TREE
;
2563 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2565 is_template_id
= true;
2566 template_args
= TREE_OPERAND (name
, 1);
2567 name
= TREE_OPERAND (name
, 0);
2569 if (TREE_CODE (name
) == OVERLOAD
)
2570 name
= DECL_NAME (get_first_fn (name
));
2571 else if (DECL_P (name
))
2572 name
= DECL_NAME (name
);
2575 if (TREE_CODE (name
) == SCOPE_REF
)
2577 /* A qualified name. The qualifying class or namespace `S'
2578 has already been looked up; it is either a TYPE or a
2580 scope
= TREE_OPERAND (name
, 0);
2581 name
= TREE_OPERAND (name
, 1);
2583 /* If SCOPE is a namespace, then the qualified name does not
2584 name a member of OBJECT_TYPE. */
2585 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2587 if (complain
& tf_error
)
2588 error ("%<%D::%D%> is not a member of %qT",
2589 scope
, name
, object_type
);
2590 return error_mark_node
;
2593 gcc_assert (CLASS_TYPE_P (scope
));
2594 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2595 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2597 if (constructor_name_p (name
, scope
))
2599 if (complain
& tf_error
)
2600 error ("cannot call constructor %<%T::%D%> directly",
2602 return error_mark_node
;
2605 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2606 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2607 if (access_path
== error_mark_node
)
2608 return error_mark_node
;
2611 if (complain
& tf_error
)
2612 error ("%qT is not a base of %qT", scope
, object_type
);
2613 return error_mark_node
;
2619 access_path
= object_type
;
2622 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2623 member
= lookup_destructor (object
, scope
, name
);
2626 /* Look up the member. */
2627 member
= lookup_member (access_path
, name
, /*protect=*/1,
2628 /*want_type=*/false);
2629 if (member
== NULL_TREE
)
2631 if (complain
& tf_error
)
2632 error ("%qD has no member named %qE", object_type
, name
);
2633 return error_mark_node
;
2635 if (member
== error_mark_node
)
2636 return error_mark_node
;
2641 tree templ
= member
;
2643 if (BASELINK_P (templ
))
2644 templ
= lookup_template_function (templ
, template_args
);
2647 if (complain
& tf_error
)
2648 error ("%qD is not a member template function", name
);
2649 return error_mark_node
;
2654 if (TREE_DEPRECATED (member
))
2655 warn_deprecated_use (member
, NULL_TREE
);
2658 check_template_keyword (member
);
2660 expr
= build_class_member_access_expr (object
, member
, access_path
,
2661 /*preserve_reference=*/false,
2663 if (processing_template_decl
&& expr
!= error_mark_node
)
2665 if (BASELINK_P (member
))
2667 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2668 BASELINK_QUALIFIED_P (member
) = 1;
2671 return build_min_non_dep (COMPONENT_REF
, expr
,
2672 orig_object
, orig_name
,
2679 /* Return an expression for the MEMBER_NAME field in the internal
2680 representation of PTRMEM, a pointer-to-member function. (Each
2681 pointer-to-member function type gets its own RECORD_TYPE so it is
2682 more convenient to access the fields by name than by FIELD_DECL.)
2683 This routine converts the NAME to a FIELD_DECL and then creates the
2684 node for the complete expression. */
2687 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2693 /* This code is a stripped down version of
2694 build_class_member_access_expr. It does not work to use that
2695 routine directly because it expects the object to be of class
2697 ptrmem_type
= TREE_TYPE (ptrmem
);
2698 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2699 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2700 /*want_type=*/false);
2701 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2702 cp_type_quals (ptrmem_type
));
2703 return fold_build3_loc (input_location
,
2704 COMPONENT_REF
, member_type
,
2705 ptrmem
, member
, NULL_TREE
);
2708 /* Given an expression PTR for a pointer, return an expression
2709 for the value pointed to.
2710 ERRORSTRING is the name of the operator to appear in error messages.
2712 This function may need to overload OPERATOR_FNNAME.
2713 Must also handle REFERENCE_TYPEs for C++. */
2716 build_x_indirect_ref (tree expr
, ref_operator errorstring
,
2717 tsubst_flags_t complain
)
2719 tree orig_expr
= expr
;
2722 if (processing_template_decl
)
2724 /* Retain the type if we know the operand is a pointer so that
2725 describable_type doesn't make auto deduction break. */
2726 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2727 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2728 if (type_dependent_expression_p (expr
))
2729 return build_min_nt (INDIRECT_REF
, expr
);
2730 expr
= build_non_dependent_expr (expr
);
2733 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2734 NULL_TREE
, /*overloaded_p=*/NULL
, complain
);
2736 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2738 if (processing_template_decl
&& rval
!= error_mark_node
)
2739 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2744 /* Helper function called from c-common. */
2746 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2747 tree ptr
, ref_operator errorstring
)
2749 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2753 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2754 tsubst_flags_t complain
)
2758 if (ptr
== error_mark_node
)
2759 return error_mark_node
;
2761 if (ptr
== current_class_ptr
)
2762 return current_class_ref
;
2764 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2765 ? ptr
: decay_conversion (ptr
));
2766 type
= TREE_TYPE (pointer
);
2768 if (POINTER_TYPE_P (type
))
2772 If the type of the expression is "pointer to T," the type
2773 of the result is "T." */
2774 tree t
= TREE_TYPE (type
);
2776 if (CONVERT_EXPR_P (ptr
)
2777 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2779 /* If a warning is issued, mark it to avoid duplicates from
2780 the backend. This only needs to be done at
2781 warn_strict_aliasing > 2. */
2782 if (warn_strict_aliasing
> 2)
2783 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2784 type
, TREE_OPERAND (ptr
, 0)))
2785 TREE_NO_WARNING (ptr
) = 1;
2788 if (VOID_TYPE_P (t
))
2790 /* A pointer to incomplete type (other than cv void) can be
2791 dereferenced [expr.unary.op]/1 */
2792 if (complain
& tf_error
)
2793 error ("%qT is not a pointer-to-object type", type
);
2794 return error_mark_node
;
2796 else if (TREE_CODE (pointer
) == ADDR_EXPR
2797 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2798 /* The POINTER was something like `&x'. We simplify `*&x' to
2800 return TREE_OPERAND (pointer
, 0);
2803 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2805 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2806 so that we get the proper error message if the result is used
2807 to assign to. Also, &* is supposed to be a no-op. */
2808 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2809 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2810 TREE_SIDE_EFFECTS (ref
)
2811 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2815 else if (!(complain
& tf_error
))
2816 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2818 /* `pointer' won't be an error_mark_node if we were given a
2819 pointer to member, so it's cool to check for this here. */
2820 else if (TYPE_PTR_TO_MEMBER_P (type
))
2821 switch (errorstring
)
2823 case RO_ARRAY_INDEXING
:
2824 error ("invalid use of array indexing on pointer to member");
2827 error ("invalid use of unary %<*%> on pointer to member");
2829 case RO_IMPLICIT_CONVERSION
:
2830 error ("invalid use of implicit conversion on pointer to member");
2835 else if (pointer
!= error_mark_node
)
2836 switch (errorstring
)
2839 error ("invalid type argument");
2841 case RO_ARRAY_INDEXING
:
2842 error ("invalid type argument of array indexing");
2845 error ("invalid type argument of unary %<*%>");
2847 case RO_IMPLICIT_CONVERSION
:
2848 error ("invalid type argument of implicit conversion");
2853 return error_mark_node
;
2856 /* This handles expressions of the form "a[i]", which denotes
2859 This is logically equivalent in C to *(a+i), but we may do it differently.
2860 If A is a variable or a member, we generate a primitive ARRAY_REF.
2861 This avoids forcing the array out of registers, and can work on
2862 arrays that are not lvalues (for example, members of structures returned
2865 If INDEX is of some user-defined type, it must be converted to
2866 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2867 will inherit the type of the array, which will be some pointer type.
2869 LOC is the location to use in building the array reference. */
2872 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
2873 tsubst_flags_t complain
)
2879 if (complain
& tf_error
)
2880 error_at (loc
, "subscript missing in array reference");
2881 return error_mark_node
;
2884 if (TREE_TYPE (array
) == error_mark_node
2885 || TREE_TYPE (idx
) == error_mark_node
)
2886 return error_mark_node
;
2888 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2890 switch (TREE_CODE (array
))
2894 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2896 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2897 TREE_OPERAND (array
, 0), value
);
2898 SET_EXPR_LOCATION (ret
, loc
);
2903 ret
= build_conditional_expr
2904 (TREE_OPERAND (array
, 0),
2905 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2907 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
2909 tf_warning_or_error
);
2910 protected_set_expr_location (ret
, loc
);
2917 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2921 warn_array_subscript_with_type_char (idx
);
2923 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2925 if (complain
& tf_error
)
2926 error_at (loc
, "array subscript is not an integer");
2927 return error_mark_node
;
2930 /* Apply integral promotions *after* noticing character types.
2931 (It is unclear why we do these promotions -- the standard
2932 does not say that we should. In fact, the natural thing would
2933 seem to be to convert IDX to ptrdiff_t; we're performing
2934 pointer arithmetic.) */
2935 idx
= perform_integral_promotions (idx
);
2937 /* An array that is indexed by a non-constant
2938 cannot be stored in a register; we must be able to do
2939 address arithmetic on its address.
2940 Likewise an array of elements of variable size. */
2941 if (TREE_CODE (idx
) != INTEGER_CST
2942 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2943 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2946 if (!cxx_mark_addressable (array
))
2947 return error_mark_node
;
2950 /* An array that is indexed by a constant value which is not within
2951 the array bounds cannot be stored in a register either; because we
2952 would get a crash in store_bit_field/extract_bit_field when trying
2953 to access a non-existent part of the register. */
2954 if (TREE_CODE (idx
) == INTEGER_CST
2955 && TYPE_DOMAIN (TREE_TYPE (array
))
2956 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
2958 if (!cxx_mark_addressable (array
))
2959 return error_mark_node
;
2962 if (!lvalue_p (array
) && (complain
& tf_error
))
2963 pedwarn (loc
, OPT_pedantic
,
2964 "ISO C++ forbids subscripting non-lvalue array");
2966 /* Note in C++ it is valid to subscript a `register' array, since
2967 it is valid to take the address of something with that
2968 storage specification. */
2972 while (TREE_CODE (foo
) == COMPONENT_REF
)
2973 foo
= TREE_OPERAND (foo
, 0);
2974 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
)
2975 && (complain
& tf_warning
))
2976 warning_at (loc
, OPT_Wextra
,
2977 "subscripting array declared %<register%>");
2980 type
= TREE_TYPE (TREE_TYPE (array
));
2981 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
2982 /* Array ref is const/volatile if the array elements are
2983 or if the array is.. */
2984 TREE_READONLY (rval
)
2985 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
2986 TREE_SIDE_EFFECTS (rval
)
2987 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
2988 TREE_THIS_VOLATILE (rval
)
2989 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
2990 ret
= require_complete_type (fold_if_not_in_template (rval
));
2991 protected_set_expr_location (ret
, loc
);
2996 tree ar
= default_conversion (array
);
2997 tree ind
= default_conversion (idx
);
2999 /* Put the integer in IND to simplify error checking. */
3000 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
3007 if (ar
== error_mark_node
)
3010 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
3012 if (complain
& tf_error
)
3013 error_at (loc
, "subscripted value is neither array nor pointer");
3014 return error_mark_node
;
3016 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
3018 if (complain
& tf_error
)
3019 error_at (loc
, "array subscript is not an integer");
3020 return error_mark_node
;
3023 warn_array_subscript_with_type_char (idx
);
3025 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
3030 protected_set_expr_location (ret
, loc
);
3035 /* Entry point for Obj-C++. */
3038 build_array_ref (location_t loc
, tree array
, tree idx
)
3040 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
3043 /* Resolve a pointer to member function. INSTANCE is the object
3044 instance to use, if the member points to a virtual member.
3046 This used to avoid checking for virtual functions if basetype
3047 has no virtual functions, according to an earlier ANSI draft.
3048 With the final ISO C++ rules, such an optimization is
3049 incorrect: A pointer to a derived member can be static_cast
3050 to pointer-to-base-member, as long as the dynamic object
3051 later has the right member. */
3054 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
3056 if (TREE_CODE (function
) == OFFSET_REF
)
3057 function
= TREE_OPERAND (function
, 1);
3059 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3061 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
3062 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3064 tree instance_ptr
= *instance_ptrptr
;
3065 tree instance_save_expr
= 0;
3066 if (instance_ptr
== error_mark_node
)
3068 if (TREE_CODE (function
) == PTRMEM_CST
)
3070 /* Extracting the function address from a pmf is only
3071 allowed with -Wno-pmf-conversions. It only works for
3073 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
3074 e1
= convert (fntype
, e1
);
3079 error ("object missing in use of %qE", function
);
3080 return error_mark_node
;
3084 if (TREE_SIDE_EFFECTS (instance_ptr
))
3085 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3087 if (TREE_SIDE_EFFECTS (function
))
3088 function
= save_expr (function
);
3090 /* Start by extracting all the information from the PMF itself. */
3091 e3
= pfn_from_ptrmemfunc (function
);
3092 delta
= delta_from_ptrmemfunc (function
);
3093 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3094 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3096 case ptrmemfunc_vbit_in_pfn
:
3097 e1
= cp_build_binary_op (input_location
,
3098 BIT_AND_EXPR
, idx
, integer_one_node
,
3099 tf_warning_or_error
);
3100 idx
= cp_build_binary_op (input_location
,
3101 MINUS_EXPR
, idx
, integer_one_node
,
3102 tf_warning_or_error
);
3105 case ptrmemfunc_vbit_in_delta
:
3106 e1
= cp_build_binary_op (input_location
,
3107 BIT_AND_EXPR
, delta
, integer_one_node
,
3108 tf_warning_or_error
);
3109 delta
= cp_build_binary_op (input_location
,
3110 RSHIFT_EXPR
, delta
, integer_one_node
,
3111 tf_warning_or_error
);
3118 /* Convert down to the right base before using the instance. A
3119 special case is that in a pointer to member of class C, C may
3120 be incomplete. In that case, the function will of course be
3121 a member of C, and no conversion is required. In fact,
3122 lookup_base will fail in that case, because incomplete
3123 classes do not have BINFOs. */
3124 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3125 if (!same_type_ignoring_top_level_qualifiers_p
3126 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3128 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3129 basetype
, ba_check
, NULL
);
3130 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3132 if (instance_ptr
== error_mark_node
)
3133 return error_mark_node
;
3135 /* ...and then the delta in the PMF. */
3136 instance_ptr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (instance_ptr
),
3137 instance_ptr
, fold_convert (sizetype
, delta
));
3139 /* Hand back the adjusted 'this' argument to our caller. */
3140 *instance_ptrptr
= instance_ptr
;
3142 /* Next extract the vtable pointer from the object. */
3143 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3145 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, tf_warning_or_error
);
3146 /* If the object is not dynamic the access invokes undefined
3147 behavior. As it is not executed in this case silence the
3148 spurious warnings it may provoke. */
3149 TREE_NO_WARNING (vtbl
) = 1;
3151 /* Finally, extract the function pointer from the vtable. */
3152 e2
= fold_build2_loc (input_location
,
3153 POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
,
3154 fold_convert (sizetype
, idx
));
3155 e2
= cp_build_indirect_ref (e2
, RO_NULL
, tf_warning_or_error
);
3156 TREE_CONSTANT (e2
) = 1;
3158 /* When using function descriptors, the address of the
3159 vtable entry is treated as a function pointer. */
3160 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3161 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3162 cp_build_unary_op (ADDR_EXPR
, e2
, /*noconvert=*/1,
3163 tf_warning_or_error
));
3165 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3166 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
3168 /* Make sure this doesn't get evaluated first inside one of the
3169 branches of the COND_EXPR. */
3170 if (instance_save_expr
)
3171 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3172 instance_save_expr
, e1
);
3179 /* Used by the C-common bits. */
3181 build_function_call (location_t loc ATTRIBUTE_UNUSED
,
3182 tree function
, tree params
)
3184 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3187 /* Used by the C-common bits. */
3189 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED
,
3190 tree function
, VEC(tree
,gc
) *params
,
3191 VEC(tree
,gc
) *origtypes ATTRIBUTE_UNUSED
)
3193 VEC(tree
,gc
) *orig_params
= params
;
3194 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3195 tf_warning_or_error
);
3197 /* cp_build_function_call_vec can reallocate PARAMS by adding
3198 default arguments. That should never happen here. Verify
3200 gcc_assert (params
== orig_params
);
3205 /* Build a function call using a tree list of arguments. */
3208 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3213 vec
= make_tree_vector ();
3214 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3215 VEC_safe_push (tree
, gc
, vec
, TREE_VALUE (params
));
3216 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3217 release_tree_vector (vec
);
3221 /* Build a function call using varargs. */
3224 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3230 vec
= make_tree_vector ();
3231 va_start (args
, complain
);
3232 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3233 VEC_safe_push (tree
, gc
, vec
, t
);
3235 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3236 release_tree_vector (vec
);
3240 /* Build a function call using a vector of arguments. PARAMS may be
3241 NULL if there are no parameters. This changes the contents of
3245 cp_build_function_call_vec (tree function
, VEC(tree
,gc
) **params
,
3246 tsubst_flags_t complain
)
3248 tree fntype
, fndecl
;
3250 tree original
= function
;
3254 VEC(tree
,gc
) *allocated
= NULL
;
3257 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3258 expressions, like those used for ObjC messenger dispatches. */
3259 if (params
!= NULL
&& !VEC_empty (tree
, *params
))
3260 function
= objc_rewrite_function_call (function
,
3261 VEC_index (tree
, *params
, 0));
3263 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3264 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3265 if (TREE_CODE (function
) == NOP_EXPR
3266 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3267 function
= TREE_OPERAND (function
, 0);
3269 if (TREE_CODE (function
) == FUNCTION_DECL
)
3271 mark_used (function
);
3274 /* Convert anything with function type to a pointer-to-function. */
3275 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
3276 pedwarn (input_location
, OPT_pedantic
,
3277 "ISO C++ forbids calling %<::main%> from within program");
3279 function
= build_addr_func (function
);
3285 function
= build_addr_func (function
);
3288 if (function
== error_mark_node
)
3289 return error_mark_node
;
3291 fntype
= TREE_TYPE (function
);
3293 if (TYPE_PTRMEMFUNC_P (fntype
))
3295 if (complain
& tf_error
)
3296 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3297 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3298 original
, original
);
3299 return error_mark_node
;
3302 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
3303 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3305 if (!((TREE_CODE (fntype
) == POINTER_TYPE
3306 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
3308 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3310 if (complain
& tf_error
)
3311 error ("%qE cannot be used as a function", original
);
3312 return error_mark_node
;
3315 /* fntype now gets the type of function pointed to. */
3316 fntype
= TREE_TYPE (fntype
);
3317 parm_types
= TYPE_ARG_TYPES (fntype
);
3321 allocated
= make_tree_vector ();
3322 params
= &allocated
;
3325 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3328 return error_mark_node
;
3330 argarray
= VEC_address (tree
, *params
);
3332 /* Check for errors in format strings and inappropriately
3334 check_function_arguments (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
,
3337 ret
= build_cxx_call (function
, nargs
, argarray
);
3339 if (allocated
!= NULL
)
3340 release_tree_vector (allocated
);
3345 /* Subroutine of convert_arguments.
3346 Warn about wrong number of args are genereted. */
3349 warn_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3353 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3355 if (DECL_NAME (fndecl
) == NULL_TREE
3356 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3359 ? G_("too many arguments to constructor %q#D")
3360 : G_("too few arguments to constructor %q#D"),
3365 ? G_("too many arguments to member function %q#D")
3366 : G_("too few arguments to member function %q#D"),
3372 ? G_("too many arguments to function %q#D")
3373 : G_("too few arguments to function %q#D"),
3375 inform (DECL_SOURCE_LOCATION (fndecl
),
3379 error_at (loc
, too_many_p
? G_("too many arguments to function")
3380 : G_("too few arguments to function"));
3383 /* Convert the actual parameter expressions in the list VALUES to the
3384 types in the list TYPELIST. The converted expressions are stored
3385 back in the VALUES vector.
3386 If parmdecls is exhausted, or when an element has NULL as its type,
3387 perform the default conversions.
3389 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3391 This is also where warnings about wrong number of args are generated.
3393 Returns the actual number of arguments processed (which might be less
3394 than the length of the vector), or -1 on error.
3396 In C++, unspecified trailing parameters can be filled in with their
3397 default arguments, if such were specified. Do so here. */
3400 convert_arguments (tree typelist
, VEC(tree
,gc
) **values
, tree fndecl
,
3401 int flags
, tsubst_flags_t complain
)
3406 /* Argument passing is always copy-initialization. */
3407 flags
|= LOOKUP_ONLYCONVERTING
;
3409 for (i
= 0, typetail
= typelist
;
3410 i
< VEC_length (tree
, *values
);
3413 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3414 tree val
= VEC_index (tree
, *values
, i
);
3416 if (val
== error_mark_node
|| type
== error_mark_node
)
3419 if (type
== void_type_node
)
3421 if (complain
& tf_error
)
3423 warn_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3430 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3431 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3432 if (TREE_CODE (val
) == NOP_EXPR
3433 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3434 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3435 val
= TREE_OPERAND (val
, 0);
3437 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3439 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3440 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3441 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3442 val
= decay_conversion (val
);
3445 if (val
== error_mark_node
)
3450 /* Formal parm type is specified by a function prototype. */
3453 if (!COMPLETE_TYPE_P (complete_type (type
)))
3455 if (complain
& tf_error
)
3458 error ("parameter %P of %qD has incomplete type %qT",
3461 error ("parameter %P has incomplete type %qT", i
, type
);
3463 parmval
= error_mark_node
;
3467 parmval
= convert_for_initialization
3468 (NULL_TREE
, type
, val
, flags
,
3469 "argument passing", fndecl
, i
, complain
);
3470 parmval
= convert_for_arg_passing (type
, parmval
);
3473 if (parmval
== error_mark_node
)
3476 VEC_replace (tree
, *values
, i
, parmval
);
3480 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3481 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3482 /* Don't do ellipsis conversion for __built_in_constant_p
3483 as this will result in spurious errors for non-trivial
3485 val
= require_complete_type (val
);
3487 val
= convert_arg_to_ellipsis (val
);
3489 VEC_replace (tree
, *values
, i
, val
);
3493 typetail
= TREE_CHAIN (typetail
);
3496 if (typetail
!= 0 && typetail
!= void_list_node
)
3498 /* See if there are default arguments that can be used. Because
3499 we hold default arguments in the FUNCTION_TYPE (which is so
3500 wrong), we can see default parameters here from deduced
3501 contexts (and via typeof) for indirect function calls.
3502 Fortunately we know whether we have a function decl to
3503 provide default arguments in a language conformant
3505 if (fndecl
&& TREE_PURPOSE (typetail
)
3506 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3508 for (; typetail
!= void_list_node
; ++i
)
3511 = convert_default_arg (TREE_VALUE (typetail
),
3512 TREE_PURPOSE (typetail
),
3515 if (parmval
== error_mark_node
)
3518 VEC_safe_push (tree
, gc
, *values
, parmval
);
3519 typetail
= TREE_CHAIN (typetail
);
3520 /* ends with `...'. */
3521 if (typetail
== NULL_TREE
)
3527 if (complain
& tf_error
)
3528 warn_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3536 /* Build a binary-operation expression, after performing default
3537 conversions on the operands. CODE is the kind of expression to
3538 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3539 are the tree codes which correspond to ARG1 and ARG2 when issuing
3540 warnings about possibly misplaced parentheses. They may differ
3541 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3542 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3543 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3544 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3545 ARG2_CODE as ERROR_MARK. */
3548 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3549 tree arg2
, enum tree_code arg2_code
, bool *overloaded_p
,
3550 tsubst_flags_t complain
)
3559 if (processing_template_decl
)
3561 if (type_dependent_expression_p (arg1
)
3562 || type_dependent_expression_p (arg2
))
3563 return build_min_nt (code
, arg1
, arg2
);
3564 arg1
= build_non_dependent_expr (arg1
);
3565 arg2
= build_non_dependent_expr (arg2
);
3568 if (code
== DOTSTAR_EXPR
)
3569 expr
= build_m_component_ref (arg1
, arg2
);
3571 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3572 overloaded_p
, complain
);
3574 /* Check for cases such as x+y<<z which users are likely to
3575 misinterpret. But don't warn about obj << x + y, since that is a
3576 common idiom for I/O. */
3577 if (warn_parentheses
3578 && (complain
& tf_warning
)
3579 && !processing_template_decl
3580 && !error_operand_p (arg1
)
3581 && !error_operand_p (arg2
)
3582 && (code
!= LSHIFT_EXPR
3583 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3584 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3586 if (processing_template_decl
&& expr
!= error_mark_node
)
3587 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3592 /* Build and return an ARRAY_REF expression. */
3595 build_x_array_ref (tree arg1
, tree arg2
, tsubst_flags_t complain
)
3597 tree orig_arg1
= arg1
;
3598 tree orig_arg2
= arg2
;
3601 if (processing_template_decl
)
3603 if (type_dependent_expression_p (arg1
)
3604 || type_dependent_expression_p (arg2
))
3605 return build_min_nt (ARRAY_REF
, arg1
, arg2
,
3606 NULL_TREE
, NULL_TREE
);
3607 arg1
= build_non_dependent_expr (arg1
);
3608 arg2
= build_non_dependent_expr (arg2
);
3611 expr
= build_new_op (ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3612 /*overloaded_p=*/NULL
, complain
);
3614 if (processing_template_decl
&& expr
!= error_mark_node
)
3615 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3616 NULL_TREE
, NULL_TREE
);
3620 /* For the c-common bits. */
3622 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3623 int convert_p ATTRIBUTE_UNUSED
)
3625 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3629 /* Build a binary-operation expression without default conversions.
3630 CODE is the kind of expression to build.
3631 LOCATION is the location_t of the operator in the source code.
3632 This function differs from `build' in several ways:
3633 the data type of the result is computed and recorded in it,
3634 warnings are generated if arg data types are invalid,
3635 special handling for addition and subtraction of pointers is known,
3636 and some optimization is done (operations on narrow ints
3637 are done in the narrower type when that gives the same result).
3638 Constant folding is also done before the result is returned.
3640 Note that the operands will never have enumeral types
3641 because either they have just had the default conversions performed
3642 or they have both just been converted to some other type in which
3643 the arithmetic is to be done.
3645 C++: must do special pointer arithmetic when implementing
3646 multiple inheritance, and deal with pointer to member functions. */
3649 cp_build_binary_op (location_t location
,
3650 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3651 tsubst_flags_t complain
)
3654 enum tree_code code0
, code1
;
3656 const char *invalid_op_diag
;
3658 /* Expression code to give to the expression when it is built.
3659 Normally this is CODE, which is what the caller asked for,
3660 but in some special cases we change it. */
3661 enum tree_code resultcode
= code
;
3663 /* Data type in which the computation is to be performed.
3664 In the simplest cases this is the common type of the arguments. */
3665 tree result_type
= NULL
;
3667 /* Nonzero means operands have already been type-converted
3668 in whatever way is necessary.
3669 Zero means they need to be converted to RESULT_TYPE. */
3672 /* Nonzero means create the expression with this type, rather than
3674 tree build_type
= 0;
3676 /* Nonzero means after finally constructing the expression
3677 convert it to this type. */
3678 tree final_type
= 0;
3682 /* Nonzero if this is an operation like MIN or MAX which can
3683 safely be computed in short if both args are promoted shorts.
3684 Also implies COMMON.
3685 -1 indicates a bitwise operation; this makes a difference
3686 in the exact conditions for when it is safe to do the operation
3687 in a narrower mode. */
3690 /* Nonzero if this is a comparison operation;
3691 if both args are promoted shorts, compare the original shorts.
3692 Also implies COMMON. */
3693 int short_compare
= 0;
3695 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3698 /* True if both operands have arithmetic type. */
3699 bool arithmetic_types_p
;
3701 /* Apply default conversions. */
3705 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3706 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3707 || code
== TRUTH_XOR_EXPR
)
3709 if (!really_overloaded_fn (op0
))
3710 op0
= decay_conversion (op0
);
3711 if (!really_overloaded_fn (op1
))
3712 op1
= decay_conversion (op1
);
3716 if (!really_overloaded_fn (op0
))
3717 op0
= default_conversion (op0
);
3718 if (!really_overloaded_fn (op1
))
3719 op1
= default_conversion (op1
);
3722 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3723 STRIP_TYPE_NOPS (op0
);
3724 STRIP_TYPE_NOPS (op1
);
3726 /* DTRT if one side is an overloaded function, but complain about it. */
3727 if (type_unknown_p (op0
))
3729 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3730 if (t
!= error_mark_node
)
3732 if (complain
& tf_error
)
3733 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3738 if (type_unknown_p (op1
))
3740 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3741 if (t
!= error_mark_node
)
3743 if (complain
& tf_error
)
3744 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3750 type0
= TREE_TYPE (op0
);
3751 type1
= TREE_TYPE (op1
);
3753 /* The expression codes of the data types of the arguments tell us
3754 whether the arguments are integers, floating, pointers, etc. */
3755 code0
= TREE_CODE (type0
);
3756 code1
= TREE_CODE (type1
);
3758 /* If an error was already reported for one of the arguments,
3759 avoid reporting another error. */
3760 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3761 return error_mark_node
;
3763 if ((invalid_op_diag
3764 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3766 error (invalid_op_diag
);
3767 return error_mark_node
;
3770 /* Issue warnings about peculiar, but valid, uses of NULL. */
3771 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3772 /* It's reasonable to use pointer values as operands of &&
3773 and ||, so NULL is no exception. */
3774 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3775 && ( /* Both are NULL (or 0) and the operation was not a
3776 comparison or a pointer subtraction. */
3777 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3778 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
3779 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3780 || (!null_ptr_cst_p (orig_op0
)
3781 && !TYPE_PTR_P (type0
) && !TYPE_PTR_TO_MEMBER_P (type0
))
3782 || (!null_ptr_cst_p (orig_op1
)
3783 && !TYPE_PTR_P (type1
) && !TYPE_PTR_TO_MEMBER_P (type1
)))
3784 && (complain
& tf_warning
))
3785 /* Some sort of arithmetic operation involving NULL was
3787 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3792 /* Subtraction of two similar pointers.
3793 We must subtract them as integers, then divide by object size. */
3794 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3795 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3797 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3798 /* In all other cases except pointer - int, the usual arithmetic
3800 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3805 /* The pointer - int case is just like pointer + int; fall
3808 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3809 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3813 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3814 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3815 if (processing_template_decl
)
3817 result_type
= TREE_TYPE (ptr_operand
);
3820 return cp_pointer_int_sum (code
,
3831 case TRUNC_DIV_EXPR
:
3833 case FLOOR_DIV_EXPR
:
3834 case ROUND_DIV_EXPR
:
3835 case EXACT_DIV_EXPR
:
3836 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3837 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3838 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3839 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3841 enum tree_code tcode0
= code0
, tcode1
= code1
;
3843 warn_for_div_by_zero (location
, op1
);
3845 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3846 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3847 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3848 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3850 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3851 resultcode
= RDIV_EXPR
;
3853 /* When dividing two signed integers, we have to promote to int.
3854 unless we divide by a constant != -1. Note that default
3855 conversion will have been performed on the operands at this
3856 point, so we have to dig out the original type to find out if
3858 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3859 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3860 || (TREE_CODE (op1
) == INTEGER_CST
3861 && ! integer_all_onesp (op1
)));
3870 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3871 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3872 && !VECTOR_FLOAT_TYPE_P (type0
)
3873 && !VECTOR_FLOAT_TYPE_P (type1
)))
3877 case TRUNC_MOD_EXPR
:
3878 case FLOOR_MOD_EXPR
:
3879 warn_for_div_by_zero (location
, op1
);
3881 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3882 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
3883 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
3885 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3887 /* Although it would be tempting to shorten always here, that loses
3888 on some targets, since the modulo instruction is undefined if the
3889 quotient can't be represented in the computation mode. We shorten
3890 only if unsigned or if dividing by something we know != -1. */
3891 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3892 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3893 || (TREE_CODE (op1
) == INTEGER_CST
3894 && ! integer_all_onesp (op1
)));
3899 case TRUTH_ANDIF_EXPR
:
3900 case TRUTH_ORIF_EXPR
:
3901 case TRUTH_AND_EXPR
:
3903 result_type
= boolean_type_node
;
3906 /* Shift operations: result has same type as first operand;
3907 always convert second operand to int.
3908 Also set SHORT_SHIFT if shifting rightward. */
3911 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3913 result_type
= type0
;
3914 if (TREE_CODE (op1
) == INTEGER_CST
)
3916 if (tree_int_cst_lt (op1
, integer_zero_node
))
3918 if ((complain
& tf_warning
)
3919 && c_inhibit_evaluation_warnings
== 0)
3920 warning (0, "right shift count is negative");
3924 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3925 && (complain
& tf_warning
)
3926 && c_inhibit_evaluation_warnings
== 0)
3927 warning (0, "right shift count >= width of type");
3930 /* Convert the shift-count to an integer, regardless of
3931 size of value being shifted. */
3932 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3933 op1
= cp_convert (integer_type_node
, op1
);
3934 /* Avoid converting op1 to result_type later. */
3940 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3942 result_type
= type0
;
3943 if (TREE_CODE (op1
) == INTEGER_CST
)
3945 if (tree_int_cst_lt (op1
, integer_zero_node
))
3947 if ((complain
& tf_warning
)
3948 && c_inhibit_evaluation_warnings
== 0)
3949 warning (0, "left shift count is negative");
3951 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3953 if ((complain
& tf_warning
)
3954 && c_inhibit_evaluation_warnings
== 0)
3955 warning (0, "left shift count >= width of type");
3958 /* Convert the shift-count to an integer, regardless of
3959 size of value being shifted. */
3960 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3961 op1
= cp_convert (integer_type_node
, op1
);
3962 /* Avoid converting op1 to result_type later. */
3969 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3971 result_type
= type0
;
3972 if (TREE_CODE (op1
) == INTEGER_CST
)
3974 if (tree_int_cst_lt (op1
, integer_zero_node
))
3976 if (complain
& tf_warning
)
3977 warning (0, (code
== LROTATE_EXPR
)
3978 ? G_("left rotate count is negative")
3979 : G_("right rotate count is negative"));
3981 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3983 if (complain
& tf_warning
)
3984 warning (0, (code
== LROTATE_EXPR
)
3985 ? G_("left rotate count >= width of type")
3986 : G_("right rotate count >= width of type"));
3989 /* Convert the shift-count to an integer, regardless of
3990 size of value being shifted. */
3991 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3992 op1
= cp_convert (integer_type_node
, op1
);
3998 if ((complain
& tf_warning
)
3999 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
4000 warning (OPT_Wfloat_equal
,
4001 "comparing floating point with == or != is unsafe");
4002 if ((complain
& tf_warning
)
4003 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
4004 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
4005 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4007 build_type
= boolean_type_node
;
4008 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4009 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
4010 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4011 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
4013 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4014 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
4015 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4016 CPO_COMPARISON
, complain
);
4017 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
4018 && null_ptr_cst_p (op1
))
4020 if (TREE_CODE (op0
) == ADDR_EXPR
4021 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
4023 if (complain
& tf_warning
)
4024 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4025 TREE_OPERAND (op0
, 0));
4027 result_type
= type0
;
4029 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
4030 && null_ptr_cst_p (op0
))
4032 if (TREE_CODE (op1
) == ADDR_EXPR
4033 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
4035 if (complain
& tf_warning
)
4036 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4037 TREE_OPERAND (op1
, 0));
4039 result_type
= type1
;
4041 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4042 /* One of the operands must be of nullptr_t type. */
4043 result_type
= TREE_TYPE (nullptr_node
);
4044 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4046 result_type
= type0
;
4047 if (complain
& tf_error
)
4048 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4050 return error_mark_node
;
4052 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4054 result_type
= type1
;
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 (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
4062 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4063 == ptrmemfunc_vbit_in_delta
)
4065 tree pfn0
= pfn_from_ptrmemfunc (op0
);
4066 tree delta0
= delta_from_ptrmemfunc (op0
);
4067 tree e1
= cp_build_binary_op (location
,
4070 fold_convert (TREE_TYPE (pfn0
),
4073 tree e2
= cp_build_binary_op (location
,
4078 e2
= cp_build_binary_op (location
,
4079 EQ_EXPR
, e2
, integer_zero_node
,
4081 op0
= cp_build_binary_op (location
,
4082 TRUTH_ANDIF_EXPR
, e1
, e2
,
4084 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
4088 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4089 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
4091 result_type
= TREE_TYPE (op0
);
4093 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4094 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4095 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4098 /* E will be the final comparison. */
4100 /* E1 and E2 are for scratch. */
4108 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4109 CPO_COMPARISON
, complain
);
4111 if (!same_type_p (TREE_TYPE (op0
), type
))
4112 op0
= cp_convert_and_check (type
, op0
);
4113 if (!same_type_p (TREE_TYPE (op1
), type
))
4114 op1
= cp_convert_and_check (type
, op1
);
4116 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4117 return error_mark_node
;
4119 if (TREE_SIDE_EFFECTS (op0
))
4120 op0
= save_expr (op0
);
4121 if (TREE_SIDE_EFFECTS (op1
))
4122 op1
= save_expr (op1
);
4124 pfn0
= pfn_from_ptrmemfunc (op0
);
4125 pfn1
= pfn_from_ptrmemfunc (op1
);
4126 delta0
= delta_from_ptrmemfunc (op0
);
4127 delta1
= delta_from_ptrmemfunc (op1
);
4128 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4129 == ptrmemfunc_vbit_in_delta
)
4134 && ((op0.delta == op1.delta)
4135 || (!op0.pfn && op0.delta & 1 == 0
4136 && op1.delta & 1 == 0))
4138 The reason for the `!op0.pfn' bit is that a NULL
4139 pointer-to-member is any member with a zero PFN and
4140 LSB of the DELTA field is 0. */
4142 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4146 e1
= cp_build_binary_op (location
,
4147 EQ_EXPR
, e1
, integer_zero_node
,
4149 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4153 e2
= cp_build_binary_op (location
,
4154 EQ_EXPR
, e2
, integer_zero_node
,
4156 e1
= cp_build_binary_op (location
,
4157 TRUTH_ANDIF_EXPR
, e2
, e1
,
4159 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4161 fold_convert (TREE_TYPE (pfn0
),
4164 e2
= cp_build_binary_op (location
,
4165 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4166 e1
= cp_build_binary_op (location
,
4167 EQ_EXPR
, delta0
, delta1
, complain
);
4168 e1
= cp_build_binary_op (location
,
4169 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4176 && (!op0.pfn || op0.delta == op1.delta))
4178 The reason for the `!op0.pfn' bit is that a NULL
4179 pointer-to-member is any member with a zero PFN; the
4180 DELTA field is unspecified. */
4182 e1
= cp_build_binary_op (location
,
4183 EQ_EXPR
, delta0
, delta1
, complain
);
4184 e2
= cp_build_binary_op (location
,
4187 fold_convert (TREE_TYPE (pfn0
),
4190 e1
= cp_build_binary_op (location
,
4191 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4193 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4194 e
= cp_build_binary_op (location
,
4195 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4196 if (code
== EQ_EXPR
)
4198 return cp_build_binary_op (location
,
4199 EQ_EXPR
, e
, integer_zero_node
, complain
);
4203 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4204 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4206 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4207 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4215 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4216 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4218 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4219 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4220 CPO_COMPARISON
, complain
);
4227 if (TREE_CODE (orig_op0
) == STRING_CST
4228 || TREE_CODE (orig_op1
) == STRING_CST
)
4230 if (complain
& tf_warning
)
4231 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4234 build_type
= boolean_type_node
;
4235 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4236 || code0
== ENUMERAL_TYPE
)
4237 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4238 || code1
== ENUMERAL_TYPE
))
4240 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4241 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4242 CPO_COMPARISON
, complain
);
4243 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4244 result_type
= type0
;
4245 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4246 result_type
= type1
;
4247 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4248 /* One of the operands must be of nullptr_t type. */
4249 result_type
= TREE_TYPE (nullptr_node
);
4250 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4252 result_type
= type0
;
4253 if (complain
& tf_error
)
4254 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4256 return error_mark_node
;
4258 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4260 result_type
= type1
;
4261 if (complain
& tf_error
)
4262 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4264 return error_mark_node
;
4268 case UNORDERED_EXPR
:
4275 build_type
= integer_type_node
;
4276 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4278 if (complain
& tf_error
)
4279 error ("unordered comparison on non-floating point argument");
4280 return error_mark_node
;
4289 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4290 || code0
== ENUMERAL_TYPE
)
4291 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4292 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4293 arithmetic_types_p
= 1;
4296 arithmetic_types_p
= 0;
4297 /* Vector arithmetic is only allowed when both sides are vectors. */
4298 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4300 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4301 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4304 binary_op_error (location
, code
, type0
, type1
);
4305 return error_mark_node
;
4307 arithmetic_types_p
= 1;
4310 /* Determine the RESULT_TYPE, if it is not already known. */
4312 && arithmetic_types_p
4313 && (shorten
|| common
|| short_compare
))
4314 result_type
= cp_common_type (type0
, type1
);
4318 if (complain
& tf_error
)
4319 error ("invalid operands of types %qT and %qT to binary %qO",
4320 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4321 return error_mark_node
;
4324 /* If we're in a template, the only thing we need to know is the
4326 if (processing_template_decl
)
4328 /* Since the middle-end checks the type when doing a build2, we
4329 need to build the tree in pieces. This built tree will never
4330 get out of the front-end as we replace it when instantiating
4332 tree tmp
= build2 (resultcode
,
4333 build_type
? build_type
: result_type
,
4335 TREE_OPERAND (tmp
, 0) = op0
;
4339 if (arithmetic_types_p
)
4341 bool first_complex
= (code0
== COMPLEX_TYPE
);
4342 bool second_complex
= (code1
== COMPLEX_TYPE
);
4343 int none_complex
= (!first_complex
&& !second_complex
);
4345 /* Adapted from patch for c/24581. */
4346 if (first_complex
!= second_complex
4347 && (code
== PLUS_EXPR
4348 || code
== MINUS_EXPR
4349 || code
== MULT_EXPR
4350 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4351 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4352 && flag_signed_zeros
)
4354 /* An operation on mixed real/complex operands must be
4355 handled specially, but the language-independent code can
4356 more easily optimize the plain complex arithmetic if
4357 -fno-signed-zeros. */
4358 tree real_type
= TREE_TYPE (result_type
);
4362 if (TREE_TYPE (op0
) != result_type
)
4363 op0
= cp_convert_and_check (result_type
, op0
);
4364 if (TREE_TYPE (op1
) != real_type
)
4365 op1
= cp_convert_and_check (real_type
, op1
);
4369 if (TREE_TYPE (op0
) != real_type
)
4370 op0
= cp_convert_and_check (real_type
, op0
);
4371 if (TREE_TYPE (op1
) != result_type
)
4372 op1
= cp_convert_and_check (result_type
, op1
);
4374 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4375 return error_mark_node
;
4378 op0
= save_expr (op0
);
4379 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4380 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4384 case TRUNC_DIV_EXPR
:
4385 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4389 real
= build2 (resultcode
, real_type
, real
, op1
);
4397 op1
= save_expr (op1
);
4398 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4399 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4403 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4406 real
= build2 (resultcode
, real_type
, op0
, real
);
4409 real
= build2 (resultcode
, real_type
, op0
, real
);
4410 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4416 return build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4419 /* For certain operations (which identify themselves by shorten != 0)
4420 if both args were extended from the same smaller type,
4421 do the arithmetic in that type and then extend.
4423 shorten !=0 and !=1 indicates a bitwise operation.
4424 For them, this optimization is safe only if
4425 both args are zero-extended or both are sign-extended.
4426 Otherwise, we might change the result.
4427 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4428 but calculated in (unsigned short) it would be (unsigned short)-1. */
4430 if (shorten
&& none_complex
)
4432 final_type
= result_type
;
4433 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4437 /* Comparison operations are shortened too but differently.
4438 They identify themselves by setting short_compare = 1. */
4442 /* Don't write &op0, etc., because that would prevent op0
4443 from being kept in a register.
4444 Instead, make copies of the our local variables and
4445 pass the copies by reference, then copy them back afterward. */
4446 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4447 enum tree_code xresultcode
= resultcode
;
4449 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4451 return cp_convert (boolean_type_node
, val
);
4452 op0
= xop0
, op1
= xop1
;
4454 resultcode
= xresultcode
;
4457 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4458 && warn_sign_compare
4459 && !TREE_NO_WARNING (orig_op0
)
4460 && !TREE_NO_WARNING (orig_op1
)
4461 /* Do not warn until the template is instantiated; we cannot
4462 bound the ranges of the arguments until that point. */
4463 && !processing_template_decl
4464 && (complain
& tf_warning
)
4465 && c_inhibit_evaluation_warnings
== 0)
4467 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4468 result_type
, resultcode
);
4472 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4473 Then the expression will be built.
4474 It will be given type FINAL_TYPE if that is nonzero;
4475 otherwise, it will be given type RESULT_TYPE. */
4478 if (TREE_TYPE (op0
) != result_type
)
4479 op0
= cp_convert_and_check (result_type
, op0
);
4480 if (TREE_TYPE (op1
) != result_type
)
4481 op1
= cp_convert_and_check (result_type
, op1
);
4483 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4484 return error_mark_node
;
4487 if (build_type
== NULL_TREE
)
4488 build_type
= result_type
;
4490 result
= build2 (resultcode
, build_type
, op0
, op1
);
4491 result
= fold_if_not_in_template (result
);
4492 if (final_type
!= 0)
4493 result
= cp_convert (final_type
, result
);
4495 if (TREE_OVERFLOW_P (result
)
4496 && !TREE_OVERFLOW_P (op0
)
4497 && !TREE_OVERFLOW_P (op1
))
4498 overflow_warning (location
, result
);
4503 /* Return a tree for the sum or difference (RESULTCODE says which)
4504 of pointer PTROP and integer INTOP. */
4507 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4509 tree res_type
= TREE_TYPE (ptrop
);
4511 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4512 in certain circumstance (when it's valid to do so). So we need
4513 to make sure it's complete. We don't need to check here, if we
4514 can actually complete it at all, as those checks will be done in
4515 pointer_int_sum() anyway. */
4516 complete_type (TREE_TYPE (res_type
));
4518 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4519 fold_if_not_in_template (intop
));
4522 /* Return a tree for the difference of pointers OP0 and OP1.
4523 The resulting tree has type int. */
4526 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4529 tree restype
= ptrdiff_type_node
;
4530 tree target_type
= TREE_TYPE (ptrtype
);
4532 if (!complete_type_or_else (target_type
, NULL_TREE
))
4533 return error_mark_node
;
4535 if (TREE_CODE (target_type
) == VOID_TYPE
)
4536 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4537 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4538 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4539 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4540 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4542 /* First do the subtraction as integers;
4543 then drop through to build the divide operator. */
4545 op0
= cp_build_binary_op (input_location
,
4547 cp_convert (restype
, op0
),
4548 cp_convert (restype
, op1
),
4549 tf_warning_or_error
);
4551 /* This generates an error if op1 is a pointer to an incomplete type. */
4552 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4553 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4555 op1
= (TYPE_PTROB_P (ptrtype
)
4556 ? size_in_bytes (target_type
)
4557 : integer_one_node
);
4559 /* Do the division. */
4561 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4562 return fold_if_not_in_template (result
);
4565 /* Construct and perhaps optimize a tree representation
4566 for a unary operation. CODE, a tree_code, specifies the operation
4567 and XARG is the operand. */
4570 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4572 tree orig_expr
= xarg
;
4576 if (processing_template_decl
)
4578 if (type_dependent_expression_p (xarg
))
4579 return build_min_nt (code
, xarg
, NULL_TREE
);
4581 xarg
= build_non_dependent_expr (xarg
);
4586 /* [expr.unary.op] says:
4588 The address of an object of incomplete type can be taken.
4590 (And is just the ordinary address operator, not an overloaded
4591 "operator &".) However, if the type is a template
4592 specialization, we must complete the type at this point so that
4593 an overloaded "operator &" will be available if required. */
4594 if (code
== ADDR_EXPR
4595 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4596 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4597 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4598 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4599 /* Don't look for a function. */;
4601 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4602 /*overloaded_p=*/NULL
, complain
);
4603 if (!exp
&& code
== ADDR_EXPR
)
4605 if (is_overloaded_fn (xarg
))
4607 tree fn
= get_first_fn (xarg
);
4608 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4610 error (DECL_CONSTRUCTOR_P (fn
)
4611 ? G_("taking address of constructor %qE")
4612 : G_("taking address of destructor %qE"),
4614 return error_mark_node
;
4618 /* A pointer to member-function can be formed only by saying
4620 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4621 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4623 if (TREE_CODE (xarg
) != OFFSET_REF
4624 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4626 error ("invalid use of %qE to form a pointer-to-member-function",
4628 if (TREE_CODE (xarg
) != OFFSET_REF
)
4629 inform (input_location
, " a qualified-id is required");
4630 return error_mark_node
;
4634 error ("parentheses around %qE cannot be used to form a"
4635 " pointer-to-member-function",
4637 PTRMEM_OK_P (xarg
) = 1;
4641 if (TREE_CODE (xarg
) == OFFSET_REF
)
4643 ptrmem
= PTRMEM_OK_P (xarg
);
4645 if (!ptrmem
&& !flag_ms_extensions
4646 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4648 /* A single non-static member, make sure we don't allow a
4649 pointer-to-member. */
4650 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4651 TREE_OPERAND (xarg
, 0),
4652 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4653 PTRMEM_OK_P (xarg
) = ptrmem
;
4656 else if (TREE_CODE (xarg
) == TARGET_EXPR
&& (complain
& tf_warning
))
4657 warning (0, "taking address of temporary");
4658 exp
= cp_build_unary_op (ADDR_EXPR
, xarg
, 0, complain
);
4661 if (processing_template_decl
&& exp
!= error_mark_node
)
4662 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4663 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4664 if (TREE_CODE (exp
) == ADDR_EXPR
)
4665 PTRMEM_OK_P (exp
) = ptrmem
;
4669 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4670 constants, where a null value is represented by an INTEGER_CST of
4674 cp_truthvalue_conversion (tree expr
)
4676 tree type
= TREE_TYPE (expr
);
4677 if (TYPE_PTRMEM_P (type
))
4678 return build_binary_op (EXPR_LOCATION (expr
),
4679 NE_EXPR
, expr
, integer_zero_node
, 1);
4681 return c_common_truthvalue_conversion (input_location
, expr
);
4684 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4687 condition_conversion (tree expr
)
4690 if (processing_template_decl
)
4692 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4693 tf_warning_or_error
, LOOKUP_NORMAL
);
4694 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4698 /* Returns the address of T. This function will fold away
4699 ADDR_EXPR of INDIRECT_REF. */
4702 build_address (tree t
)
4704 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4705 return error_mark_node
;
4706 t
= build_fold_addr_expr (t
);
4707 if (TREE_CODE (t
) != ADDR_EXPR
)
4712 /* Returns the address of T with type TYPE. */
4715 build_typed_address (tree t
, tree type
)
4717 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4718 return error_mark_node
;
4719 t
= build_fold_addr_expr_with_type (t
, type
);
4720 if (TREE_CODE (t
) != ADDR_EXPR
)
4725 /* Return a NOP_EXPR converting EXPR to TYPE. */
4728 build_nop (tree type
, tree expr
)
4730 if (type
== error_mark_node
|| error_operand_p (expr
))
4732 return build1 (NOP_EXPR
, type
, expr
);
4735 /* C++: Must handle pointers to members.
4737 Perhaps type instantiation should be extended to handle conversion
4738 from aggregates to types we don't yet know we want? (Or are those
4739 cases typically errors which should be reported?)
4741 NOCONVERT nonzero suppresses the default promotions
4742 (such as from short to int). */
4745 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
4746 tsubst_flags_t complain
)
4748 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4751 const char *errstring
= NULL
;
4753 const char *invalid_op_diag
;
4755 if (error_operand_p (arg
))
4756 return error_mark_node
;
4758 if ((invalid_op_diag
4759 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
4764 error (invalid_op_diag
);
4765 return error_mark_node
;
4770 case UNARY_PLUS_EXPR
:
4773 int flags
= WANT_ARITH
| WANT_ENUM
;
4774 /* Unary plus (but not unary minus) is allowed on pointers. */
4775 if (code
== UNARY_PLUS_EXPR
)
4776 flags
|= WANT_POINTER
;
4777 arg
= build_expr_type_conversion (flags
, arg
, true);
4779 errstring
= (code
== NEGATE_EXPR
4780 ? _("wrong type argument to unary minus")
4781 : _("wrong type argument to unary plus"));
4784 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4785 arg
= perform_integral_promotions (arg
);
4787 /* Make sure the result is not an lvalue: a unary plus or minus
4788 expression is always a rvalue. */
4795 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4799 arg
= default_conversion (arg
);
4801 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
4802 | WANT_VECTOR_OR_COMPLEX
,
4804 errstring
= _("wrong type argument to bit-complement");
4805 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4806 arg
= perform_integral_promotions (arg
);
4810 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4811 errstring
= _("wrong type argument to abs");
4812 else if (!noconvert
)
4813 arg
= default_conversion (arg
);
4817 /* Conjugating a real value is a no-op, but allow it anyway. */
4818 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4819 errstring
= _("wrong type argument to conjugation");
4820 else if (!noconvert
)
4821 arg
= default_conversion (arg
);
4824 case TRUTH_NOT_EXPR
:
4825 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
4827 val
= invert_truthvalue_loc (input_location
, arg
);
4828 if (arg
!= error_mark_node
)
4830 errstring
= _("in argument to unary !");
4837 if (TREE_CODE (arg
) == COMPLEX_CST
)
4838 return TREE_REALPART (arg
);
4839 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4841 arg
= build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4842 return fold_if_not_in_template (arg
);
4848 if (TREE_CODE (arg
) == COMPLEX_CST
)
4849 return TREE_IMAGPART (arg
);
4850 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4852 arg
= build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4853 return fold_if_not_in_template (arg
);
4856 return cp_convert (TREE_TYPE (arg
), integer_zero_node
);
4858 case PREINCREMENT_EXPR
:
4859 case POSTINCREMENT_EXPR
:
4860 case PREDECREMENT_EXPR
:
4861 case POSTDECREMENT_EXPR
:
4862 /* Handle complex lvalues (when permitted)
4863 by reduction to simpler cases. */
4865 val
= unary_complex_lvalue (code
, arg
);
4869 arg
= mark_lvalue_use (arg
);
4871 /* Increment or decrement the real part of the value,
4872 and don't change the imaginary part. */
4873 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4877 arg
= stabilize_reference (arg
);
4878 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
4879 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
4880 real
= cp_build_unary_op (code
, real
, 1, complain
);
4881 if (real
== error_mark_node
|| imag
== error_mark_node
)
4882 return error_mark_node
;
4883 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
4887 /* Report invalid types. */
4889 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
4892 if (code
== PREINCREMENT_EXPR
)
4893 errstring
= _("no pre-increment operator for type");
4894 else if (code
== POSTINCREMENT_EXPR
)
4895 errstring
= _("no post-increment operator for type");
4896 else if (code
== PREDECREMENT_EXPR
)
4897 errstring
= _("no pre-decrement operator for type");
4899 errstring
= _("no post-decrement operator for type");
4902 else if (arg
== error_mark_node
)
4903 return error_mark_node
;
4905 /* Report something read-only. */
4907 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
4908 || TREE_READONLY (arg
))
4910 if (complain
& tf_error
)
4911 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
4912 || code
== POSTINCREMENT_EXPR
)
4913 ? REK_INCREMENT
: REK_DECREMENT
));
4915 return error_mark_node
;
4920 tree declared_type
= unlowered_expr_type (arg
);
4922 argtype
= TREE_TYPE (arg
);
4924 /* ARM $5.2.5 last annotation says this should be forbidden. */
4925 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
4927 if (complain
& tf_error
)
4928 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
4929 ? G_("ISO C++ forbids incrementing an enum")
4930 : G_("ISO C++ forbids decrementing an enum"));
4932 return error_mark_node
;
4935 /* Compute the increment. */
4937 if (TREE_CODE (argtype
) == POINTER_TYPE
)
4939 tree type
= complete_type (TREE_TYPE (argtype
));
4941 if (!COMPLETE_OR_VOID_TYPE_P (type
))
4943 if (complain
& tf_error
)
4944 error (((code
== PREINCREMENT_EXPR
4945 || code
== POSTINCREMENT_EXPR
))
4946 ? G_("cannot increment a pointer to incomplete type %qT")
4947 : G_("cannot decrement a pointer to incomplete type %qT"),
4948 TREE_TYPE (argtype
));
4950 return error_mark_node
;
4952 else if ((pedantic
|| warn_pointer_arith
)
4953 && !TYPE_PTROB_P (argtype
))
4955 if (complain
& tf_error
)
4956 permerror (input_location
, (code
== PREINCREMENT_EXPR
4957 || code
== POSTINCREMENT_EXPR
)
4958 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
4959 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
4962 return error_mark_node
;
4965 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
4968 inc
= integer_one_node
;
4970 inc
= cp_convert (argtype
, inc
);
4972 /* Complain about anything else that is not a true lvalue. */
4973 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
4974 || code
== POSTINCREMENT_EXPR
)
4975 ? lv_increment
: lv_decrement
),
4977 return error_mark_node
;
4979 /* Forbid using -- on `bool'. */
4980 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
4982 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
4984 if (complain
& tf_error
)
4985 error ("invalid use of Boolean expression as operand "
4986 "to %<operator--%>");
4987 return error_mark_node
;
4989 val
= boolean_increment (code
, arg
);
4992 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
4994 TREE_SIDE_EFFECTS (val
) = 1;
4999 /* Note that this operation never does default_conversion
5000 regardless of NOCONVERT. */
5002 argtype
= lvalue_type (arg
);
5004 arg
= mark_lvalue_use (arg
);
5006 if (TREE_CODE (arg
) == OFFSET_REF
)
5009 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
5011 tree type
= build_pointer_type (TREE_TYPE (argtype
));
5012 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5015 else if (pedantic
&& DECL_MAIN_P (arg
))
5018 /* Apparently a lot of autoconf scripts for C++ packages do this,
5019 so only complain if -pedantic. */
5020 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
5021 pedwarn (input_location
, OPT_pedantic
,
5022 "ISO C++ forbids taking address of function %<::main%>");
5023 else if (flag_pedantic_errors
)
5024 return error_mark_node
;
5027 /* Let &* cancel out to simplify resulting code. */
5028 if (TREE_CODE (arg
) == INDIRECT_REF
)
5030 /* We don't need to have `current_class_ptr' wrapped in a
5031 NON_LVALUE_EXPR node. */
5032 if (arg
== current_class_ref
)
5033 return current_class_ptr
;
5035 arg
= TREE_OPERAND (arg
, 0);
5036 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
5038 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
5039 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5042 /* Don't let this be an lvalue. */
5047 /* ??? Cope with user tricks that amount to offsetof. */
5048 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5049 && TREE_CODE (argtype
) != METHOD_TYPE
5050 && argtype
!= unknown_type_node
5051 && (val
= get_base_address (arg
))
5052 && TREE_CODE (val
) == INDIRECT_REF
5053 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
5055 tree type
= build_pointer_type (argtype
);
5056 tree op0
= fold_convert (type
, TREE_OPERAND (val
, 0));
5057 tree op1
= fold_convert (sizetype
, fold_offsetof (arg
, val
));
5058 return fold_build2 (POINTER_PLUS_EXPR
, type
, op0
, op1
);
5061 /* Uninstantiated types are all functions. Taking the
5062 address of a function is a no-op, so just return the
5065 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
5066 || !IDENTIFIER_OPNAME_P (arg
));
5068 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
5069 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
5071 /* They're trying to take the address of a unique non-static
5072 member function. This is ill-formed (except in MS-land),
5073 but let's try to DTRT.
5074 Note: We only handle unique functions here because we don't
5075 want to complain if there's a static overload; non-unique
5076 cases will be handled by instantiate_type. But we need to
5077 handle this case here to allow casts on the resulting PMF.
5078 We could defer this in non-MS mode, but it's easier to give
5079 a useful error here. */
5081 /* Inside constant member functions, the `this' pointer
5082 contains an extra const qualifier. TYPE_MAIN_VARIANT
5083 is used here to remove this const from the diagnostics
5084 and the created OFFSET_REF. */
5085 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
5086 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
5089 if (! flag_ms_extensions
)
5091 tree name
= DECL_NAME (fn
);
5092 if (!(complain
& tf_error
))
5093 return error_mark_node
;
5094 else if (current_class_type
5095 && TREE_OPERAND (arg
, 0) == current_class_ref
)
5096 /* An expression like &memfn. */
5097 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
5098 " or parenthesized non-static member function to form"
5099 " a pointer to member function. Say %<&%T::%D%>",
5102 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
5103 " function to form a pointer to member function."
5107 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
5111 if (type_unknown_p (arg
))
5112 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
5114 /* Handle complex lvalues (when permitted)
5115 by reduction to simpler cases. */
5116 val
= unary_complex_lvalue (code
, arg
);
5120 switch (TREE_CODE (arg
))
5124 case FIX_TRUNC_EXPR
:
5125 /* Even if we're not being pedantic, we cannot allow this
5126 extension when we're instantiating in a SFINAE
5128 if (! lvalue_p (arg
) && complain
== tf_none
)
5130 if (complain
& tf_error
)
5131 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
5133 return error_mark_node
;
5138 arg
= BASELINK_FUNCTIONS (arg
);
5142 arg
= OVL_CURRENT (arg
);
5146 /* Turn a reference to a non-static data member into a
5147 pointer-to-member. */
5152 if (!PTRMEM_OK_P (arg
))
5153 return cp_build_unary_op (code
, arg
, 0, complain
);
5155 t
= TREE_OPERAND (arg
, 1);
5156 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
5158 if (complain
& tf_error
)
5159 error ("cannot create pointer to reference member %qD", t
);
5160 return error_mark_node
;
5163 type
= build_ptrmem_type (context_for_name_lookup (t
),
5165 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
5173 /* Anything not already handled and not a true memory reference
5175 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5176 && TREE_CODE (argtype
) != METHOD_TYPE
5177 && TREE_CODE (arg
) != OFFSET_REF
5178 && !lvalue_or_else (arg
, lv_addressof
, complain
))
5179 return error_mark_node
;
5181 if (argtype
!= error_mark_node
)
5182 argtype
= build_pointer_type (argtype
);
5184 /* In a template, we are processing a non-dependent expression
5185 so we can just form an ADDR_EXPR with the correct type. */
5186 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
5188 val
= build_address (arg
);
5189 if (TREE_CODE (arg
) == OFFSET_REF
)
5190 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
5192 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
5194 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
5196 /* We can only get here with a single static member
5198 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
5199 && DECL_STATIC_FUNCTION_P (fn
));
5201 val
= build_address (fn
);
5202 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
5203 /* Do not lose object's side effects. */
5204 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
5205 TREE_OPERAND (arg
, 0), val
);
5207 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
5209 if (complain
& tf_error
)
5210 error ("attempt to take address of bit-field structure member %qD",
5211 TREE_OPERAND (arg
, 1));
5212 return error_mark_node
;
5216 tree object
= TREE_OPERAND (arg
, 0);
5217 tree field
= TREE_OPERAND (arg
, 1);
5218 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5219 (TREE_TYPE (object
), decl_type_context (field
)));
5220 val
= build_address (arg
);
5223 if (TREE_CODE (argtype
) == POINTER_TYPE
5224 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
5226 build_ptrmemfunc_type (argtype
);
5227 val
= build_ptrmemfunc (argtype
, val
, 0,
5228 /*c_cast_p=*/false);
5240 argtype
= TREE_TYPE (arg
);
5241 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5244 if (complain
& tf_error
)
5245 error ("%s", errstring
);
5246 return error_mark_node
;
5249 /* Hook for the c-common bits that build a unary op. */
5251 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5252 enum tree_code code
, tree xarg
, int noconvert
)
5254 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5257 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5258 for certain kinds of expressions which are not really lvalues
5259 but which we can accept as lvalues.
5261 If ARG is not a kind of expression we can handle, return
5265 unary_complex_lvalue (enum tree_code code
, tree arg
)
5267 /* Inside a template, making these kinds of adjustments is
5268 pointless; we are only concerned with the type of the
5270 if (processing_template_decl
)
5273 /* Handle (a, b) used as an "lvalue". */
5274 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5276 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5277 tf_warning_or_error
);
5278 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5279 TREE_OPERAND (arg
, 0), real_result
);
5282 /* Handle (a ? b : c) used as an "lvalue". */
5283 if (TREE_CODE (arg
) == COND_EXPR
5284 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5285 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5287 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5288 if (TREE_CODE (arg
) == MODIFY_EXPR
5289 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5290 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5292 tree lvalue
= TREE_OPERAND (arg
, 0);
5293 if (TREE_SIDE_EFFECTS (lvalue
))
5295 lvalue
= stabilize_reference (lvalue
);
5296 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5297 lvalue
, TREE_OPERAND (arg
, 1));
5299 return unary_complex_lvalue
5300 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5303 if (code
!= ADDR_EXPR
)
5306 /* Handle (a = b) used as an "lvalue" for `&'. */
5307 if (TREE_CODE (arg
) == MODIFY_EXPR
5308 || TREE_CODE (arg
) == INIT_EXPR
)
5310 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5311 tf_warning_or_error
);
5312 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5314 TREE_NO_WARNING (arg
) = 1;
5318 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5319 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5320 || TREE_CODE (arg
) == OFFSET_REF
)
5323 /* We permit compiler to make function calls returning
5324 objects of aggregate type look like lvalues. */
5328 if (TREE_CODE (targ
) == SAVE_EXPR
)
5329 targ
= TREE_OPERAND (targ
, 0);
5331 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5333 if (TREE_CODE (arg
) == SAVE_EXPR
)
5336 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
5337 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5340 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5341 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5342 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5345 /* Don't let anything else be handled specially. */
5349 /* Mark EXP saying that we need to be able to take the
5350 address of it; it should not be allocated in a register.
5351 Value is true if successful.
5353 C++: we do not allow `current_class_ptr' to be addressable. */
5356 cxx_mark_addressable (tree exp
)
5361 switch (TREE_CODE (x
))
5368 x
= TREE_OPERAND (x
, 0);
5372 if (x
== current_class_ptr
)
5374 error ("cannot take the address of %<this%>, which is an rvalue expression");
5375 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5381 /* Caller should not be trying to mark initialized
5382 constant fields addressable. */
5383 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5384 || DECL_IN_AGGR_P (x
) == 0
5386 || DECL_EXTERNAL (x
));
5391 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5392 && !DECL_ARTIFICIAL (x
))
5394 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5397 ("address of explicit register variable %qD requested", x
);
5400 else if (extra_warnings
)
5402 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5404 TREE_ADDRESSABLE (x
) = 1;
5408 TREE_ADDRESSABLE (x
) = 1;
5412 TREE_ADDRESSABLE (x
) = 1;
5416 TREE_ADDRESSABLE (x
) = 1;
5417 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5425 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5428 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5429 tsubst_flags_t complain
)
5431 tree orig_ifexp
= ifexp
;
5432 tree orig_op1
= op1
;
5433 tree orig_op2
= op2
;
5436 if (processing_template_decl
)
5438 /* The standard says that the expression is type-dependent if
5439 IFEXP is type-dependent, even though the eventual type of the
5440 expression doesn't dependent on IFEXP. */
5441 if (type_dependent_expression_p (ifexp
)
5442 /* As a GNU extension, the middle operand may be omitted. */
5443 || (op1
&& type_dependent_expression_p (op1
))
5444 || type_dependent_expression_p (op2
))
5445 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5446 ifexp
= build_non_dependent_expr (ifexp
);
5448 op1
= build_non_dependent_expr (op1
);
5449 op2
= build_non_dependent_expr (op2
);
5452 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5453 if (processing_template_decl
&& expr
!= error_mark_node
)
5454 return build_min_non_dep (COND_EXPR
, expr
,
5455 orig_ifexp
, orig_op1
, orig_op2
);
5459 /* Given a list of expressions, return a compound expression
5460 that performs them all and returns the value of the last of them. */
5462 tree
build_x_compound_expr_from_list (tree list
, const char *msg
)
5464 tree expr
= TREE_VALUE (list
);
5466 if (TREE_CHAIN (list
))
5469 permerror (input_location
, "%s expression list treated as compound expression", msg
);
5471 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5472 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5473 tf_warning_or_error
);
5479 /* Like build_x_compound_expr_from_list, but using a VEC. */
5482 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5484 if (VEC_empty (tree
, vec
))
5486 else if (VEC_length (tree
, vec
) == 1)
5487 return VEC_index (tree
, vec
, 0);
5495 permerror (input_location
,
5496 "%s expression list treated as compound expression",
5499 expr
= VEC_index (tree
, vec
, 0);
5500 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5501 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5507 /* Handle overloading of the ',' operator when needed. */
5510 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5513 tree orig_op1
= op1
;
5514 tree orig_op2
= op2
;
5516 if (processing_template_decl
)
5518 if (type_dependent_expression_p (op1
)
5519 || type_dependent_expression_p (op2
))
5520 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5521 op1
= build_non_dependent_expr (op1
);
5522 op2
= build_non_dependent_expr (op2
);
5525 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5526 /*overloaded_p=*/NULL
, complain
);
5528 result
= cp_build_compound_expr (op1
, op2
, complain
);
5530 if (processing_template_decl
&& result
!= error_mark_node
)
5531 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5536 /* Like cp_build_compound_expr, but for the c-common bits. */
5539 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5541 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5544 /* Build a compound expression. */
5547 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5549 lhs
= convert_to_void (lhs
, "left-hand operand of comma", complain
);
5551 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5552 return error_mark_node
;
5554 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5556 /* If the rhs is a TARGET_EXPR, then build the compound
5557 expression inside the target_expr's initializer. This
5558 helps the compiler to eliminate unnecessary temporaries. */
5559 tree init
= TREE_OPERAND (rhs
, 1);
5561 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5562 TREE_OPERAND (rhs
, 1) = init
;
5567 if (type_unknown_p (rhs
))
5569 error ("no context to resolve type of %qE", rhs
);
5570 return error_mark_node
;
5573 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5576 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5577 casts away constness. CAST gives the type of cast.
5579 ??? This function warns for casting away any qualifier not just
5580 const. We would like to specify exactly what qualifiers are casted
5585 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5586 enum tree_code cast
)
5588 /* C-style casts are allowed to cast away constness. With
5589 WARN_CAST_QUAL, we still want to issue a warning. */
5590 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5593 if (!casts_away_constness (src_type
, dest_type
))
5599 warning (OPT_Wcast_qual
,
5600 "cast from type %qT to type %qT casts away qualifiers",
5601 src_type
, dest_type
);
5604 case STATIC_CAST_EXPR
:
5605 error ("static_cast from type %qT to type %qT casts away qualifiers",
5606 src_type
, dest_type
);
5609 case REINTERPRET_CAST_EXPR
:
5610 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5611 src_type
, dest_type
);
5618 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5619 (another pointer-to-member type in the same hierarchy) and return
5620 the converted expression. If ALLOW_INVERSE_P is permitted, a
5621 pointer-to-derived may be converted to pointer-to-base; otherwise,
5622 only the other direction is permitted. If C_CAST_P is true, this
5623 conversion is taking place as part of a C-style cast. */
5626 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5629 if (TYPE_PTRMEM_P (type
))
5633 if (TREE_CODE (expr
) == PTRMEM_CST
)
5634 expr
= cplus_expand_constant (expr
);
5635 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5636 TYPE_PTRMEM_CLASS_TYPE (type
),
5639 if (!integer_zerop (delta
))
5641 tree cond
, op1
, op2
;
5643 cond
= cp_build_binary_op (input_location
,
5646 build_int_cst (TREE_TYPE (expr
), -1),
5647 tf_warning_or_error
);
5648 op1
= build_nop (ptrdiff_type_node
, expr
);
5649 op2
= cp_build_binary_op (input_location
,
5650 PLUS_EXPR
, op1
, delta
,
5651 tf_warning_or_error
);
5653 expr
= fold_build3_loc (input_location
,
5654 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5658 return build_nop (type
, expr
);
5661 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5662 allow_inverse_p
, c_cast_p
);
5665 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
5666 a version of EXPR that has TREE_OVERFLOW set if it is set in ORIG.
5667 Otherwise, return EXPR unchanged. */
5670 ignore_overflows (tree expr
, tree orig
)
5672 if (TREE_CODE (expr
) == INTEGER_CST
5673 && CONSTANT_CLASS_P (orig
)
5674 && TREE_CODE (orig
) != STRING_CST
5675 && TREE_OVERFLOW (expr
) != TREE_OVERFLOW (orig
))
5677 if (!TREE_OVERFLOW (orig
))
5678 /* Ensure constant sharing. */
5679 expr
= build_int_cst_wide (TREE_TYPE (expr
),
5680 TREE_INT_CST_LOW (expr
),
5681 TREE_INT_CST_HIGH (expr
));
5684 /* Avoid clobbering a shared constant. */
5685 expr
= copy_node (expr
);
5686 TREE_OVERFLOW (expr
) = TREE_OVERFLOW (orig
);
5692 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5693 this static_cast is being attempted as one of the possible casts
5694 allowed by a C-style cast. (In that case, accessibility of base
5695 classes is not considered, and it is OK to cast away
5696 constness.) Return the result of the cast. *VALID_P is set to
5697 indicate whether or not the cast was valid. */
5700 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5701 bool *valid_p
, tsubst_flags_t complain
)
5707 /* Assume the cast is valid. */
5710 intype
= TREE_TYPE (expr
);
5712 /* Save casted types in the function's used types hash table. */
5713 used_types_insert (type
);
5715 /* [expr.static.cast]
5717 An lvalue of type "cv1 B", where B is a class type, can be cast
5718 to type "reference to cv2 D", where D is a class derived (clause
5719 _class.derived_) from B, if a valid standard conversion from
5720 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5721 same cv-qualification as, or greater cv-qualification than, cv1,
5722 and B is not a virtual base class of D. */
5723 /* We check this case before checking the validity of "TYPE t =
5724 EXPR;" below because for this case:
5727 struct D : public B { D(const B&); };
5729 void f() { static_cast<const D&>(b); }
5731 we want to avoid constructing a new D. The standard is not
5732 completely clear about this issue, but our interpretation is
5733 consistent with other compilers. */
5734 if (TREE_CODE (type
) == REFERENCE_TYPE
5735 && CLASS_TYPE_P (TREE_TYPE (type
))
5736 && CLASS_TYPE_P (intype
)
5737 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5738 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5739 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5740 build_pointer_type (TYPE_MAIN_VARIANT
5741 (TREE_TYPE (type
))))
5743 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5747 /* There is a standard conversion from "D*" to "B*" even if "B"
5748 is ambiguous or inaccessible. If this is really a
5749 static_cast, then we check both for inaccessibility and
5750 ambiguity. However, if this is a static_cast being performed
5751 because the user wrote a C-style cast, then accessibility is
5753 base
= lookup_base (TREE_TYPE (type
), intype
,
5754 c_cast_p
? ba_unique
: ba_check
,
5757 /* Convert from "B*" to "D*". This function will check that "B"
5758 is not a virtual base of "D". */
5759 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5760 base
, /*nonnull=*/false);
5761 /* Convert the pointer to a reference -- but then remember that
5762 there are no expressions with reference type in C++. */
5763 return convert_from_reference (cp_fold_convert (type
, expr
));
5766 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5767 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5768 if (TREE_CODE (type
) == REFERENCE_TYPE
5769 && TYPE_REF_IS_RVALUE (type
)
5770 && real_lvalue_p (expr
)
5771 && reference_related_p (TREE_TYPE (type
), intype
)
5772 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5774 expr
= build_typed_address (expr
, type
);
5775 return convert_from_reference (expr
);
5780 /* Resolve overloaded address here rather than once in
5781 implicit_conversion and again in the inverse code below. */
5782 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5784 expr
= instantiate_type (type
, expr
, complain
);
5785 intype
= TREE_TYPE (expr
);
5788 /* [expr.static.cast]
5790 An expression e can be explicitly converted to a type T using a
5791 static_cast of the form static_cast<T>(e) if the declaration T
5792 t(e);" is well-formed, for some invented temporary variable
5794 result
= perform_direct_initialization_if_possible (type
, expr
,
5795 c_cast_p
, complain
);
5798 result
= convert_from_reference (result
);
5800 /* Ignore any integer overflow caused by the cast. */
5801 result
= ignore_overflows (result
, orig
);
5803 /* [expr.static.cast]
5805 If T is a reference type, the result is an lvalue; otherwise,
5806 the result is an rvalue. */
5807 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5808 result
= rvalue (result
);
5812 /* [expr.static.cast]
5814 Any expression can be explicitly converted to type cv void. */
5815 if (TREE_CODE (type
) == VOID_TYPE
)
5816 return convert_to_void (expr
, /*implicit=*/NULL
, complain
);
5818 /* [expr.static.cast]
5820 The inverse of any standard conversion sequence (clause _conv_),
5821 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5822 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5823 (_conv.bool_) conversions, can be performed explicitly using
5824 static_cast subject to the restriction that the explicit
5825 conversion does not cast away constness (_expr.const.cast_), and
5826 the following additional rules for specific cases: */
5827 /* For reference, the conversions not excluded are: integral
5828 promotions, floating point promotion, integral conversions,
5829 floating point conversions, floating-integral conversions,
5830 pointer conversions, and pointer to member conversions. */
5833 A value of integral _or enumeration_ type can be explicitly
5834 converted to an enumeration type. */
5835 /* The effect of all that is that any conversion between any two
5836 types which are integral, floating, or enumeration types can be
5838 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5839 || SCALAR_FLOAT_TYPE_P (type
))
5840 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5841 || SCALAR_FLOAT_TYPE_P (intype
)))
5843 expr
= ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5845 /* Ignore any integer overflow caused by the cast. */
5846 expr
= ignore_overflows (expr
, orig
);
5850 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5851 && CLASS_TYPE_P (TREE_TYPE (type
))
5852 && CLASS_TYPE_P (TREE_TYPE (intype
))
5853 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5854 (TREE_TYPE (intype
))),
5855 build_pointer_type (TYPE_MAIN_VARIANT
5856 (TREE_TYPE (type
)))))
5861 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5862 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
5863 c_cast_p
? ba_unique
: ba_check
,
5865 return build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
5868 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5869 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5876 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
5877 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
5879 if (TYPE_PTRMEM_P (type
))
5881 t1
= (build_ptrmem_type
5883 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
5884 t2
= (build_ptrmem_type
5886 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
5893 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
5896 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5897 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
5902 /* [expr.static.cast]
5904 An rvalue of type "pointer to cv void" can be explicitly
5905 converted to a pointer to object type. A value of type pointer
5906 to object converted to "pointer to cv void" and back to the
5907 original pointer type will have its original value. */
5908 if (TREE_CODE (intype
) == POINTER_TYPE
5909 && VOID_TYPE_P (TREE_TYPE (intype
))
5910 && TYPE_PTROB_P (type
))
5913 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5914 return build_nop (type
, expr
);
5918 return error_mark_node
;
5921 /* Return an expression representing static_cast<TYPE>(EXPR). */
5924 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5929 if (type
== error_mark_node
|| expr
== error_mark_node
)
5930 return error_mark_node
;
5932 if (processing_template_decl
)
5934 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
5935 /* We don't know if it will or will not have side effects. */
5936 TREE_SIDE_EFFECTS (expr
) = 1;
5937 return convert_from_reference (expr
);
5940 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5941 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5942 if (TREE_CODE (type
) != REFERENCE_TYPE
5943 && TREE_CODE (expr
) == NOP_EXPR
5944 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5945 expr
= TREE_OPERAND (expr
, 0);
5947 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
5952 if (complain
& tf_error
)
5953 error ("invalid static_cast from type %qT to type %qT",
5954 TREE_TYPE (expr
), type
);
5955 return error_mark_node
;
5958 /* EXPR is an expression with member function or pointer-to-member
5959 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5960 not permitted by ISO C++, but we accept it in some modes. If we
5961 are not in one of those modes, issue a diagnostic. Return the
5962 converted expression. */
5965 convert_member_func_to_ptr (tree type
, tree expr
)
5970 intype
= TREE_TYPE (expr
);
5971 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
5972 || TREE_CODE (intype
) == METHOD_TYPE
);
5974 if (pedantic
|| warn_pmf2ptr
)
5975 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
5976 "converting from %qT to %qT", intype
, type
);
5978 if (TREE_CODE (intype
) == METHOD_TYPE
)
5979 expr
= build_addr_func (expr
);
5980 else if (TREE_CODE (expr
) == PTRMEM_CST
)
5981 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
5984 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
5985 decl
= build_address (decl
);
5986 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
5989 return build_nop (type
, expr
);
5992 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
5993 If C_CAST_P is true, this reinterpret cast is being done as part of
5994 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
5995 indicate whether or not reinterpret_cast was valid. */
5998 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5999 bool *valid_p
, tsubst_flags_t complain
)
6003 /* Assume the cast is invalid. */
6007 if (type
== error_mark_node
|| error_operand_p (expr
))
6008 return error_mark_node
;
6010 intype
= TREE_TYPE (expr
);
6012 /* Save casted types in the function's used types hash table. */
6013 used_types_insert (type
);
6015 /* [expr.reinterpret.cast]
6016 An lvalue expression of type T1 can be cast to the type
6017 "reference to T2" if an expression of type "pointer to T1" can be
6018 explicitly converted to the type "pointer to T2" using a
6019 reinterpret_cast. */
6020 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6022 if (! real_lvalue_p (expr
))
6024 if (complain
& tf_error
)
6025 error ("invalid cast of an rvalue expression of type "
6028 return error_mark_node
;
6031 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6032 "B" are related class types; the reinterpret_cast does not
6033 adjust the pointer. */
6034 if (TYPE_PTR_P (intype
)
6035 && (complain
& tf_warning
)
6036 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
6037 COMPARE_BASE
| COMPARE_DERIVED
)))
6038 warning (0, "casting %qT to %qT does not dereference pointer",
6041 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0, complain
);
6043 if (warn_strict_aliasing
> 2)
6044 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
6046 if (expr
!= error_mark_node
)
6047 expr
= build_reinterpret_cast_1
6048 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
6050 if (expr
!= error_mark_node
)
6051 /* cp_build_indirect_ref isn't right for rvalue refs. */
6052 expr
= convert_from_reference (fold_convert (type
, expr
));
6056 /* As a G++ extension, we consider conversions from member
6057 functions, and pointers to member functions to
6058 pointer-to-function and pointer-to-void types. If
6059 -Wno-pmf-conversions has not been specified,
6060 convert_member_func_to_ptr will issue an error message. */
6061 if ((TYPE_PTRMEMFUNC_P (intype
)
6062 || TREE_CODE (intype
) == METHOD_TYPE
)
6063 && TYPE_PTR_P (type
)
6064 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6065 || VOID_TYPE_P (TREE_TYPE (type
))))
6066 return convert_member_func_to_ptr (type
, expr
);
6068 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6069 array-to-pointer, and function-to-pointer conversions are
6071 expr
= decay_conversion (expr
);
6073 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6074 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6075 if (TREE_CODE (expr
) == NOP_EXPR
6076 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6077 expr
= TREE_OPERAND (expr
, 0);
6079 if (error_operand_p (expr
))
6080 return error_mark_node
;
6082 intype
= TREE_TYPE (expr
);
6084 /* [expr.reinterpret.cast]
6085 A pointer can be converted to any integral type large enough to
6086 hold it. ... A value of type std::nullptr_t can be converted to
6087 an integral type; the conversion has the same meaning and
6088 validity as a conversion of (void*)0 to the integral type. */
6089 if (CP_INTEGRAL_TYPE_P (type
)
6090 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
6092 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
6094 if (complain
& tf_error
)
6095 permerror (input_location
, "cast from %qT to %qT loses precision",
6098 return error_mark_node
;
6100 if (NULLPTR_TYPE_P (intype
))
6101 return build_int_cst (type
, 0);
6103 /* [expr.reinterpret.cast]
6104 A value of integral or enumeration type can be explicitly
6105 converted to a pointer. */
6106 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6109 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6110 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6111 return fold_if_not_in_template (build_nop (type
, expr
));
6112 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6113 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6118 check_for_casting_away_constness (intype
, type
, REINTERPRET_CAST_EXPR
);
6119 /* Warn about possible alignment problems. */
6120 if (STRICT_ALIGNMENT
&& warn_cast_align
6121 && (complain
& tf_warning
)
6122 && !VOID_TYPE_P (type
)
6123 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6124 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6125 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6126 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6127 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6128 "increases required alignment of target type", intype
, type
);
6130 /* We need to strip nops here, because the front end likes to
6131 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6133 if (warn_strict_aliasing
<= 2)
6134 strict_aliasing_warning (intype
, type
, sexpr
);
6136 return fold_if_not_in_template (build_nop (type
, expr
));
6138 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6139 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6141 if (pedantic
&& (complain
& tf_warning
))
6142 /* Only issue a warning, as we have always supported this
6143 where possible, and it is necessary in some cases. DR 195
6144 addresses this issue, but as of 2004/10/26 is still in
6146 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6147 return fold_if_not_in_template (build_nop (type
, expr
));
6149 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6150 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6151 else if (TREE_CODE (intype
) == VECTOR_TYPE
6152 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6153 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6158 if (complain
& tf_error
)
6159 error ("invalid cast from type %qT to type %qT", intype
, type
);
6160 return error_mark_node
;
6163 return cp_convert (type
, expr
);
6167 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6169 if (type
== error_mark_node
|| expr
== error_mark_node
)
6170 return error_mark_node
;
6172 if (processing_template_decl
)
6174 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6176 if (!TREE_SIDE_EFFECTS (t
)
6177 && type_dependent_expression_p (expr
))
6178 /* There might turn out to be side effects inside expr. */
6179 TREE_SIDE_EFFECTS (t
) = 1;
6180 return convert_from_reference (t
);
6183 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6184 /*valid_p=*/NULL
, complain
);
6187 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6188 return an appropriate expression. Otherwise, return
6189 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6190 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6191 performing a C-style cast, its value upon return will indicate
6192 whether or not the conversion succeeded. */
6195 build_const_cast_1 (tree dst_type
, tree expr
, bool complain
,
6199 tree reference_type
;
6201 /* Callers are responsible for handling error_mark_node as a
6202 destination type. */
6203 gcc_assert (dst_type
!= error_mark_node
);
6204 /* In a template, callers should be building syntactic
6205 representations of casts, not using this machinery. */
6206 gcc_assert (!processing_template_decl
);
6208 /* Assume the conversion is invalid. */
6212 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6215 error ("invalid use of const_cast with type %qT, "
6216 "which is not a pointer, "
6217 "reference, nor a pointer-to-data-member type", dst_type
);
6218 return error_mark_node
;
6221 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6224 error ("invalid use of const_cast with type %qT, which is a pointer "
6225 "or reference to a function type", dst_type
);
6226 return error_mark_node
;
6229 /* Save casted types in the function's used types hash table. */
6230 used_types_insert (dst_type
);
6232 src_type
= TREE_TYPE (expr
);
6233 /* Expressions do not really have reference types. */
6234 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6235 src_type
= TREE_TYPE (src_type
);
6237 /* [expr.const.cast]
6239 An lvalue of type T1 can be explicitly converted to an lvalue of
6240 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6241 types) if a pointer to T1 can be explicitly converted to the type
6242 pointer to T2 using a const_cast. */
6243 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6245 reference_type
= dst_type
;
6246 if (! real_lvalue_p (expr
))
6249 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6250 src_type
, dst_type
);
6251 return error_mark_node
;
6253 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6254 src_type
= build_pointer_type (src_type
);
6258 reference_type
= NULL_TREE
;
6259 /* If the destination type is not a reference type, the
6260 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6261 conversions are performed. */
6262 src_type
= type_decays_to (src_type
);
6263 if (src_type
== error_mark_node
)
6264 return error_mark_node
;
6267 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6268 && comp_ptr_ttypes_const (dst_type
, src_type
))
6273 /* This cast is actually a C-style cast. Issue a warning if
6274 the user is making a potentially unsafe cast. */
6275 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
);
6279 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0,
6280 complain
? tf_warning_or_error
: tf_none
);
6281 expr
= build_nop (reference_type
, expr
);
6282 return convert_from_reference (expr
);
6286 expr
= decay_conversion (expr
);
6287 /* build_c_cast puts on a NOP_EXPR to make the result not an
6288 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6289 non-lvalue context. */
6290 if (TREE_CODE (expr
) == NOP_EXPR
6291 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6292 expr
= TREE_OPERAND (expr
, 0);
6293 return build_nop (dst_type
, expr
);
6298 error ("invalid const_cast from type %qT to type %qT",
6299 src_type
, dst_type
);
6300 return error_mark_node
;
6304 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6306 if (type
== error_mark_node
|| error_operand_p (expr
))
6307 return error_mark_node
;
6309 if (processing_template_decl
)
6311 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6313 if (!TREE_SIDE_EFFECTS (t
)
6314 && type_dependent_expression_p (expr
))
6315 /* There might turn out to be side effects inside expr. */
6316 TREE_SIDE_EFFECTS (t
) = 1;
6317 return convert_from_reference (t
);
6320 return build_const_cast_1 (type
, expr
, complain
& tf_error
,
6324 /* Like cp_build_c_cast, but for the c-common bits. */
6327 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6329 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6332 /* Build an expression representing an explicit C-style cast to type
6333 TYPE of expression EXPR. */
6336 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6342 if (type
== error_mark_node
|| error_operand_p (expr
))
6343 return error_mark_node
;
6345 if (processing_template_decl
)
6347 tree t
= build_min (CAST_EXPR
, type
,
6348 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6349 /* We don't know if it will or will not have side effects. */
6350 TREE_SIDE_EFFECTS (t
) = 1;
6351 return convert_from_reference (t
);
6354 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6355 'Class') should always be retained, because this information aids
6356 in method lookup. */
6357 if (objc_is_object_ptr (type
)
6358 && objc_is_object_ptr (TREE_TYPE (expr
)))
6359 return build_nop (type
, expr
);
6361 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6362 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6363 if (TREE_CODE (type
) != REFERENCE_TYPE
6364 && TREE_CODE (value
) == NOP_EXPR
6365 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6366 value
= TREE_OPERAND (value
, 0);
6368 if (TREE_CODE (type
) == ARRAY_TYPE
)
6370 /* Allow casting from T1* to T2[] because Cfront allows it.
6371 NIHCL uses it. It is not valid ISO C++ however. */
6372 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6374 if (complain
& tf_error
)
6375 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6377 return error_mark_node
;
6378 type
= build_pointer_type (TREE_TYPE (type
));
6382 if (complain
& tf_error
)
6383 error ("ISO C++ forbids casting to an array type %qT", type
);
6384 return error_mark_node
;
6388 if (TREE_CODE (type
) == FUNCTION_TYPE
6389 || TREE_CODE (type
) == METHOD_TYPE
)
6391 if (complain
& tf_error
)
6392 error ("invalid cast to function type %qT", type
);
6393 return error_mark_node
;
6396 if (TREE_CODE (type
) == POINTER_TYPE
6397 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
6398 /* Casting to an integer of smaller size is an error detected elsewhere. */
6399 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
6400 /* Don't warn about converting any constant. */
6401 && !TREE_CONSTANT (value
))
6402 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
6403 "cast to pointer from integer of different size");
6405 /* A C-style cast can be a const_cast. */
6406 result
= build_const_cast_1 (type
, value
, /*complain=*/false,
6411 /* Or a static cast. */
6412 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6413 &valid_p
, complain
);
6414 /* Or a reinterpret_cast. */
6416 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6417 &valid_p
, complain
);
6418 /* The static_cast or reinterpret_cast may be followed by a
6421 /* A valid cast may result in errors if, for example, a
6422 conversion to am ambiguous base class is required. */
6423 && !error_operand_p (result
))
6427 /* Non-class rvalues always have cv-unqualified type. */
6428 if (!CLASS_TYPE_P (type
))
6429 type
= TYPE_MAIN_VARIANT (type
);
6430 result_type
= TREE_TYPE (result
);
6431 if (!CLASS_TYPE_P (result_type
))
6432 result_type
= TYPE_MAIN_VARIANT (result_type
);
6433 /* If the type of RESULT does not match TYPE, perform a
6434 const_cast to make it match. If the static_cast or
6435 reinterpret_cast succeeded, we will differ by at most
6436 cv-qualification, so the follow-on const_cast is guaranteed
6438 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6440 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6441 gcc_assert (valid_p
);
6446 return error_mark_node
;
6449 /* For use from the C common bits. */
6451 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6452 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6453 enum tree_code modifycode
,
6454 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6455 tree rhs_origtype ATTRIBUTE_UNUSED
)
6457 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6460 /* Build an assignment expression of lvalue LHS from value RHS.
6461 MODIFYCODE is the code for a binary operator that we use
6462 to combine the old value of LHS with RHS to get the new value.
6463 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6465 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6468 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6469 tsubst_flags_t complain
)
6473 tree lhstype
= TREE_TYPE (lhs
);
6474 tree olhstype
= lhstype
;
6475 bool plain_assign
= (modifycode
== NOP_EXPR
);
6477 /* Avoid duplicate error messages from operands that had errors. */
6478 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6479 return error_mark_node
;
6481 /* Handle control structure constructs used as "lvalues". */
6482 switch (TREE_CODE (lhs
))
6484 /* Handle --foo = 5; as these are valid constructs in C++. */
6485 case PREDECREMENT_EXPR
:
6486 case PREINCREMENT_EXPR
:
6487 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6488 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6489 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6490 TREE_OPERAND (lhs
, 1));
6491 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6492 modifycode
, rhs
, complain
);
6493 if (newrhs
== error_mark_node
)
6494 return error_mark_node
;
6495 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6497 /* Handle (a, b) used as an "lvalue". */
6499 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6500 modifycode
, rhs
, complain
);
6501 if (newrhs
== error_mark_node
)
6502 return error_mark_node
;
6503 return build2 (COMPOUND_EXPR
, lhstype
,
6504 TREE_OPERAND (lhs
, 0), newrhs
);
6507 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6508 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6509 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6510 TREE_OPERAND (lhs
, 1));
6511 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6513 if (newrhs
== error_mark_node
)
6514 return error_mark_node
;
6515 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6519 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6520 when neither operand has side-effects. */
6521 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6522 return error_mark_node
;
6524 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6525 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6527 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6528 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6530 TREE_OPERAND (lhs
, 0),
6531 TREE_OPERAND (lhs
, 1)),
6532 TREE_OPERAND (lhs
, 0),
6533 TREE_OPERAND (lhs
, 1));
6536 /* Handle (a ? b : c) used as an "lvalue". */
6539 /* Produce (a ? (b = rhs) : (c = rhs))
6540 except that the RHS goes through a save-expr
6541 so the code to compute it is only emitted once. */
6543 tree preeval
= NULL_TREE
;
6545 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6547 if (complain
& tf_error
)
6548 error ("void value not ignored as it ought to be");
6549 return error_mark_node
;
6552 rhs
= stabilize_expr (rhs
, &preeval
);
6554 /* Check this here to avoid odd errors when trying to convert
6555 a throw to the type of the COND_EXPR. */
6556 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6557 return error_mark_node
;
6559 cond
= build_conditional_expr
6560 (TREE_OPERAND (lhs
, 0),
6561 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6562 modifycode
, rhs
, complain
),
6563 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6564 modifycode
, rhs
, complain
),
6567 if (cond
== error_mark_node
)
6569 /* Make sure the code to compute the rhs comes out
6570 before the split. */
6572 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6580 if (modifycode
== INIT_EXPR
)
6582 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6583 /* Do the default thing. */;
6584 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6586 /* Compound literal. */
6587 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6588 /* Call convert to generate an error; see PR 11063. */
6589 rhs
= convert (lhstype
, rhs
);
6590 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6591 TREE_SIDE_EFFECTS (result
) = 1;
6594 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6595 /* Do the default thing. */;
6598 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6599 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6600 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6602 release_tree_vector (rhs_vec
);
6603 if (result
== NULL_TREE
)
6604 return error_mark_node
;
6610 lhs
= require_complete_type (lhs
);
6611 if (lhs
== error_mark_node
)
6612 return error_mark_node
;
6614 if (modifycode
== NOP_EXPR
)
6616 /* `operator=' is not an inheritable operator. */
6617 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6618 /* Do the default thing. */;
6621 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6622 lhs
, rhs
, make_node (NOP_EXPR
),
6623 /*overloaded_p=*/NULL
,
6625 if (result
== NULL_TREE
)
6626 return error_mark_node
;
6633 /* A binary op has been requested. Combine the old LHS
6634 value with the RHS producing the value we should actually
6635 store into the LHS. */
6636 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6637 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6638 || MAYBE_CLASS_TYPE_P (lhstype
)));
6640 lhs
= stabilize_reference (lhs
);
6641 newrhs
= cp_build_binary_op (input_location
,
6642 modifycode
, lhs
, rhs
,
6644 if (newrhs
== error_mark_node
)
6646 if (complain
& tf_error
)
6647 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6648 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6649 return error_mark_node
;
6652 /* Now it looks like a plain assignment. */
6653 modifycode
= NOP_EXPR
;
6655 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6656 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6659 /* The left-hand side must be an lvalue. */
6660 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6661 return error_mark_node
;
6663 /* Warn about modifying something that is `const'. Don't warn if
6664 this is initialization. */
6665 if (modifycode
!= INIT_EXPR
6666 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6667 /* Functions are not modifiable, even though they are
6669 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6670 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6671 /* If it's an aggregate and any field is const, then it is
6672 effectively const. */
6673 || (CLASS_TYPE_P (lhstype
)
6674 && C_TYPE_FIELDS_READONLY (lhstype
))))
6676 if (complain
& tf_error
)
6677 readonly_error (lhs
, REK_ASSIGNMENT
);
6679 return error_mark_node
;
6682 /* If storing into a structure or union member, it may have been given a
6683 lowered bitfield type. We need to convert to the declared type first,
6684 so retrieve it now. */
6686 olhstype
= unlowered_expr_type (lhs
);
6688 /* Convert new value to destination type. */
6690 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6694 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6696 if (modifycode
!= INIT_EXPR
)
6698 if (complain
& tf_error
)
6699 error ("assigning to an array from an initializer list");
6700 return error_mark_node
;
6702 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6703 return error_mark_node
;
6704 newrhs
= digest_init (lhstype
, newrhs
);
6707 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6708 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6710 if (complain
& tf_error
)
6711 error ("incompatible types in assignment of %qT to %qT",
6712 TREE_TYPE (rhs
), lhstype
);
6713 return error_mark_node
;
6716 /* Allow array assignment in compiler-generated code. */
6717 else if (!current_function_decl
6718 || !DECL_ARTIFICIAL (current_function_decl
))
6720 /* This routine is used for both initialization and assignment.
6721 Make sure the diagnostic message differentiates the context. */
6722 if (complain
& tf_error
)
6724 if (modifycode
== INIT_EXPR
)
6725 error ("array used as initializer");
6727 error ("invalid array assignment");
6729 return error_mark_node
;
6732 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6733 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6734 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6735 /*explicit_value_init_p=*/false,
6736 from_array
, complain
);
6739 if (modifycode
== INIT_EXPR
)
6740 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6741 LOOKUP_ONLYCONVERTING. */
6742 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6743 "initialization", NULL_TREE
, 0,
6746 newrhs
= convert_for_assignment (olhstype
, newrhs
, "assignment",
6747 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6749 if (!same_type_p (lhstype
, olhstype
))
6750 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6752 if (modifycode
!= INIT_EXPR
)
6754 if (TREE_CODE (newrhs
) == CALL_EXPR
6755 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6756 newrhs
= build_cplus_new (lhstype
, newrhs
);
6758 /* Can't initialize directly from a TARGET_EXPR, since that would
6759 cause the lhs to be constructed twice, and possibly result in
6760 accidental self-initialization. So we force the TARGET_EXPR to be
6761 expanded without a target. */
6762 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6763 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6764 TREE_OPERAND (newrhs
, 0));
6767 if (newrhs
== error_mark_node
)
6768 return error_mark_node
;
6770 if (c_dialect_objc () && flag_objc_gc
)
6772 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6778 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6779 lhstype
, lhs
, newrhs
);
6781 TREE_SIDE_EFFECTS (result
) = 1;
6783 TREE_NO_WARNING (result
) = 1;
6789 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6790 tsubst_flags_t complain
)
6792 if (processing_template_decl
)
6793 return build_min_nt (MODOP_EXPR
, lhs
,
6794 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6796 if (modifycode
!= NOP_EXPR
)
6798 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6799 make_node (modifycode
),
6800 /*overloaded_p=*/NULL
,
6804 TREE_NO_WARNING (rval
) = 1;
6808 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6811 /* Helper function for get_delta_difference which assumes FROM is a base
6812 class of TO. Returns a delta for the conversion of pointer-to-member
6813 of FROM to pointer-to-member of TO. If the conversion is invalid,
6814 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6815 If C_CAST_P is true, this conversion is taking place as part of a C-style
6819 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
)
6824 binfo
= lookup_base (to
, from
, c_cast_p
? ba_unique
: ba_check
, &kind
);
6825 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6827 error (" in pointer to member function conversion");
6828 return size_zero_node
;
6832 if (kind
!= bk_via_virtual
)
6833 return BINFO_OFFSET (binfo
);
6835 /* FROM is a virtual base class of TO. Issue an error or warning
6836 depending on whether or not this is a reinterpret cast. */
6838 error ("pointer to member conversion via virtual base %qT",
6839 BINFO_TYPE (binfo_from_vbase (binfo
)));
6841 return size_zero_node
;
6848 /* Get difference in deltas for different pointer to member function
6849 types. Returns an integer constant of type PTRDIFF_TYPE_NODE. If
6850 the conversion is invalid, the constant is zero. If
6851 ALLOW_INVERSE_P is true, then allow reverse conversions as well.
6852 If C_CAST_P is true this conversion is taking place as part of a
6855 Note that the naming of FROM and TO is kind of backwards; the return
6856 value is what we add to a TO in order to get a FROM. They are named
6857 this way because we call this function to find out how to convert from
6858 a pointer to member of FROM to a pointer to member of TO. */
6861 get_delta_difference (tree from
, tree to
,
6862 bool allow_inverse_p
,
6867 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
6868 /* Pointer to member of incomplete class is permitted*/
6869 result
= size_zero_node
;
6871 result
= get_delta_difference_1 (from
, to
, c_cast_p
);
6875 if (!allow_inverse_p
)
6877 error_not_base_type (from
, to
);
6878 error (" in pointer to member conversion");
6879 result
= size_zero_node
;
6883 result
= get_delta_difference_1 (to
, from
, c_cast_p
);
6886 result
= size_diffop_loc (input_location
,
6887 size_zero_node
, result
);
6890 error_not_base_type (from
, to
);
6891 error (" in pointer to member conversion");
6892 result
= size_zero_node
;
6897 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
6901 /* Return a constructor for the pointer-to-member-function TYPE using
6902 the other components as specified. */
6905 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
6910 VEC(constructor_elt
, gc
) *v
;
6912 /* Pull the FIELD_DECLs out of the type. */
6913 pfn_field
= TYPE_FIELDS (type
);
6914 delta_field
= TREE_CHAIN (pfn_field
);
6916 /* Make sure DELTA has the type we want. */
6917 delta
= convert_and_check (delta_type_node
, delta
);
6919 /* Convert to the correct target type if necessary. */
6920 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
6922 /* Finish creating the initializer. */
6923 v
= VEC_alloc(constructor_elt
, gc
, 2);
6924 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
6925 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
6926 u
= build_constructor (type
, v
);
6927 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
6928 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
6929 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
6931 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
6936 /* Build a constructor for a pointer to member function. It can be
6937 used to initialize global variables, local variable, or used
6938 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6941 If FORCE is nonzero, then force this conversion, even if
6942 we would rather not do it. Usually set when using an explicit
6943 cast. A C-style cast is being processed iff C_CAST_P is true.
6945 Return error_mark_node, if something goes wrong. */
6948 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
)
6954 if (error_operand_p (pfn
))
6955 return error_mark_node
;
6957 pfn_type
= TREE_TYPE (pfn
);
6958 to_type
= build_ptrmemfunc_type (type
);
6960 /* Handle multiple conversions of pointer to member functions. */
6961 if (TYPE_PTRMEMFUNC_P (pfn_type
))
6963 tree delta
= NULL_TREE
;
6964 tree npfn
= NULL_TREE
;
6968 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
6969 error ("invalid conversion to type %qT from type %qT",
6972 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
6973 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
6977 /* We don't have to do any conversion to convert a
6978 pointer-to-member to its own type. But, we don't want to
6979 just return a PTRMEM_CST if there's an explicit cast; that
6980 cast should make the expression an invalid template argument. */
6981 if (TREE_CODE (pfn
) != PTRMEM_CST
)
6983 if (same_type_p (to_type
, pfn_type
))
6985 else if (integer_zerop (n
))
6986 return build_reinterpret_cast (to_type
, pfn
,
6987 tf_warning_or_error
);
6990 if (TREE_SIDE_EFFECTS (pfn
))
6991 pfn
= save_expr (pfn
);
6993 /* Obtain the function pointer and the current DELTA. */
6994 if (TREE_CODE (pfn
) == PTRMEM_CST
)
6995 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
6998 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
6999 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
7002 /* Just adjust the DELTA field. */
7003 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7004 (TREE_TYPE (delta
), ptrdiff_type_node
));
7005 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
7006 n
= cp_build_binary_op (input_location
,
7007 LSHIFT_EXPR
, n
, integer_one_node
,
7008 tf_warning_or_error
);
7009 delta
= cp_build_binary_op (input_location
,
7010 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
7011 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
7014 /* Handle null pointer to member function conversions. */
7015 if (integer_zerop (pfn
))
7017 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
7018 return build_ptrmemfunc1 (to_type
,
7023 if (type_unknown_p (pfn
))
7024 return instantiate_type (type
, pfn
, tf_warning_or_error
);
7026 fn
= TREE_OPERAND (pfn
, 0);
7027 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7028 /* In a template, we will have preserved the
7030 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
7031 return make_ptrmem_cst (to_type
, fn
);
7034 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7037 ??? There is no consistency as to the types returned for the above
7038 values. Some code acts as if it were a sizetype and some as if it were
7039 integer_type_node. */
7042 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
7044 tree type
= TREE_TYPE (cst
);
7045 tree fn
= PTRMEM_CST_MEMBER (cst
);
7046 tree ptr_class
, fn_class
;
7048 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7050 /* The class that the function belongs to. */
7051 fn_class
= DECL_CONTEXT (fn
);
7053 /* The class that we're creating a pointer to member of. */
7054 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
7056 /* First, calculate the adjustment to the function's class. */
7057 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
7060 if (!DECL_VIRTUAL_P (fn
))
7061 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
7064 /* If we're dealing with a virtual function, we have to adjust 'this'
7065 again, to point to the base which provides the vtable entry for
7066 fn; the call will do the opposite adjustment. */
7067 tree orig_class
= DECL_CONTEXT (fn
);
7068 tree binfo
= binfo_or_else (orig_class
, fn_class
);
7069 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7070 *delta
, BINFO_OFFSET (binfo
));
7071 *delta
= fold_if_not_in_template (*delta
);
7073 /* We set PFN to the vtable offset at which the function can be
7074 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7075 case delta is shifted left, and then incremented). */
7076 *pfn
= DECL_VINDEX (fn
);
7077 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
7078 TYPE_SIZE_UNIT (vtable_entry_type
));
7079 *pfn
= fold_if_not_in_template (*pfn
);
7081 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
7083 case ptrmemfunc_vbit_in_pfn
:
7084 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
7086 *pfn
= fold_if_not_in_template (*pfn
);
7089 case ptrmemfunc_vbit_in_delta
:
7090 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
7091 *delta
, integer_one_node
);
7092 *delta
= fold_if_not_in_template (*delta
);
7093 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7094 *delta
, integer_one_node
);
7095 *delta
= fold_if_not_in_template (*delta
);
7102 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
7103 *pfn
= fold_if_not_in_template (*pfn
);
7107 /* Return an expression for PFN from the pointer-to-member function
7111 pfn_from_ptrmemfunc (tree t
)
7113 if (TREE_CODE (t
) == PTRMEM_CST
)
7118 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7123 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
7126 /* Return an expression for DELTA from the pointer-to-member function
7130 delta_from_ptrmemfunc (tree t
)
7132 if (TREE_CODE (t
) == PTRMEM_CST
)
7137 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7142 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7145 /* Convert value RHS to type TYPE as preparation for an assignment to
7146 an lvalue of type TYPE. ERRTYPE is a string to use in error
7147 messages: "assignment", "return", etc. If FNDECL is non-NULL, we
7148 are doing the conversion in order to pass the PARMNUMth argument of
7152 convert_for_assignment (tree type
, tree rhs
,
7153 const char *errtype
, tree fndecl
, int parmnum
,
7154 tsubst_flags_t complain
, int flags
)
7157 enum tree_code coder
;
7159 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7160 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7161 rhs
= TREE_OPERAND (rhs
, 0);
7163 rhstype
= TREE_TYPE (rhs
);
7164 coder
= TREE_CODE (rhstype
);
7166 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7167 && vector_types_convertible_p (type
, rhstype
, true))
7168 return convert (type
, rhs
);
7170 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7171 return error_mark_node
;
7172 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7173 return error_mark_node
;
7175 /* The RHS of an assignment cannot have void type. */
7176 if (coder
== VOID_TYPE
)
7178 if (complain
& tf_error
)
7179 error ("void value not ignored as it ought to be");
7180 return error_mark_node
;
7183 /* Simplify the RHS if possible. */
7184 if (TREE_CODE (rhs
) == CONST_DECL
)
7185 rhs
= DECL_INITIAL (rhs
);
7187 if (c_dialect_objc ())
7190 tree rname
= fndecl
;
7192 if (!strcmp (errtype
, "assignment"))
7194 else if (!strcmp (errtype
, "initialization"))
7198 tree selector
= objc_message_selector ();
7202 if (selector
&& parmno
> 1)
7209 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7210 return convert (type
, rhs
);
7215 The expression is implicitly converted (clause _conv_) to the
7216 cv-unqualified type of the left operand.
7218 We allow bad conversions here because by the time we get to this point
7219 we are committed to doing the conversion. If we end up doing a bad
7220 conversion, convert_like will complain. */
7221 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7223 /* When -Wno-pmf-conversions is use, we just silently allow
7224 conversions from pointers-to-members to plain pointers. If
7225 the conversion doesn't work, cp_convert will complain. */
7227 && TYPE_PTR_P (type
)
7228 && TYPE_PTRMEMFUNC_P (rhstype
))
7229 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7232 if (complain
& tf_error
)
7234 /* If the right-hand side has unknown type, then it is an
7235 overloaded function. Call instantiate_type to get error
7237 if (rhstype
== unknown_type_node
)
7238 instantiate_type (type
, rhs
, tf_warning_or_error
);
7240 error ("cannot convert %qT to %qT for argument %qP to %qD",
7241 rhstype
, type
, parmnum
, fndecl
);
7243 error ("cannot convert %qT to %qT in %s", rhstype
, type
,
7246 return error_mark_node
;
7249 if (warn_missing_format_attribute
)
7251 const enum tree_code codel
= TREE_CODE (type
);
7252 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7254 && check_missing_format_attribute (type
, rhstype
)
7255 && (complain
& tf_warning
))
7256 warning (OPT_Wmissing_format_attribute
,
7257 "%s might be a candidate for a format attribute",
7261 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7263 if (warn_parentheses
7264 && TREE_CODE (type
) == BOOLEAN_TYPE
7265 && TREE_CODE (rhs
) == MODIFY_EXPR
7266 && !TREE_NO_WARNING (rhs
)
7267 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7268 && (complain
& tf_warning
))
7270 location_t loc
= EXPR_HAS_LOCATION (rhs
)
7271 ? EXPR_LOCATION (rhs
) : input_location
;
7273 warning_at (loc
, OPT_Wparentheses
,
7274 "suggest parentheses around assignment used as truth value");
7275 TREE_NO_WARNING (rhs
) = 1;
7278 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7282 /* Convert RHS to be of type TYPE.
7283 If EXP is nonzero, it is the target of the initialization.
7284 ERRTYPE is a string to use in error messages.
7286 Two major differences between the behavior of
7287 `convert_for_assignment' and `convert_for_initialization'
7288 are that references are bashed in the former, while
7289 copied in the latter, and aggregates are assigned in
7290 the former (operator=) while initialized in the
7293 If using constructor make sure no conversion operator exists, if one does
7294 exist, an ambiguity exists.
7296 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7299 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7300 const char *errtype
, tree fndecl
, int parmnum
,
7301 tsubst_flags_t complain
)
7303 enum tree_code codel
= TREE_CODE (type
);
7305 enum tree_code coder
;
7307 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7308 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7309 if (TREE_CODE (rhs
) == NOP_EXPR
7310 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7311 && codel
!= REFERENCE_TYPE
)
7312 rhs
= TREE_OPERAND (rhs
, 0);
7314 if (type
== error_mark_node
7315 || rhs
== error_mark_node
7316 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7317 return error_mark_node
;
7319 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7320 && TREE_CODE (type
) != ARRAY_TYPE
7321 && (TREE_CODE (type
) != REFERENCE_TYPE
7322 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7323 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7324 && (TREE_CODE (type
) != REFERENCE_TYPE
7325 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7326 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7327 rhs
= decay_conversion (rhs
);
7329 rhstype
= TREE_TYPE (rhs
);
7330 coder
= TREE_CODE (rhstype
);
7332 if (coder
== ERROR_MARK
)
7333 return error_mark_node
;
7335 /* We accept references to incomplete types, so we can
7336 return here before checking if RHS is of complete type. */
7338 if (codel
== REFERENCE_TYPE
)
7340 /* This should eventually happen in convert_arguments. */
7341 int savew
= 0, savee
= 0;
7344 savew
= warningcount
, savee
= errorcount
;
7345 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7346 /*cleanup=*/NULL
, complain
);
7349 if (warningcount
> savew
)
7350 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7351 else if (errorcount
> savee
)
7352 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7358 exp
= require_complete_type (exp
);
7359 if (exp
== error_mark_node
)
7360 return error_mark_node
;
7362 rhstype
= non_reference (rhstype
);
7364 type
= complete_type (type
);
7366 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7367 /* Don't try to do copy-initialization if we already have
7368 direct-initialization. */
7371 if (MAYBE_CLASS_TYPE_P (type
))
7372 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
7374 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7378 /* If RETVAL is the address of, or a reference to, a local variable or
7379 temporary give an appropriate warning. */
7382 maybe_warn_about_returning_address_of_local (tree retval
)
7384 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7385 tree whats_returned
= retval
;
7389 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7390 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7391 else if (CONVERT_EXPR_P (whats_returned
)
7392 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7393 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7398 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7400 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7402 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7404 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7405 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7407 warning (0, "returning reference to temporary");
7410 if (TREE_CODE (whats_returned
) == VAR_DECL
7411 && DECL_NAME (whats_returned
)
7412 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7414 warning (0, "reference to non-lvalue returned");
7419 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7420 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7421 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7423 if (DECL_P (whats_returned
)
7424 && DECL_NAME (whats_returned
)
7425 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7426 && !(TREE_STATIC (whats_returned
)
7427 || TREE_PUBLIC (whats_returned
)))
7429 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7430 warning (0, "reference to local variable %q+D returned",
7433 warning (0, "address of local variable %q+D returned",
7439 /* Check that returning RETVAL from the current function is valid.
7440 Return an expression explicitly showing all conversions required to
7441 change RETVAL into the function return type, and to assign it to
7442 the DECL_RESULT for the function. Set *NO_WARNING to true if
7443 code reaches end of non-void function warning shouldn't be issued
7444 on this RETURN_EXPR. */
7447 check_return_expr (tree retval
, bool *no_warning
)
7450 /* The type actually returned by the function, after any
7453 int fn_returns_value_p
;
7454 bool named_return_value_okay_p
;
7456 *no_warning
= false;
7458 /* A `volatile' function is one that isn't supposed to return, ever.
7459 (This is a G++ extension, used to get better code for functions
7460 that call the `volatile' function.) */
7461 if (TREE_THIS_VOLATILE (current_function_decl
))
7462 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7464 /* Check for various simple errors. */
7465 if (DECL_DESTRUCTOR_P (current_function_decl
))
7468 error ("returning a value from a destructor");
7471 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7473 if (in_function_try_handler
)
7474 /* If a return statement appears in a handler of the
7475 function-try-block of a constructor, the program is ill-formed. */
7476 error ("cannot return from a handler of a function-try-block of a constructor");
7478 /* You can't return a value from a constructor. */
7479 error ("returning a value from a constructor");
7483 /* As an extension, deduce lambda return type from a return statement
7484 anywhere in the body. */
7485 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7487 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7488 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7490 tree type
= lambda_return_type (retval
);
7491 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7493 if (VOID_TYPE_P (type
))
7495 else if (oldtype
== NULL_TREE
)
7497 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7498 "can only be deduced when the return statement is "
7499 "the only statement in the function body");
7500 apply_lambda_return_type (lambda
, type
);
7502 else if (!same_type_p (type
, oldtype
))
7503 error ("inconsistent types %qT and %qT deduced for "
7504 "lambda return type", type
, oldtype
);
7508 if (processing_template_decl
)
7510 current_function_returns_value
= 1;
7511 if (check_for_bare_parameter_packs (retval
))
7512 retval
= error_mark_node
;
7516 /* When no explicit return-value is given in a function with a named
7517 return value, the named return value is used. */
7518 result
= DECL_RESULT (current_function_decl
);
7519 valtype
= TREE_TYPE (result
);
7520 gcc_assert (valtype
!= NULL_TREE
);
7521 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7522 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7525 /* Check for a return statement with no return value in a function
7526 that's supposed to return a value. */
7527 if (!retval
&& fn_returns_value_p
)
7529 permerror (input_location
, "return-statement with no value, in function returning %qT",
7531 /* Clear this, so finish_function won't say that we reach the
7532 end of a non-void function (which we don't, we gave a
7534 current_function_returns_null
= 0;
7535 /* And signal caller that TREE_NO_WARNING should be set on the
7536 RETURN_EXPR to avoid control reaches end of non-void function
7537 warnings in tree-cfg.c. */
7540 /* Check for a return statement with a value in a function that
7541 isn't supposed to return a value. */
7542 else if (retval
&& !fn_returns_value_p
)
7544 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7545 /* You can return a `void' value from a function of `void'
7546 type. In that case, we have to evaluate the expression for
7547 its side-effects. */
7548 finish_expr_stmt (retval
);
7550 permerror (input_location
, "return-statement with a value, in function "
7551 "returning 'void'");
7552 current_function_returns_null
= 1;
7554 /* There's really no value to return, after all. */
7558 /* Remember that this function can sometimes return without a
7560 current_function_returns_null
= 1;
7562 /* Remember that this function did return a value. */
7563 current_function_returns_value
= 1;
7565 /* Check for erroneous operands -- but after giving ourselves a
7566 chance to provide an error about returning a value from a void
7568 if (error_operand_p (retval
))
7570 current_function_return_value
= error_mark_node
;
7571 return error_mark_node
;
7574 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7575 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7576 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7577 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7579 && retval
&& null_ptr_cst_p (retval
))
7580 warning (0, "%<operator new%> must not return NULL unless it is "
7581 "declared %<throw()%> (or -fcheck-new is in effect)");
7583 /* Effective C++ rule 15. See also start_function. */
7585 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7589 /* The function return type must be a reference to the current
7591 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7592 && same_type_ignoring_top_level_qualifiers_p
7593 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7595 /* Returning '*this' is obviously OK. */
7596 if (retval
== current_class_ref
)
7598 /* If we are calling a function whose return type is the same of
7599 the current class reference, it is ok. */
7600 else if (TREE_CODE (retval
) == INDIRECT_REF
7601 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7606 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7609 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7611 [...] For a function with a class return type, if the expression
7612 in the return statement is the name of a local object, and the cv-
7613 unqualified type of the local object is the same as the function
7614 return type, an implementation is permitted to omit creating the tem-
7615 porary object to hold the function return value [...]
7617 So, if this is a value-returning function that always returns the same
7618 local variable, remember it.
7620 It might be nice to be more flexible, and choose the first suitable
7621 variable even if the function sometimes returns something else, but
7622 then we run the risk of clobbering the variable we chose if the other
7623 returned expression uses the chosen variable somehow. And people expect
7624 this restriction, anyway. (jason 2000-11-19)
7626 See finish_function and finalize_nrv for the rest of this optimization. */
7628 named_return_value_okay_p
=
7629 (retval
!= NULL_TREE
7630 /* Must be a local, automatic variable. */
7631 && TREE_CODE (retval
) == VAR_DECL
7632 && DECL_CONTEXT (retval
) == current_function_decl
7633 && ! TREE_STATIC (retval
)
7634 && ! DECL_ANON_UNION_VAR_P (retval
)
7635 && (DECL_ALIGN (retval
)
7636 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7637 /* The cv-unqualified type of the returned value must be the
7638 same as the cv-unqualified return type of the
7640 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7642 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7643 /* And the returned value must be non-volatile. */
7644 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7646 if (fn_returns_value_p
&& flag_elide_constructors
)
7648 if (named_return_value_okay_p
7649 && (current_function_return_value
== NULL_TREE
7650 || current_function_return_value
== retval
))
7651 current_function_return_value
= retval
;
7653 current_function_return_value
= error_mark_node
;
7656 /* We don't need to do any conversions when there's nothing being
7661 /* Do any required conversions. */
7662 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7663 /* No conversions are required. */
7667 /* The type the function is declared to return. */
7668 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7669 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7671 /* The functype's return type will have been set to void, if it
7672 was an incomplete type. Just treat this as 'return;' */
7673 if (VOID_TYPE_P (functype
))
7674 return error_mark_node
;
7676 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7677 treated as an rvalue for the purposes of overload resolution to
7678 favor move constructors over copy constructors. */
7679 if ((cxx_dialect
!= cxx98
)
7680 && named_return_value_okay_p
7681 /* The variable must not have the `volatile' qualifier. */
7682 && !CP_TYPE_VOLATILE_P (TREE_TYPE (retval
))
7683 /* The return type must be a class type. */
7684 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7685 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7687 /* First convert the value to the function's return type, then
7688 to the type of return value's location to handle the
7689 case that functype is smaller than the valtype. */
7690 retval
= convert_for_initialization
7691 (NULL_TREE
, functype
, retval
, flags
, "return", NULL_TREE
, 0,
7692 tf_warning_or_error
);
7693 retval
= convert (valtype
, retval
);
7695 /* If the conversion failed, treat this just like `return;'. */
7696 if (retval
== error_mark_node
)
7698 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7699 else if (! cfun
->returns_struct
7700 && TREE_CODE (retval
) == TARGET_EXPR
7701 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7702 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7703 TREE_OPERAND (retval
, 0));
7705 maybe_warn_about_returning_address_of_local (retval
);
7708 /* Actually copy the value returned into the appropriate location. */
7709 if (retval
&& retval
!= result
)
7710 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7716 /* Returns nonzero if the pointer-type FROM can be converted to the
7717 pointer-type TO via a qualification conversion. If CONSTP is -1,
7718 then we return nonzero if the pointers are similar, and the
7719 cv-qualification signature of FROM is a proper subset of that of TO.
7721 If CONSTP is positive, then all outer pointers have been
7725 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7727 bool to_more_cv_qualified
= false;
7728 bool is_opaque_pointer
= false;
7730 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7732 if (TREE_CODE (to
) != TREE_CODE (from
))
7735 if (TREE_CODE (from
) == OFFSET_TYPE
7736 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7737 TYPE_OFFSET_BASETYPE (to
)))
7740 /* Const and volatile mean something different for function types,
7741 so the usual checks are not appropriate. */
7742 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7744 /* In Objective-C++, some types may have been 'volatilized' by
7745 the compiler for EH; when comparing them here, the volatile
7746 qualification must be ignored. */
7747 bool objc_quals_match
= objc_type_quals_match (to
, from
);
7749 if (!at_least_as_qualified_p (to
, from
) && !objc_quals_match
)
7752 if (!at_least_as_qualified_p (from
, to
) && !objc_quals_match
)
7756 to_more_cv_qualified
= true;
7760 constp
&= TYPE_READONLY (to
);
7763 if (TREE_CODE (to
) == VECTOR_TYPE
)
7764 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7766 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
7767 return ((constp
>= 0 || to_more_cv_qualified
)
7768 && (is_opaque_pointer
7769 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
7773 /* When comparing, say, char ** to char const **, this function takes
7774 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7775 types to this function. */
7778 comp_ptr_ttypes (tree to
, tree from
)
7780 return comp_ptr_ttypes_real (to
, from
, 1);
7783 /* Returns true iff FNTYPE is a non-class type that involves
7784 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7785 if a parameter type is ill-formed. */
7788 error_type_p (const_tree type
)
7792 switch (TREE_CODE (type
))
7798 case REFERENCE_TYPE
:
7800 return error_type_p (TREE_TYPE (type
));
7804 if (error_type_p (TREE_TYPE (type
)))
7806 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7807 if (error_type_p (TREE_VALUE (t
)))
7812 if (TYPE_PTRMEMFUNC_P (type
))
7813 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
7821 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7822 type or inheritance-related types, regardless of cv-quals. */
7825 ptr_reasonably_similar (const_tree to
, const_tree from
)
7827 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7829 /* Any target type is similar enough to void. */
7830 if (TREE_CODE (to
) == VOID_TYPE
)
7831 return !error_type_p (from
);
7832 if (TREE_CODE (from
) == VOID_TYPE
)
7833 return !error_type_p (to
);
7835 if (TREE_CODE (to
) != TREE_CODE (from
))
7838 if (TREE_CODE (from
) == OFFSET_TYPE
7839 && comptypes (TYPE_OFFSET_BASETYPE (to
),
7840 TYPE_OFFSET_BASETYPE (from
),
7841 COMPARE_BASE
| COMPARE_DERIVED
))
7844 if (TREE_CODE (to
) == VECTOR_TYPE
7845 && vector_types_convertible_p (to
, from
, false))
7848 if (TREE_CODE (to
) == INTEGER_TYPE
7849 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
7852 if (TREE_CODE (to
) == FUNCTION_TYPE
)
7853 return !error_type_p (to
) && !error_type_p (from
);
7855 if (TREE_CODE (to
) != POINTER_TYPE
)
7857 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
7858 COMPARE_BASE
| COMPARE_DERIVED
);
7862 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
7863 pointer-to-member types) are the same, ignoring cv-qualification at
7867 comp_ptr_ttypes_const (tree to
, tree from
)
7869 bool is_opaque_pointer
= false;
7871 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7873 if (TREE_CODE (to
) != TREE_CODE (from
))
7876 if (TREE_CODE (from
) == OFFSET_TYPE
7877 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
7878 TYPE_OFFSET_BASETYPE (to
)))
7881 if (TREE_CODE (to
) == VECTOR_TYPE
)
7882 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7884 if (TREE_CODE (to
) != POINTER_TYPE
)
7885 return (is_opaque_pointer
7886 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
7890 /* Returns the type qualifiers for this type, including the qualifiers on the
7891 elements for an array type. */
7894 cp_type_quals (const_tree type
)
7897 /* This CONST_CAST is okay because strip_array_types returns its
7898 argument unmodified and we assign it to a const_tree. */
7899 type
= strip_array_types (CONST_CAST_TREE (type
));
7900 if (type
== error_mark_node
7901 /* Quals on a FUNCTION_TYPE are memfn quals. */
7902 || TREE_CODE (type
) == FUNCTION_TYPE
)
7903 return TYPE_UNQUALIFIED
;
7904 quals
= TYPE_QUALS (type
);
7905 /* METHOD and REFERENCE_TYPEs should never have quals. */
7906 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
7907 && TREE_CODE (type
) != REFERENCE_TYPE
)
7908 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
7909 == TYPE_UNQUALIFIED
));
7913 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
7917 type_memfn_quals (const_tree type
)
7919 if (TREE_CODE (type
) == FUNCTION_TYPE
)
7920 return TYPE_QUALS (type
);
7921 else if (TREE_CODE (type
) == METHOD_TYPE
)
7922 return cp_type_quals (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))));
7927 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
7931 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
)
7933 /* Could handle METHOD_TYPE here if necessary. */
7934 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7935 if (TYPE_QUALS (type
) == memfn_quals
)
7937 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
7939 return build_qualified_type (type
, memfn_quals
);
7942 /* Returns nonzero if TYPE is const or volatile. */
7945 cv_qualified_p (const_tree type
)
7947 int quals
= cp_type_quals (type
);
7948 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
7951 /* Returns nonzero if the TYPE contains a mutable member. */
7954 cp_has_mutable_p (const_tree type
)
7956 /* This CONST_CAST is okay because strip_array_types returns its
7957 argument unmodified and we assign it to a const_tree. */
7958 type
= strip_array_types (CONST_CAST_TREE(type
));
7960 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
7963 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
7964 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
7965 approximation. In particular, consider:
7968 struct S { int i; };
7969 const S s = { f(); }
7971 Here, we will make "s" as TREE_READONLY (because it is declared
7972 "const") -- only to reverse ourselves upon seeing that the
7973 initializer is non-constant. */
7976 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
7978 tree type
= TREE_TYPE (decl
);
7980 if (type
== error_mark_node
)
7983 if (TREE_CODE (decl
) == TYPE_DECL
)
7986 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
7987 && type_quals
!= TYPE_UNQUALIFIED
));
7989 /* Avoid setting TREE_READONLY incorrectly. */
7990 if (/* If the object has a constructor, the constructor may modify
7992 TYPE_NEEDS_CONSTRUCTING (type
)
7993 /* If the type isn't complete, we don't know yet if it will need
7995 || !COMPLETE_TYPE_P (type
)
7996 /* If the type has a mutable component, that component might be
7998 || TYPE_HAS_MUTABLE_P (type
))
7999 type_quals
&= ~TYPE_QUAL_CONST
;
8001 c_apply_type_quals_to_decl (type_quals
, decl
);
8004 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8005 exemplar types such that casting T1 to T2 is casting away constness
8006 if and only if there is no implicit conversion from T1 to T2. */
8009 casts_away_constness_r (tree
*t1
, tree
*t2
)
8014 /* [expr.const.cast]
8016 For multi-level pointer to members and multi-level mixed pointers
8017 and pointers to members (conv.qual), the "member" aspect of a
8018 pointer to member level is ignored when determining if a const
8019 cv-qualifier has been cast away. */
8020 /* [expr.const.cast]
8022 For two pointer types:
8024 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8025 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8028 casting from X1 to X2 casts away constness if, for a non-pointer
8029 type T there does not exist an implicit conversion (clause
8032 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8036 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8037 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
8038 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
8040 *t1
= cp_build_qualified_type (void_type_node
,
8041 cp_type_quals (*t1
));
8042 *t2
= cp_build_qualified_type (void_type_node
,
8043 cp_type_quals (*t2
));
8047 quals1
= cp_type_quals (*t1
);
8048 quals2
= cp_type_quals (*t2
);
8050 if (TYPE_PTRMEM_P (*t1
))
8051 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
8053 *t1
= TREE_TYPE (*t1
);
8054 if (TYPE_PTRMEM_P (*t2
))
8055 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
8057 *t2
= TREE_TYPE (*t2
);
8059 casts_away_constness_r (t1
, t2
);
8060 *t1
= build_pointer_type (*t1
);
8061 *t2
= build_pointer_type (*t2
);
8062 *t1
= cp_build_qualified_type (*t1
, quals1
);
8063 *t2
= cp_build_qualified_type (*t2
, quals2
);
8066 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8069 ??? This function returns non-zero if casting away qualifiers not
8070 just const. We would like to return to the caller exactly which
8071 qualifiers are casted away to give more accurate diagnostics.
8075 casts_away_constness (tree t1
, tree t2
)
8077 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
8079 /* [expr.const.cast]
8081 Casting from an lvalue of type T1 to an lvalue of type T2
8082 using a reference cast casts away constness if a cast from an
8083 rvalue of type "pointer to T1" to the type "pointer to T2"
8084 casts away constness. */
8085 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
8086 return casts_away_constness (build_pointer_type (t1
),
8087 build_pointer_type (TREE_TYPE (t2
)));
8090 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
8091 /* [expr.const.cast]
8093 Casting from an rvalue of type "pointer to data member of X
8094 of type T1" to the type "pointer to data member of Y of type
8095 T2" casts away constness if a cast from an rvalue of type
8096 "pointer to T1" to the type "pointer to T2" casts away
8098 return casts_away_constness
8099 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
8100 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
8102 /* Casting away constness is only something that makes sense for
8103 pointer or reference types. */
8104 if (TREE_CODE (t1
) != POINTER_TYPE
8105 || TREE_CODE (t2
) != POINTER_TYPE
)
8108 /* Top-level qualifiers don't matter. */
8109 t1
= TYPE_MAIN_VARIANT (t1
);
8110 t2
= TYPE_MAIN_VARIANT (t2
);
8111 casts_away_constness_r (&t1
, &t2
);
8112 if (!can_convert (t2
, t1
))
8118 /* If T is a REFERENCE_TYPE return the type to which T refers.
8119 Otherwise, return T itself. */
8122 non_reference (tree t
)
8124 if (TREE_CODE (t
) == REFERENCE_TYPE
)
8130 /* Return nonzero if REF is an lvalue valid for this language;
8131 otherwise, print an error message and return zero. USE says
8132 how the lvalue is being used and so selects the error message. */
8135 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
8137 int win
= lvalue_p (ref
);
8139 if (!win
&& (complain
& tf_error
))