1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
5 Hacked by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
24 /* This file is part of the C++ front end.
25 It contains routines to build C++ expressions given their operands,
26 including computing the types of the result, C and C++ specific error
27 checks, and some optimization. */
31 #include "coretypes.h"
38 #include "diagnostic.h"
42 #include "c-family/c-common.h"
45 static tree
pfn_from_ptrmemfunc (tree
);
46 static tree
delta_from_ptrmemfunc (tree
);
47 static tree
convert_for_assignment (tree
, tree
, impl_conv_rhs
, tree
, int,
49 static tree
cp_pointer_int_sum (enum tree_code
, tree
, tree
);
50 static tree
rationalize_conditional_expr (enum tree_code
, tree
,
52 static int comp_ptr_ttypes_real (tree
, tree
, int);
53 static bool comp_except_types (tree
, tree
, bool);
54 static bool comp_array_types (const_tree
, const_tree
, bool);
55 static tree
pointer_diff (tree
, tree
, tree
);
56 static tree
get_delta_difference (tree
, tree
, bool, bool, tsubst_flags_t
);
57 static void casts_away_constness_r (tree
*, tree
*);
58 static bool casts_away_constness (tree
, tree
);
59 static void maybe_warn_about_returning_address_of_local (tree
);
60 static tree
lookup_destructor (tree
, tree
, tree
);
61 static void warn_args_num (location_t
, tree
, bool);
62 static int convert_arguments (tree
, VEC(tree
,gc
) **, tree
, int,
65 /* Do `exp = require_complete_type (exp);' to make sure exp
66 does not have an incomplete type. (That includes void types.)
67 Returns the error_mark_node if the VALUE does not have
68 complete type when this function returns. */
71 require_complete_type (tree value
)
75 if (processing_template_decl
|| value
== error_mark_node
)
78 if (TREE_CODE (value
) == OVERLOAD
)
79 type
= unknown_type_node
;
81 type
= TREE_TYPE (value
);
83 if (type
== error_mark_node
)
84 return error_mark_node
;
86 /* First, detect a valid value with a complete type. */
87 if (COMPLETE_TYPE_P (type
))
90 if (complete_type_or_else (type
, value
))
93 return error_mark_node
;
96 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
97 a template instantiation, do the instantiation. Returns TYPE,
98 whether or not it could be completed, unless something goes
99 horribly wrong, in which case the error_mark_node is returned. */
102 complete_type (tree type
)
104 if (type
== NULL_TREE
)
105 /* Rather than crash, we return something sure to cause an error
107 return error_mark_node
;
109 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
111 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
113 tree t
= complete_type (TREE_TYPE (type
));
114 unsigned int needs_constructing
, has_nontrivial_dtor
;
115 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
118 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
120 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
121 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
123 TYPE_NEEDS_CONSTRUCTING (t
) = needs_constructing
;
124 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = has_nontrivial_dtor
;
127 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
128 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
133 /* Like complete_type, but issue an error if the TYPE cannot be completed.
134 VALUE is used for informative diagnostics.
135 Returns NULL_TREE if the type cannot be made complete. */
138 complete_type_or_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 ce_derived, T2 can be stricter than T1 (according to 15.4/5).
985 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
986 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
987 are unordered, but we've already filtered out duplicates. Most lists will
988 be in order, we should try to make use of that. */
991 comp_except_specs (const_tree t1
, const_tree t2
, int exact
)
1000 /* First handle noexcept. */
1001 if (exact
< ce_exact
)
1003 /* noexcept(false) is compatible with any throwing dynamic-exc-spec
1004 and stricter than any spec. */
1005 if (t1
== noexcept_false_spec
)
1006 return !nothrow_spec_p (t2
) || exact
== ce_derived
;
1007 /* Even a derived noexcept(false) is compatible with a throwing
1009 if (t2
== noexcept_false_spec
)
1010 return !nothrow_spec_p (t1
);
1012 /* Otherwise, if we aren't looking for an exact match, noexcept is
1013 equivalent to throw(). */
1014 if (t1
== noexcept_true_spec
)
1015 t1
= empty_except_spec
;
1016 if (t2
== noexcept_true_spec
)
1017 t2
= empty_except_spec
;
1020 /* If any noexcept is left, it is only comparable to itself;
1021 either we're looking for an exact match or we're redeclaring a
1022 template with dependent noexcept. */
1023 if ((t1
&& TREE_PURPOSE (t1
))
1024 || (t2
&& TREE_PURPOSE (t2
)))
1026 && cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)));
1028 if (t1
== NULL_TREE
) /* T1 is ... */
1029 return t2
== NULL_TREE
|| exact
== ce_derived
;
1030 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1031 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1032 if (t2
== NULL_TREE
) /* T2 is ... */
1034 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1035 return exact
== ce_derived
;
1037 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1038 Count how many we find, to determine exactness. For exact matching and
1039 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1041 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1043 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1045 tree a
= TREE_VALUE (probe
);
1046 tree b
= TREE_VALUE (t2
);
1048 if (comp_except_types (a
, b
, exact
))
1050 if (probe
== base
&& exact
> ce_derived
)
1051 base
= TREE_CHAIN (probe
);
1056 if (probe
== NULL_TREE
)
1059 return exact
== ce_derived
|| base
== NULL_TREE
|| length
== list_length (t1
);
1062 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1063 [] can match [size]. */
1066 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1075 /* The type of the array elements must be the same. */
1076 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1079 d1
= TYPE_DOMAIN (t1
);
1080 d2
= TYPE_DOMAIN (t2
);
1085 /* If one of the arrays is dimensionless, and the other has a
1086 dimension, they are of different types. However, it is valid to
1094 declarations for an array object can specify
1095 array types that differ by the presence or absence of a major
1096 array bound (_dcl.array_). */
1098 return allow_redeclaration
;
1100 /* Check that the dimensions are the same. */
1102 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1104 max1
= TYPE_MAX_VALUE (d1
);
1105 max2
= TYPE_MAX_VALUE (d2
);
1106 if (processing_template_decl
&& !abi_version_at_least (2)
1107 && !value_dependent_expression_p (max1
)
1108 && !value_dependent_expression_p (max2
))
1110 /* With abi-1 we do not fold non-dependent array bounds, (and
1111 consequently mangle them incorrectly). We must therefore
1112 fold them here, to verify the domains have the same
1118 if (!cp_tree_equal (max1
, max2
))
1124 /* Compare the relative position of T1 and T2 into their respective
1125 template parameter list.
1126 T1 and T2 must be template parameter types.
1127 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1130 comp_template_parms_position (tree t1
, tree t2
)
1132 gcc_assert (t1
&& t2
1133 && TREE_CODE (t1
) == TREE_CODE (t2
)
1134 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1135 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1136 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1138 if (TEMPLATE_TYPE_IDX (t1
) != TEMPLATE_TYPE_IDX (t2
)
1139 || TEMPLATE_TYPE_LEVEL (t1
) != TEMPLATE_TYPE_LEVEL (t2
)
1140 || (TEMPLATE_TYPE_PARAMETER_PACK (t1
)
1141 != TEMPLATE_TYPE_PARAMETER_PACK (t2
)))
1147 /* Subroutine of incompatible_dependent_types_p.
1148 Return the template parameter of the dependent type T.
1149 If T is a typedef, return the template parameters of
1150 the _decl_ of the typedef. T must be a dependent type. */
1153 get_template_parms_of_dependent_type (tree t
)
1155 tree tinfo
= NULL_TREE
, tparms
= NULL_TREE
;
1157 /* First, try the obvious case of getting the
1158 template info from T itself. */
1159 if ((tinfo
= get_template_info (t
)))
1161 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
1162 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (t
);
1163 else if (typedef_variant_p (t
)
1164 && !NAMESPACE_SCOPE_P (TYPE_NAME (t
)))
1165 tinfo
= get_template_info (DECL_CONTEXT (TYPE_NAME (t
)));
1166 /* If T is a TYPENAME_TYPE which context is a template type
1167 parameter, get the template parameters from that context. */
1168 else if (TYPE_CONTEXT (t
)
1169 && TREE_CODE (TYPE_CONTEXT (t
)) == TEMPLATE_TYPE_PARM
)
1170 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (TYPE_CONTEXT (t
));
1171 else if (TYPE_CONTEXT (t
)
1172 && !NAMESPACE_SCOPE_P (t
))
1173 tinfo
= get_template_info (TYPE_CONTEXT (t
));
1176 tparms
= DECL_TEMPLATE_PARMS (TI_TEMPLATE (tinfo
));
1181 /* Subroutine of structural_comptypes.
1182 Compare the dependent types T1 and T2.
1183 Return TRUE if we are sure they can't be equal, FALSE otherwise.
1184 The whole point of this function is to support cases where either T1 or
1185 T2 is a typedef. In those cases, we need to compare the template parameters
1186 of the _decl_ of the typedef. If those don't match then we know T1
1187 and T2 cannot be equal. */
1190 incompatible_dependent_types_p (tree t1
, tree t2
)
1192 tree tparms1
= NULL_TREE
, tparms2
= NULL_TREE
;
1193 bool t1_typedef_variant_p
, t2_typedef_variant_p
;
1195 if (!uses_template_parms (t1
) || !uses_template_parms (t2
))
1198 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
)
1200 /* If T1 and T2 don't have the same relative position in their
1201 template parameters set, they can't be equal. */
1202 if (!comp_template_parms_position (t1
, t2
))
1206 t1_typedef_variant_p
= typedef_variant_p (t1
);
1207 t2_typedef_variant_p
= typedef_variant_p (t2
);
1209 /* Either T1 or T2 must be a typedef. */
1210 if (!t1_typedef_variant_p
&& !t2_typedef_variant_p
)
1213 if (!t1_typedef_variant_p
|| !t2_typedef_variant_p
)
1214 /* Either T1 or T2 is not a typedef so we cannot compare the
1215 the template parms of the typedefs of T1 and T2.
1216 At this point, if the main variant type of T1 and T2 are equal
1217 it means the two types can't be incompatible, from the perspective
1218 of this function. */
1219 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1222 /* So if we reach this point, it means either T1 or T2 is a typedef variant.
1223 Let's compare their template parameters. */
1225 tparms1
= get_template_parms_of_dependent_type (t1
);
1226 tparms2
= get_template_parms_of_dependent_type (t2
);
1228 /* If T2 is a template type parm and if we could not get the template
1229 parms it belongs to, that means we have not finished parsing the
1230 full set of template parameters of the template declaration it
1231 belongs to yet. If we could get the template parms T1 belongs to,
1232 that mostly means T1 and T2 belongs to templates that are
1233 different and incompatible. */
1234 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
1235 && (tparms1
== NULL_TREE
|| tparms2
== NULL_TREE
)
1236 && tparms1
!= tparms2
)
1239 if (tparms1
== NULL_TREE
1240 || tparms2
== NULL_TREE
1241 || tparms1
== tparms2
)
1244 /* And now compare the mighty template parms! */
1245 return !comp_template_parms (tparms1
, tparms2
);
1248 /* Subroutine in comptypes. */
1251 structural_comptypes (tree t1
, tree t2
, int strict
)
1256 /* Suppress errors caused by previously reported errors. */
1257 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1260 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1262 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1263 current instantiation. */
1264 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1265 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1267 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1268 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1270 if (TYPE_PTRMEMFUNC_P (t1
))
1271 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1272 if (TYPE_PTRMEMFUNC_P (t2
))
1273 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1275 /* Different classes of types can't be compatible. */
1276 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1279 /* Qualifiers must match. For array types, we will check when we
1280 recur on the array element types. */
1281 if (TREE_CODE (t1
) != ARRAY_TYPE
1282 && cp_type_quals (t1
) != cp_type_quals (t2
))
1284 if (TREE_CODE (t1
) == FUNCTION_TYPE
1285 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1287 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1290 /* If T1 and T2 are dependent typedefs then check upfront that
1291 the template parameters of their typedef DECLs match before
1292 going down checking their subtypes. */
1293 if (incompatible_dependent_types_p (t1
, t2
))
1296 /* Allow for two different type nodes which have essentially the same
1297 definition. Note that we already checked for equality of the type
1298 qualifiers (just above). */
1300 if (TREE_CODE (t1
) != ARRAY_TYPE
1301 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1305 /* Compare the types. Break out if they could be the same. */
1306 switch (TREE_CODE (t1
))
1310 /* All void and bool types are the same. */
1314 case FIXED_POINT_TYPE
:
1316 /* With these nodes, we can't determine type equivalence by
1317 looking at what is stored in the nodes themselves, because
1318 two nodes might have different TYPE_MAIN_VARIANTs but still
1319 represent the same type. For example, wchar_t and int could
1320 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1321 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1322 and are distinct types. On the other hand, int and the
1325 typedef int INT __attribute((may_alias));
1327 have identical properties, different TYPE_MAIN_VARIANTs, but
1328 represent the same type. The canonical type system keeps
1329 track of equivalence in this case, so we fall back on it. */
1330 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1332 case TEMPLATE_TEMPLATE_PARM
:
1333 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1334 if (!comp_template_parms_position (t1
, t2
))
1336 if (!comp_template_parms
1337 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1338 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1340 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1342 /* Don't check inheritance. */
1343 strict
= COMPARE_STRICT
;
1348 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1349 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1350 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1351 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1354 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1356 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1362 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1363 strict
& ~COMPARE_REDECLARATION
))
1365 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1369 case REFERENCE_TYPE
:
1370 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1372 /* fall through to checks for pointer types */
1375 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1376 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
)
1377 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1383 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1385 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1390 /* Target types must match incl. qualifiers. */
1391 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1395 case TEMPLATE_TYPE_PARM
:
1396 /* If incompatible_dependent_types_p called earlier didn't decide
1397 T1 and T2 were different, they might be equal. */
1401 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1402 TYPENAME_TYPE_FULLNAME (t2
)))
1404 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1408 case UNBOUND_CLASS_TEMPLATE
:
1409 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1411 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1416 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1421 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1422 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1426 case TYPE_PACK_EXPANSION
:
1427 return same_type_p (PACK_EXPANSION_PATTERN (t1
),
1428 PACK_EXPANSION_PATTERN (t2
));
1431 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1432 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1433 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1434 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1435 || (DECLTYPE_FOR_LAMBDA_RETURN (t1
)
1436 != DECLTYPE_FOR_LAMBDA_RETURN (t2
))
1437 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1438 DECLTYPE_TYPE_EXPR (t2
)))
1446 /* If we get here, we know that from a target independent POV the
1447 types are the same. Make sure the target attributes are also
1449 return targetm
.comp_type_attributes (t1
, t2
);
1452 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1453 is a bitwise-or of the COMPARE_* flags. */
1456 comptypes (tree t1
, tree t2
, int strict
)
1458 if (strict
== COMPARE_STRICT
)
1463 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1466 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1467 /* At least one of the types requires structural equality, so
1468 perform a deep check. */
1469 return structural_comptypes (t1
, t2
, strict
);
1471 #ifdef ENABLE_CHECKING
1472 if (USE_CANONICAL_TYPES
)
1474 bool result
= structural_comptypes (t1
, t2
, strict
);
1476 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1477 /* The two types are structurally equivalent, but their
1478 canonical types were different. This is a failure of the
1479 canonical type propagation code.*/
1481 ("canonical types differ for identical types %T and %T",
1483 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1484 /* Two types are structurally different, but the canonical
1485 types are the same. This means we were over-eager in
1486 assigning canonical types. */
1488 ("same canonical type node for different types %T and %T",
1494 if (USE_CANONICAL_TYPES
)
1495 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1498 return structural_comptypes (t1
, t2
, strict
);
1500 else if (strict
== COMPARE_STRUCTURAL
)
1501 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1503 return structural_comptypes (t1
, t2
, strict
);
1506 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1507 top-level qualifiers. */
1510 same_type_ignoring_top_level_qualifiers_p (tree type1
, tree type2
)
1512 if (type1
== error_mark_node
|| type2
== error_mark_node
)
1515 return same_type_p (TYPE_MAIN_VARIANT (type1
), TYPE_MAIN_VARIANT (type2
));
1518 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1521 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1523 int q1
= cp_type_quals (type1
);
1524 int q2
= cp_type_quals (type2
);
1526 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1527 return (q1
& q2
) == q2
;
1530 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1531 more cv-qualified that TYPE1, and 0 otherwise. */
1534 comp_cv_qualification (const_tree type1
, const_tree type2
)
1536 int q1
= cp_type_quals (type1
);
1537 int q2
= cp_type_quals (type2
);
1542 if ((q1
& q2
) == q2
)
1544 else if ((q1
& q2
) == q1
)
1550 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1551 subset of the cv-qualification signature of TYPE2, and the types
1552 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1555 comp_cv_qual_signature (tree type1
, tree type2
)
1557 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1559 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1565 /* Subroutines of `comptypes'. */
1567 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1568 equivalent in the sense that functions with those parameter types
1569 can have equivalent types. The two lists must be equivalent,
1570 element by element. */
1573 compparms (const_tree parms1
, const_tree parms2
)
1577 /* An unspecified parmlist matches any specified parmlist
1578 whose argument types don't need default promotions. */
1580 for (t1
= parms1
, t2
= parms2
;
1582 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1584 /* If one parmlist is shorter than the other,
1585 they fail to match. */
1588 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1595 /* Process a sizeof or alignof expression where the operand is a
1599 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1604 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1605 if (type
== error_mark_node
)
1606 return error_mark_node
;
1608 type
= non_reference (type
);
1609 if (TREE_CODE (type
) == METHOD_TYPE
)
1612 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
1613 "invalid application of %qs to a member function",
1614 operator_name_info
[(int) op
].name
);
1615 value
= size_one_node
;
1618 dependent_p
= dependent_type_p (type
);
1620 complete_type (type
);
1622 /* VLA types will have a non-constant size. In the body of an
1623 uninstantiated template, we don't need to try to compute the
1624 value, because the sizeof expression is not an integral
1625 constant expression in that case. And, if we do try to
1626 compute the value, we'll likely end up with SAVE_EXPRs, which
1627 the template substitution machinery does not expect to see. */
1628 || (processing_template_decl
1629 && COMPLETE_TYPE_P (type
)
1630 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1632 value
= build_min (op
, size_type_node
, type
);
1633 TREE_READONLY (value
) = 1;
1637 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1642 /* Return the size of the type, without producing any warnings for
1643 types whose size cannot be taken. This routine should be used only
1644 in some other routine that has already produced a diagnostic about
1645 using the size of such a type. */
1647 cxx_sizeof_nowarn (tree type
)
1649 if (TREE_CODE (type
) == FUNCTION_TYPE
1650 || TREE_CODE (type
) == VOID_TYPE
1651 || TREE_CODE (type
) == ERROR_MARK
)
1652 return size_one_node
;
1653 else if (!COMPLETE_TYPE_P (type
))
1654 return size_zero_node
;
1656 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1659 /* Process a sizeof expression where the operand is an expression. */
1662 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1664 if (e
== error_mark_node
)
1665 return error_mark_node
;
1667 if (processing_template_decl
)
1669 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1670 TREE_SIDE_EFFECTS (e
) = 0;
1671 TREE_READONLY (e
) = 1;
1676 /* To get the size of a static data member declared as an array of
1677 unknown bound, we need to instantiate it. */
1678 if (TREE_CODE (e
) == VAR_DECL
1679 && VAR_HAD_UNKNOWN_BOUND (e
)
1680 && DECL_TEMPLATE_INSTANTIATION (e
))
1681 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1683 e
= mark_type_use (e
);
1685 if (TREE_CODE (e
) == COMPONENT_REF
1686 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1687 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1689 if (complain
& tf_error
)
1690 error ("invalid application of %<sizeof%> to a bit-field");
1692 return error_mark_node
;
1695 else if (is_overloaded_fn (e
))
1697 if (complain
& tf_error
)
1698 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1701 return error_mark_node
;
1704 else if (type_unknown_p (e
))
1706 if (complain
& tf_error
)
1707 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1709 return error_mark_node
;
1715 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1718 /* Implement the __alignof keyword: Return the minimum required
1719 alignment of E, measured in bytes. For VAR_DECL's and
1720 FIELD_DECL's return DECL_ALIGN (which can be set from an
1721 "aligned" __attribute__ specification). */
1724 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1728 if (e
== error_mark_node
)
1729 return error_mark_node
;
1731 if (processing_template_decl
)
1733 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1734 TREE_SIDE_EFFECTS (e
) = 0;
1735 TREE_READONLY (e
) = 1;
1740 e
= mark_type_use (e
);
1742 if (TREE_CODE (e
) == VAR_DECL
)
1743 t
= size_int (DECL_ALIGN_UNIT (e
));
1744 else if (TREE_CODE (e
) == COMPONENT_REF
1745 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1746 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1748 if (complain
& tf_error
)
1749 error ("invalid application of %<__alignof%> to a bit-field");
1751 return error_mark_node
;
1754 else if (TREE_CODE (e
) == COMPONENT_REF
1755 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1756 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1757 else if (is_overloaded_fn (e
))
1759 if (complain
& tf_error
)
1760 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1763 return error_mark_node
;
1764 if (TREE_CODE (e
) == FUNCTION_DECL
)
1765 t
= size_int (DECL_ALIGN_UNIT (e
));
1769 else if (type_unknown_p (e
))
1771 if (complain
& tf_error
)
1772 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1774 return error_mark_node
;
1778 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1779 complain
& tf_error
);
1781 return fold_convert (size_type_node
, t
);
1784 /* Process a sizeof or alignof expression E with code OP where the operand
1785 is an expression. */
1788 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1790 if (op
== SIZEOF_EXPR
)
1791 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1793 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1796 /* EXPR is being used in a context that is not a function call.
1801 The expression can be used only as the left-hand operand of a
1802 member function call.
1804 [expr.mptr.operator]
1806 If the result of .* or ->* is a function, then that result can be
1807 used only as the operand for the function call operator ().
1809 by issuing an error message if appropriate. Returns true iff EXPR
1810 violates these rules. */
1813 invalid_nonstatic_memfn_p (const_tree expr
, tsubst_flags_t complain
)
1815 if (expr
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1817 if (complain
& tf_error
)
1818 error ("invalid use of non-static member function");
1824 /* If EXP is a reference to a bitfield, and the type of EXP does not
1825 match the declared type of the bitfield, return the declared type
1826 of the bitfield. Otherwise, return NULL_TREE. */
1829 is_bitfield_expr_with_lowered_type (const_tree exp
)
1831 switch (TREE_CODE (exp
))
1834 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1835 ? TREE_OPERAND (exp
, 1)
1836 : TREE_OPERAND (exp
, 0)))
1838 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1841 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1845 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1851 field
= TREE_OPERAND (exp
, 1);
1852 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1854 if (same_type_ignoring_top_level_qualifiers_p
1855 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1857 return DECL_BIT_FIELD_TYPE (field
);
1861 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1862 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1863 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1871 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1872 bitfield with a lowered type, the type of EXP is returned, rather
1876 unlowered_expr_type (const_tree exp
)
1880 type
= is_bitfield_expr_with_lowered_type (exp
);
1882 type
= TREE_TYPE (exp
);
1887 /* Perform the conversions in [expr] that apply when an lvalue appears
1888 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1889 function-to-pointer conversions. In addition, manifest constants
1890 are replaced by their values, and bitfield references are converted
1891 to their declared types. Note that this function does not perform the
1892 lvalue-to-rvalue conversion for class types. If you need that conversion
1893 to for class types, then you probably need to use force_rvalue.
1895 Although the returned value is being used as an rvalue, this
1896 function does not wrap the returned expression in a
1897 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1898 that the return value is no longer an lvalue. */
1901 decay_conversion (tree exp
)
1904 enum tree_code code
;
1906 type
= TREE_TYPE (exp
);
1907 if (type
== error_mark_node
)
1908 return error_mark_node
;
1910 exp
= mark_rvalue_use (exp
);
1912 exp
= resolve_nondeduced_context (exp
);
1913 if (type_unknown_p (exp
))
1915 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1916 return error_mark_node
;
1919 exp
= decl_constant_value (exp
);
1920 if (error_operand_p (exp
))
1921 return error_mark_node
;
1923 if (NULLPTR_TYPE_P (type
))
1924 return nullptr_node
;
1926 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1927 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1928 code
= TREE_CODE (type
);
1929 if (code
== VOID_TYPE
)
1931 error ("void value not ignored as it ought to be");
1932 return error_mark_node
;
1934 if (invalid_nonstatic_memfn_p (exp
, tf_warning_or_error
))
1935 return error_mark_node
;
1936 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1937 return cp_build_unary_op (ADDR_EXPR
, exp
, 0, tf_warning_or_error
);
1938 if (code
== ARRAY_TYPE
)
1943 if (TREE_CODE (exp
) == INDIRECT_REF
)
1944 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1945 TREE_OPERAND (exp
, 0));
1947 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1949 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1950 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1951 TREE_OPERAND (exp
, 0), op1
);
1955 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1957 error ("invalid use of non-lvalue array");
1958 return error_mark_node
;
1961 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1963 if (TREE_CODE (exp
) == VAR_DECL
)
1965 if (!cxx_mark_addressable (exp
))
1966 return error_mark_node
;
1967 adr
= build_nop (ptrtype
, build_address (exp
));
1970 /* This way is better for a COMPONENT_REF since it can
1971 simplify the offset for a component. */
1972 adr
= cp_build_unary_op (ADDR_EXPR
, exp
, 1, tf_warning_or_error
);
1973 return cp_convert (ptrtype
, adr
);
1976 /* If a bitfield is used in a context where integral promotion
1977 applies, then the caller is expected to have used
1978 default_conversion. That function promotes bitfields correctly
1979 before calling this function. At this point, if we have a
1980 bitfield referenced, we may assume that is not subject to
1981 promotion, and that, therefore, the type of the resulting rvalue
1982 is the declared type of the bitfield. */
1983 exp
= convert_bitfield_to_declared_type (exp
);
1985 /* We do not call rvalue() here because we do not want to wrap EXP
1986 in a NON_LVALUE_EXPR. */
1990 Non-class rvalues always have cv-unqualified types. */
1991 type
= TREE_TYPE (exp
);
1992 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
1993 exp
= build_nop (cv_unqualified (type
), exp
);
1998 /* Perform preparatory conversions, as part of the "usual arithmetic
1999 conversions". In particular, as per [expr]:
2001 Whenever an lvalue expression appears as an operand of an
2002 operator that expects the rvalue for that operand, the
2003 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
2004 standard conversions are applied to convert the expression to an
2007 In addition, we perform integral promotions here, as those are
2008 applied to both operands to a binary operator before determining
2009 what additional conversions should apply. */
2012 default_conversion (tree exp
)
2014 /* Check for target-specific promotions. */
2015 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
2017 exp
= cp_convert (promoted_type
, exp
);
2018 /* Perform the integral promotions first so that bitfield
2019 expressions (which may promote to "int", even if the bitfield is
2020 declared "unsigned") are promoted correctly. */
2021 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
2022 exp
= perform_integral_promotions (exp
);
2023 /* Perform the other conversions. */
2024 exp
= decay_conversion (exp
);
2029 /* EXPR is an expression with an integral or enumeration type.
2030 Perform the integral promotions in [conv.prom], and return the
2034 perform_integral_promotions (tree expr
)
2039 expr
= mark_rvalue_use (expr
);
2043 If the bitfield has an enumerated type, it is treated as any
2044 other value of that type for promotion purposes. */
2045 type
= is_bitfield_expr_with_lowered_type (expr
);
2046 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
2047 type
= TREE_TYPE (expr
);
2048 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
2049 promoted_type
= type_promotes_to (type
);
2050 if (type
!= promoted_type
)
2051 expr
= cp_convert (promoted_type
, expr
);
2055 /* Returns nonzero iff exp is a STRING_CST or the result of applying
2056 decay_conversion to one. */
2059 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
2063 if (TREE_CODE (totype
) != POINTER_TYPE
)
2066 t
= TREE_TYPE (totype
);
2067 if (!same_type_p (t
, char_type_node
)
2068 && !same_type_p (t
, char16_type_node
)
2069 && !same_type_p (t
, char32_type_node
)
2070 && !same_type_p (t
, wchar_type_node
))
2073 if (TREE_CODE (exp
) == STRING_CST
)
2075 /* Make sure that we don't try to convert between char and wide chars. */
2076 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
2081 /* Is this a string constant which has decayed to 'const char *'? */
2082 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
2083 if (!same_type_p (TREE_TYPE (exp
), t
))
2086 if (TREE_CODE (exp
) != ADDR_EXPR
2087 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2091 /* This warning is not very useful, as it complains about printf. */
2093 warning (OPT_Wwrite_strings
,
2094 "deprecated conversion from string constant to %qT",
2100 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2101 can, for example, use as an lvalue. This code used to be in
2102 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2103 expressions, where we're dealing with aggregates. But now it's again only
2104 called from unary_complex_lvalue. The case (in particular) that led to
2105 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2109 rationalize_conditional_expr (enum tree_code code
, tree t
,
2110 tsubst_flags_t complain
)
2112 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2113 the first operand is always the one to be used if both operands
2114 are equal, so we know what conditional expression this used to be. */
2115 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2117 tree op0
= TREE_OPERAND (t
, 0);
2118 tree op1
= TREE_OPERAND (t
, 1);
2120 /* The following code is incorrect if either operand side-effects. */
2121 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2122 && !TREE_SIDE_EFFECTS (op1
));
2124 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
2125 ? LE_EXPR
: GE_EXPR
),
2126 op0
, TREE_CODE (op0
),
2127 op1
, TREE_CODE (op1
),
2128 /*overloaded_p=*/NULL
,
2130 cp_build_unary_op (code
, op0
, 0, complain
),
2131 cp_build_unary_op (code
, op1
, 0, complain
),
2136 build_conditional_expr (TREE_OPERAND (t
, 0),
2137 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2139 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2144 /* Given the TYPE of an anonymous union field inside T, return the
2145 FIELD_DECL for the field. If not found return NULL_TREE. Because
2146 anonymous unions can nest, we must also search all anonymous unions
2147 that are directly reachable. */
2150 lookup_anon_field (tree t
, tree type
)
2154 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2156 if (TREE_STATIC (field
))
2158 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2161 /* If we find it directly, return the field. */
2162 if (DECL_NAME (field
) == NULL_TREE
2163 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2168 /* Otherwise, it could be nested, search harder. */
2169 if (DECL_NAME (field
) == NULL_TREE
2170 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2172 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2180 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2181 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2182 non-NULL, it indicates the path to the base used to name MEMBER.
2183 If PRESERVE_REFERENCE is true, the expression returned will have
2184 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2185 returned will have the type referred to by the reference.
2187 This function does not perform access control; that is either done
2188 earlier by the parser when the name of MEMBER is resolved to MEMBER
2189 itself, or later when overload resolution selects one of the
2190 functions indicated by MEMBER. */
2193 build_class_member_access_expr (tree object
, tree member
,
2194 tree access_path
, bool preserve_reference
,
2195 tsubst_flags_t complain
)
2199 tree result
= NULL_TREE
;
2201 if (error_operand_p (object
) || error_operand_p (member
))
2202 return error_mark_node
;
2204 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2208 The type of the first expression shall be "class object" (of a
2210 object_type
= TREE_TYPE (object
);
2211 if (!currently_open_class (object_type
)
2212 && !complete_type_or_else (object_type
, object
))
2213 return error_mark_node
;
2214 if (!CLASS_TYPE_P (object_type
))
2216 if (complain
& tf_error
)
2217 error ("request for member %qD in %qE, which is of non-class type %qT",
2218 member
, object
, object_type
);
2219 return error_mark_node
;
2222 /* The standard does not seem to actually say that MEMBER must be a
2223 member of OBJECT_TYPE. However, that is clearly what is
2225 if (DECL_P (member
))
2227 member_scope
= DECL_CLASS_CONTEXT (member
);
2229 if (TREE_DEPRECATED (member
))
2230 warn_deprecated_use (member
, NULL_TREE
);
2233 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2234 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2235 presently be the anonymous union. Go outwards until we find a
2236 type related to OBJECT_TYPE. */
2237 while (ANON_AGGR_TYPE_P (member_scope
)
2238 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2240 member_scope
= TYPE_CONTEXT (member_scope
);
2241 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2243 if (complain
& tf_error
)
2245 if (TREE_CODE (member
) == FIELD_DECL
)
2246 error ("invalid use of nonstatic data member %qE", member
);
2248 error ("%qD is not a member of %qT", member
, object_type
);
2250 return error_mark_node
;
2253 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2254 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2255 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2257 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2259 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2262 /* In [expr.ref], there is an explicit list of the valid choices for
2263 MEMBER. We check for each of those cases here. */
2264 if (TREE_CODE (member
) == VAR_DECL
)
2266 /* A static data member. */
2268 mark_exp_read (object
);
2269 /* If OBJECT has side-effects, they are supposed to occur. */
2270 if (TREE_SIDE_EFFECTS (object
))
2271 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2273 else if (TREE_CODE (member
) == FIELD_DECL
)
2275 /* A non-static data member. */
2280 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
2281 && integer_zerop (TREE_OPERAND (object
, 0)));
2283 /* Convert OBJECT to the type of MEMBER. */
2284 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2285 TYPE_MAIN_VARIANT (member_scope
)))
2290 binfo
= lookup_base (access_path
? access_path
: object_type
,
2291 member_scope
, ba_unique
, &kind
);
2292 if (binfo
== error_mark_node
)
2293 return error_mark_node
;
2295 /* It is invalid to try to get to a virtual base of a
2296 NULL object. The most common cause is invalid use of
2298 if (null_object_p
&& kind
== bk_via_virtual
)
2300 if (complain
& tf_error
)
2302 error ("invalid access to non-static data member %qD of "
2305 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2307 return error_mark_node
;
2310 /* Convert to the base. */
2311 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2313 /* If we found the base successfully then we should be able
2314 to convert to it successfully. */
2315 gcc_assert (object
!= error_mark_node
);
2318 /* Complain about other invalid uses of offsetof, even though they will
2319 give the right answer. Note that we complain whether or not they
2320 actually used the offsetof macro, since there's no way to know at this
2321 point. So we just give a warning, instead of a pedwarn. */
2322 /* Do not produce this warning for base class field references, because
2323 we know for a fact that didn't come from offsetof. This does occur
2324 in various testsuite cases where a null object is passed where a
2325 vtable access is required. */
2326 if (null_object_p
&& warn_invalid_offsetof
2327 && CLASSTYPE_NON_STD_LAYOUT (object_type
)
2328 && !DECL_FIELD_IS_BASE (member
)
2329 && cp_unevaluated_operand
== 0
2330 && (complain
& tf_warning
))
2332 warning (OPT_Winvalid_offsetof
,
2333 "invalid access to non-static data member %qD "
2334 " of NULL object", member
);
2335 warning (OPT_Winvalid_offsetof
,
2336 "(perhaps the %<offsetof%> macro was used incorrectly)");
2339 /* If MEMBER is from an anonymous aggregate, we have converted
2340 OBJECT so that it refers to the class containing the
2341 anonymous union. Generate a reference to the anonymous union
2342 itself, and recur to find MEMBER. */
2343 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2344 /* When this code is called from build_field_call, the
2345 object already has the type of the anonymous union.
2346 That is because the COMPONENT_REF was already
2347 constructed, and was then disassembled before calling
2348 build_field_call. After the function-call code is
2349 cleaned up, this waste can be eliminated. */
2350 && (!same_type_ignoring_top_level_qualifiers_p
2351 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2353 tree anonymous_union
;
2355 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2356 DECL_CONTEXT (member
));
2357 object
= build_class_member_access_expr (object
,
2359 /*access_path=*/NULL_TREE
,
2364 /* Compute the type of the field, as described in [expr.ref]. */
2365 type_quals
= TYPE_UNQUALIFIED
;
2366 member_type
= TREE_TYPE (member
);
2367 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2369 type_quals
= (cp_type_quals (member_type
)
2370 | cp_type_quals (object_type
));
2372 /* A field is const (volatile) if the enclosing object, or the
2373 field itself, is const (volatile). But, a mutable field is
2374 not const, even within a const object. */
2375 if (DECL_MUTABLE_P (member
))
2376 type_quals
&= ~TYPE_QUAL_CONST
;
2377 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2380 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
2382 result
= fold_if_not_in_template (result
);
2384 /* Mark the expression const or volatile, as appropriate. Even
2385 though we've dealt with the type above, we still have to mark the
2386 expression itself. */
2387 if (type_quals
& TYPE_QUAL_CONST
)
2388 TREE_READONLY (result
) = 1;
2389 if (type_quals
& TYPE_QUAL_VOLATILE
)
2390 TREE_THIS_VOLATILE (result
) = 1;
2392 else if (BASELINK_P (member
))
2394 /* The member is a (possibly overloaded) member function. */
2398 /* If the MEMBER is exactly one static member function, then we
2399 know the type of the expression. Otherwise, we must wait
2400 until overload resolution has been performed. */
2401 functions
= BASELINK_FUNCTIONS (member
);
2402 if (TREE_CODE (functions
) == FUNCTION_DECL
2403 && DECL_STATIC_FUNCTION_P (functions
))
2404 type
= TREE_TYPE (functions
);
2406 type
= unknown_type_node
;
2407 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2408 base. That will happen when the function is called. */
2409 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2411 else if (TREE_CODE (member
) == CONST_DECL
)
2413 /* The member is an enumerator. */
2415 /* If OBJECT has side-effects, they are supposed to occur. */
2416 if (TREE_SIDE_EFFECTS (object
))
2417 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2422 if (complain
& tf_error
)
2423 error ("invalid use of %qD", member
);
2424 return error_mark_node
;
2427 if (!preserve_reference
)
2430 If E2 is declared to have type "reference to T", then ... the
2431 type of E1.E2 is T. */
2432 result
= convert_from_reference (result
);
2437 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2438 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2441 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2443 tree object_type
= TREE_TYPE (object
);
2444 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2447 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2449 error ("qualified type %qT does not match destructor name ~%qT",
2451 return error_mark_node
;
2453 if (TREE_CODE (dtor_type
) == IDENTIFIER_NODE
)
2455 /* In a template, names we can't find a match for are still accepted
2456 destructor names, and we check them here. */
2457 if (check_dtor_name (object_type
, dtor_type
))
2458 dtor_type
= object_type
;
2461 error ("object type %qT does not match destructor name ~%qT",
2462 object_type
, dtor_type
);
2463 return error_mark_node
;
2467 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2469 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2470 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2471 return error_mark_node
;
2473 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2474 /*protect=*/1, /*want_type=*/false);
2475 expr
= (adjust_result_of_qualified_name_lookup
2476 (expr
, dtor_type
, object_type
));
2480 /* An expression of the form "A::template B" has been resolved to
2481 DECL. Issue a diagnostic if B is not a template or template
2485 check_template_keyword (tree decl
)
2487 /* The standard says:
2491 If a name prefixed by the keyword template is not a member
2492 template, the program is ill-formed.
2494 DR 228 removed the restriction that the template be a member
2497 DR 96, if accepted would add the further restriction that explicit
2498 template arguments must be provided if the template keyword is
2499 used, but, as of 2005-10-16, that DR is still in "drafting". If
2500 this DR is accepted, then the semantic checks here can be
2501 simplified, as the entity named must in fact be a template
2502 specialization, rather than, as at present, a set of overloaded
2503 functions containing at least one template function. */
2504 if (TREE_CODE (decl
) != TEMPLATE_DECL
2505 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2507 if (!is_overloaded_fn (decl
))
2508 permerror (input_location
, "%qD is not a template", decl
);
2513 if (BASELINK_P (fns
))
2514 fns
= BASELINK_FUNCTIONS (fns
);
2517 tree fn
= OVL_CURRENT (fns
);
2518 if (TREE_CODE (fn
) == TEMPLATE_DECL
2519 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2521 if (TREE_CODE (fn
) == FUNCTION_DECL
2522 && DECL_USE_TEMPLATE (fn
)
2523 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2525 fns
= OVL_NEXT (fns
);
2528 permerror (input_location
, "%qD is not a template", decl
);
2533 /* This function is called by the parser to process a class member
2534 access expression of the form OBJECT.NAME. NAME is a node used by
2535 the parser to represent a name; it is not yet a DECL. It may,
2536 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2537 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2538 there is no reason to do the lookup twice, so the parser keeps the
2539 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2540 be a template via the use of the "A::template B" syntax. */
2543 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2544 tsubst_flags_t complain
)
2549 tree access_path
= NULL_TREE
;
2550 tree orig_object
= object
;
2551 tree orig_name
= name
;
2553 if (object
== error_mark_node
|| name
== error_mark_node
)
2554 return error_mark_node
;
2556 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2557 if (!objc_is_public (object
, name
))
2558 return error_mark_node
;
2560 object_type
= TREE_TYPE (object
);
2562 if (processing_template_decl
)
2564 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2565 dependent_type_p (object_type
)
2566 /* If NAME is just an IDENTIFIER_NODE, then the expression
2568 || TREE_CODE (object
) == IDENTIFIER_NODE
2569 /* If NAME is "f<args>", where either 'f' or 'args' is
2570 dependent, then the expression is dependent. */
2571 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2572 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2573 TREE_OPERAND (name
, 1)))
2574 /* If NAME is "T::X" where "T" is dependent, then the
2575 expression is dependent. */
2576 || (TREE_CODE (name
) == SCOPE_REF
2577 && TYPE_P (TREE_OPERAND (name
, 0))
2578 && dependent_type_p (TREE_OPERAND (name
, 0))))
2579 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2580 object
= build_non_dependent_expr (object
);
2585 The type of the first expression shall be "class object" (of a
2587 if (!currently_open_class (object_type
)
2588 && !complete_type_or_else (object_type
, object
))
2589 return error_mark_node
;
2590 if (!CLASS_TYPE_P (object_type
))
2592 if (complain
& tf_error
)
2593 error ("request for member %qD in %qE, which is of non-class type %qT",
2594 name
, object
, object_type
);
2595 return error_mark_node
;
2598 if (BASELINK_P (name
))
2599 /* A member function that has already been looked up. */
2603 bool is_template_id
= false;
2604 tree template_args
= NULL_TREE
;
2607 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2609 is_template_id
= true;
2610 template_args
= TREE_OPERAND (name
, 1);
2611 name
= TREE_OPERAND (name
, 0);
2613 if (TREE_CODE (name
) == OVERLOAD
)
2614 name
= DECL_NAME (get_first_fn (name
));
2615 else if (DECL_P (name
))
2616 name
= DECL_NAME (name
);
2619 if (TREE_CODE (name
) == SCOPE_REF
)
2621 /* A qualified name. The qualifying class or namespace `S'
2622 has already been looked up; it is either a TYPE or a
2624 scope
= TREE_OPERAND (name
, 0);
2625 name
= TREE_OPERAND (name
, 1);
2627 /* If SCOPE is a namespace, then the qualified name does not
2628 name a member of OBJECT_TYPE. */
2629 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2631 if (complain
& tf_error
)
2632 error ("%<%D::%D%> is not a member of %qT",
2633 scope
, name
, object_type
);
2634 return error_mark_node
;
2637 gcc_assert (CLASS_TYPE_P (scope
));
2638 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2639 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2641 if (constructor_name_p (name
, scope
))
2643 if (complain
& tf_error
)
2644 error ("cannot call constructor %<%T::%D%> directly",
2646 return error_mark_node
;
2649 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2650 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2651 if (access_path
== error_mark_node
)
2652 return error_mark_node
;
2655 if (complain
& tf_error
)
2656 error ("%qT is not a base of %qT", scope
, object_type
);
2657 return error_mark_node
;
2663 access_path
= object_type
;
2666 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2667 member
= lookup_destructor (object
, scope
, name
);
2670 /* Look up the member. */
2671 member
= lookup_member (access_path
, name
, /*protect=*/1,
2672 /*want_type=*/false);
2673 if (member
== NULL_TREE
)
2675 if (complain
& tf_error
)
2676 error ("%qD has no member named %qE", object_type
, name
);
2677 return error_mark_node
;
2679 if (member
== error_mark_node
)
2680 return error_mark_node
;
2685 tree templ
= member
;
2687 if (BASELINK_P (templ
))
2688 templ
= lookup_template_function (templ
, template_args
);
2691 if (complain
& tf_error
)
2692 error ("%qD is not a member template function", name
);
2693 return error_mark_node
;
2698 if (TREE_DEPRECATED (member
))
2699 warn_deprecated_use (member
, NULL_TREE
);
2702 check_template_keyword (member
);
2704 expr
= build_class_member_access_expr (object
, member
, access_path
,
2705 /*preserve_reference=*/false,
2707 if (processing_template_decl
&& expr
!= error_mark_node
)
2709 if (BASELINK_P (member
))
2711 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2712 BASELINK_QUALIFIED_P (member
) = 1;
2715 return build_min_non_dep (COMPONENT_REF
, expr
,
2716 orig_object
, orig_name
,
2723 /* Return an expression for the MEMBER_NAME field in the internal
2724 representation of PTRMEM, a pointer-to-member function. (Each
2725 pointer-to-member function type gets its own RECORD_TYPE so it is
2726 more convenient to access the fields by name than by FIELD_DECL.)
2727 This routine converts the NAME to a FIELD_DECL and then creates the
2728 node for the complete expression. */
2731 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2737 /* This code is a stripped down version of
2738 build_class_member_access_expr. It does not work to use that
2739 routine directly because it expects the object to be of class
2741 ptrmem_type
= TREE_TYPE (ptrmem
);
2742 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2743 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2744 /*want_type=*/false);
2745 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2746 cp_type_quals (ptrmem_type
));
2747 return fold_build3_loc (input_location
,
2748 COMPONENT_REF
, member_type
,
2749 ptrmem
, member
, NULL_TREE
);
2752 /* Given an expression PTR for a pointer, return an expression
2753 for the value pointed to.
2754 ERRORSTRING is the name of the operator to appear in error messages.
2756 This function may need to overload OPERATOR_FNNAME.
2757 Must also handle REFERENCE_TYPEs for C++. */
2760 build_x_indirect_ref (tree expr
, ref_operator errorstring
,
2761 tsubst_flags_t complain
)
2763 tree orig_expr
= expr
;
2766 if (processing_template_decl
)
2768 /* Retain the type if we know the operand is a pointer so that
2769 describable_type doesn't make auto deduction break. */
2770 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2771 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2772 if (type_dependent_expression_p (expr
))
2773 return build_min_nt (INDIRECT_REF
, expr
);
2774 expr
= build_non_dependent_expr (expr
);
2777 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2778 NULL_TREE
, /*overloaded_p=*/NULL
, complain
);
2780 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2782 if (processing_template_decl
&& rval
!= error_mark_node
)
2783 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2788 /* Helper function called from c-common. */
2790 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2791 tree ptr
, ref_operator errorstring
)
2793 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2797 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2798 tsubst_flags_t complain
)
2802 if (ptr
== error_mark_node
)
2803 return error_mark_node
;
2805 if (ptr
== current_class_ptr
)
2806 return current_class_ref
;
2808 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2809 ? ptr
: decay_conversion (ptr
));
2810 type
= TREE_TYPE (pointer
);
2812 if (POINTER_TYPE_P (type
))
2816 If the type of the expression is "pointer to T," the type
2817 of the result is "T." */
2818 tree t
= TREE_TYPE (type
);
2820 if (CONVERT_EXPR_P (ptr
)
2821 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2823 /* If a warning is issued, mark it to avoid duplicates from
2824 the backend. This only needs to be done at
2825 warn_strict_aliasing > 2. */
2826 if (warn_strict_aliasing
> 2)
2827 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2828 type
, TREE_OPERAND (ptr
, 0)))
2829 TREE_NO_WARNING (ptr
) = 1;
2832 if (VOID_TYPE_P (t
))
2834 /* A pointer to incomplete type (other than cv void) can be
2835 dereferenced [expr.unary.op]/1 */
2836 if (complain
& tf_error
)
2837 error ("%qT is not a pointer-to-object type", type
);
2838 return error_mark_node
;
2840 else if (TREE_CODE (pointer
) == ADDR_EXPR
2841 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2842 /* The POINTER was something like `&x'. We simplify `*&x' to
2844 return TREE_OPERAND (pointer
, 0);
2847 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2849 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2850 so that we get the proper error message if the result is used
2851 to assign to. Also, &* is supposed to be a no-op. */
2852 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2853 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2854 TREE_SIDE_EFFECTS (ref
)
2855 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2859 else if (!(complain
& tf_error
))
2860 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2862 /* `pointer' won't be an error_mark_node if we were given a
2863 pointer to member, so it's cool to check for this here. */
2864 else if (TYPE_PTR_TO_MEMBER_P (type
))
2865 switch (errorstring
)
2867 case RO_ARRAY_INDEXING
:
2868 error ("invalid use of array indexing on pointer to member");
2871 error ("invalid use of unary %<*%> on pointer to member");
2873 case RO_IMPLICIT_CONVERSION
:
2874 error ("invalid use of implicit conversion on pointer to member");
2879 else if (pointer
!= error_mark_node
)
2880 switch (errorstring
)
2883 error ("invalid type argument");
2885 case RO_ARRAY_INDEXING
:
2886 error ("invalid type argument of array indexing");
2889 error ("invalid type argument of unary %<*%>");
2891 case RO_IMPLICIT_CONVERSION
:
2892 error ("invalid type argument of implicit conversion");
2897 return error_mark_node
;
2900 /* This handles expressions of the form "a[i]", which denotes
2903 This is logically equivalent in C to *(a+i), but we may do it differently.
2904 If A is a variable or a member, we generate a primitive ARRAY_REF.
2905 This avoids forcing the array out of registers, and can work on
2906 arrays that are not lvalues (for example, members of structures returned
2909 If INDEX is of some user-defined type, it must be converted to
2910 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2911 will inherit the type of the array, which will be some pointer type.
2913 LOC is the location to use in building the array reference. */
2916 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
2917 tsubst_flags_t complain
)
2923 if (complain
& tf_error
)
2924 error_at (loc
, "subscript missing in array reference");
2925 return error_mark_node
;
2928 if (TREE_TYPE (array
) == error_mark_node
2929 || TREE_TYPE (idx
) == error_mark_node
)
2930 return error_mark_node
;
2932 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2934 switch (TREE_CODE (array
))
2938 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2940 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2941 TREE_OPERAND (array
, 0), value
);
2942 SET_EXPR_LOCATION (ret
, loc
);
2947 ret
= build_conditional_expr
2948 (TREE_OPERAND (array
, 0),
2949 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2951 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
2953 tf_warning_or_error
);
2954 protected_set_expr_location (ret
, loc
);
2961 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2965 warn_array_subscript_with_type_char (idx
);
2967 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2969 if (complain
& tf_error
)
2970 error_at (loc
, "array subscript is not an integer");
2971 return error_mark_node
;
2974 /* Apply integral promotions *after* noticing character types.
2975 (It is unclear why we do these promotions -- the standard
2976 does not say that we should. In fact, the natural thing would
2977 seem to be to convert IDX to ptrdiff_t; we're performing
2978 pointer arithmetic.) */
2979 idx
= perform_integral_promotions (idx
);
2981 /* An array that is indexed by a non-constant
2982 cannot be stored in a register; we must be able to do
2983 address arithmetic on its address.
2984 Likewise an array of elements of variable size. */
2985 if (TREE_CODE (idx
) != INTEGER_CST
2986 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2987 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2990 if (!cxx_mark_addressable (array
))
2991 return error_mark_node
;
2994 /* An array that is indexed by a constant value which is not within
2995 the array bounds cannot be stored in a register either; because we
2996 would get a crash in store_bit_field/extract_bit_field when trying
2997 to access a non-existent part of the register. */
2998 if (TREE_CODE (idx
) == INTEGER_CST
2999 && TYPE_DOMAIN (TREE_TYPE (array
))
3000 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
3002 if (!cxx_mark_addressable (array
))
3003 return error_mark_node
;
3006 if (!lvalue_p (array
) && (complain
& tf_error
))
3007 pedwarn (loc
, OPT_pedantic
,
3008 "ISO C++ forbids subscripting non-lvalue array");
3010 /* Note in C++ it is valid to subscript a `register' array, since
3011 it is valid to take the address of something with that
3012 storage specification. */
3016 while (TREE_CODE (foo
) == COMPONENT_REF
)
3017 foo
= TREE_OPERAND (foo
, 0);
3018 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
)
3019 && (complain
& tf_warning
))
3020 warning_at (loc
, OPT_Wextra
,
3021 "subscripting array declared %<register%>");
3024 type
= TREE_TYPE (TREE_TYPE (array
));
3025 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
3026 /* Array ref is const/volatile if the array elements are
3027 or if the array is.. */
3028 TREE_READONLY (rval
)
3029 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
3030 TREE_SIDE_EFFECTS (rval
)
3031 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
3032 TREE_THIS_VOLATILE (rval
)
3033 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
3034 ret
= require_complete_type (fold_if_not_in_template (rval
));
3035 protected_set_expr_location (ret
, loc
);
3040 tree ar
= default_conversion (array
);
3041 tree ind
= default_conversion (idx
);
3043 /* Put the integer in IND to simplify error checking. */
3044 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
3051 if (ar
== error_mark_node
)
3054 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
3056 if (complain
& tf_error
)
3057 error_at (loc
, "subscripted value is neither array nor pointer");
3058 return error_mark_node
;
3060 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
3062 if (complain
& tf_error
)
3063 error_at (loc
, "array subscript is not an integer");
3064 return error_mark_node
;
3067 warn_array_subscript_with_type_char (idx
);
3069 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
3074 protected_set_expr_location (ret
, loc
);
3079 /* Entry point for Obj-C++. */
3082 build_array_ref (location_t loc
, tree array
, tree idx
)
3084 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
3087 /* Resolve a pointer to member function. INSTANCE is the object
3088 instance to use, if the member points to a virtual member.
3090 This used to avoid checking for virtual functions if basetype
3091 has no virtual functions, according to an earlier ANSI draft.
3092 With the final ISO C++ rules, such an optimization is
3093 incorrect: A pointer to a derived member can be static_cast
3094 to pointer-to-base-member, as long as the dynamic object
3095 later has the right member. */
3098 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
3100 if (TREE_CODE (function
) == OFFSET_REF
)
3101 function
= TREE_OPERAND (function
, 1);
3103 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3105 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
3106 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3108 tree instance_ptr
= *instance_ptrptr
;
3109 tree instance_save_expr
= 0;
3110 if (instance_ptr
== error_mark_node
)
3112 if (TREE_CODE (function
) == PTRMEM_CST
)
3114 /* Extracting the function address from a pmf is only
3115 allowed with -Wno-pmf-conversions. It only works for
3117 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
3118 e1
= convert (fntype
, e1
);
3123 error ("object missing in use of %qE", function
);
3124 return error_mark_node
;
3128 if (TREE_SIDE_EFFECTS (instance_ptr
))
3129 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3131 if (TREE_SIDE_EFFECTS (function
))
3132 function
= save_expr (function
);
3134 /* Start by extracting all the information from the PMF itself. */
3135 e3
= pfn_from_ptrmemfunc (function
);
3136 delta
= delta_from_ptrmemfunc (function
);
3137 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3138 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3140 case ptrmemfunc_vbit_in_pfn
:
3141 e1
= cp_build_binary_op (input_location
,
3142 BIT_AND_EXPR
, idx
, integer_one_node
,
3143 tf_warning_or_error
);
3144 idx
= cp_build_binary_op (input_location
,
3145 MINUS_EXPR
, idx
, integer_one_node
,
3146 tf_warning_or_error
);
3149 case ptrmemfunc_vbit_in_delta
:
3150 e1
= cp_build_binary_op (input_location
,
3151 BIT_AND_EXPR
, delta
, integer_one_node
,
3152 tf_warning_or_error
);
3153 delta
= cp_build_binary_op (input_location
,
3154 RSHIFT_EXPR
, delta
, integer_one_node
,
3155 tf_warning_or_error
);
3162 /* Convert down to the right base before using the instance. A
3163 special case is that in a pointer to member of class C, C may
3164 be incomplete. In that case, the function will of course be
3165 a member of C, and no conversion is required. In fact,
3166 lookup_base will fail in that case, because incomplete
3167 classes do not have BINFOs. */
3168 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3169 if (!same_type_ignoring_top_level_qualifiers_p
3170 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3172 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3173 basetype
, ba_check
, NULL
);
3174 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3176 if (instance_ptr
== error_mark_node
)
3177 return error_mark_node
;
3179 /* ...and then the delta in the PMF. */
3180 instance_ptr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (instance_ptr
),
3181 instance_ptr
, fold_convert (sizetype
, delta
));
3183 /* Hand back the adjusted 'this' argument to our caller. */
3184 *instance_ptrptr
= instance_ptr
;
3186 /* Next extract the vtable pointer from the object. */
3187 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3189 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, tf_warning_or_error
);
3190 /* If the object is not dynamic the access invokes undefined
3191 behavior. As it is not executed in this case silence the
3192 spurious warnings it may provoke. */
3193 TREE_NO_WARNING (vtbl
) = 1;
3195 /* Finally, extract the function pointer from the vtable. */
3196 e2
= fold_build2_loc (input_location
,
3197 POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
,
3198 fold_convert (sizetype
, idx
));
3199 e2
= cp_build_indirect_ref (e2
, RO_NULL
, tf_warning_or_error
);
3200 TREE_CONSTANT (e2
) = 1;
3202 /* When using function descriptors, the address of the
3203 vtable entry is treated as a function pointer. */
3204 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3205 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3206 cp_build_unary_op (ADDR_EXPR
, e2
, /*noconvert=*/1,
3207 tf_warning_or_error
));
3209 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3210 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
3212 /* Make sure this doesn't get evaluated first inside one of the
3213 branches of the COND_EXPR. */
3214 if (instance_save_expr
)
3215 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3216 instance_save_expr
, e1
);
3223 /* Used by the C-common bits. */
3225 build_function_call (location_t loc ATTRIBUTE_UNUSED
,
3226 tree function
, tree params
)
3228 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3231 /* Used by the C-common bits. */
3233 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED
,
3234 tree function
, VEC(tree
,gc
) *params
,
3235 VEC(tree
,gc
) *origtypes ATTRIBUTE_UNUSED
)
3237 VEC(tree
,gc
) *orig_params
= params
;
3238 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3239 tf_warning_or_error
);
3241 /* cp_build_function_call_vec can reallocate PARAMS by adding
3242 default arguments. That should never happen here. Verify
3244 gcc_assert (params
== orig_params
);
3249 /* Build a function call using a tree list of arguments. */
3252 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3257 vec
= make_tree_vector ();
3258 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3259 VEC_safe_push (tree
, gc
, vec
, TREE_VALUE (params
));
3260 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3261 release_tree_vector (vec
);
3265 /* Build a function call using varargs. */
3268 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3274 vec
= make_tree_vector ();
3275 va_start (args
, complain
);
3276 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3277 VEC_safe_push (tree
, gc
, vec
, t
);
3279 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3280 release_tree_vector (vec
);
3284 /* Build a function call using a vector of arguments. PARAMS may be
3285 NULL if there are no parameters. This changes the contents of
3289 cp_build_function_call_vec (tree function
, VEC(tree
,gc
) **params
,
3290 tsubst_flags_t complain
)
3292 tree fntype
, fndecl
;
3294 tree original
= function
;
3298 VEC(tree
,gc
) *allocated
= NULL
;
3301 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3302 expressions, like those used for ObjC messenger dispatches. */
3303 if (params
!= NULL
&& !VEC_empty (tree
, *params
))
3304 function
= objc_rewrite_function_call (function
,
3305 VEC_index (tree
, *params
, 0));
3307 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3308 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3309 if (TREE_CODE (function
) == NOP_EXPR
3310 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3311 function
= TREE_OPERAND (function
, 0);
3313 if (TREE_CODE (function
) == FUNCTION_DECL
)
3315 mark_used (function
);
3318 /* Convert anything with function type to a pointer-to-function. */
3319 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
3320 pedwarn (input_location
, OPT_pedantic
,
3321 "ISO C++ forbids calling %<::main%> from within program");
3323 function
= build_addr_func (function
);
3329 function
= build_addr_func (function
);
3332 if (function
== error_mark_node
)
3333 return error_mark_node
;
3335 fntype
= TREE_TYPE (function
);
3337 if (TYPE_PTRMEMFUNC_P (fntype
))
3339 if (complain
& tf_error
)
3340 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3341 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3342 original
, original
);
3343 return error_mark_node
;
3346 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
3347 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3349 if (!((TREE_CODE (fntype
) == POINTER_TYPE
3350 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
3352 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3354 if (complain
& tf_error
)
3355 error ("%qE cannot be used as a function", original
);
3356 return error_mark_node
;
3359 /* fntype now gets the type of function pointed to. */
3360 fntype
= TREE_TYPE (fntype
);
3361 parm_types
= TYPE_ARG_TYPES (fntype
);
3365 allocated
= make_tree_vector ();
3366 params
= &allocated
;
3369 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3372 return error_mark_node
;
3374 argarray
= VEC_address (tree
, *params
);
3376 /* Check for errors in format strings and inappropriately
3378 check_function_arguments (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
,
3381 ret
= build_cxx_call (function
, nargs
, argarray
);
3383 if (allocated
!= NULL
)
3384 release_tree_vector (allocated
);
3389 /* Subroutine of convert_arguments.
3390 Warn about wrong number of args are genereted. */
3393 warn_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3397 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3399 if (DECL_NAME (fndecl
) == NULL_TREE
3400 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3403 ? G_("too many arguments to constructor %q#D")
3404 : G_("too few arguments to constructor %q#D"),
3409 ? G_("too many arguments to member function %q#D")
3410 : G_("too few arguments to member function %q#D"),
3416 ? G_("too many arguments to function %q#D")
3417 : G_("too few arguments to function %q#D"),
3419 inform (DECL_SOURCE_LOCATION (fndecl
),
3423 error_at (loc
, too_many_p
? G_("too many arguments to function")
3424 : G_("too few arguments to function"));
3427 /* Convert the actual parameter expressions in the list VALUES to the
3428 types in the list TYPELIST. The converted expressions are stored
3429 back in the VALUES vector.
3430 If parmdecls is exhausted, or when an element has NULL as its type,
3431 perform the default conversions.
3433 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3435 This is also where warnings about wrong number of args are generated.
3437 Returns the actual number of arguments processed (which might be less
3438 than the length of the vector), or -1 on error.
3440 In C++, unspecified trailing parameters can be filled in with their
3441 default arguments, if such were specified. Do so here. */
3444 convert_arguments (tree typelist
, VEC(tree
,gc
) **values
, tree fndecl
,
3445 int flags
, tsubst_flags_t complain
)
3450 /* Argument passing is always copy-initialization. */
3451 flags
|= LOOKUP_ONLYCONVERTING
;
3453 for (i
= 0, typetail
= typelist
;
3454 i
< VEC_length (tree
, *values
);
3457 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3458 tree val
= VEC_index (tree
, *values
, i
);
3460 if (val
== error_mark_node
|| type
== error_mark_node
)
3463 if (type
== void_type_node
)
3465 if (complain
& tf_error
)
3467 warn_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3474 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3475 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3476 if (TREE_CODE (val
) == NOP_EXPR
3477 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3478 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3479 val
= TREE_OPERAND (val
, 0);
3481 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3483 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3484 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3485 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3486 val
= decay_conversion (val
);
3489 if (val
== error_mark_node
)
3494 /* Formal parm type is specified by a function prototype. */
3497 if (!COMPLETE_TYPE_P (complete_type (type
)))
3499 if (complain
& tf_error
)
3502 error ("parameter %P of %qD has incomplete type %qT",
3505 error ("parameter %P has incomplete type %qT", i
, type
);
3507 parmval
= error_mark_node
;
3511 parmval
= convert_for_initialization
3512 (NULL_TREE
, type
, val
, flags
,
3513 ICR_ARGPASS
, fndecl
, i
, complain
);
3514 parmval
= convert_for_arg_passing (type
, parmval
);
3517 if (parmval
== error_mark_node
)
3520 VEC_replace (tree
, *values
, i
, parmval
);
3524 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3525 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3526 /* Don't do ellipsis conversion for __built_in_constant_p
3527 as this will result in spurious errors for non-trivial
3529 val
= require_complete_type (val
);
3531 val
= convert_arg_to_ellipsis (val
);
3533 VEC_replace (tree
, *values
, i
, val
);
3537 typetail
= TREE_CHAIN (typetail
);
3540 if (typetail
!= 0 && typetail
!= void_list_node
)
3542 /* See if there are default arguments that can be used. Because
3543 we hold default arguments in the FUNCTION_TYPE (which is so
3544 wrong), we can see default parameters here from deduced
3545 contexts (and via typeof) for indirect function calls.
3546 Fortunately we know whether we have a function decl to
3547 provide default arguments in a language conformant
3549 if (fndecl
&& TREE_PURPOSE (typetail
)
3550 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3552 for (; typetail
!= void_list_node
; ++i
)
3555 = convert_default_arg (TREE_VALUE (typetail
),
3556 TREE_PURPOSE (typetail
),
3559 if (parmval
== error_mark_node
)
3562 VEC_safe_push (tree
, gc
, *values
, parmval
);
3563 typetail
= TREE_CHAIN (typetail
);
3564 /* ends with `...'. */
3565 if (typetail
== NULL_TREE
)
3571 if (complain
& tf_error
)
3572 warn_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3580 /* Build a binary-operation expression, after performing default
3581 conversions on the operands. CODE is the kind of expression to
3582 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3583 are the tree codes which correspond to ARG1 and ARG2 when issuing
3584 warnings about possibly misplaced parentheses. They may differ
3585 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3586 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3587 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3588 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3589 ARG2_CODE as ERROR_MARK. */
3592 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3593 tree arg2
, enum tree_code arg2_code
, bool *overloaded_p
,
3594 tsubst_flags_t complain
)
3603 if (processing_template_decl
)
3605 if (type_dependent_expression_p (arg1
)
3606 || type_dependent_expression_p (arg2
))
3607 return build_min_nt (code
, arg1
, arg2
);
3608 arg1
= build_non_dependent_expr (arg1
);
3609 arg2
= build_non_dependent_expr (arg2
);
3612 if (code
== DOTSTAR_EXPR
)
3613 expr
= build_m_component_ref (arg1
, arg2
);
3615 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3616 overloaded_p
, complain
);
3618 /* Check for cases such as x+y<<z which users are likely to
3619 misinterpret. But don't warn about obj << x + y, since that is a
3620 common idiom for I/O. */
3621 if (warn_parentheses
3622 && (complain
& tf_warning
)
3623 && !processing_template_decl
3624 && !error_operand_p (arg1
)
3625 && !error_operand_p (arg2
)
3626 && (code
!= LSHIFT_EXPR
3627 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3628 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3630 if (processing_template_decl
&& expr
!= error_mark_node
)
3631 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3636 /* Build and return an ARRAY_REF expression. */
3639 build_x_array_ref (tree arg1
, tree arg2
, tsubst_flags_t complain
)
3641 tree orig_arg1
= arg1
;
3642 tree orig_arg2
= arg2
;
3645 if (processing_template_decl
)
3647 if (type_dependent_expression_p (arg1
)
3648 || type_dependent_expression_p (arg2
))
3649 return build_min_nt (ARRAY_REF
, arg1
, arg2
,
3650 NULL_TREE
, NULL_TREE
);
3651 arg1
= build_non_dependent_expr (arg1
);
3652 arg2
= build_non_dependent_expr (arg2
);
3655 expr
= build_new_op (ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3656 /*overloaded_p=*/NULL
, complain
);
3658 if (processing_template_decl
&& expr
!= error_mark_node
)
3659 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3660 NULL_TREE
, NULL_TREE
);
3664 /* For the c-common bits. */
3666 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3667 int convert_p ATTRIBUTE_UNUSED
)
3669 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3673 /* Build a binary-operation expression without default conversions.
3674 CODE is the kind of expression to build.
3675 LOCATION is the location_t of the operator in the source code.
3676 This function differs from `build' in several ways:
3677 the data type of the result is computed and recorded in it,
3678 warnings are generated if arg data types are invalid,
3679 special handling for addition and subtraction of pointers is known,
3680 and some optimization is done (operations on narrow ints
3681 are done in the narrower type when that gives the same result).
3682 Constant folding is also done before the result is returned.
3684 Note that the operands will never have enumeral types
3685 because either they have just had the default conversions performed
3686 or they have both just been converted to some other type in which
3687 the arithmetic is to be done.
3689 C++: must do special pointer arithmetic when implementing
3690 multiple inheritance, and deal with pointer to member functions. */
3693 cp_build_binary_op (location_t location
,
3694 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3695 tsubst_flags_t complain
)
3698 enum tree_code code0
, code1
;
3700 const char *invalid_op_diag
;
3702 /* Expression code to give to the expression when it is built.
3703 Normally this is CODE, which is what the caller asked for,
3704 but in some special cases we change it. */
3705 enum tree_code resultcode
= code
;
3707 /* Data type in which the computation is to be performed.
3708 In the simplest cases this is the common type of the arguments. */
3709 tree result_type
= NULL
;
3711 /* Nonzero means operands have already been type-converted
3712 in whatever way is necessary.
3713 Zero means they need to be converted to RESULT_TYPE. */
3716 /* Nonzero means create the expression with this type, rather than
3718 tree build_type
= 0;
3720 /* Nonzero means after finally constructing the expression
3721 convert it to this type. */
3722 tree final_type
= 0;
3726 /* Nonzero if this is an operation like MIN or MAX which can
3727 safely be computed in short if both args are promoted shorts.
3728 Also implies COMMON.
3729 -1 indicates a bitwise operation; this makes a difference
3730 in the exact conditions for when it is safe to do the operation
3731 in a narrower mode. */
3734 /* Nonzero if this is a comparison operation;
3735 if both args are promoted shorts, compare the original shorts.
3736 Also implies COMMON. */
3737 int short_compare
= 0;
3739 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3742 /* True if both operands have arithmetic type. */
3743 bool arithmetic_types_p
;
3745 /* Apply default conversions. */
3749 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3750 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3751 || code
== TRUTH_XOR_EXPR
)
3753 if (!really_overloaded_fn (op0
))
3754 op0
= decay_conversion (op0
);
3755 if (!really_overloaded_fn (op1
))
3756 op1
= decay_conversion (op1
);
3760 if (!really_overloaded_fn (op0
))
3761 op0
= default_conversion (op0
);
3762 if (!really_overloaded_fn (op1
))
3763 op1
= default_conversion (op1
);
3766 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3767 STRIP_TYPE_NOPS (op0
);
3768 STRIP_TYPE_NOPS (op1
);
3770 /* DTRT if one side is an overloaded function, but complain about it. */
3771 if (type_unknown_p (op0
))
3773 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3774 if (t
!= error_mark_node
)
3776 if (complain
& tf_error
)
3777 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3782 if (type_unknown_p (op1
))
3784 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3785 if (t
!= error_mark_node
)
3787 if (complain
& tf_error
)
3788 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3794 type0
= TREE_TYPE (op0
);
3795 type1
= TREE_TYPE (op1
);
3797 /* The expression codes of the data types of the arguments tell us
3798 whether the arguments are integers, floating, pointers, etc. */
3799 code0
= TREE_CODE (type0
);
3800 code1
= TREE_CODE (type1
);
3802 /* If an error was already reported for one of the arguments,
3803 avoid reporting another error. */
3804 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3805 return error_mark_node
;
3807 if ((invalid_op_diag
3808 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3810 error (invalid_op_diag
);
3811 return error_mark_node
;
3814 /* Issue warnings about peculiar, but valid, uses of NULL. */
3815 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3816 /* It's reasonable to use pointer values as operands of &&
3817 and ||, so NULL is no exception. */
3818 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3819 && ( /* Both are NULL (or 0) and the operation was not a
3820 comparison or a pointer subtraction. */
3821 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3822 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
3823 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3824 || (!null_ptr_cst_p (orig_op0
)
3825 && !TYPE_PTR_P (type0
) && !TYPE_PTR_TO_MEMBER_P (type0
))
3826 || (!null_ptr_cst_p (orig_op1
)
3827 && !TYPE_PTR_P (type1
) && !TYPE_PTR_TO_MEMBER_P (type1
)))
3828 && (complain
& tf_warning
))
3829 /* Some sort of arithmetic operation involving NULL was
3831 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3836 /* Subtraction of two similar pointers.
3837 We must subtract them as integers, then divide by object size. */
3838 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3839 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3841 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3842 /* In all other cases except pointer - int, the usual arithmetic
3844 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3849 /* The pointer - int case is just like pointer + int; fall
3852 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3853 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3857 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3858 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3859 if (processing_template_decl
)
3861 result_type
= TREE_TYPE (ptr_operand
);
3864 return cp_pointer_int_sum (code
,
3875 case TRUNC_DIV_EXPR
:
3877 case FLOOR_DIV_EXPR
:
3878 case ROUND_DIV_EXPR
:
3879 case EXACT_DIV_EXPR
:
3880 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3881 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3882 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3883 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3885 enum tree_code tcode0
= code0
, tcode1
= code1
;
3887 warn_for_div_by_zero (location
, op1
);
3889 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3890 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3891 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3892 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3894 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3895 resultcode
= RDIV_EXPR
;
3897 /* When dividing two signed integers, we have to promote to int.
3898 unless we divide by a constant != -1. Note that default
3899 conversion will have been performed on the operands at this
3900 point, so we have to dig out the original type to find out if
3902 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3903 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3904 || (TREE_CODE (op1
) == INTEGER_CST
3905 && ! integer_all_onesp (op1
)));
3914 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3915 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3916 && !VECTOR_FLOAT_TYPE_P (type0
)
3917 && !VECTOR_FLOAT_TYPE_P (type1
)))
3921 case TRUNC_MOD_EXPR
:
3922 case FLOOR_MOD_EXPR
:
3923 warn_for_div_by_zero (location
, op1
);
3925 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3926 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
3927 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
3929 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3931 /* Although it would be tempting to shorten always here, that loses
3932 on some targets, since the modulo instruction is undefined if the
3933 quotient can't be represented in the computation mode. We shorten
3934 only if unsigned or if dividing by something we know != -1. */
3935 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3936 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3937 || (TREE_CODE (op1
) == INTEGER_CST
3938 && ! integer_all_onesp (op1
)));
3943 case TRUTH_ANDIF_EXPR
:
3944 case TRUTH_ORIF_EXPR
:
3945 case TRUTH_AND_EXPR
:
3947 result_type
= boolean_type_node
;
3950 /* Shift operations: result has same type as first operand;
3951 always convert second operand to int.
3952 Also set SHORT_SHIFT if shifting rightward. */
3955 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3957 result_type
= type0
;
3958 if (TREE_CODE (op1
) == INTEGER_CST
)
3960 if (tree_int_cst_lt (op1
, integer_zero_node
))
3962 if ((complain
& tf_warning
)
3963 && c_inhibit_evaluation_warnings
== 0)
3964 warning (0, "right shift count is negative");
3968 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3969 && (complain
& tf_warning
)
3970 && c_inhibit_evaluation_warnings
== 0)
3971 warning (0, "right shift count >= width of type");
3974 /* Convert the shift-count to an integer, regardless of
3975 size of value being shifted. */
3976 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3977 op1
= cp_convert (integer_type_node
, op1
);
3978 /* Avoid converting op1 to result_type later. */
3984 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3986 result_type
= type0
;
3987 if (TREE_CODE (op1
) == INTEGER_CST
)
3989 if (tree_int_cst_lt (op1
, integer_zero_node
))
3991 if ((complain
& tf_warning
)
3992 && c_inhibit_evaluation_warnings
== 0)
3993 warning (0, "left shift count is negative");
3995 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3997 if ((complain
& tf_warning
)
3998 && c_inhibit_evaluation_warnings
== 0)
3999 warning (0, "left shift count >= width of type");
4002 /* Convert the shift-count to an integer, regardless of
4003 size of value being shifted. */
4004 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
4005 op1
= cp_convert (integer_type_node
, op1
);
4006 /* Avoid converting op1 to result_type later. */
4013 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4015 result_type
= type0
;
4016 if (TREE_CODE (op1
) == INTEGER_CST
)
4018 if (tree_int_cst_lt (op1
, integer_zero_node
))
4020 if (complain
& tf_warning
)
4021 warning (0, (code
== LROTATE_EXPR
)
4022 ? G_("left rotate count is negative")
4023 : G_("right rotate count is negative"));
4025 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
4027 if (complain
& tf_warning
)
4028 warning (0, (code
== LROTATE_EXPR
)
4029 ? G_("left rotate count >= width of type")
4030 : G_("right rotate count >= width of type"));
4033 /* Convert the shift-count to an integer, regardless of
4034 size of value being shifted. */
4035 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
4036 op1
= cp_convert (integer_type_node
, op1
);
4042 if ((complain
& tf_warning
)
4043 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
4044 warning (OPT_Wfloat_equal
,
4045 "comparing floating point with == or != is unsafe");
4046 if ((complain
& tf_warning
)
4047 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
4048 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
4049 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4051 build_type
= boolean_type_node
;
4052 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4053 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
4054 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4055 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
4057 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4058 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
4059 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4060 CPO_COMPARISON
, complain
);
4061 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
4062 && null_ptr_cst_p (op1
))
4064 if (TREE_CODE (op0
) == ADDR_EXPR
4065 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
4067 if (complain
& tf_warning
)
4068 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4069 TREE_OPERAND (op0
, 0));
4071 result_type
= type0
;
4073 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
4074 && null_ptr_cst_p (op0
))
4076 if (TREE_CODE (op1
) == ADDR_EXPR
4077 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
4079 if (complain
& tf_warning
)
4080 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4081 TREE_OPERAND (op1
, 0));
4083 result_type
= type1
;
4085 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4086 /* One of the operands must be of nullptr_t type. */
4087 result_type
= TREE_TYPE (nullptr_node
);
4088 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4090 result_type
= type0
;
4091 if (complain
& tf_error
)
4092 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4094 return error_mark_node
;
4096 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4098 result_type
= type1
;
4099 if (complain
& tf_error
)
4100 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4102 return error_mark_node
;
4104 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
4106 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4107 == ptrmemfunc_vbit_in_delta
)
4109 tree pfn0
= pfn_from_ptrmemfunc (op0
);
4110 tree delta0
= delta_from_ptrmemfunc (op0
);
4111 tree e1
= cp_build_binary_op (location
,
4114 fold_convert (TREE_TYPE (pfn0
),
4117 tree e2
= cp_build_binary_op (location
,
4122 e2
= cp_build_binary_op (location
,
4123 EQ_EXPR
, e2
, integer_zero_node
,
4125 op0
= cp_build_binary_op (location
,
4126 TRUTH_ANDIF_EXPR
, e1
, e2
,
4128 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
4132 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4133 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
4135 result_type
= TREE_TYPE (op0
);
4137 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4138 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4139 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4142 /* E will be the final comparison. */
4144 /* E1 and E2 are for scratch. */
4152 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4153 CPO_COMPARISON
, complain
);
4155 if (!same_type_p (TREE_TYPE (op0
), type
))
4156 op0
= cp_convert_and_check (type
, op0
);
4157 if (!same_type_p (TREE_TYPE (op1
), type
))
4158 op1
= cp_convert_and_check (type
, op1
);
4160 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4161 return error_mark_node
;
4163 if (TREE_SIDE_EFFECTS (op0
))
4164 op0
= save_expr (op0
);
4165 if (TREE_SIDE_EFFECTS (op1
))
4166 op1
= save_expr (op1
);
4168 pfn0
= pfn_from_ptrmemfunc (op0
);
4169 pfn1
= pfn_from_ptrmemfunc (op1
);
4170 delta0
= delta_from_ptrmemfunc (op0
);
4171 delta1
= delta_from_ptrmemfunc (op1
);
4172 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4173 == ptrmemfunc_vbit_in_delta
)
4178 && ((op0.delta == op1.delta)
4179 || (!op0.pfn && op0.delta & 1 == 0
4180 && op1.delta & 1 == 0))
4182 The reason for the `!op0.pfn' bit is that a NULL
4183 pointer-to-member is any member with a zero PFN and
4184 LSB of the DELTA field is 0. */
4186 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4190 e1
= cp_build_binary_op (location
,
4191 EQ_EXPR
, e1
, integer_zero_node
,
4193 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4197 e2
= cp_build_binary_op (location
,
4198 EQ_EXPR
, e2
, integer_zero_node
,
4200 e1
= cp_build_binary_op (location
,
4201 TRUTH_ANDIF_EXPR
, e2
, e1
,
4203 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4205 fold_convert (TREE_TYPE (pfn0
),
4208 e2
= cp_build_binary_op (location
,
4209 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4210 e1
= cp_build_binary_op (location
,
4211 EQ_EXPR
, delta0
, delta1
, complain
);
4212 e1
= cp_build_binary_op (location
,
4213 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4220 && (!op0.pfn || op0.delta == op1.delta))
4222 The reason for the `!op0.pfn' bit is that a NULL
4223 pointer-to-member is any member with a zero PFN; the
4224 DELTA field is unspecified. */
4226 e1
= cp_build_binary_op (location
,
4227 EQ_EXPR
, delta0
, delta1
, complain
);
4228 e2
= cp_build_binary_op (location
,
4231 fold_convert (TREE_TYPE (pfn0
),
4234 e1
= cp_build_binary_op (location
,
4235 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4237 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4238 e
= cp_build_binary_op (location
,
4239 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4240 if (code
== EQ_EXPR
)
4242 return cp_build_binary_op (location
,
4243 EQ_EXPR
, e
, integer_zero_node
, complain
);
4247 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4248 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4250 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4251 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4259 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4260 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4262 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4263 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4264 CPO_COMPARISON
, complain
);
4271 if (TREE_CODE (orig_op0
) == STRING_CST
4272 || TREE_CODE (orig_op1
) == STRING_CST
)
4274 if (complain
& tf_warning
)
4275 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4278 build_type
= boolean_type_node
;
4279 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4280 || code0
== ENUMERAL_TYPE
)
4281 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4282 || code1
== ENUMERAL_TYPE
))
4284 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4285 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4286 CPO_COMPARISON
, complain
);
4287 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4288 result_type
= type0
;
4289 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4290 result_type
= type1
;
4291 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4292 /* One of the operands must be of nullptr_t type. */
4293 result_type
= TREE_TYPE (nullptr_node
);
4294 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4296 result_type
= type0
;
4297 if (complain
& tf_error
)
4298 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4300 return error_mark_node
;
4302 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4304 result_type
= type1
;
4305 if (complain
& tf_error
)
4306 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4308 return error_mark_node
;
4312 case UNORDERED_EXPR
:
4319 build_type
= integer_type_node
;
4320 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4322 if (complain
& tf_error
)
4323 error ("unordered comparison on non-floating point argument");
4324 return error_mark_node
;
4333 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4334 || code0
== ENUMERAL_TYPE
)
4335 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4336 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4337 arithmetic_types_p
= 1;
4340 arithmetic_types_p
= 0;
4341 /* Vector arithmetic is only allowed when both sides are vectors. */
4342 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4344 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4345 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4348 binary_op_error (location
, code
, type0
, type1
);
4349 return error_mark_node
;
4351 arithmetic_types_p
= 1;
4354 /* Determine the RESULT_TYPE, if it is not already known. */
4356 && arithmetic_types_p
4357 && (shorten
|| common
|| short_compare
))
4358 result_type
= cp_common_type (type0
, type1
);
4362 if (complain
& tf_error
)
4363 error ("invalid operands of types %qT and %qT to binary %qO",
4364 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4365 return error_mark_node
;
4368 /* If we're in a template, the only thing we need to know is the
4370 if (processing_template_decl
)
4372 /* Since the middle-end checks the type when doing a build2, we
4373 need to build the tree in pieces. This built tree will never
4374 get out of the front-end as we replace it when instantiating
4376 tree tmp
= build2 (resultcode
,
4377 build_type
? build_type
: result_type
,
4379 TREE_OPERAND (tmp
, 0) = op0
;
4383 if (arithmetic_types_p
)
4385 bool first_complex
= (code0
== COMPLEX_TYPE
);
4386 bool second_complex
= (code1
== COMPLEX_TYPE
);
4387 int none_complex
= (!first_complex
&& !second_complex
);
4389 /* Adapted from patch for c/24581. */
4390 if (first_complex
!= second_complex
4391 && (code
== PLUS_EXPR
4392 || code
== MINUS_EXPR
4393 || code
== MULT_EXPR
4394 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4395 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4396 && flag_signed_zeros
)
4398 /* An operation on mixed real/complex operands must be
4399 handled specially, but the language-independent code can
4400 more easily optimize the plain complex arithmetic if
4401 -fno-signed-zeros. */
4402 tree real_type
= TREE_TYPE (result_type
);
4406 if (TREE_TYPE (op0
) != result_type
)
4407 op0
= cp_convert_and_check (result_type
, op0
);
4408 if (TREE_TYPE (op1
) != real_type
)
4409 op1
= cp_convert_and_check (real_type
, op1
);
4413 if (TREE_TYPE (op0
) != real_type
)
4414 op0
= cp_convert_and_check (real_type
, op0
);
4415 if (TREE_TYPE (op1
) != result_type
)
4416 op1
= cp_convert_and_check (result_type
, op1
);
4418 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4419 return error_mark_node
;
4422 op0
= save_expr (op0
);
4423 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4424 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4428 case TRUNC_DIV_EXPR
:
4429 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4433 real
= build2 (resultcode
, real_type
, real
, op1
);
4441 op1
= save_expr (op1
);
4442 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4443 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4447 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4450 real
= build2 (resultcode
, real_type
, op0
, real
);
4453 real
= build2 (resultcode
, real_type
, op0
, real
);
4454 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4460 return build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4463 /* For certain operations (which identify themselves by shorten != 0)
4464 if both args were extended from the same smaller type,
4465 do the arithmetic in that type and then extend.
4467 shorten !=0 and !=1 indicates a bitwise operation.
4468 For them, this optimization is safe only if
4469 both args are zero-extended or both are sign-extended.
4470 Otherwise, we might change the result.
4471 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4472 but calculated in (unsigned short) it would be (unsigned short)-1. */
4474 if (shorten
&& none_complex
)
4476 final_type
= result_type
;
4477 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4481 /* Comparison operations are shortened too but differently.
4482 They identify themselves by setting short_compare = 1. */
4486 /* Don't write &op0, etc., because that would prevent op0
4487 from being kept in a register.
4488 Instead, make copies of the our local variables and
4489 pass the copies by reference, then copy them back afterward. */
4490 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4491 enum tree_code xresultcode
= resultcode
;
4493 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4495 return cp_convert (boolean_type_node
, val
);
4496 op0
= xop0
, op1
= xop1
;
4498 resultcode
= xresultcode
;
4501 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4502 && warn_sign_compare
4503 && !TREE_NO_WARNING (orig_op0
)
4504 && !TREE_NO_WARNING (orig_op1
)
4505 /* Do not warn until the template is instantiated; we cannot
4506 bound the ranges of the arguments until that point. */
4507 && !processing_template_decl
4508 && (complain
& tf_warning
)
4509 && c_inhibit_evaluation_warnings
== 0)
4511 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4512 result_type
, resultcode
);
4516 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4517 Then the expression will be built.
4518 It will be given type FINAL_TYPE if that is nonzero;
4519 otherwise, it will be given type RESULT_TYPE. */
4522 if (TREE_TYPE (op0
) != result_type
)
4523 op0
= cp_convert_and_check (result_type
, op0
);
4524 if (TREE_TYPE (op1
) != result_type
)
4525 op1
= cp_convert_and_check (result_type
, op1
);
4527 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4528 return error_mark_node
;
4531 if (build_type
== NULL_TREE
)
4532 build_type
= result_type
;
4534 result
= build2 (resultcode
, build_type
, op0
, op1
);
4535 result
= fold_if_not_in_template (result
);
4536 if (final_type
!= 0)
4537 result
= cp_convert (final_type
, result
);
4539 if (TREE_OVERFLOW_P (result
)
4540 && !TREE_OVERFLOW_P (op0
)
4541 && !TREE_OVERFLOW_P (op1
))
4542 overflow_warning (location
, result
);
4547 /* Return a tree for the sum or difference (RESULTCODE says which)
4548 of pointer PTROP and integer INTOP. */
4551 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4553 tree res_type
= TREE_TYPE (ptrop
);
4555 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4556 in certain circumstance (when it's valid to do so). So we need
4557 to make sure it's complete. We don't need to check here, if we
4558 can actually complete it at all, as those checks will be done in
4559 pointer_int_sum() anyway. */
4560 complete_type (TREE_TYPE (res_type
));
4562 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4563 fold_if_not_in_template (intop
));
4566 /* Return a tree for the difference of pointers OP0 and OP1.
4567 The resulting tree has type int. */
4570 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4573 tree restype
= ptrdiff_type_node
;
4574 tree target_type
= TREE_TYPE (ptrtype
);
4576 if (!complete_type_or_else (target_type
, NULL_TREE
))
4577 return error_mark_node
;
4579 if (TREE_CODE (target_type
) == VOID_TYPE
)
4580 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4581 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4582 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4583 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4584 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4586 /* First do the subtraction as integers;
4587 then drop through to build the divide operator. */
4589 op0
= cp_build_binary_op (input_location
,
4591 cp_convert (restype
, op0
),
4592 cp_convert (restype
, op1
),
4593 tf_warning_or_error
);
4595 /* This generates an error if op1 is a pointer to an incomplete type. */
4596 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4597 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4599 op1
= (TYPE_PTROB_P (ptrtype
)
4600 ? size_in_bytes (target_type
)
4601 : integer_one_node
);
4603 /* Do the division. */
4605 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4606 return fold_if_not_in_template (result
);
4609 /* Construct and perhaps optimize a tree representation
4610 for a unary operation. CODE, a tree_code, specifies the operation
4611 and XARG is the operand. */
4614 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4616 tree orig_expr
= xarg
;
4620 if (processing_template_decl
)
4622 if (type_dependent_expression_p (xarg
))
4623 return build_min_nt (code
, xarg
, NULL_TREE
);
4625 xarg
= build_non_dependent_expr (xarg
);
4630 /* [expr.unary.op] says:
4632 The address of an object of incomplete type can be taken.
4634 (And is just the ordinary address operator, not an overloaded
4635 "operator &".) However, if the type is a template
4636 specialization, we must complete the type at this point so that
4637 an overloaded "operator &" will be available if required. */
4638 if (code
== ADDR_EXPR
4639 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4640 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4641 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4642 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4643 /* Don't look for a function. */;
4645 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4646 /*overloaded_p=*/NULL
, complain
);
4647 if (!exp
&& code
== ADDR_EXPR
)
4649 if (is_overloaded_fn (xarg
))
4651 tree fn
= get_first_fn (xarg
);
4652 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4654 error (DECL_CONSTRUCTOR_P (fn
)
4655 ? G_("taking address of constructor %qE")
4656 : G_("taking address of destructor %qE"),
4658 return error_mark_node
;
4662 /* A pointer to member-function can be formed only by saying
4664 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4665 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4667 if (TREE_CODE (xarg
) != OFFSET_REF
4668 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4670 error ("invalid use of %qE to form a pointer-to-member-function",
4672 if (TREE_CODE (xarg
) != OFFSET_REF
)
4673 inform (input_location
, " a qualified-id is required");
4674 return error_mark_node
;
4678 error ("parentheses around %qE cannot be used to form a"
4679 " pointer-to-member-function",
4681 PTRMEM_OK_P (xarg
) = 1;
4685 if (TREE_CODE (xarg
) == OFFSET_REF
)
4687 ptrmem
= PTRMEM_OK_P (xarg
);
4689 if (!ptrmem
&& !flag_ms_extensions
4690 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4692 /* A single non-static member, make sure we don't allow a
4693 pointer-to-member. */
4694 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4695 TREE_OPERAND (xarg
, 0),
4696 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4697 PTRMEM_OK_P (xarg
) = ptrmem
;
4700 else if (TREE_CODE (xarg
) == TARGET_EXPR
&& (complain
& tf_warning
))
4701 warning (0, "taking address of temporary");
4702 exp
= cp_build_unary_op (ADDR_EXPR
, xarg
, 0, complain
);
4705 if (processing_template_decl
&& exp
!= error_mark_node
)
4706 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4707 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4708 if (TREE_CODE (exp
) == ADDR_EXPR
)
4709 PTRMEM_OK_P (exp
) = ptrmem
;
4713 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4714 constants, where a null value is represented by an INTEGER_CST of
4718 cp_truthvalue_conversion (tree expr
)
4720 tree type
= TREE_TYPE (expr
);
4721 if (TYPE_PTRMEM_P (type
))
4722 return build_binary_op (EXPR_LOCATION (expr
),
4723 NE_EXPR
, expr
, integer_zero_node
, 1);
4725 return c_common_truthvalue_conversion (input_location
, expr
);
4728 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4731 condition_conversion (tree expr
)
4734 if (processing_template_decl
)
4736 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4737 tf_warning_or_error
, LOOKUP_NORMAL
);
4738 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4742 /* Returns the address of T. This function will fold away
4743 ADDR_EXPR of INDIRECT_REF. */
4746 build_address (tree t
)
4748 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4749 return error_mark_node
;
4750 t
= build_fold_addr_expr (t
);
4751 if (TREE_CODE (t
) != ADDR_EXPR
)
4756 /* Returns the address of T with type TYPE. */
4759 build_typed_address (tree t
, tree type
)
4761 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4762 return error_mark_node
;
4763 t
= build_fold_addr_expr_with_type (t
, type
);
4764 if (TREE_CODE (t
) != ADDR_EXPR
)
4769 /* Return a NOP_EXPR converting EXPR to TYPE. */
4772 build_nop (tree type
, tree expr
)
4774 if (type
== error_mark_node
|| error_operand_p (expr
))
4776 return build1 (NOP_EXPR
, type
, expr
);
4779 /* C++: Must handle pointers to members.
4781 Perhaps type instantiation should be extended to handle conversion
4782 from aggregates to types we don't yet know we want? (Or are those
4783 cases typically errors which should be reported?)
4785 NOCONVERT nonzero suppresses the default promotions
4786 (such as from short to int). */
4789 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
4790 tsubst_flags_t complain
)
4792 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4795 const char *errstring
= NULL
;
4797 const char *invalid_op_diag
;
4799 if (!arg
|| error_operand_p (arg
))
4800 return error_mark_node
;
4802 if ((invalid_op_diag
4803 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
4808 error (invalid_op_diag
);
4809 return error_mark_node
;
4814 case UNARY_PLUS_EXPR
:
4817 int flags
= WANT_ARITH
| WANT_ENUM
;
4818 /* Unary plus (but not unary minus) is allowed on pointers. */
4819 if (code
== UNARY_PLUS_EXPR
)
4820 flags
|= WANT_POINTER
;
4821 arg
= build_expr_type_conversion (flags
, arg
, true);
4823 errstring
= (code
== NEGATE_EXPR
4824 ? _("wrong type argument to unary minus")
4825 : _("wrong type argument to unary plus"));
4828 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4829 arg
= perform_integral_promotions (arg
);
4831 /* Make sure the result is not an lvalue: a unary plus or minus
4832 expression is always a rvalue. */
4839 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4843 arg
= default_conversion (arg
);
4845 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
4846 | WANT_VECTOR_OR_COMPLEX
,
4848 errstring
= _("wrong type argument to bit-complement");
4849 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4850 arg
= perform_integral_promotions (arg
);
4854 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4855 errstring
= _("wrong type argument to abs");
4856 else if (!noconvert
)
4857 arg
= default_conversion (arg
);
4861 /* Conjugating a real value is a no-op, but allow it anyway. */
4862 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4863 errstring
= _("wrong type argument to conjugation");
4864 else if (!noconvert
)
4865 arg
= default_conversion (arg
);
4868 case TRUTH_NOT_EXPR
:
4869 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
4871 val
= invert_truthvalue_loc (input_location
, arg
);
4872 if (arg
!= error_mark_node
)
4874 errstring
= _("in argument to unary !");
4881 if (TREE_CODE (arg
) == COMPLEX_CST
)
4882 return TREE_REALPART (arg
);
4883 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4885 arg
= build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4886 return fold_if_not_in_template (arg
);
4892 if (TREE_CODE (arg
) == COMPLEX_CST
)
4893 return TREE_IMAGPART (arg
);
4894 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4896 arg
= build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4897 return fold_if_not_in_template (arg
);
4900 return cp_convert (TREE_TYPE (arg
), integer_zero_node
);
4902 case PREINCREMENT_EXPR
:
4903 case POSTINCREMENT_EXPR
:
4904 case PREDECREMENT_EXPR
:
4905 case POSTDECREMENT_EXPR
:
4906 /* Handle complex lvalues (when permitted)
4907 by reduction to simpler cases. */
4909 val
= unary_complex_lvalue (code
, arg
);
4913 arg
= mark_lvalue_use (arg
);
4915 /* Increment or decrement the real part of the value,
4916 and don't change the imaginary part. */
4917 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4921 arg
= stabilize_reference (arg
);
4922 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
4923 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
4924 real
= cp_build_unary_op (code
, real
, 1, complain
);
4925 if (real
== error_mark_node
|| imag
== error_mark_node
)
4926 return error_mark_node
;
4927 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
4931 /* Report invalid types. */
4933 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
4936 if (code
== PREINCREMENT_EXPR
)
4937 errstring
= _("no pre-increment operator for type");
4938 else if (code
== POSTINCREMENT_EXPR
)
4939 errstring
= _("no post-increment operator for type");
4940 else if (code
== PREDECREMENT_EXPR
)
4941 errstring
= _("no pre-decrement operator for type");
4943 errstring
= _("no post-decrement operator for type");
4946 else if (arg
== error_mark_node
)
4947 return error_mark_node
;
4949 /* Report something read-only. */
4951 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
4952 || TREE_READONLY (arg
))
4954 if (complain
& tf_error
)
4955 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
4956 || code
== POSTINCREMENT_EXPR
)
4957 ? REK_INCREMENT
: REK_DECREMENT
));
4959 return error_mark_node
;
4964 tree declared_type
= unlowered_expr_type (arg
);
4966 argtype
= TREE_TYPE (arg
);
4968 /* ARM $5.2.5 last annotation says this should be forbidden. */
4969 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
4971 if (complain
& tf_error
)
4972 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
4973 ? G_("ISO C++ forbids incrementing an enum")
4974 : G_("ISO C++ forbids decrementing an enum"));
4976 return error_mark_node
;
4979 /* Compute the increment. */
4981 if (TREE_CODE (argtype
) == POINTER_TYPE
)
4983 tree type
= complete_type (TREE_TYPE (argtype
));
4985 if (!COMPLETE_OR_VOID_TYPE_P (type
))
4987 if (complain
& tf_error
)
4988 error (((code
== PREINCREMENT_EXPR
4989 || code
== POSTINCREMENT_EXPR
))
4990 ? G_("cannot increment a pointer to incomplete type %qT")
4991 : G_("cannot decrement a pointer to incomplete type %qT"),
4992 TREE_TYPE (argtype
));
4994 return error_mark_node
;
4996 else if ((pedantic
|| warn_pointer_arith
)
4997 && !TYPE_PTROB_P (argtype
))
4999 if (complain
& tf_error
)
5000 permerror (input_location
, (code
== PREINCREMENT_EXPR
5001 || code
== POSTINCREMENT_EXPR
)
5002 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
5003 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
5006 return error_mark_node
;
5009 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
5012 inc
= integer_one_node
;
5014 inc
= cp_convert (argtype
, inc
);
5016 /* Complain about anything else that is not a true lvalue. */
5017 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
5018 || code
== POSTINCREMENT_EXPR
)
5019 ? lv_increment
: lv_decrement
),
5021 return error_mark_node
;
5023 /* Forbid using -- on `bool'. */
5024 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
5026 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
5028 if (complain
& tf_error
)
5029 error ("invalid use of Boolean expression as operand "
5030 "to %<operator--%>");
5031 return error_mark_node
;
5033 val
= boolean_increment (code
, arg
);
5036 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
5038 TREE_SIDE_EFFECTS (val
) = 1;
5043 /* Note that this operation never does default_conversion
5044 regardless of NOCONVERT. */
5046 argtype
= lvalue_type (arg
);
5048 arg
= mark_lvalue_use (arg
);
5050 if (TREE_CODE (arg
) == OFFSET_REF
)
5053 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
5055 tree type
= build_pointer_type (TREE_TYPE (argtype
));
5056 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5059 else if (pedantic
&& DECL_MAIN_P (arg
))
5062 /* Apparently a lot of autoconf scripts for C++ packages do this,
5063 so only complain if -pedantic. */
5064 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
5065 pedwarn (input_location
, OPT_pedantic
,
5066 "ISO C++ forbids taking address of function %<::main%>");
5067 else if (flag_pedantic_errors
)
5068 return error_mark_node
;
5071 /* Let &* cancel out to simplify resulting code. */
5072 if (TREE_CODE (arg
) == INDIRECT_REF
)
5074 /* We don't need to have `current_class_ptr' wrapped in a
5075 NON_LVALUE_EXPR node. */
5076 if (arg
== current_class_ref
)
5077 return current_class_ptr
;
5079 arg
= TREE_OPERAND (arg
, 0);
5080 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
5082 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
5083 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5086 /* Don't let this be an lvalue. */
5091 /* ??? Cope with user tricks that amount to offsetof. */
5092 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5093 && TREE_CODE (argtype
) != METHOD_TYPE
5094 && argtype
!= unknown_type_node
5095 && (val
= get_base_address (arg
))
5096 && TREE_CODE (val
) == INDIRECT_REF
5097 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
5099 tree type
= build_pointer_type (argtype
);
5100 tree op0
= fold_convert (type
, TREE_OPERAND (val
, 0));
5101 tree op1
= fold_convert (sizetype
, fold_offsetof (arg
, val
));
5102 return fold_build2 (POINTER_PLUS_EXPR
, type
, op0
, op1
);
5105 /* Uninstantiated types are all functions. Taking the
5106 address of a function is a no-op, so just return the
5109 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
5110 || !IDENTIFIER_OPNAME_P (arg
));
5112 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
5113 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
5115 /* They're trying to take the address of a unique non-static
5116 member function. This is ill-formed (except in MS-land),
5117 but let's try to DTRT.
5118 Note: We only handle unique functions here because we don't
5119 want to complain if there's a static overload; non-unique
5120 cases will be handled by instantiate_type. But we need to
5121 handle this case here to allow casts on the resulting PMF.
5122 We could defer this in non-MS mode, but it's easier to give
5123 a useful error here. */
5125 /* Inside constant member functions, the `this' pointer
5126 contains an extra const qualifier. TYPE_MAIN_VARIANT
5127 is used here to remove this const from the diagnostics
5128 and the created OFFSET_REF. */
5129 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
5130 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
5133 if (! flag_ms_extensions
)
5135 tree name
= DECL_NAME (fn
);
5136 if (!(complain
& tf_error
))
5137 return error_mark_node
;
5138 else if (current_class_type
5139 && TREE_OPERAND (arg
, 0) == current_class_ref
)
5140 /* An expression like &memfn. */
5141 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
5142 " or parenthesized non-static member function to form"
5143 " a pointer to member function. Say %<&%T::%D%>",
5146 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
5147 " function to form a pointer to member function."
5151 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
5155 if (type_unknown_p (arg
))
5156 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
5158 /* Handle complex lvalues (when permitted)
5159 by reduction to simpler cases. */
5160 val
= unary_complex_lvalue (code
, arg
);
5164 switch (TREE_CODE (arg
))
5168 case FIX_TRUNC_EXPR
:
5169 /* Even if we're not being pedantic, we cannot allow this
5170 extension when we're instantiating in a SFINAE
5172 if (! lvalue_p (arg
) && complain
== tf_none
)
5174 if (complain
& tf_error
)
5175 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
5177 return error_mark_node
;
5182 arg
= BASELINK_FUNCTIONS (arg
);
5186 arg
= OVL_CURRENT (arg
);
5190 /* Turn a reference to a non-static data member into a
5191 pointer-to-member. */
5196 if (!PTRMEM_OK_P (arg
))
5197 return cp_build_unary_op (code
, arg
, 0, complain
);
5199 t
= TREE_OPERAND (arg
, 1);
5200 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
5202 if (complain
& tf_error
)
5203 error ("cannot create pointer to reference member %qD", t
);
5204 return error_mark_node
;
5207 type
= build_ptrmem_type (context_for_name_lookup (t
),
5209 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
5217 /* Anything not already handled and not a true memory reference
5219 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5220 && TREE_CODE (argtype
) != METHOD_TYPE
5221 && TREE_CODE (arg
) != OFFSET_REF
5222 && !lvalue_or_else (arg
, lv_addressof
, complain
))
5223 return error_mark_node
;
5225 if (argtype
!= error_mark_node
)
5226 argtype
= build_pointer_type (argtype
);
5228 /* In a template, we are processing a non-dependent expression
5229 so we can just form an ADDR_EXPR with the correct type. */
5230 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
5232 val
= build_address (arg
);
5233 if (TREE_CODE (arg
) == OFFSET_REF
)
5234 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
5236 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
5238 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
5240 /* We can only get here with a single static member
5242 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
5243 && DECL_STATIC_FUNCTION_P (fn
));
5245 val
= build_address (fn
);
5246 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
5247 /* Do not lose object's side effects. */
5248 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
5249 TREE_OPERAND (arg
, 0), val
);
5251 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
5253 if (complain
& tf_error
)
5254 error ("attempt to take address of bit-field structure member %qD",
5255 TREE_OPERAND (arg
, 1));
5256 return error_mark_node
;
5260 tree object
= TREE_OPERAND (arg
, 0);
5261 tree field
= TREE_OPERAND (arg
, 1);
5262 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5263 (TREE_TYPE (object
), decl_type_context (field
)));
5264 val
= build_address (arg
);
5267 if (TREE_CODE (argtype
) == POINTER_TYPE
5268 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
5270 build_ptrmemfunc_type (argtype
);
5271 val
= build_ptrmemfunc (argtype
, val
, 0,
5273 tf_warning_or_error
);
5285 argtype
= TREE_TYPE (arg
);
5286 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5289 if (complain
& tf_error
)
5290 error ("%s", errstring
);
5291 return error_mark_node
;
5294 /* Hook for the c-common bits that build a unary op. */
5296 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5297 enum tree_code code
, tree xarg
, int noconvert
)
5299 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5302 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5303 for certain kinds of expressions which are not really lvalues
5304 but which we can accept as lvalues.
5306 If ARG is not a kind of expression we can handle, return
5310 unary_complex_lvalue (enum tree_code code
, tree arg
)
5312 /* Inside a template, making these kinds of adjustments is
5313 pointless; we are only concerned with the type of the
5315 if (processing_template_decl
)
5318 /* Handle (a, b) used as an "lvalue". */
5319 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5321 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5322 tf_warning_or_error
);
5323 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5324 TREE_OPERAND (arg
, 0), real_result
);
5327 /* Handle (a ? b : c) used as an "lvalue". */
5328 if (TREE_CODE (arg
) == COND_EXPR
5329 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5330 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5332 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5333 if (TREE_CODE (arg
) == MODIFY_EXPR
5334 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5335 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5337 tree lvalue
= TREE_OPERAND (arg
, 0);
5338 if (TREE_SIDE_EFFECTS (lvalue
))
5340 lvalue
= stabilize_reference (lvalue
);
5341 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5342 lvalue
, TREE_OPERAND (arg
, 1));
5344 return unary_complex_lvalue
5345 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5348 if (code
!= ADDR_EXPR
)
5351 /* Handle (a = b) used as an "lvalue" for `&'. */
5352 if (TREE_CODE (arg
) == MODIFY_EXPR
5353 || TREE_CODE (arg
) == INIT_EXPR
)
5355 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5356 tf_warning_or_error
);
5357 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5359 TREE_NO_WARNING (arg
) = 1;
5363 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5364 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5365 || TREE_CODE (arg
) == OFFSET_REF
)
5368 /* We permit compiler to make function calls returning
5369 objects of aggregate type look like lvalues. */
5373 if (TREE_CODE (targ
) == SAVE_EXPR
)
5374 targ
= TREE_OPERAND (targ
, 0);
5376 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5378 if (TREE_CODE (arg
) == SAVE_EXPR
)
5381 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
5382 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5385 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5386 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5387 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5390 /* Don't let anything else be handled specially. */
5394 /* Mark EXP saying that we need to be able to take the
5395 address of it; it should not be allocated in a register.
5396 Value is true if successful.
5398 C++: we do not allow `current_class_ptr' to be addressable. */
5401 cxx_mark_addressable (tree exp
)
5406 switch (TREE_CODE (x
))
5413 x
= TREE_OPERAND (x
, 0);
5417 if (x
== current_class_ptr
)
5419 error ("cannot take the address of %<this%>, which is an rvalue expression");
5420 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5426 /* Caller should not be trying to mark initialized
5427 constant fields addressable. */
5428 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5429 || DECL_IN_AGGR_P (x
) == 0
5431 || DECL_EXTERNAL (x
));
5436 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5437 && !DECL_ARTIFICIAL (x
))
5439 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5442 ("address of explicit register variable %qD requested", x
);
5445 else if (extra_warnings
)
5447 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5449 TREE_ADDRESSABLE (x
) = 1;
5453 TREE_ADDRESSABLE (x
) = 1;
5457 TREE_ADDRESSABLE (x
) = 1;
5461 TREE_ADDRESSABLE (x
) = 1;
5462 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5470 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5473 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5474 tsubst_flags_t complain
)
5476 tree orig_ifexp
= ifexp
;
5477 tree orig_op1
= op1
;
5478 tree orig_op2
= op2
;
5481 if (processing_template_decl
)
5483 /* The standard says that the expression is type-dependent if
5484 IFEXP is type-dependent, even though the eventual type of the
5485 expression doesn't dependent on IFEXP. */
5486 if (type_dependent_expression_p (ifexp
)
5487 /* As a GNU extension, the middle operand may be omitted. */
5488 || (op1
&& type_dependent_expression_p (op1
))
5489 || type_dependent_expression_p (op2
))
5490 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5491 ifexp
= build_non_dependent_expr (ifexp
);
5493 op1
= build_non_dependent_expr (op1
);
5494 op2
= build_non_dependent_expr (op2
);
5497 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5498 if (processing_template_decl
&& expr
!= error_mark_node
)
5499 return build_min_non_dep (COND_EXPR
, expr
,
5500 orig_ifexp
, orig_op1
, orig_op2
);
5504 /* Given a list of expressions, return a compound expression
5505 that performs them all and returns the value of the last of them. */
5508 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
,
5509 tsubst_flags_t complain
)
5511 tree expr
= TREE_VALUE (list
);
5513 if (TREE_CHAIN (list
))
5515 if (complain
& tf_error
)
5519 permerror (input_location
, "expression list treated as compound "
5520 "expression in initializer");
5523 permerror (input_location
, "expression list treated as compound "
5524 "expression in mem-initializer");
5527 permerror (input_location
, "expression list treated as compound "
5528 "expression in functional cast");
5534 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5535 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5542 /* Like build_x_compound_expr_from_list, but using a VEC. */
5545 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5547 if (VEC_empty (tree
, vec
))
5549 else if (VEC_length (tree
, vec
) == 1)
5550 return VEC_index (tree
, vec
, 0);
5558 permerror (input_location
,
5559 "%s expression list treated as compound expression",
5562 expr
= VEC_index (tree
, vec
, 0);
5563 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5564 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5570 /* Handle overloading of the ',' operator when needed. */
5573 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5576 tree orig_op1
= op1
;
5577 tree orig_op2
= op2
;
5579 if (processing_template_decl
)
5581 if (type_dependent_expression_p (op1
)
5582 || type_dependent_expression_p (op2
))
5583 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5584 op1
= build_non_dependent_expr (op1
);
5585 op2
= build_non_dependent_expr (op2
);
5588 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5589 /*overloaded_p=*/NULL
, complain
);
5591 result
= cp_build_compound_expr (op1
, op2
, complain
);
5593 if (processing_template_decl
&& result
!= error_mark_node
)
5594 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5599 /* Like cp_build_compound_expr, but for the c-common bits. */
5602 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5604 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5607 /* Build a compound expression. */
5610 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5612 lhs
= convert_to_void (lhs
, ICV_LEFT_OF_COMMA
, complain
);
5614 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5615 return error_mark_node
;
5617 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5619 /* If the rhs is a TARGET_EXPR, then build the compound
5620 expression inside the target_expr's initializer. This
5621 helps the compiler to eliminate unnecessary temporaries. */
5622 tree init
= TREE_OPERAND (rhs
, 1);
5624 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5625 TREE_OPERAND (rhs
, 1) = init
;
5630 if (type_unknown_p (rhs
))
5632 error ("no context to resolve type of %qE", rhs
);
5633 return error_mark_node
;
5636 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5639 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5640 casts away constness. CAST gives the type of cast.
5642 ??? This function warns for casting away any qualifier not just
5643 const. We would like to specify exactly what qualifiers are casted
5648 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5649 enum tree_code cast
)
5651 /* C-style casts are allowed to cast away constness. With
5652 WARN_CAST_QUAL, we still want to issue a warning. */
5653 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5656 if (!casts_away_constness (src_type
, dest_type
))
5662 warning (OPT_Wcast_qual
,
5663 "cast from type %qT to type %qT casts away qualifiers",
5664 src_type
, dest_type
);
5667 case STATIC_CAST_EXPR
:
5668 error ("static_cast from type %qT to type %qT casts away qualifiers",
5669 src_type
, dest_type
);
5672 case REINTERPRET_CAST_EXPR
:
5673 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5674 src_type
, dest_type
);
5681 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5682 (another pointer-to-member type in the same hierarchy) and return
5683 the converted expression. If ALLOW_INVERSE_P is permitted, a
5684 pointer-to-derived may be converted to pointer-to-base; otherwise,
5685 only the other direction is permitted. If C_CAST_P is true, this
5686 conversion is taking place as part of a C-style cast. */
5689 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5690 bool c_cast_p
, tsubst_flags_t complain
)
5692 if (TYPE_PTRMEM_P (type
))
5696 if (TREE_CODE (expr
) == PTRMEM_CST
)
5697 expr
= cplus_expand_constant (expr
);
5698 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5699 TYPE_PTRMEM_CLASS_TYPE (type
),
5701 c_cast_p
, complain
);
5702 if (delta
== error_mark_node
)
5703 return error_mark_node
;
5705 if (!integer_zerop (delta
))
5707 tree cond
, op1
, op2
;
5709 cond
= cp_build_binary_op (input_location
,
5712 build_int_cst (TREE_TYPE (expr
), -1),
5713 tf_warning_or_error
);
5714 op1
= build_nop (ptrdiff_type_node
, expr
);
5715 op2
= cp_build_binary_op (input_location
,
5716 PLUS_EXPR
, op1
, delta
,
5717 tf_warning_or_error
);
5719 expr
= fold_build3_loc (input_location
,
5720 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5724 return build_nop (type
, expr
);
5727 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5728 allow_inverse_p
, c_cast_p
, complain
);
5731 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
5732 a version of EXPR that has TREE_OVERFLOW set if it is set in ORIG.
5733 Otherwise, return EXPR unchanged. */
5736 ignore_overflows (tree expr
, tree orig
)
5738 if (TREE_CODE (expr
) == INTEGER_CST
5739 && CONSTANT_CLASS_P (orig
)
5740 && TREE_CODE (orig
) != STRING_CST
5741 && TREE_OVERFLOW (expr
) != TREE_OVERFLOW (orig
))
5743 if (!TREE_OVERFLOW (orig
))
5744 /* Ensure constant sharing. */
5745 expr
= build_int_cst_wide (TREE_TYPE (expr
),
5746 TREE_INT_CST_LOW (expr
),
5747 TREE_INT_CST_HIGH (expr
));
5750 /* Avoid clobbering a shared constant. */
5751 expr
= copy_node (expr
);
5752 TREE_OVERFLOW (expr
) = TREE_OVERFLOW (orig
);
5758 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5759 this static_cast is being attempted as one of the possible casts
5760 allowed by a C-style cast. (In that case, accessibility of base
5761 classes is not considered, and it is OK to cast away
5762 constness.) Return the result of the cast. *VALID_P is set to
5763 indicate whether or not the cast was valid. */
5766 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5767 bool *valid_p
, tsubst_flags_t complain
)
5773 /* Assume the cast is valid. */
5776 intype
= TREE_TYPE (expr
);
5778 /* Save casted types in the function's used types hash table. */
5779 used_types_insert (type
);
5781 /* [expr.static.cast]
5783 An lvalue of type "cv1 B", where B is a class type, can be cast
5784 to type "reference to cv2 D", where D is a class derived (clause
5785 _class.derived_) from B, if a valid standard conversion from
5786 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5787 same cv-qualification as, or greater cv-qualification than, cv1,
5788 and B is not a virtual base class of D. */
5789 /* We check this case before checking the validity of "TYPE t =
5790 EXPR;" below because for this case:
5793 struct D : public B { D(const B&); };
5795 void f() { static_cast<const D&>(b); }
5797 we want to avoid constructing a new D. The standard is not
5798 completely clear about this issue, but our interpretation is
5799 consistent with other compilers. */
5800 if (TREE_CODE (type
) == REFERENCE_TYPE
5801 && CLASS_TYPE_P (TREE_TYPE (type
))
5802 && CLASS_TYPE_P (intype
)
5803 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5804 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5805 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5806 build_pointer_type (TYPE_MAIN_VARIANT
5807 (TREE_TYPE (type
))))
5809 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5813 /* There is a standard conversion from "D*" to "B*" even if "B"
5814 is ambiguous or inaccessible. If this is really a
5815 static_cast, then we check both for inaccessibility and
5816 ambiguity. However, if this is a static_cast being performed
5817 because the user wrote a C-style cast, then accessibility is
5819 base
= lookup_base (TREE_TYPE (type
), intype
,
5820 c_cast_p
? ba_unique
: ba_check
,
5823 /* Convert from "B*" to "D*". This function will check that "B"
5824 is not a virtual base of "D". */
5825 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5826 base
, /*nonnull=*/false);
5827 /* Convert the pointer to a reference -- but then remember that
5828 there are no expressions with reference type in C++. */
5829 return convert_from_reference (cp_fold_convert (type
, expr
));
5832 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5833 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5834 if (TREE_CODE (type
) == REFERENCE_TYPE
5835 && TYPE_REF_IS_RVALUE (type
)
5836 && real_lvalue_p (expr
)
5837 && reference_related_p (TREE_TYPE (type
), intype
)
5838 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5840 expr
= build_typed_address (expr
, type
);
5841 return convert_from_reference (expr
);
5846 /* Resolve overloaded address here rather than once in
5847 implicit_conversion and again in the inverse code below. */
5848 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5850 expr
= instantiate_type (type
, expr
, complain
);
5851 intype
= TREE_TYPE (expr
);
5854 /* [expr.static.cast]
5856 An expression e can be explicitly converted to a type T using a
5857 static_cast of the form static_cast<T>(e) if the declaration T
5858 t(e);" is well-formed, for some invented temporary variable
5860 result
= perform_direct_initialization_if_possible (type
, expr
,
5861 c_cast_p
, complain
);
5864 result
= convert_from_reference (result
);
5866 /* Ignore any integer overflow caused by the cast. */
5867 result
= ignore_overflows (result
, orig
);
5869 /* [expr.static.cast]
5871 If T is a reference type, the result is an lvalue; otherwise,
5872 the result is an rvalue. */
5873 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5874 result
= rvalue (result
);
5878 /* [expr.static.cast]
5880 Any expression can be explicitly converted to type cv void. */
5881 if (TREE_CODE (type
) == VOID_TYPE
)
5882 return convert_to_void (expr
, ICV_CAST
, complain
);
5884 /* [expr.static.cast]
5886 The inverse of any standard conversion sequence (clause _conv_),
5887 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5888 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5889 (_conv.bool_) conversions, can be performed explicitly using
5890 static_cast subject to the restriction that the explicit
5891 conversion does not cast away constness (_expr.const.cast_), and
5892 the following additional rules for specific cases: */
5893 /* For reference, the conversions not excluded are: integral
5894 promotions, floating point promotion, integral conversions,
5895 floating point conversions, floating-integral conversions,
5896 pointer conversions, and pointer to member conversions. */
5899 A value of integral _or enumeration_ type can be explicitly
5900 converted to an enumeration type. */
5901 /* The effect of all that is that any conversion between any two
5902 types which are integral, floating, or enumeration types can be
5904 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5905 || SCALAR_FLOAT_TYPE_P (type
))
5906 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5907 || SCALAR_FLOAT_TYPE_P (intype
)))
5909 expr
= ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5911 /* Ignore any integer overflow caused by the cast. */
5912 expr
= ignore_overflows (expr
, orig
);
5916 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5917 && CLASS_TYPE_P (TREE_TYPE (type
))
5918 && CLASS_TYPE_P (TREE_TYPE (intype
))
5919 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5920 (TREE_TYPE (intype
))),
5921 build_pointer_type (TYPE_MAIN_VARIANT
5922 (TREE_TYPE (type
)))))
5927 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5928 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
5929 c_cast_p
? ba_unique
: ba_check
,
5931 return build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
5934 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5935 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5942 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
5943 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
5945 if (TYPE_PTRMEM_P (type
))
5947 t1
= (build_ptrmem_type
5949 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
5950 t2
= (build_ptrmem_type
5952 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
5959 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
5962 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5963 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
5964 c_cast_p
, tf_warning_or_error
);
5968 /* [expr.static.cast]
5970 An rvalue of type "pointer to cv void" can be explicitly
5971 converted to a pointer to object type. A value of type pointer
5972 to object converted to "pointer to cv void" and back to the
5973 original pointer type will have its original value. */
5974 if (TREE_CODE (intype
) == POINTER_TYPE
5975 && VOID_TYPE_P (TREE_TYPE (intype
))
5976 && TYPE_PTROB_P (type
))
5979 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5980 return build_nop (type
, expr
);
5984 return error_mark_node
;
5987 /* Return an expression representing static_cast<TYPE>(EXPR). */
5990 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5995 if (type
== error_mark_node
|| expr
== error_mark_node
)
5996 return error_mark_node
;
5998 if (processing_template_decl
)
6000 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
6001 /* We don't know if it will or will not have side effects. */
6002 TREE_SIDE_EFFECTS (expr
) = 1;
6003 return convert_from_reference (expr
);
6006 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6007 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6008 if (TREE_CODE (type
) != REFERENCE_TYPE
6009 && TREE_CODE (expr
) == NOP_EXPR
6010 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6011 expr
= TREE_OPERAND (expr
, 0);
6013 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
6018 if (complain
& tf_error
)
6019 error ("invalid static_cast from type %qT to type %qT",
6020 TREE_TYPE (expr
), type
);
6021 return error_mark_node
;
6024 /* EXPR is an expression with member function or pointer-to-member
6025 function type. TYPE is a pointer type. Converting EXPR to TYPE is
6026 not permitted by ISO C++, but we accept it in some modes. If we
6027 are not in one of those modes, issue a diagnostic. Return the
6028 converted expression. */
6031 convert_member_func_to_ptr (tree type
, tree expr
)
6036 intype
= TREE_TYPE (expr
);
6037 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
6038 || TREE_CODE (intype
) == METHOD_TYPE
);
6040 if (pedantic
|| warn_pmf2ptr
)
6041 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
6042 "converting from %qT to %qT", intype
, type
);
6044 if (TREE_CODE (intype
) == METHOD_TYPE
)
6045 expr
= build_addr_func (expr
);
6046 else if (TREE_CODE (expr
) == PTRMEM_CST
)
6047 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
6050 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
6051 decl
= build_address (decl
);
6052 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
6055 return build_nop (type
, expr
);
6058 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
6059 If C_CAST_P is true, this reinterpret cast is being done as part of
6060 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
6061 indicate whether or not reinterpret_cast was valid. */
6064 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6065 bool *valid_p
, tsubst_flags_t complain
)
6069 /* Assume the cast is invalid. */
6073 if (type
== error_mark_node
|| error_operand_p (expr
))
6074 return error_mark_node
;
6076 intype
= TREE_TYPE (expr
);
6078 /* Save casted types in the function's used types hash table. */
6079 used_types_insert (type
);
6081 /* [expr.reinterpret.cast]
6082 An lvalue expression of type T1 can be cast to the type
6083 "reference to T2" if an expression of type "pointer to T1" can be
6084 explicitly converted to the type "pointer to T2" using a
6085 reinterpret_cast. */
6086 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6088 if (! real_lvalue_p (expr
))
6090 if (complain
& tf_error
)
6091 error ("invalid cast of an rvalue expression of type "
6094 return error_mark_node
;
6097 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6098 "B" are related class types; the reinterpret_cast does not
6099 adjust the pointer. */
6100 if (TYPE_PTR_P (intype
)
6101 && (complain
& tf_warning
)
6102 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
6103 COMPARE_BASE
| COMPARE_DERIVED
)))
6104 warning (0, "casting %qT to %qT does not dereference pointer",
6107 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0, complain
);
6109 if (warn_strict_aliasing
> 2)
6110 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
6112 if (expr
!= error_mark_node
)
6113 expr
= build_reinterpret_cast_1
6114 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
6116 if (expr
!= error_mark_node
)
6117 /* cp_build_indirect_ref isn't right for rvalue refs. */
6118 expr
= convert_from_reference (fold_convert (type
, expr
));
6122 /* As a G++ extension, we consider conversions from member
6123 functions, and pointers to member functions to
6124 pointer-to-function and pointer-to-void types. If
6125 -Wno-pmf-conversions has not been specified,
6126 convert_member_func_to_ptr will issue an error message. */
6127 if ((TYPE_PTRMEMFUNC_P (intype
)
6128 || TREE_CODE (intype
) == METHOD_TYPE
)
6129 && TYPE_PTR_P (type
)
6130 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6131 || VOID_TYPE_P (TREE_TYPE (type
))))
6132 return convert_member_func_to_ptr (type
, expr
);
6134 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6135 array-to-pointer, and function-to-pointer conversions are
6137 expr
= decay_conversion (expr
);
6139 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6140 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6141 if (TREE_CODE (expr
) == NOP_EXPR
6142 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6143 expr
= TREE_OPERAND (expr
, 0);
6145 if (error_operand_p (expr
))
6146 return error_mark_node
;
6148 intype
= TREE_TYPE (expr
);
6150 /* [expr.reinterpret.cast]
6151 A pointer can be converted to any integral type large enough to
6152 hold it. ... A value of type std::nullptr_t can be converted to
6153 an integral type; the conversion has the same meaning and
6154 validity as a conversion of (void*)0 to the integral type. */
6155 if (CP_INTEGRAL_TYPE_P (type
)
6156 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
6158 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
6160 if (complain
& tf_error
)
6161 permerror (input_location
, "cast from %qT to %qT loses precision",
6164 return error_mark_node
;
6166 if (NULLPTR_TYPE_P (intype
))
6167 return build_int_cst (type
, 0);
6169 /* [expr.reinterpret.cast]
6170 A value of integral or enumeration type can be explicitly
6171 converted to a pointer. */
6172 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6175 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6176 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6177 return fold_if_not_in_template (build_nop (type
, expr
));
6178 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6179 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6184 check_for_casting_away_constness (intype
, type
, REINTERPRET_CAST_EXPR
);
6185 /* Warn about possible alignment problems. */
6186 if (STRICT_ALIGNMENT
&& warn_cast_align
6187 && (complain
& tf_warning
)
6188 && !VOID_TYPE_P (type
)
6189 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6190 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6191 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6192 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6193 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6194 "increases required alignment of target type", intype
, type
);
6196 /* We need to strip nops here, because the front end likes to
6197 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6199 if (warn_strict_aliasing
<= 2)
6200 strict_aliasing_warning (intype
, type
, sexpr
);
6202 return fold_if_not_in_template (build_nop (type
, expr
));
6204 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6205 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6207 if (pedantic
&& (complain
& tf_warning
))
6208 /* Only issue a warning, as we have always supported this
6209 where possible, and it is necessary in some cases. DR 195
6210 addresses this issue, but as of 2004/10/26 is still in
6212 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6213 return fold_if_not_in_template (build_nop (type
, expr
));
6215 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6216 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6217 else if (TREE_CODE (intype
) == VECTOR_TYPE
6218 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6219 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6224 if (complain
& tf_error
)
6225 error ("invalid cast from type %qT to type %qT", intype
, type
);
6226 return error_mark_node
;
6229 return cp_convert (type
, expr
);
6233 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6235 if (type
== error_mark_node
|| expr
== error_mark_node
)
6236 return error_mark_node
;
6238 if (processing_template_decl
)
6240 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6242 if (!TREE_SIDE_EFFECTS (t
)
6243 && type_dependent_expression_p (expr
))
6244 /* There might turn out to be side effects inside expr. */
6245 TREE_SIDE_EFFECTS (t
) = 1;
6246 return convert_from_reference (t
);
6249 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6250 /*valid_p=*/NULL
, complain
);
6253 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6254 return an appropriate expression. Otherwise, return
6255 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6256 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6257 performing a C-style cast, its value upon return will indicate
6258 whether or not the conversion succeeded. */
6261 build_const_cast_1 (tree dst_type
, tree expr
, bool complain
,
6265 tree reference_type
;
6267 /* Callers are responsible for handling error_mark_node as a
6268 destination type. */
6269 gcc_assert (dst_type
!= error_mark_node
);
6270 /* In a template, callers should be building syntactic
6271 representations of casts, not using this machinery. */
6272 gcc_assert (!processing_template_decl
);
6274 /* Assume the conversion is invalid. */
6278 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6281 error ("invalid use of const_cast with type %qT, "
6282 "which is not a pointer, "
6283 "reference, nor a pointer-to-data-member type", dst_type
);
6284 return error_mark_node
;
6287 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6290 error ("invalid use of const_cast with type %qT, which is a pointer "
6291 "or reference to a function type", dst_type
);
6292 return error_mark_node
;
6295 /* Save casted types in the function's used types hash table. */
6296 used_types_insert (dst_type
);
6298 src_type
= TREE_TYPE (expr
);
6299 /* Expressions do not really have reference types. */
6300 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6301 src_type
= TREE_TYPE (src_type
);
6303 /* [expr.const.cast]
6305 An lvalue of type T1 can be explicitly converted to an lvalue of
6306 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6307 types) if a pointer to T1 can be explicitly converted to the type
6308 pointer to T2 using a const_cast. */
6309 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6311 reference_type
= dst_type
;
6312 if (! real_lvalue_p (expr
))
6315 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6316 src_type
, dst_type
);
6317 return error_mark_node
;
6319 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6320 src_type
= build_pointer_type (src_type
);
6324 reference_type
= NULL_TREE
;
6325 /* If the destination type is not a reference type, the
6326 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6327 conversions are performed. */
6328 src_type
= type_decays_to (src_type
);
6329 if (src_type
== error_mark_node
)
6330 return error_mark_node
;
6333 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6334 && comp_ptr_ttypes_const (dst_type
, src_type
))
6339 /* This cast is actually a C-style cast. Issue a warning if
6340 the user is making a potentially unsafe cast. */
6341 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
);
6345 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0,
6346 complain
? tf_warning_or_error
: tf_none
);
6347 expr
= build_nop (reference_type
, expr
);
6348 return convert_from_reference (expr
);
6352 expr
= decay_conversion (expr
);
6353 /* build_c_cast puts on a NOP_EXPR to make the result not an
6354 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6355 non-lvalue context. */
6356 if (TREE_CODE (expr
) == NOP_EXPR
6357 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6358 expr
= TREE_OPERAND (expr
, 0);
6359 return build_nop (dst_type
, expr
);
6364 error ("invalid const_cast from type %qT to type %qT",
6365 src_type
, dst_type
);
6366 return error_mark_node
;
6370 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6372 if (type
== error_mark_node
|| error_operand_p (expr
))
6373 return error_mark_node
;
6375 if (processing_template_decl
)
6377 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6379 if (!TREE_SIDE_EFFECTS (t
)
6380 && type_dependent_expression_p (expr
))
6381 /* There might turn out to be side effects inside expr. */
6382 TREE_SIDE_EFFECTS (t
) = 1;
6383 return convert_from_reference (t
);
6386 return build_const_cast_1 (type
, expr
, complain
& tf_error
,
6390 /* Like cp_build_c_cast, but for the c-common bits. */
6393 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6395 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6398 /* Build an expression representing an explicit C-style cast to type
6399 TYPE of expression EXPR. */
6402 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6408 if (type
== error_mark_node
|| error_operand_p (expr
))
6409 return error_mark_node
;
6411 if (processing_template_decl
)
6413 tree t
= build_min (CAST_EXPR
, type
,
6414 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6415 /* We don't know if it will or will not have side effects. */
6416 TREE_SIDE_EFFECTS (t
) = 1;
6417 return convert_from_reference (t
);
6420 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6421 'Class') should always be retained, because this information aids
6422 in method lookup. */
6423 if (objc_is_object_ptr (type
)
6424 && objc_is_object_ptr (TREE_TYPE (expr
)))
6425 return build_nop (type
, expr
);
6427 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6428 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6429 if (TREE_CODE (type
) != REFERENCE_TYPE
6430 && TREE_CODE (value
) == NOP_EXPR
6431 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6432 value
= TREE_OPERAND (value
, 0);
6434 if (TREE_CODE (type
) == ARRAY_TYPE
)
6436 /* Allow casting from T1* to T2[] because Cfront allows it.
6437 NIHCL uses it. It is not valid ISO C++ however. */
6438 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6440 if (complain
& tf_error
)
6441 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6443 return error_mark_node
;
6444 type
= build_pointer_type (TREE_TYPE (type
));
6448 if (complain
& tf_error
)
6449 error ("ISO C++ forbids casting to an array type %qT", type
);
6450 return error_mark_node
;
6454 if (TREE_CODE (type
) == FUNCTION_TYPE
6455 || TREE_CODE (type
) == METHOD_TYPE
)
6457 if (complain
& tf_error
)
6458 error ("invalid cast to function type %qT", type
);
6459 return error_mark_node
;
6462 if (TREE_CODE (type
) == POINTER_TYPE
6463 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
6464 /* Casting to an integer of smaller size is an error detected elsewhere. */
6465 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
6466 /* Don't warn about converting any constant. */
6467 && !TREE_CONSTANT (value
))
6468 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
6469 "cast to pointer from integer of different size");
6471 /* A C-style cast can be a const_cast. */
6472 result
= build_const_cast_1 (type
, value
, /*complain=*/false,
6477 /* Or a static cast. */
6478 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6479 &valid_p
, complain
);
6480 /* Or a reinterpret_cast. */
6482 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6483 &valid_p
, complain
);
6484 /* The static_cast or reinterpret_cast may be followed by a
6487 /* A valid cast may result in errors if, for example, a
6488 conversion to am ambiguous base class is required. */
6489 && !error_operand_p (result
))
6493 /* Non-class rvalues always have cv-unqualified type. */
6494 if (!CLASS_TYPE_P (type
))
6495 type
= TYPE_MAIN_VARIANT (type
);
6496 result_type
= TREE_TYPE (result
);
6497 if (!CLASS_TYPE_P (result_type
))
6498 result_type
= TYPE_MAIN_VARIANT (result_type
);
6499 /* If the type of RESULT does not match TYPE, perform a
6500 const_cast to make it match. If the static_cast or
6501 reinterpret_cast succeeded, we will differ by at most
6502 cv-qualification, so the follow-on const_cast is guaranteed
6504 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6506 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6507 gcc_assert (valid_p
);
6512 return error_mark_node
;
6515 /* For use from the C common bits. */
6517 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6518 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6519 enum tree_code modifycode
,
6520 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6521 tree rhs_origtype ATTRIBUTE_UNUSED
)
6523 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6526 /* Build an assignment expression of lvalue LHS from value RHS.
6527 MODIFYCODE is the code for a binary operator that we use
6528 to combine the old value of LHS with RHS to get the new value.
6529 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6531 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6534 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6535 tsubst_flags_t complain
)
6539 tree lhstype
= TREE_TYPE (lhs
);
6540 tree olhstype
= lhstype
;
6541 bool plain_assign
= (modifycode
== NOP_EXPR
);
6543 /* Avoid duplicate error messages from operands that had errors. */
6544 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6545 return error_mark_node
;
6547 /* Handle control structure constructs used as "lvalues". */
6548 switch (TREE_CODE (lhs
))
6550 /* Handle --foo = 5; as these are valid constructs in C++. */
6551 case PREDECREMENT_EXPR
:
6552 case PREINCREMENT_EXPR
:
6553 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6554 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6555 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6556 TREE_OPERAND (lhs
, 1));
6557 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6558 modifycode
, rhs
, complain
);
6559 if (newrhs
== error_mark_node
)
6560 return error_mark_node
;
6561 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6563 /* Handle (a, b) used as an "lvalue". */
6565 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6566 modifycode
, rhs
, complain
);
6567 if (newrhs
== error_mark_node
)
6568 return error_mark_node
;
6569 return build2 (COMPOUND_EXPR
, lhstype
,
6570 TREE_OPERAND (lhs
, 0), newrhs
);
6573 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6574 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6575 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6576 TREE_OPERAND (lhs
, 1));
6577 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6579 if (newrhs
== error_mark_node
)
6580 return error_mark_node
;
6581 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6585 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6586 when neither operand has side-effects. */
6587 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6588 return error_mark_node
;
6590 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6591 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6593 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6594 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6596 TREE_OPERAND (lhs
, 0),
6597 TREE_OPERAND (lhs
, 1)),
6598 TREE_OPERAND (lhs
, 0),
6599 TREE_OPERAND (lhs
, 1));
6602 /* Handle (a ? b : c) used as an "lvalue". */
6605 /* Produce (a ? (b = rhs) : (c = rhs))
6606 except that the RHS goes through a save-expr
6607 so the code to compute it is only emitted once. */
6609 tree preeval
= NULL_TREE
;
6611 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6613 if (complain
& tf_error
)
6614 error ("void value not ignored as it ought to be");
6615 return error_mark_node
;
6618 rhs
= stabilize_expr (rhs
, &preeval
);
6620 /* Check this here to avoid odd errors when trying to convert
6621 a throw to the type of the COND_EXPR. */
6622 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6623 return error_mark_node
;
6625 cond
= build_conditional_expr
6626 (TREE_OPERAND (lhs
, 0),
6627 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6628 modifycode
, rhs
, complain
),
6629 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6630 modifycode
, rhs
, complain
),
6633 if (cond
== error_mark_node
)
6635 /* Make sure the code to compute the rhs comes out
6636 before the split. */
6638 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6646 if (modifycode
== INIT_EXPR
)
6648 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6649 /* Do the default thing. */;
6650 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6652 /* Compound literal. */
6653 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6654 /* Call convert to generate an error; see PR 11063. */
6655 rhs
= convert (lhstype
, rhs
);
6656 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6657 TREE_SIDE_EFFECTS (result
) = 1;
6660 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6661 /* Do the default thing. */;
6664 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6665 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6666 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6668 release_tree_vector (rhs_vec
);
6669 if (result
== NULL_TREE
)
6670 return error_mark_node
;
6676 lhs
= require_complete_type (lhs
);
6677 if (lhs
== error_mark_node
)
6678 return error_mark_node
;
6680 if (modifycode
== NOP_EXPR
)
6682 /* `operator=' is not an inheritable operator. */
6683 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6684 /* Do the default thing. */;
6687 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6688 lhs
, rhs
, make_node (NOP_EXPR
),
6689 /*overloaded_p=*/NULL
,
6691 if (result
== NULL_TREE
)
6692 return error_mark_node
;
6699 /* A binary op has been requested. Combine the old LHS
6700 value with the RHS producing the value we should actually
6701 store into the LHS. */
6702 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6703 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6704 || MAYBE_CLASS_TYPE_P (lhstype
)));
6706 lhs
= stabilize_reference (lhs
);
6707 newrhs
= cp_build_binary_op (input_location
,
6708 modifycode
, lhs
, rhs
,
6710 if (newrhs
== error_mark_node
)
6712 if (complain
& tf_error
)
6713 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6714 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6715 return error_mark_node
;
6718 /* Now it looks like a plain assignment. */
6719 modifycode
= NOP_EXPR
;
6721 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6722 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6725 /* The left-hand side must be an lvalue. */
6726 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6727 return error_mark_node
;
6729 /* Warn about modifying something that is `const'. Don't warn if
6730 this is initialization. */
6731 if (modifycode
!= INIT_EXPR
6732 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6733 /* Functions are not modifiable, even though they are
6735 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6736 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6737 /* If it's an aggregate and any field is const, then it is
6738 effectively const. */
6739 || (CLASS_TYPE_P (lhstype
)
6740 && C_TYPE_FIELDS_READONLY (lhstype
))))
6742 if (complain
& tf_error
)
6743 readonly_error (lhs
, REK_ASSIGNMENT
);
6745 return error_mark_node
;
6748 /* If storing into a structure or union member, it may have been given a
6749 lowered bitfield type. We need to convert to the declared type first,
6750 so retrieve it now. */
6752 olhstype
= unlowered_expr_type (lhs
);
6754 /* Convert new value to destination type. */
6756 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6760 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6762 if (modifycode
!= INIT_EXPR
)
6764 if (complain
& tf_error
)
6765 error ("assigning to an array from an initializer list");
6766 return error_mark_node
;
6768 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6769 return error_mark_node
;
6770 newrhs
= digest_init (lhstype
, newrhs
);
6773 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6774 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6776 if (complain
& tf_error
)
6777 error ("incompatible types in assignment of %qT to %qT",
6778 TREE_TYPE (rhs
), lhstype
);
6779 return error_mark_node
;
6782 /* Allow array assignment in compiler-generated code. */
6783 else if (!current_function_decl
6784 || !DECL_ARTIFICIAL (current_function_decl
))
6786 /* This routine is used for both initialization and assignment.
6787 Make sure the diagnostic message differentiates the context. */
6788 if (complain
& tf_error
)
6790 if (modifycode
== INIT_EXPR
)
6791 error ("array used as initializer");
6793 error ("invalid array assignment");
6795 return error_mark_node
;
6798 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6799 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6800 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6801 /*explicit_value_init_p=*/false,
6802 from_array
, complain
);
6805 if (modifycode
== INIT_EXPR
)
6806 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6807 LOOKUP_ONLYCONVERTING. */
6808 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6809 ICR_INIT
, NULL_TREE
, 0,
6812 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
6813 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6815 if (!same_type_p (lhstype
, olhstype
))
6816 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6818 if (modifycode
!= INIT_EXPR
)
6820 if (TREE_CODE (newrhs
) == CALL_EXPR
6821 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6822 newrhs
= build_cplus_new (lhstype
, newrhs
);
6824 /* Can't initialize directly from a TARGET_EXPR, since that would
6825 cause the lhs to be constructed twice, and possibly result in
6826 accidental self-initialization. So we force the TARGET_EXPR to be
6827 expanded without a target. */
6828 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6829 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6830 TREE_OPERAND (newrhs
, 0));
6833 if (newrhs
== error_mark_node
)
6834 return error_mark_node
;
6836 if (c_dialect_objc () && flag_objc_gc
)
6838 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6844 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6845 lhstype
, lhs
, newrhs
);
6847 TREE_SIDE_EFFECTS (result
) = 1;
6849 TREE_NO_WARNING (result
) = 1;
6855 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6856 tsubst_flags_t complain
)
6858 if (processing_template_decl
)
6859 return build_min_nt (MODOP_EXPR
, lhs
,
6860 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6862 if (modifycode
!= NOP_EXPR
)
6864 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6865 make_node (modifycode
),
6866 /*overloaded_p=*/NULL
,
6870 TREE_NO_WARNING (rval
) = 1;
6874 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6877 /* Helper function for get_delta_difference which assumes FROM is a base
6878 class of TO. Returns a delta for the conversion of pointer-to-member
6879 of FROM to pointer-to-member of TO. If the conversion is invalid and
6880 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
6881 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6882 If C_CAST_P is true, this conversion is taking place as part of a
6886 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
,
6887 tsubst_flags_t complain
)
6891 base_access access
= c_cast_p
? ba_unique
: ba_check
;
6893 /* Note: ba_quiet does not distinguish between access control and
6895 if (!(complain
& tf_error
))
6898 binfo
= lookup_base (to
, from
, access
, &kind
);
6900 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6902 if (!(complain
& tf_error
))
6903 return error_mark_node
;
6905 error (" in pointer to member function conversion");
6906 return size_zero_node
;
6910 if (kind
!= bk_via_virtual
)
6911 return BINFO_OFFSET (binfo
);
6913 /* FROM is a virtual base class of TO. Issue an error or warning
6914 depending on whether or not this is a reinterpret cast. */
6916 if (!(complain
& tf_error
))
6917 return error_mark_node
;
6919 error ("pointer to member conversion via virtual base %qT",
6920 BINFO_TYPE (binfo_from_vbase (binfo
)));
6922 return size_zero_node
;
6929 /* Get difference in deltas for different pointer to member function
6930 types. If the conversion is invalid and tf_error is not set in
6931 COMPLAIN, returns error_mark_node, otherwise returns an integer
6932 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
6933 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
6934 conversions as well. If C_CAST_P is true this conversion is taking
6935 place as part of a C-style cast.
6937 Note that the naming of FROM and TO is kind of backwards; the return
6938 value is what we add to a TO in order to get a FROM. They are named
6939 this way because we call this function to find out how to convert from
6940 a pointer to member of FROM to a pointer to member of TO. */
6943 get_delta_difference (tree from
, tree to
,
6944 bool allow_inverse_p
,
6945 bool c_cast_p
, tsubst_flags_t complain
)
6949 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
6950 /* Pointer to member of incomplete class is permitted*/
6951 result
= size_zero_node
;
6953 result
= get_delta_difference_1 (from
, to
, c_cast_p
, complain
);
6955 if (result
== error_mark_node
)
6956 return error_mark_node
;
6960 if (!allow_inverse_p
)
6962 if (!(complain
& tf_error
))
6963 return error_mark_node
;
6965 error_not_base_type (from
, to
);
6966 error (" in pointer to member conversion");
6967 result
= size_zero_node
;
6971 result
= get_delta_difference_1 (to
, from
, c_cast_p
, complain
);
6973 if (result
== error_mark_node
)
6974 return error_mark_node
;
6977 result
= size_diffop_loc (input_location
,
6978 size_zero_node
, result
);
6981 if (!(complain
& tf_error
))
6982 return error_mark_node
;
6984 error_not_base_type (from
, to
);
6985 error (" in pointer to member conversion");
6986 result
= size_zero_node
;
6991 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
6995 /* Return a constructor for the pointer-to-member-function TYPE using
6996 the other components as specified. */
6999 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
7004 VEC(constructor_elt
, gc
) *v
;
7006 /* Pull the FIELD_DECLs out of the type. */
7007 pfn_field
= TYPE_FIELDS (type
);
7008 delta_field
= DECL_CHAIN (pfn_field
);
7010 /* Make sure DELTA has the type we want. */
7011 delta
= convert_and_check (delta_type_node
, delta
);
7013 /* Convert to the correct target type if necessary. */
7014 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
7016 /* Finish creating the initializer. */
7017 v
= VEC_alloc(constructor_elt
, gc
, 2);
7018 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
7019 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
7020 u
= build_constructor (type
, v
);
7021 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
7022 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
7023 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
7025 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
7030 /* Build a constructor for a pointer to member function. It can be
7031 used to initialize global variables, local variable, or used
7032 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
7035 If FORCE is nonzero, then force this conversion, even if
7036 we would rather not do it. Usually set when using an explicit
7037 cast. A C-style cast is being processed iff C_CAST_P is true.
7039 Return error_mark_node, if something goes wrong. */
7042 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
,
7043 tsubst_flags_t complain
)
7049 if (error_operand_p (pfn
))
7050 return error_mark_node
;
7052 pfn_type
= TREE_TYPE (pfn
);
7053 to_type
= build_ptrmemfunc_type (type
);
7055 /* Handle multiple conversions of pointer to member functions. */
7056 if (TYPE_PTRMEMFUNC_P (pfn_type
))
7058 tree delta
= NULL_TREE
;
7059 tree npfn
= NULL_TREE
;
7063 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
7064 error ("invalid conversion to type %qT from type %qT",
7067 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
7068 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
7070 c_cast_p
, complain
);
7071 if (n
== error_mark_node
)
7072 return error_mark_node
;
7074 /* We don't have to do any conversion to convert a
7075 pointer-to-member to its own type. But, we don't want to
7076 just return a PTRMEM_CST if there's an explicit cast; that
7077 cast should make the expression an invalid template argument. */
7078 if (TREE_CODE (pfn
) != PTRMEM_CST
)
7080 if (same_type_p (to_type
, pfn_type
))
7082 else if (integer_zerop (n
))
7083 return build_reinterpret_cast (to_type
, pfn
,
7084 tf_warning_or_error
);
7087 if (TREE_SIDE_EFFECTS (pfn
))
7088 pfn
= save_expr (pfn
);
7090 /* Obtain the function pointer and the current DELTA. */
7091 if (TREE_CODE (pfn
) == PTRMEM_CST
)
7092 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
7095 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
7096 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
7099 /* Just adjust the DELTA field. */
7100 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7101 (TREE_TYPE (delta
), ptrdiff_type_node
));
7102 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
7103 n
= cp_build_binary_op (input_location
,
7104 LSHIFT_EXPR
, n
, integer_one_node
,
7105 tf_warning_or_error
);
7106 delta
= cp_build_binary_op (input_location
,
7107 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
7108 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
7111 /* Handle null pointer to member function conversions. */
7112 if (null_ptr_cst_p (pfn
))
7114 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
7115 return build_ptrmemfunc1 (to_type
,
7120 if (type_unknown_p (pfn
))
7121 return instantiate_type (type
, pfn
, tf_warning_or_error
);
7123 fn
= TREE_OPERAND (pfn
, 0);
7124 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7125 /* In a template, we will have preserved the
7127 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
7128 return make_ptrmem_cst (to_type
, fn
);
7131 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7134 ??? There is no consistency as to the types returned for the above
7135 values. Some code acts as if it were a sizetype and some as if it were
7136 integer_type_node. */
7139 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
7141 tree type
= TREE_TYPE (cst
);
7142 tree fn
= PTRMEM_CST_MEMBER (cst
);
7143 tree ptr_class
, fn_class
;
7145 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7147 /* The class that the function belongs to. */
7148 fn_class
= DECL_CONTEXT (fn
);
7150 /* The class that we're creating a pointer to member of. */
7151 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
7153 /* First, calculate the adjustment to the function's class. */
7154 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
7155 /*c_cast_p=*/0, tf_warning_or_error
);
7157 if (!DECL_VIRTUAL_P (fn
))
7158 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
7161 /* If we're dealing with a virtual function, we have to adjust 'this'
7162 again, to point to the base which provides the vtable entry for
7163 fn; the call will do the opposite adjustment. */
7164 tree orig_class
= DECL_CONTEXT (fn
);
7165 tree binfo
= binfo_or_else (orig_class
, fn_class
);
7166 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7167 *delta
, BINFO_OFFSET (binfo
));
7168 *delta
= fold_if_not_in_template (*delta
);
7170 /* We set PFN to the vtable offset at which the function can be
7171 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7172 case delta is shifted left, and then incremented). */
7173 *pfn
= DECL_VINDEX (fn
);
7174 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
7175 TYPE_SIZE_UNIT (vtable_entry_type
));
7176 *pfn
= fold_if_not_in_template (*pfn
);
7178 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
7180 case ptrmemfunc_vbit_in_pfn
:
7181 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
7183 *pfn
= fold_if_not_in_template (*pfn
);
7186 case ptrmemfunc_vbit_in_delta
:
7187 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
7188 *delta
, integer_one_node
);
7189 *delta
= fold_if_not_in_template (*delta
);
7190 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7191 *delta
, integer_one_node
);
7192 *delta
= fold_if_not_in_template (*delta
);
7199 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
7200 *pfn
= fold_if_not_in_template (*pfn
);
7204 /* Return an expression for PFN from the pointer-to-member function
7208 pfn_from_ptrmemfunc (tree t
)
7210 if (TREE_CODE (t
) == PTRMEM_CST
)
7215 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7220 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
7223 /* Return an expression for DELTA from the pointer-to-member function
7227 delta_from_ptrmemfunc (tree t
)
7229 if (TREE_CODE (t
) == PTRMEM_CST
)
7234 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7239 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7242 /* Convert value RHS to type TYPE as preparation for an assignment to
7243 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
7244 implicit conversion is. If FNDECL is non-NULL, we are doing the
7245 conversion in order to pass the PARMNUMth argument of FNDECL.
7246 If FNDECL is NULL, we are doing the conversion in function pointer
7247 argument passing, conversion in initialization, etc. */
7250 convert_for_assignment (tree type
, tree rhs
,
7251 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7252 tsubst_flags_t complain
, int flags
)
7255 enum tree_code coder
;
7257 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7258 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7259 rhs
= TREE_OPERAND (rhs
, 0);
7261 rhstype
= TREE_TYPE (rhs
);
7262 coder
= TREE_CODE (rhstype
);
7264 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7265 && vector_types_convertible_p (type
, rhstype
, true))
7267 rhs
= mark_rvalue_use (rhs
);
7268 return convert (type
, rhs
);
7271 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7272 return error_mark_node
;
7273 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7274 return error_mark_node
;
7276 /* The RHS of an assignment cannot have void type. */
7277 if (coder
== VOID_TYPE
)
7279 if (complain
& tf_error
)
7280 error ("void value not ignored as it ought to be");
7281 return error_mark_node
;
7284 /* Simplify the RHS if possible. */
7285 if (TREE_CODE (rhs
) == CONST_DECL
)
7286 rhs
= DECL_INITIAL (rhs
);
7288 if (c_dialect_objc ())
7292 tree rname
= fndecl
;
7303 selector
= objc_message_selector ();
7305 if (selector
&& parmno
> 1)
7312 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7314 rhs
= mark_rvalue_use (rhs
);
7315 return convert (type
, rhs
);
7321 The expression is implicitly converted (clause _conv_) to the
7322 cv-unqualified type of the left operand.
7324 We allow bad conversions here because by the time we get to this point
7325 we are committed to doing the conversion. If we end up doing a bad
7326 conversion, convert_like will complain. */
7327 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7329 /* When -Wno-pmf-conversions is use, we just silently allow
7330 conversions from pointers-to-members to plain pointers. If
7331 the conversion doesn't work, cp_convert will complain. */
7333 && TYPE_PTR_P (type
)
7334 && TYPE_PTRMEMFUNC_P (rhstype
))
7335 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7338 if (complain
& tf_error
)
7340 /* If the right-hand side has unknown type, then it is an
7341 overloaded function. Call instantiate_type to get error
7343 if (rhstype
== unknown_type_node
)
7344 instantiate_type (type
, rhs
, tf_warning_or_error
);
7346 error ("cannot convert %qT to %qT for argument %qP to %qD",
7347 rhstype
, type
, parmnum
, fndecl
);
7351 case ICR_DEFAULT_ARGUMENT
:
7352 error ("cannot convert %qT to %qT in default argument",
7356 error ("cannot convert %qT to %qT in argument passing",
7359 case ICR_CONVERTING
:
7360 error ("cannot convert %qT to %qT",
7364 error ("cannot convert %qT to %qT in initialization",
7368 error ("cannot convert %qT to %qT in return",
7372 error ("cannot convert %qT to %qT in assignment",
7379 return error_mark_node
;
7382 if (warn_missing_format_attribute
)
7384 const enum tree_code codel
= TREE_CODE (type
);
7385 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7387 && check_missing_format_attribute (type
, rhstype
)
7388 && (complain
& tf_warning
))
7392 case ICR_DEFAULT_ARGUMENT
:
7394 warning (OPT_Wmissing_format_attribute
,
7395 "parameter %qP of %qD might be a candidate "
7396 "for a format attribute", parmnum
, fndecl
);
7398 warning (OPT_Wmissing_format_attribute
,
7399 "parameter might be a candidate "
7400 "for a format attribute");
7402 case ICR_CONVERTING
:
7403 warning (OPT_Wmissing_format_attribute
,
7404 "target of conversion might be might be a candidate "
7405 "for a format attribute");
7408 warning (OPT_Wmissing_format_attribute
,
7409 "target of initialization might be a candidate "
7410 "for a format attribute");
7413 warning (OPT_Wmissing_format_attribute
,
7414 "return type might be a candidate "
7415 "for a format attribute");
7418 warning (OPT_Wmissing_format_attribute
,
7419 "left-hand side of assignment might be a candidate "
7420 "for a format attribute");
7427 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7429 if (warn_parentheses
7430 && TREE_CODE (type
) == BOOLEAN_TYPE
7431 && TREE_CODE (rhs
) == MODIFY_EXPR
7432 && !TREE_NO_WARNING (rhs
)
7433 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7434 && (complain
& tf_warning
))
7436 location_t loc
= EXPR_HAS_LOCATION (rhs
)
7437 ? EXPR_LOCATION (rhs
) : input_location
;
7439 warning_at (loc
, OPT_Wparentheses
,
7440 "suggest parentheses around assignment used as truth value");
7441 TREE_NO_WARNING (rhs
) = 1;
7444 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7448 /* Convert RHS to be of type TYPE.
7449 If EXP is nonzero, it is the target of the initialization.
7450 ERRTYPE indicates what kind of error the implicit conversion is.
7452 Two major differences between the behavior of
7453 `convert_for_assignment' and `convert_for_initialization'
7454 are that references are bashed in the former, while
7455 copied in the latter, and aggregates are assigned in
7456 the former (operator=) while initialized in the
7459 If using constructor make sure no conversion operator exists, if one does
7460 exist, an ambiguity exists.
7462 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7465 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7466 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7467 tsubst_flags_t complain
)
7469 enum tree_code codel
= TREE_CODE (type
);
7471 enum tree_code coder
;
7473 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7474 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7475 if (TREE_CODE (rhs
) == NOP_EXPR
7476 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7477 && codel
!= REFERENCE_TYPE
)
7478 rhs
= TREE_OPERAND (rhs
, 0);
7480 if (type
== error_mark_node
7481 || rhs
== error_mark_node
7482 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7483 return error_mark_node
;
7485 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7486 && TREE_CODE (type
) != ARRAY_TYPE
7487 && (TREE_CODE (type
) != REFERENCE_TYPE
7488 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7489 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7490 && (TREE_CODE (type
) != REFERENCE_TYPE
7491 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7492 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7493 rhs
= decay_conversion (rhs
);
7495 rhstype
= TREE_TYPE (rhs
);
7496 coder
= TREE_CODE (rhstype
);
7498 if (coder
== ERROR_MARK
)
7499 return error_mark_node
;
7501 /* We accept references to incomplete types, so we can
7502 return here before checking if RHS is of complete type. */
7504 if (codel
== REFERENCE_TYPE
)
7506 /* This should eventually happen in convert_arguments. */
7507 int savew
= 0, savee
= 0;
7510 savew
= warningcount
, savee
= errorcount
;
7511 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7512 /*cleanup=*/NULL
, complain
);
7515 if (warningcount
> savew
)
7516 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7517 else if (errorcount
> savee
)
7518 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7524 exp
= require_complete_type (exp
);
7525 if (exp
== error_mark_node
)
7526 return error_mark_node
;
7528 rhstype
= non_reference (rhstype
);
7530 type
= complete_type (type
);
7532 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7533 /* Don't try to do copy-initialization if we already have
7534 direct-initialization. */
7537 if (MAYBE_CLASS_TYPE_P (type
))
7538 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
7540 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7544 /* If RETVAL is the address of, or a reference to, a local variable or
7545 temporary give an appropriate warning. */
7548 maybe_warn_about_returning_address_of_local (tree retval
)
7550 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7551 tree whats_returned
= retval
;
7555 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7556 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7557 else if (CONVERT_EXPR_P (whats_returned
)
7558 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7559 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7564 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7566 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7568 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7570 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7571 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7573 warning (0, "returning reference to temporary");
7576 if (TREE_CODE (whats_returned
) == VAR_DECL
7577 && DECL_NAME (whats_returned
)
7578 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7580 warning (0, "reference to non-lvalue returned");
7585 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7586 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7587 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7589 if (DECL_P (whats_returned
)
7590 && DECL_NAME (whats_returned
)
7591 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7592 && !(TREE_STATIC (whats_returned
)
7593 || TREE_PUBLIC (whats_returned
)))
7595 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7596 warning (0, "reference to local variable %q+D returned",
7599 warning (0, "address of local variable %q+D returned",
7605 /* Check that returning RETVAL from the current function is valid.
7606 Return an expression explicitly showing all conversions required to
7607 change RETVAL into the function return type, and to assign it to
7608 the DECL_RESULT for the function. Set *NO_WARNING to true if
7609 code reaches end of non-void function warning shouldn't be issued
7610 on this RETURN_EXPR. */
7613 check_return_expr (tree retval
, bool *no_warning
)
7616 /* The type actually returned by the function, after any
7619 int fn_returns_value_p
;
7620 bool named_return_value_okay_p
;
7622 *no_warning
= false;
7624 /* A `volatile' function is one that isn't supposed to return, ever.
7625 (This is a G++ extension, used to get better code for functions
7626 that call the `volatile' function.) */
7627 if (TREE_THIS_VOLATILE (current_function_decl
))
7628 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7630 /* Check for various simple errors. */
7631 if (DECL_DESTRUCTOR_P (current_function_decl
))
7634 error ("returning a value from a destructor");
7637 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7639 if (in_function_try_handler
)
7640 /* If a return statement appears in a handler of the
7641 function-try-block of a constructor, the program is ill-formed. */
7642 error ("cannot return from a handler of a function-try-block of a constructor");
7644 /* You can't return a value from a constructor. */
7645 error ("returning a value from a constructor");
7649 /* As an extension, deduce lambda return type from a return statement
7650 anywhere in the body. */
7651 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7653 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7654 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7656 tree type
= lambda_return_type (retval
);
7657 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7659 if (VOID_TYPE_P (type
))
7661 else if (oldtype
== NULL_TREE
)
7663 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7664 "can only be deduced when the return statement is "
7665 "the only statement in the function body");
7666 apply_lambda_return_type (lambda
, type
);
7668 else if (!same_type_p (type
, oldtype
))
7669 error ("inconsistent types %qT and %qT deduced for "
7670 "lambda return type", type
, oldtype
);
7674 if (processing_template_decl
)
7676 current_function_returns_value
= 1;
7677 if (check_for_bare_parameter_packs (retval
))
7678 retval
= error_mark_node
;
7682 /* When no explicit return-value is given in a function with a named
7683 return value, the named return value is used. */
7684 result
= DECL_RESULT (current_function_decl
);
7685 valtype
= TREE_TYPE (result
);
7686 gcc_assert (valtype
!= NULL_TREE
);
7687 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7688 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7691 /* Check for a return statement with no return value in a function
7692 that's supposed to return a value. */
7693 if (!retval
&& fn_returns_value_p
)
7695 permerror (input_location
, "return-statement with no value, in function returning %qT",
7697 /* Clear this, so finish_function won't say that we reach the
7698 end of a non-void function (which we don't, we gave a
7700 current_function_returns_null
= 0;
7701 /* And signal caller that TREE_NO_WARNING should be set on the
7702 RETURN_EXPR to avoid control reaches end of non-void function
7703 warnings in tree-cfg.c. */
7706 /* Check for a return statement with a value in a function that
7707 isn't supposed to return a value. */
7708 else if (retval
&& !fn_returns_value_p
)
7710 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7711 /* You can return a `void' value from a function of `void'
7712 type. In that case, we have to evaluate the expression for
7713 its side-effects. */
7714 finish_expr_stmt (retval
);
7716 permerror (input_location
, "return-statement with a value, in function "
7717 "returning 'void'");
7718 current_function_returns_null
= 1;
7720 /* There's really no value to return, after all. */
7724 /* Remember that this function can sometimes return without a
7726 current_function_returns_null
= 1;
7728 /* Remember that this function did return a value. */
7729 current_function_returns_value
= 1;
7731 /* Check for erroneous operands -- but after giving ourselves a
7732 chance to provide an error about returning a value from a void
7734 if (error_operand_p (retval
))
7736 current_function_return_value
= error_mark_node
;
7737 return error_mark_node
;
7740 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7741 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7742 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7743 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7745 && retval
&& null_ptr_cst_p (retval
))
7746 warning (0, "%<operator new%> must not return NULL unless it is "
7747 "declared %<throw()%> (or -fcheck-new is in effect)");
7749 /* Effective C++ rule 15. See also start_function. */
7751 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7755 /* The function return type must be a reference to the current
7757 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7758 && same_type_ignoring_top_level_qualifiers_p
7759 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7761 /* Returning '*this' is obviously OK. */
7762 if (retval
== current_class_ref
)
7764 /* If we are calling a function whose return type is the same of
7765 the current class reference, it is ok. */
7766 else if (TREE_CODE (retval
) == INDIRECT_REF
7767 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7772 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7775 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7777 [...] For a function with a class return type, if the expression
7778 in the return statement is the name of a local object, and the cv-
7779 unqualified type of the local object is the same as the function
7780 return type, an implementation is permitted to omit creating the tem-
7781 porary object to hold the function return value [...]
7783 So, if this is a value-returning function that always returns the same
7784 local variable, remember it.
7786 It might be nice to be more flexible, and choose the first suitable
7787 variable even if the function sometimes returns something else, but
7788 then we run the risk of clobbering the variable we chose if the other
7789 returned expression uses the chosen variable somehow. And people expect
7790 this restriction, anyway. (jason 2000-11-19)
7792 See finish_function and finalize_nrv for the rest of this optimization. */
7794 named_return_value_okay_p
=
7795 (retval
!= NULL_TREE
7796 /* Must be a local, automatic variable. */
7797 && TREE_CODE (retval
) == VAR_DECL
7798 && DECL_CONTEXT (retval
) == current_function_decl
7799 && ! TREE_STATIC (retval
)
7800 && ! DECL_ANON_UNION_VAR_P (retval
)
7801 && (DECL_ALIGN (retval
)
7802 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7803 /* The cv-unqualified type of the returned value must be the
7804 same as the cv-unqualified return type of the
7806 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7808 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7809 /* And the returned value must be non-volatile. */
7810 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7812 if (fn_returns_value_p
&& flag_elide_constructors
)
7814 if (named_return_value_okay_p
7815 && (current_function_return_value
== NULL_TREE
7816 || current_function_return_value
== retval
))
7817 current_function_return_value
= retval
;
7819 current_function_return_value
= error_mark_node
;
7822 /* We don't need to do any conversions when there's nothing being
7827 /* Do any required conversions. */
7828 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7829 /* No conversions are required. */
7833 /* The type the function is declared to return. */
7834 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7835 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7837 /* The functype's return type will have been set to void, if it
7838 was an incomplete type. Just treat this as 'return;' */
7839 if (VOID_TYPE_P (functype
))
7840 return error_mark_node
;
7842 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7843 treated as an rvalue for the purposes of overload resolution to
7844 favor move constructors over copy constructors. */
7845 if ((cxx_dialect
!= cxx98
)
7846 && named_return_value_okay_p
7847 /* The variable must not have the `volatile' qualifier. */
7848 && !CP_TYPE_VOLATILE_P (TREE_TYPE (retval
))
7849 /* The return type must be a class type. */
7850 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7851 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7853 /* First convert the value to the function's return type, then
7854 to the type of return value's location to handle the
7855 case that functype is smaller than the valtype. */
7856 retval
= convert_for_initialization
7857 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
7858 tf_warning_or_error
);
7859 retval
= convert (valtype
, retval
);
7861 /* If the conversion failed, treat this just like `return;'. */
7862 if (retval
== error_mark_node
)
7864 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7865 else if (! cfun
->returns_struct
7866 && TREE_CODE (retval
) == TARGET_EXPR
7867 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7868 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7869 TREE_OPERAND (retval
, 0));
7871 maybe_warn_about_returning_address_of_local (retval
);
7874 /* Actually copy the value returned into the appropriate location. */
7875 if (retval
&& retval
!= result
)
7876 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7882 /* Returns nonzero if the pointer-type FROM can be converted to the
7883 pointer-type TO via a qualification conversion. If CONSTP is -1,
7884 then we return nonzero if the pointers are similar, and the
7885 cv-qualification signature of FROM is a proper subset of that of TO.
7887 If CONSTP is positive, then all outer pointers have been
7891 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7893 bool to_more_cv_qualified
= false;
7894 bool is_opaque_pointer
= false;
7896 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7898 if (TREE_CODE (to
) != TREE_CODE (from
))
7901 if (TREE_CODE (from
) == OFFSET_TYPE
7902 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7903 TYPE_OFFSET_BASETYPE (to
)))
7906 /* Const and volatile mean something different for function types,
7907 so the usual checks are not appropriate. */
7908 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7910 /* In Objective-C++, some types may have been 'volatilized' by
7911 the compiler for EH; when comparing them here, the volatile
7912 qualification must be ignored. */
7913 bool objc_quals_match
= objc_type_quals_match (to
, from
);
7915 if (!at_least_as_qualified_p (to
, from
) && !objc_quals_match
)
7918 if (!at_least_as_qualified_p (from
, to
) && !objc_quals_match
)
7922 to_more_cv_qualified
= true;
7926 constp
&= TYPE_READONLY (to
);
7929 if (TREE_CODE (to
) == VECTOR_TYPE
)
7930 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7932 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
7933 return ((constp
>= 0 || to_more_cv_qualified
)
7934 && (is_opaque_pointer
7935 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
7939 /* When comparing, say, char ** to char const **, this function takes
7940 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7941 types to this function. */
7944 comp_ptr_ttypes (tree to
, tree from
)
7946 return comp_ptr_ttypes_real (to
, from
, 1);
7949 /* Returns true iff FNTYPE is a non-class type that involves
7950 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7951 if a parameter type is ill-formed. */
7954 error_type_p (const_tree type
)
7958 switch (TREE_CODE (type
))
7964 case REFERENCE_TYPE
:
7966 return error_type_p (TREE_TYPE (type
));
7970 if (error_type_p (TREE_TYPE (type
)))
7972 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7973 if (error_type_p (TREE_VALUE (t
)))
7978 if (TYPE_PTRMEMFUNC_P (type
))
7979 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
7987 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7988 type or inheritance-related types, regardless of cv-quals. */
7991 ptr_reasonably_similar (const_tree to
, const_tree from
)
7993 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7995 /* Any target type is similar enough to void. */
7996 if (TREE_CODE (to
) == VOID_TYPE
)
7997 return !error_type_p (from
);
7998 if (TREE_CODE (from
) == VOID_TYPE
)
7999 return !error_type_p (to
);
8001 if (TREE_CODE (to
) != TREE_CODE (from
))
8004 if (TREE_CODE (from
) == OFFSET_TYPE
8005 && comptypes (TYPE_OFFSET_BASETYPE (to
),
8006 TYPE_OFFSET_BASETYPE (from
),
8007 COMPARE_BASE
| COMPARE_DERIVED
))
8010 if (TREE_CODE (to
) == VECTOR_TYPE
8011 && vector_types_convertible_p (to
, from
, false))
8014 if (TREE_CODE (to
) == INTEGER_TYPE
8015 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
8018 if (TREE_CODE (to
) == FUNCTION_TYPE
)
8019 return !error_type_p (to
) && !error_type_p (from
);
8021 if (TREE_CODE (to
) != POINTER_TYPE
)
8023 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
8024 COMPARE_BASE
| COMPARE_DERIVED
);
8028 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
8029 pointer-to-member types) are the same, ignoring cv-qualification at
8033 comp_ptr_ttypes_const (tree to
, tree from
)
8035 bool is_opaque_pointer
= false;
8037 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
8039 if (TREE_CODE (to
) != TREE_CODE (from
))
8042 if (TREE_CODE (from
) == OFFSET_TYPE
8043 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
8044 TYPE_OFFSET_BASETYPE (to
)))
8047 if (TREE_CODE (to
) == VECTOR_TYPE
)
8048 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
8050 if (TREE_CODE (to
) != POINTER_TYPE
)
8051 return (is_opaque_pointer
8052 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
8056 /* Returns the type qualifiers for this type, including the qualifiers on the
8057 elements for an array type. */
8060 cp_type_quals (const_tree type
)
8063 /* This CONST_CAST is okay because strip_array_types returns its
8064 argument unmodified and we assign it to a const_tree. */
8065 type
= strip_array_types (CONST_CAST_TREE (type
));
8066 if (type
== error_mark_node
8067 /* Quals on a FUNCTION_TYPE are memfn quals. */
8068 || TREE_CODE (type
) == FUNCTION_TYPE
)
8069 return TYPE_UNQUALIFIED
;
8070 quals
= TYPE_QUALS (type
);
8071 /* METHOD and REFERENCE_TYPEs should never have quals. */
8072 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
8073 && TREE_CODE (type
) != REFERENCE_TYPE
)
8074 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
8075 == TYPE_UNQUALIFIED
));
8079 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
8083 type_memfn_quals (const_tree type
)
8085 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8086 return TYPE_QUALS (type
);
8087 else if (TREE_CODE (type
) == METHOD_TYPE
)
8088 return cp_type_quals (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))));
8093 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
8097 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
)
8099 /* Could handle METHOD_TYPE here if necessary. */
8100 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8101 if (TYPE_QUALS (type
) == memfn_quals
)
8103 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
8105 return build_qualified_type (type
, memfn_quals
);
8108 /* Returns nonzero if TYPE is const or volatile. */
8111 cv_qualified_p (const_tree type
)
8113 int quals
= cp_type_quals (type
);
8114 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
8117 /* Returns nonzero if the TYPE contains a mutable member. */
8120 cp_has_mutable_p (const_tree type
)
8122 /* This CONST_CAST is okay because strip_array_types returns its
8123 argument unmodified and we assign it to a const_tree. */
8124 type
= strip_array_types (CONST_CAST_TREE(type
));
8126 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
8129 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
8130 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
8131 approximation. In particular, consider:
8134 struct S { int i; };
8135 const S s = { f(); }
8137 Here, we will make "s" as TREE_READONLY (because it is declared
8138 "const") -- only to reverse ourselves upon seeing that the
8139 initializer is non-constant. */
8142 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
8144 tree type
= TREE_TYPE (decl
);
8146 if (type
== error_mark_node
)
8149 if (TREE_CODE (decl
) == TYPE_DECL
)
8152 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
8153 && type_quals
!= TYPE_UNQUALIFIED
));
8155 /* Avoid setting TREE_READONLY incorrectly. */
8156 if (/* If the object has a constructor, the constructor may modify
8158 TYPE_NEEDS_CONSTRUCTING (type
)
8159 /* If the type isn't complete, we don't know yet if it will need
8161 || !COMPLETE_TYPE_P (type
)
8162 /* If the type has a mutable component, that component might be
8164 || TYPE_HAS_MUTABLE_P (type
))
8165 type_quals
&= ~TYPE_QUAL_CONST
;
8167 c_apply_type_quals_to_decl (type_quals
, decl
);
8170 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8171 exemplar types such that casting T1 to T2 is casting away constness
8172 if and only if there is no implicit conversion from T1 to T2. */
8175 casts_away_constness_r (tree
*t1
, tree
*t2
)
8180 /* [expr.const.cast]
8182 For multi-level pointer to members and multi-level mixed pointers
8183 and pointers to members (conv.qual), the "member" aspect of a
8184 pointer to member level is ignored when determining if a const
8185 cv-qualifier has been cast away. */
8186 /* [expr.const.cast]
8188 For two pointer types:
8190 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8191 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8194 casting from X1 to X2 casts away constness if, for a non-pointer
8195 type T there does not exist an implicit conversion (clause
8198 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8202 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8203 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
8204 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
8206 *t1
= cp_build_qualified_type (void_type_node
,
8207 cp_type_quals (*t1
));
8208 *t2
= cp_build_qualified_type (void_type_node
,
8209 cp_type_quals (*t2
));
8213 quals1
= cp_type_quals (*t1
);
8214 quals2
= cp_type_quals (*t2
);
8216 if (TYPE_PTRMEM_P (*t1
))
8217 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
8219 *t1
= TREE_TYPE (*t1
);
8220 if (TYPE_PTRMEM_P (*t2
))
8221 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
8223 *t2
= TREE_TYPE (*t2
);
8225 casts_away_constness_r (t1
, t2
);
8226 *t1
= build_pointer_type (*t1
);
8227 *t2
= build_pointer_type (*t2
);
8228 *t1
= cp_build_qualified_type (*t1
, quals1
);
8229 *t2
= cp_build_qualified_type (*t2
, quals2
);
8232 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8235 ??? This function returns non-zero if casting away qualifiers not
8236 just const. We would like to return to the caller exactly which
8237 qualifiers are casted away to give more accurate diagnostics.
8241 casts_away_constness (tree t1
, tree t2
)
8243 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
8245 /* [expr.const.cast]
8247 Casting from an lvalue of type T1 to an lvalue of type T2
8248 using a reference cast casts away constness if a cast from an
8249 rvalue of type "pointer to T1" to the type "pointer to T2"
8250 casts away constness. */
8251 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
8252 return casts_away_constness (build_pointer_type (t1
),
8253 build_pointer_type (TREE_TYPE (t2
)));
8256 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
8257 /* [expr.const.cast]
8259 Casting from an rvalue of type "pointer to data member of X
8260 of type T1" to the type "pointer to data member of Y of type
8261 T2" casts away constness if a cast from an rvalue of type
8262 "pointer to T1" to the type "pointer to T2" casts away
8264 return casts_away_constness
8265 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
8266 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
8268 /* Casting away constness is only something that makes sense for
8269 pointer or reference types. */
8270 if (TREE_CODE (t1
) != POINTER_TYPE
8271 || TREE_CODE (t2
) != POINTER_TYPE
)
8274 /* Top-level qualifiers don't matter. */
8275 t1
= TYPE_MAIN_VARIANT (t1
);
8276 t2
= TYPE_MAIN_VARIANT (t2
);
8277 casts_away_constness_r (&t1
, &t2
);
8278 if (!can_convert (t2
, t1
))
8284 /* If T is a REFERENCE_TYPE return the type to which T refers.
8285 Otherwise, return T itself. */
8288 non_reference (tree t
)
8290 if (TREE_CODE (t
) == REFERENCE_TYPE
)
8296 /* Return nonzero if REF is an lvalue valid for this language;
8297 otherwise, print an error message and return zero. USE says
8298 how the lvalue is being used and so selects the error message. */
8301 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
8303 int win
= lvalue_p (ref
);
8305 if (!win
&& (complain
& tf_error
))