1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
4 Free Software Foundation, Inc.
5 Hacked by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
24 /* This file is part of the C++ front end.
25 It contains routines to build C++ expressions given their operands,
26 including computing the types of the result, C and C++ specific error
27 checks, and some optimization. */
31 #include "coretypes.h"
38 #include "diagnostic.h"
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);
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 1 if TYPE1 is at least as qualified as TYPE2. */
1509 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1511 int q1
= cp_type_quals (type1
);
1512 int q2
= cp_type_quals (type2
);
1514 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1515 return (q1
& q2
) == q2
;
1518 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1519 more cv-qualified that TYPE1, and 0 otherwise. */
1522 comp_cv_qualification (const_tree type1
, const_tree type2
)
1524 int q1
= cp_type_quals (type1
);
1525 int q2
= cp_type_quals (type2
);
1530 if ((q1
& q2
) == q2
)
1532 else if ((q1
& q2
) == q1
)
1538 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1539 subset of the cv-qualification signature of TYPE2, and the types
1540 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1543 comp_cv_qual_signature (tree type1
, tree type2
)
1545 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1547 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1553 /* Subroutines of `comptypes'. */
1555 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1556 equivalent in the sense that functions with those parameter types
1557 can have equivalent types. The two lists must be equivalent,
1558 element by element. */
1561 compparms (const_tree parms1
, const_tree parms2
)
1565 /* An unspecified parmlist matches any specified parmlist
1566 whose argument types don't need default promotions. */
1568 for (t1
= parms1
, t2
= parms2
;
1570 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1572 /* If one parmlist is shorter than the other,
1573 they fail to match. */
1576 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1583 /* Process a sizeof or alignof expression where the operand is a
1587 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1592 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1593 if (type
== error_mark_node
)
1594 return error_mark_node
;
1596 type
= non_reference (type
);
1597 if (TREE_CODE (type
) == METHOD_TYPE
)
1600 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
1601 "invalid application of %qs to a member function",
1602 operator_name_info
[(int) op
].name
);
1603 value
= size_one_node
;
1606 dependent_p
= dependent_type_p (type
);
1608 complete_type (type
);
1610 /* VLA types will have a non-constant size. In the body of an
1611 uninstantiated template, we don't need to try to compute the
1612 value, because the sizeof expression is not an integral
1613 constant expression in that case. And, if we do try to
1614 compute the value, we'll likely end up with SAVE_EXPRs, which
1615 the template substitution machinery does not expect to see. */
1616 || (processing_template_decl
1617 && COMPLETE_TYPE_P (type
)
1618 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1620 value
= build_min (op
, size_type_node
, type
);
1621 TREE_READONLY (value
) = 1;
1625 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1630 /* Return the size of the type, without producing any warnings for
1631 types whose size cannot be taken. This routine should be used only
1632 in some other routine that has already produced a diagnostic about
1633 using the size of such a type. */
1635 cxx_sizeof_nowarn (tree type
)
1637 if (TREE_CODE (type
) == FUNCTION_TYPE
1638 || TREE_CODE (type
) == VOID_TYPE
1639 || TREE_CODE (type
) == ERROR_MARK
)
1640 return size_one_node
;
1641 else if (!COMPLETE_TYPE_P (type
))
1642 return size_zero_node
;
1644 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1647 /* Process a sizeof expression where the operand is an expression. */
1650 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1652 if (e
== error_mark_node
)
1653 return error_mark_node
;
1655 if (processing_template_decl
)
1657 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1658 TREE_SIDE_EFFECTS (e
) = 0;
1659 TREE_READONLY (e
) = 1;
1664 /* To get the size of a static data member declared as an array of
1665 unknown bound, we need to instantiate it. */
1666 if (TREE_CODE (e
) == VAR_DECL
1667 && VAR_HAD_UNKNOWN_BOUND (e
)
1668 && DECL_TEMPLATE_INSTANTIATION (e
))
1669 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1671 e
= mark_type_use (e
);
1673 if (TREE_CODE (e
) == COMPONENT_REF
1674 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1675 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1677 if (complain
& tf_error
)
1678 error ("invalid application of %<sizeof%> to a bit-field");
1680 return error_mark_node
;
1683 else if (is_overloaded_fn (e
))
1685 if (complain
& tf_error
)
1686 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1689 return error_mark_node
;
1692 else if (type_unknown_p (e
))
1694 if (complain
& tf_error
)
1695 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1697 return error_mark_node
;
1703 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1706 /* Implement the __alignof keyword: Return the minimum required
1707 alignment of E, measured in bytes. For VAR_DECL's and
1708 FIELD_DECL's return DECL_ALIGN (which can be set from an
1709 "aligned" __attribute__ specification). */
1712 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1716 if (e
== error_mark_node
)
1717 return error_mark_node
;
1719 if (processing_template_decl
)
1721 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1722 TREE_SIDE_EFFECTS (e
) = 0;
1723 TREE_READONLY (e
) = 1;
1728 e
= mark_type_use (e
);
1730 if (TREE_CODE (e
) == VAR_DECL
)
1731 t
= size_int (DECL_ALIGN_UNIT (e
));
1732 else if (TREE_CODE (e
) == COMPONENT_REF
1733 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1734 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1736 if (complain
& tf_error
)
1737 error ("invalid application of %<__alignof%> to a bit-field");
1739 return error_mark_node
;
1742 else if (TREE_CODE (e
) == COMPONENT_REF
1743 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1744 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1745 else if (is_overloaded_fn (e
))
1747 if (complain
& tf_error
)
1748 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1751 return error_mark_node
;
1752 if (TREE_CODE (e
) == FUNCTION_DECL
)
1753 t
= size_int (DECL_ALIGN_UNIT (e
));
1757 else if (type_unknown_p (e
))
1759 if (complain
& tf_error
)
1760 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1762 return error_mark_node
;
1766 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1767 complain
& tf_error
);
1769 return fold_convert (size_type_node
, t
);
1772 /* Process a sizeof or alignof expression E with code OP where the operand
1773 is an expression. */
1776 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1778 if (op
== SIZEOF_EXPR
)
1779 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1781 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1784 /* EXPR is being used in a context that is not a function call.
1789 The expression can be used only as the left-hand operand of a
1790 member function call.
1792 [expr.mptr.operator]
1794 If the result of .* or ->* is a function, then that result can be
1795 used only as the operand for the function call operator ().
1797 by issuing an error message if appropriate. Returns true iff EXPR
1798 violates these rules. */
1801 invalid_nonstatic_memfn_p (const_tree expr
, tsubst_flags_t complain
)
1803 if (expr
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1805 if (complain
& tf_error
)
1806 error ("invalid use of non-static member function");
1812 /* If EXP is a reference to a bitfield, and the type of EXP does not
1813 match the declared type of the bitfield, return the declared type
1814 of the bitfield. Otherwise, return NULL_TREE. */
1817 is_bitfield_expr_with_lowered_type (const_tree exp
)
1819 switch (TREE_CODE (exp
))
1822 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1823 ? TREE_OPERAND (exp
, 1)
1824 : TREE_OPERAND (exp
, 0)))
1826 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1829 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1833 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1839 field
= TREE_OPERAND (exp
, 1);
1840 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1842 if (same_type_ignoring_top_level_qualifiers_p
1843 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1845 return DECL_BIT_FIELD_TYPE (field
);
1849 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1850 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1851 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1859 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1860 bitfield with a lowered type, the type of EXP is returned, rather
1864 unlowered_expr_type (const_tree exp
)
1868 type
= is_bitfield_expr_with_lowered_type (exp
);
1870 type
= TREE_TYPE (exp
);
1875 /* Perform the conversions in [expr] that apply when an lvalue appears
1876 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1877 function-to-pointer conversions. In addition, manifest constants
1878 are replaced by their values, and bitfield references are converted
1879 to their declared types. Note that this function does not perform the
1880 lvalue-to-rvalue conversion for class types. If you need that conversion
1881 to for class types, then you probably need to use force_rvalue.
1883 Although the returned value is being used as an rvalue, this
1884 function does not wrap the returned expression in a
1885 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1886 that the return value is no longer an lvalue. */
1889 decay_conversion (tree exp
)
1892 enum tree_code code
;
1894 type
= TREE_TYPE (exp
);
1895 if (type
== error_mark_node
)
1896 return error_mark_node
;
1898 exp
= mark_rvalue_use (exp
);
1900 exp
= resolve_nondeduced_context (exp
);
1901 if (type_unknown_p (exp
))
1903 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1904 return error_mark_node
;
1907 exp
= decl_constant_value (exp
);
1908 if (error_operand_p (exp
))
1909 return error_mark_node
;
1911 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1912 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1913 code
= TREE_CODE (type
);
1914 if (code
== VOID_TYPE
)
1916 error ("void value not ignored as it ought to be");
1917 return error_mark_node
;
1919 if (invalid_nonstatic_memfn_p (exp
, tf_warning_or_error
))
1920 return error_mark_node
;
1921 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1922 return cp_build_unary_op (ADDR_EXPR
, exp
, 0, tf_warning_or_error
);
1923 if (code
== ARRAY_TYPE
)
1928 if (TREE_CODE (exp
) == INDIRECT_REF
)
1929 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1930 TREE_OPERAND (exp
, 0));
1932 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1934 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1935 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1936 TREE_OPERAND (exp
, 0), op1
);
1940 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1942 error ("invalid use of non-lvalue array");
1943 return error_mark_node
;
1946 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1948 if (TREE_CODE (exp
) == VAR_DECL
)
1950 if (!cxx_mark_addressable (exp
))
1951 return error_mark_node
;
1952 adr
= build_nop (ptrtype
, build_address (exp
));
1955 /* This way is better for a COMPONENT_REF since it can
1956 simplify the offset for a component. */
1957 adr
= cp_build_unary_op (ADDR_EXPR
, exp
, 1, tf_warning_or_error
);
1958 return cp_convert (ptrtype
, adr
);
1961 /* If a bitfield is used in a context where integral promotion
1962 applies, then the caller is expected to have used
1963 default_conversion. That function promotes bitfields correctly
1964 before calling this function. At this point, if we have a
1965 bitfield referenced, we may assume that is not subject to
1966 promotion, and that, therefore, the type of the resulting rvalue
1967 is the declared type of the bitfield. */
1968 exp
= convert_bitfield_to_declared_type (exp
);
1970 /* We do not call rvalue() here because we do not want to wrap EXP
1971 in a NON_LVALUE_EXPR. */
1975 Non-class rvalues always have cv-unqualified types. */
1976 type
= TREE_TYPE (exp
);
1977 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
1978 exp
= build_nop (cv_unqualified (type
), exp
);
1983 /* Perform preparatory conversions, as part of the "usual arithmetic
1984 conversions". In particular, as per [expr]:
1986 Whenever an lvalue expression appears as an operand of an
1987 operator that expects the rvalue for that operand, the
1988 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1989 standard conversions are applied to convert the expression to an
1992 In addition, we perform integral promotions here, as those are
1993 applied to both operands to a binary operator before determining
1994 what additional conversions should apply. */
1997 default_conversion (tree exp
)
1999 /* Check for target-specific promotions. */
2000 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
2002 exp
= cp_convert (promoted_type
, exp
);
2003 /* Perform the integral promotions first so that bitfield
2004 expressions (which may promote to "int", even if the bitfield is
2005 declared "unsigned") are promoted correctly. */
2006 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
2007 exp
= perform_integral_promotions (exp
);
2008 /* Perform the other conversions. */
2009 exp
= decay_conversion (exp
);
2014 /* EXPR is an expression with an integral or enumeration type.
2015 Perform the integral promotions in [conv.prom], and return the
2019 perform_integral_promotions (tree expr
)
2024 expr
= mark_rvalue_use (expr
);
2028 If the bitfield has an enumerated type, it is treated as any
2029 other value of that type for promotion purposes. */
2030 type
= is_bitfield_expr_with_lowered_type (expr
);
2031 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
2032 type
= TREE_TYPE (expr
);
2033 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
2034 promoted_type
= type_promotes_to (type
);
2035 if (type
!= promoted_type
)
2036 expr
= cp_convert (promoted_type
, expr
);
2040 /* Returns nonzero iff exp is a STRING_CST or the result of applying
2041 decay_conversion to one. */
2044 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
2048 if (TREE_CODE (totype
) != POINTER_TYPE
)
2051 t
= TREE_TYPE (totype
);
2052 if (!same_type_p (t
, char_type_node
)
2053 && !same_type_p (t
, char16_type_node
)
2054 && !same_type_p (t
, char32_type_node
)
2055 && !same_type_p (t
, wchar_type_node
))
2058 if (TREE_CODE (exp
) == STRING_CST
)
2060 /* Make sure that we don't try to convert between char and wide chars. */
2061 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
2066 /* Is this a string constant which has decayed to 'const char *'? */
2067 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
2068 if (!same_type_p (TREE_TYPE (exp
), t
))
2071 if (TREE_CODE (exp
) != ADDR_EXPR
2072 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2076 /* This warning is not very useful, as it complains about printf. */
2078 warning (OPT_Wwrite_strings
,
2079 "deprecated conversion from string constant to %qT",
2085 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2086 can, for example, use as an lvalue. This code used to be in
2087 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2088 expressions, where we're dealing with aggregates. But now it's again only
2089 called from unary_complex_lvalue. The case (in particular) that led to
2090 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2094 rationalize_conditional_expr (enum tree_code code
, tree t
,
2095 tsubst_flags_t complain
)
2097 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2098 the first operand is always the one to be used if both operands
2099 are equal, so we know what conditional expression this used to be. */
2100 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2102 tree op0
= TREE_OPERAND (t
, 0);
2103 tree op1
= TREE_OPERAND (t
, 1);
2105 /* The following code is incorrect if either operand side-effects. */
2106 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2107 && !TREE_SIDE_EFFECTS (op1
));
2109 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
2110 ? LE_EXPR
: GE_EXPR
),
2111 op0
, TREE_CODE (op0
),
2112 op1
, TREE_CODE (op1
),
2113 /*overloaded_p=*/NULL
,
2115 cp_build_unary_op (code
, op0
, 0, complain
),
2116 cp_build_unary_op (code
, op1
, 0, complain
),
2121 build_conditional_expr (TREE_OPERAND (t
, 0),
2122 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2124 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2129 /* Given the TYPE of an anonymous union field inside T, return the
2130 FIELD_DECL for the field. If not found return NULL_TREE. Because
2131 anonymous unions can nest, we must also search all anonymous unions
2132 that are directly reachable. */
2135 lookup_anon_field (tree t
, tree type
)
2139 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
2141 if (TREE_STATIC (field
))
2143 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2146 /* If we find it directly, return the field. */
2147 if (DECL_NAME (field
) == NULL_TREE
2148 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2153 /* Otherwise, it could be nested, search harder. */
2154 if (DECL_NAME (field
) == NULL_TREE
2155 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2157 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2165 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2166 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2167 non-NULL, it indicates the path to the base used to name MEMBER.
2168 If PRESERVE_REFERENCE is true, the expression returned will have
2169 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2170 returned will have the type referred to by the reference.
2172 This function does not perform access control; that is either done
2173 earlier by the parser when the name of MEMBER is resolved to MEMBER
2174 itself, or later when overload resolution selects one of the
2175 functions indicated by MEMBER. */
2178 build_class_member_access_expr (tree object
, tree member
,
2179 tree access_path
, bool preserve_reference
,
2180 tsubst_flags_t complain
)
2184 tree result
= NULL_TREE
;
2186 if (error_operand_p (object
) || error_operand_p (member
))
2187 return error_mark_node
;
2189 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2193 The type of the first expression shall be "class object" (of a
2195 object_type
= TREE_TYPE (object
);
2196 if (!currently_open_class (object_type
)
2197 && !complete_type_or_else (object_type
, object
))
2198 return error_mark_node
;
2199 if (!CLASS_TYPE_P (object_type
))
2201 if (complain
& tf_error
)
2202 error ("request for member %qD in %qE, which is of non-class type %qT",
2203 member
, object
, object_type
);
2204 return error_mark_node
;
2207 /* The standard does not seem to actually say that MEMBER must be a
2208 member of OBJECT_TYPE. However, that is clearly what is
2210 if (DECL_P (member
))
2212 member_scope
= DECL_CLASS_CONTEXT (member
);
2214 if (TREE_DEPRECATED (member
))
2215 warn_deprecated_use (member
, NULL_TREE
);
2218 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2219 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2220 presently be the anonymous union. Go outwards until we find a
2221 type related to OBJECT_TYPE. */
2222 while (ANON_AGGR_TYPE_P (member_scope
)
2223 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2225 member_scope
= TYPE_CONTEXT (member_scope
);
2226 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2228 if (complain
& tf_error
)
2230 if (TREE_CODE (member
) == FIELD_DECL
)
2231 error ("invalid use of nonstatic data member %qE", member
);
2233 error ("%qD is not a member of %qT", member
, object_type
);
2235 return error_mark_node
;
2238 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2239 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2240 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2242 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2244 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2247 /* In [expr.ref], there is an explicit list of the valid choices for
2248 MEMBER. We check for each of those cases here. */
2249 if (TREE_CODE (member
) == VAR_DECL
)
2251 /* A static data member. */
2253 mark_exp_read (object
);
2254 /* If OBJECT has side-effects, they are supposed to occur. */
2255 if (TREE_SIDE_EFFECTS (object
))
2256 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2258 else if (TREE_CODE (member
) == FIELD_DECL
)
2260 /* A non-static data member. */
2265 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
2266 && integer_zerop (TREE_OPERAND (object
, 0)));
2268 /* Convert OBJECT to the type of MEMBER. */
2269 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2270 TYPE_MAIN_VARIANT (member_scope
)))
2275 binfo
= lookup_base (access_path
? access_path
: object_type
,
2276 member_scope
, ba_unique
, &kind
);
2277 if (binfo
== error_mark_node
)
2278 return error_mark_node
;
2280 /* It is invalid to try to get to a virtual base of a
2281 NULL object. The most common cause is invalid use of
2283 if (null_object_p
&& kind
== bk_via_virtual
)
2285 if (complain
& tf_error
)
2287 error ("invalid access to non-static data member %qD of "
2290 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2292 return error_mark_node
;
2295 /* Convert to the base. */
2296 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2298 /* If we found the base successfully then we should be able
2299 to convert to it successfully. */
2300 gcc_assert (object
!= error_mark_node
);
2303 /* Complain about other invalid uses of offsetof, even though they will
2304 give the right answer. Note that we complain whether or not they
2305 actually used the offsetof macro, since there's no way to know at this
2306 point. So we just give a warning, instead of a pedwarn. */
2307 /* Do not produce this warning for base class field references, because
2308 we know for a fact that didn't come from offsetof. This does occur
2309 in various testsuite cases where a null object is passed where a
2310 vtable access is required. */
2311 if (null_object_p
&& warn_invalid_offsetof
2312 && CLASSTYPE_NON_STD_LAYOUT (object_type
)
2313 && !DECL_FIELD_IS_BASE (member
)
2314 && cp_unevaluated_operand
== 0
2315 && (complain
& tf_warning
))
2317 warning (OPT_Winvalid_offsetof
,
2318 "invalid access to non-static data member %qD "
2319 " of NULL object", member
);
2320 warning (OPT_Winvalid_offsetof
,
2321 "(perhaps the %<offsetof%> macro was used incorrectly)");
2324 /* If MEMBER is from an anonymous aggregate, we have converted
2325 OBJECT so that it refers to the class containing the
2326 anonymous union. Generate a reference to the anonymous union
2327 itself, and recur to find MEMBER. */
2328 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2329 /* When this code is called from build_field_call, the
2330 object already has the type of the anonymous union.
2331 That is because the COMPONENT_REF was already
2332 constructed, and was then disassembled before calling
2333 build_field_call. After the function-call code is
2334 cleaned up, this waste can be eliminated. */
2335 && (!same_type_ignoring_top_level_qualifiers_p
2336 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2338 tree anonymous_union
;
2340 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2341 DECL_CONTEXT (member
));
2342 object
= build_class_member_access_expr (object
,
2344 /*access_path=*/NULL_TREE
,
2349 /* Compute the type of the field, as described in [expr.ref]. */
2350 type_quals
= TYPE_UNQUALIFIED
;
2351 member_type
= TREE_TYPE (member
);
2352 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2354 type_quals
= (cp_type_quals (member_type
)
2355 | cp_type_quals (object_type
));
2357 /* A field is const (volatile) if the enclosing object, or the
2358 field itself, is const (volatile). But, a mutable field is
2359 not const, even within a const object. */
2360 if (DECL_MUTABLE_P (member
))
2361 type_quals
&= ~TYPE_QUAL_CONST
;
2362 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2365 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
2367 result
= fold_if_not_in_template (result
);
2369 /* Mark the expression const or volatile, as appropriate. Even
2370 though we've dealt with the type above, we still have to mark the
2371 expression itself. */
2372 if (type_quals
& TYPE_QUAL_CONST
)
2373 TREE_READONLY (result
) = 1;
2374 if (type_quals
& TYPE_QUAL_VOLATILE
)
2375 TREE_THIS_VOLATILE (result
) = 1;
2377 else if (BASELINK_P (member
))
2379 /* The member is a (possibly overloaded) member function. */
2383 /* If the MEMBER is exactly one static member function, then we
2384 know the type of the expression. Otherwise, we must wait
2385 until overload resolution has been performed. */
2386 functions
= BASELINK_FUNCTIONS (member
);
2387 if (TREE_CODE (functions
) == FUNCTION_DECL
2388 && DECL_STATIC_FUNCTION_P (functions
))
2389 type
= TREE_TYPE (functions
);
2391 type
= unknown_type_node
;
2392 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2393 base. That will happen when the function is called. */
2394 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2396 else if (TREE_CODE (member
) == CONST_DECL
)
2398 /* The member is an enumerator. */
2400 /* If OBJECT has side-effects, they are supposed to occur. */
2401 if (TREE_SIDE_EFFECTS (object
))
2402 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2407 if (complain
& tf_error
)
2408 error ("invalid use of %qD", member
);
2409 return error_mark_node
;
2412 if (!preserve_reference
)
2415 If E2 is declared to have type "reference to T", then ... the
2416 type of E1.E2 is T. */
2417 result
= convert_from_reference (result
);
2422 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2423 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2426 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2428 tree object_type
= TREE_TYPE (object
);
2429 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2432 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2434 error ("qualified type %qT does not match destructor name ~%qT",
2436 return error_mark_node
;
2438 if (TREE_CODE (dtor_type
) == IDENTIFIER_NODE
)
2440 /* In a template, names we can't find a match for are still accepted
2441 destructor names, and we check them here. */
2442 if (check_dtor_name (object_type
, dtor_type
))
2443 dtor_type
= object_type
;
2446 error ("object type %qT does not match destructor name ~%qT",
2447 object_type
, dtor_type
);
2448 return error_mark_node
;
2452 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2454 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2455 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2456 return error_mark_node
;
2458 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2459 /*protect=*/1, /*want_type=*/false);
2460 expr
= (adjust_result_of_qualified_name_lookup
2461 (expr
, dtor_type
, object_type
));
2465 /* An expression of the form "A::template B" has been resolved to
2466 DECL. Issue a diagnostic if B is not a template or template
2470 check_template_keyword (tree decl
)
2472 /* The standard says:
2476 If a name prefixed by the keyword template is not a member
2477 template, the program is ill-formed.
2479 DR 228 removed the restriction that the template be a member
2482 DR 96, if accepted would add the further restriction that explicit
2483 template arguments must be provided if the template keyword is
2484 used, but, as of 2005-10-16, that DR is still in "drafting". If
2485 this DR is accepted, then the semantic checks here can be
2486 simplified, as the entity named must in fact be a template
2487 specialization, rather than, as at present, a set of overloaded
2488 functions containing at least one template function. */
2489 if (TREE_CODE (decl
) != TEMPLATE_DECL
2490 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2492 if (!is_overloaded_fn (decl
))
2493 permerror (input_location
, "%qD is not a template", decl
);
2498 if (BASELINK_P (fns
))
2499 fns
= BASELINK_FUNCTIONS (fns
);
2502 tree fn
= OVL_CURRENT (fns
);
2503 if (TREE_CODE (fn
) == TEMPLATE_DECL
2504 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2506 if (TREE_CODE (fn
) == FUNCTION_DECL
2507 && DECL_USE_TEMPLATE (fn
)
2508 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2510 fns
= OVL_NEXT (fns
);
2513 permerror (input_location
, "%qD is not a template", decl
);
2518 /* This function is called by the parser to process a class member
2519 access expression of the form OBJECT.NAME. NAME is a node used by
2520 the parser to represent a name; it is not yet a DECL. It may,
2521 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2522 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2523 there is no reason to do the lookup twice, so the parser keeps the
2524 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2525 be a template via the use of the "A::template B" syntax. */
2528 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2529 tsubst_flags_t complain
)
2534 tree access_path
= NULL_TREE
;
2535 tree orig_object
= object
;
2536 tree orig_name
= name
;
2538 if (object
== error_mark_node
|| name
== error_mark_node
)
2539 return error_mark_node
;
2541 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2542 if (!objc_is_public (object
, name
))
2543 return error_mark_node
;
2545 object_type
= TREE_TYPE (object
);
2547 if (processing_template_decl
)
2549 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2550 dependent_type_p (object_type
)
2551 /* If NAME is just an IDENTIFIER_NODE, then the expression
2553 || TREE_CODE (object
) == IDENTIFIER_NODE
2554 /* If NAME is "f<args>", where either 'f' or 'args' is
2555 dependent, then the expression is dependent. */
2556 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2557 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2558 TREE_OPERAND (name
, 1)))
2559 /* If NAME is "T::X" where "T" is dependent, then the
2560 expression is dependent. */
2561 || (TREE_CODE (name
) == SCOPE_REF
2562 && TYPE_P (TREE_OPERAND (name
, 0))
2563 && dependent_type_p (TREE_OPERAND (name
, 0))))
2564 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2565 object
= build_non_dependent_expr (object
);
2570 The type of the first expression shall be "class object" (of a
2572 if (!currently_open_class (object_type
)
2573 && !complete_type_or_else (object_type
, object
))
2574 return error_mark_node
;
2575 if (!CLASS_TYPE_P (object_type
))
2577 if (complain
& tf_error
)
2578 error ("request for member %qD in %qE, which is of non-class type %qT",
2579 name
, object
, object_type
);
2580 return error_mark_node
;
2583 if (BASELINK_P (name
))
2584 /* A member function that has already been looked up. */
2588 bool is_template_id
= false;
2589 tree template_args
= NULL_TREE
;
2592 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2594 is_template_id
= true;
2595 template_args
= TREE_OPERAND (name
, 1);
2596 name
= TREE_OPERAND (name
, 0);
2598 if (TREE_CODE (name
) == OVERLOAD
)
2599 name
= DECL_NAME (get_first_fn (name
));
2600 else if (DECL_P (name
))
2601 name
= DECL_NAME (name
);
2604 if (TREE_CODE (name
) == SCOPE_REF
)
2606 /* A qualified name. The qualifying class or namespace `S'
2607 has already been looked up; it is either a TYPE or a
2609 scope
= TREE_OPERAND (name
, 0);
2610 name
= TREE_OPERAND (name
, 1);
2612 /* If SCOPE is a namespace, then the qualified name does not
2613 name a member of OBJECT_TYPE. */
2614 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2616 if (complain
& tf_error
)
2617 error ("%<%D::%D%> is not a member of %qT",
2618 scope
, name
, object_type
);
2619 return error_mark_node
;
2622 gcc_assert (CLASS_TYPE_P (scope
));
2623 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2624 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2626 if (constructor_name_p (name
, scope
))
2628 if (complain
& tf_error
)
2629 error ("cannot call constructor %<%T::%D%> directly",
2631 return error_mark_node
;
2634 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2635 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2636 if (access_path
== error_mark_node
)
2637 return error_mark_node
;
2640 if (complain
& tf_error
)
2641 error ("%qT is not a base of %qT", scope
, object_type
);
2642 return error_mark_node
;
2648 access_path
= object_type
;
2651 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2652 member
= lookup_destructor (object
, scope
, name
);
2655 /* Look up the member. */
2656 member
= lookup_member (access_path
, name
, /*protect=*/1,
2657 /*want_type=*/false);
2658 if (member
== NULL_TREE
)
2660 if (complain
& tf_error
)
2661 error ("%qD has no member named %qE", object_type
, name
);
2662 return error_mark_node
;
2664 if (member
== error_mark_node
)
2665 return error_mark_node
;
2670 tree templ
= member
;
2672 if (BASELINK_P (templ
))
2673 templ
= lookup_template_function (templ
, template_args
);
2676 if (complain
& tf_error
)
2677 error ("%qD is not a member template function", name
);
2678 return error_mark_node
;
2683 if (TREE_DEPRECATED (member
))
2684 warn_deprecated_use (member
, NULL_TREE
);
2687 check_template_keyword (member
);
2689 expr
= build_class_member_access_expr (object
, member
, access_path
,
2690 /*preserve_reference=*/false,
2692 if (processing_template_decl
&& expr
!= error_mark_node
)
2694 if (BASELINK_P (member
))
2696 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2697 BASELINK_QUALIFIED_P (member
) = 1;
2700 return build_min_non_dep (COMPONENT_REF
, expr
,
2701 orig_object
, orig_name
,
2708 /* Return an expression for the MEMBER_NAME field in the internal
2709 representation of PTRMEM, a pointer-to-member function. (Each
2710 pointer-to-member function type gets its own RECORD_TYPE so it is
2711 more convenient to access the fields by name than by FIELD_DECL.)
2712 This routine converts the NAME to a FIELD_DECL and then creates the
2713 node for the complete expression. */
2716 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2722 /* This code is a stripped down version of
2723 build_class_member_access_expr. It does not work to use that
2724 routine directly because it expects the object to be of class
2726 ptrmem_type
= TREE_TYPE (ptrmem
);
2727 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2728 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2729 /*want_type=*/false);
2730 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2731 cp_type_quals (ptrmem_type
));
2732 return fold_build3_loc (input_location
,
2733 COMPONENT_REF
, member_type
,
2734 ptrmem
, member
, NULL_TREE
);
2737 /* Given an expression PTR for a pointer, return an expression
2738 for the value pointed to.
2739 ERRORSTRING is the name of the operator to appear in error messages.
2741 This function may need to overload OPERATOR_FNNAME.
2742 Must also handle REFERENCE_TYPEs for C++. */
2745 build_x_indirect_ref (tree expr
, ref_operator errorstring
,
2746 tsubst_flags_t complain
)
2748 tree orig_expr
= expr
;
2751 if (processing_template_decl
)
2753 /* Retain the type if we know the operand is a pointer so that
2754 describable_type doesn't make auto deduction break. */
2755 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2756 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2757 if (type_dependent_expression_p (expr
))
2758 return build_min_nt (INDIRECT_REF
, expr
);
2759 expr
= build_non_dependent_expr (expr
);
2762 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2763 NULL_TREE
, /*overloaded_p=*/NULL
, complain
);
2765 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2767 if (processing_template_decl
&& rval
!= error_mark_node
)
2768 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2773 /* Helper function called from c-common. */
2775 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2776 tree ptr
, ref_operator errorstring
)
2778 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2782 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2783 tsubst_flags_t complain
)
2787 if (ptr
== error_mark_node
)
2788 return error_mark_node
;
2790 if (ptr
== current_class_ptr
)
2791 return current_class_ref
;
2793 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2794 ? ptr
: decay_conversion (ptr
));
2795 type
= TREE_TYPE (pointer
);
2797 if (POINTER_TYPE_P (type
))
2801 If the type of the expression is "pointer to T," the type
2802 of the result is "T." */
2803 tree t
= TREE_TYPE (type
);
2805 if (CONVERT_EXPR_P (ptr
)
2806 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2808 /* If a warning is issued, mark it to avoid duplicates from
2809 the backend. This only needs to be done at
2810 warn_strict_aliasing > 2. */
2811 if (warn_strict_aliasing
> 2)
2812 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2813 type
, TREE_OPERAND (ptr
, 0)))
2814 TREE_NO_WARNING (ptr
) = 1;
2817 if (VOID_TYPE_P (t
))
2819 /* A pointer to incomplete type (other than cv void) can be
2820 dereferenced [expr.unary.op]/1 */
2821 if (complain
& tf_error
)
2822 error ("%qT is not a pointer-to-object type", type
);
2823 return error_mark_node
;
2825 else if (TREE_CODE (pointer
) == ADDR_EXPR
2826 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2827 /* The POINTER was something like `&x'. We simplify `*&x' to
2829 return TREE_OPERAND (pointer
, 0);
2832 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2834 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2835 so that we get the proper error message if the result is used
2836 to assign to. Also, &* is supposed to be a no-op. */
2837 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2838 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2839 TREE_SIDE_EFFECTS (ref
)
2840 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2844 else if (!(complain
& tf_error
))
2845 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2847 /* `pointer' won't be an error_mark_node if we were given a
2848 pointer to member, so it's cool to check for this here. */
2849 else if (TYPE_PTR_TO_MEMBER_P (type
))
2850 switch (errorstring
)
2852 case RO_ARRAY_INDEXING
:
2853 error ("invalid use of array indexing on pointer to member");
2856 error ("invalid use of unary %<*%> on pointer to member");
2858 case RO_IMPLICIT_CONVERSION
:
2859 error ("invalid use of implicit conversion on pointer to member");
2864 else if (pointer
!= error_mark_node
)
2865 switch (errorstring
)
2868 error ("invalid type argument");
2870 case RO_ARRAY_INDEXING
:
2871 error ("invalid type argument of array indexing");
2874 error ("invalid type argument of unary %<*%>");
2876 case RO_IMPLICIT_CONVERSION
:
2877 error ("invalid type argument of implicit conversion");
2882 return error_mark_node
;
2885 /* This handles expressions of the form "a[i]", which denotes
2888 This is logically equivalent in C to *(a+i), but we may do it differently.
2889 If A is a variable or a member, we generate a primitive ARRAY_REF.
2890 This avoids forcing the array out of registers, and can work on
2891 arrays that are not lvalues (for example, members of structures returned
2894 If INDEX is of some user-defined type, it must be converted to
2895 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2896 will inherit the type of the array, which will be some pointer type.
2898 LOC is the location to use in building the array reference. */
2901 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
2902 tsubst_flags_t complain
)
2908 if (complain
& tf_error
)
2909 error_at (loc
, "subscript missing in array reference");
2910 return error_mark_node
;
2913 if (TREE_TYPE (array
) == error_mark_node
2914 || TREE_TYPE (idx
) == error_mark_node
)
2915 return error_mark_node
;
2917 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2919 switch (TREE_CODE (array
))
2923 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2925 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2926 TREE_OPERAND (array
, 0), value
);
2927 SET_EXPR_LOCATION (ret
, loc
);
2932 ret
= build_conditional_expr
2933 (TREE_OPERAND (array
, 0),
2934 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2936 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
2938 tf_warning_or_error
);
2939 protected_set_expr_location (ret
, loc
);
2946 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2950 warn_array_subscript_with_type_char (idx
);
2952 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2954 if (complain
& tf_error
)
2955 error_at (loc
, "array subscript is not an integer");
2956 return error_mark_node
;
2959 /* Apply integral promotions *after* noticing character types.
2960 (It is unclear why we do these promotions -- the standard
2961 does not say that we should. In fact, the natural thing would
2962 seem to be to convert IDX to ptrdiff_t; we're performing
2963 pointer arithmetic.) */
2964 idx
= perform_integral_promotions (idx
);
2966 /* An array that is indexed by a non-constant
2967 cannot be stored in a register; we must be able to do
2968 address arithmetic on its address.
2969 Likewise an array of elements of variable size. */
2970 if (TREE_CODE (idx
) != INTEGER_CST
2971 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2972 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2975 if (!cxx_mark_addressable (array
))
2976 return error_mark_node
;
2979 /* An array that is indexed by a constant value which is not within
2980 the array bounds cannot be stored in a register either; because we
2981 would get a crash in store_bit_field/extract_bit_field when trying
2982 to access a non-existent part of the register. */
2983 if (TREE_CODE (idx
) == INTEGER_CST
2984 && TYPE_DOMAIN (TREE_TYPE (array
))
2985 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
2987 if (!cxx_mark_addressable (array
))
2988 return error_mark_node
;
2991 if (!lvalue_p (array
) && (complain
& tf_error
))
2992 pedwarn (loc
, OPT_pedantic
,
2993 "ISO C++ forbids subscripting non-lvalue array");
2995 /* Note in C++ it is valid to subscript a `register' array, since
2996 it is valid to take the address of something with that
2997 storage specification. */
3001 while (TREE_CODE (foo
) == COMPONENT_REF
)
3002 foo
= TREE_OPERAND (foo
, 0);
3003 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
)
3004 && (complain
& tf_warning
))
3005 warning_at (loc
, OPT_Wextra
,
3006 "subscripting array declared %<register%>");
3009 type
= TREE_TYPE (TREE_TYPE (array
));
3010 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
3011 /* Array ref is const/volatile if the array elements are
3012 or if the array is.. */
3013 TREE_READONLY (rval
)
3014 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
3015 TREE_SIDE_EFFECTS (rval
)
3016 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
3017 TREE_THIS_VOLATILE (rval
)
3018 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
3019 ret
= require_complete_type (fold_if_not_in_template (rval
));
3020 protected_set_expr_location (ret
, loc
);
3025 tree ar
= default_conversion (array
);
3026 tree ind
= default_conversion (idx
);
3028 /* Put the integer in IND to simplify error checking. */
3029 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
3036 if (ar
== error_mark_node
)
3039 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
3041 if (complain
& tf_error
)
3042 error_at (loc
, "subscripted value is neither array nor pointer");
3043 return error_mark_node
;
3045 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
3047 if (complain
& tf_error
)
3048 error_at (loc
, "array subscript is not an integer");
3049 return error_mark_node
;
3052 warn_array_subscript_with_type_char (idx
);
3054 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
3059 protected_set_expr_location (ret
, loc
);
3064 /* Entry point for Obj-C++. */
3067 build_array_ref (location_t loc
, tree array
, tree idx
)
3069 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
3072 /* Resolve a pointer to member function. INSTANCE is the object
3073 instance to use, if the member points to a virtual member.
3075 This used to avoid checking for virtual functions if basetype
3076 has no virtual functions, according to an earlier ANSI draft.
3077 With the final ISO C++ rules, such an optimization is
3078 incorrect: A pointer to a derived member can be static_cast
3079 to pointer-to-base-member, as long as the dynamic object
3080 later has the right member. */
3083 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
3085 if (TREE_CODE (function
) == OFFSET_REF
)
3086 function
= TREE_OPERAND (function
, 1);
3088 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3090 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
3091 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3093 tree instance_ptr
= *instance_ptrptr
;
3094 tree instance_save_expr
= 0;
3095 if (instance_ptr
== error_mark_node
)
3097 if (TREE_CODE (function
) == PTRMEM_CST
)
3099 /* Extracting the function address from a pmf is only
3100 allowed with -Wno-pmf-conversions. It only works for
3102 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
3103 e1
= convert (fntype
, e1
);
3108 error ("object missing in use of %qE", function
);
3109 return error_mark_node
;
3113 if (TREE_SIDE_EFFECTS (instance_ptr
))
3114 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3116 if (TREE_SIDE_EFFECTS (function
))
3117 function
= save_expr (function
);
3119 /* Start by extracting all the information from the PMF itself. */
3120 e3
= pfn_from_ptrmemfunc (function
);
3121 delta
= delta_from_ptrmemfunc (function
);
3122 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3123 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3125 case ptrmemfunc_vbit_in_pfn
:
3126 e1
= cp_build_binary_op (input_location
,
3127 BIT_AND_EXPR
, idx
, integer_one_node
,
3128 tf_warning_or_error
);
3129 idx
= cp_build_binary_op (input_location
,
3130 MINUS_EXPR
, idx
, integer_one_node
,
3131 tf_warning_or_error
);
3134 case ptrmemfunc_vbit_in_delta
:
3135 e1
= cp_build_binary_op (input_location
,
3136 BIT_AND_EXPR
, delta
, integer_one_node
,
3137 tf_warning_or_error
);
3138 delta
= cp_build_binary_op (input_location
,
3139 RSHIFT_EXPR
, delta
, integer_one_node
,
3140 tf_warning_or_error
);
3147 /* Convert down to the right base before using the instance. A
3148 special case is that in a pointer to member of class C, C may
3149 be incomplete. In that case, the function will of course be
3150 a member of C, and no conversion is required. In fact,
3151 lookup_base will fail in that case, because incomplete
3152 classes do not have BINFOs. */
3153 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3154 if (!same_type_ignoring_top_level_qualifiers_p
3155 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3157 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3158 basetype
, ba_check
, NULL
);
3159 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3161 if (instance_ptr
== error_mark_node
)
3162 return error_mark_node
;
3164 /* ...and then the delta in the PMF. */
3165 instance_ptr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (instance_ptr
),
3166 instance_ptr
, fold_convert (sizetype
, delta
));
3168 /* Hand back the adjusted 'this' argument to our caller. */
3169 *instance_ptrptr
= instance_ptr
;
3171 /* Next extract the vtable pointer from the object. */
3172 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3174 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, tf_warning_or_error
);
3175 /* If the object is not dynamic the access invokes undefined
3176 behavior. As it is not executed in this case silence the
3177 spurious warnings it may provoke. */
3178 TREE_NO_WARNING (vtbl
) = 1;
3180 /* Finally, extract the function pointer from the vtable. */
3181 e2
= fold_build2_loc (input_location
,
3182 POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
,
3183 fold_convert (sizetype
, idx
));
3184 e2
= cp_build_indirect_ref (e2
, RO_NULL
, tf_warning_or_error
);
3185 TREE_CONSTANT (e2
) = 1;
3187 /* When using function descriptors, the address of the
3188 vtable entry is treated as a function pointer. */
3189 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3190 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3191 cp_build_unary_op (ADDR_EXPR
, e2
, /*noconvert=*/1,
3192 tf_warning_or_error
));
3194 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3195 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
3197 /* Make sure this doesn't get evaluated first inside one of the
3198 branches of the COND_EXPR. */
3199 if (instance_save_expr
)
3200 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3201 instance_save_expr
, e1
);
3208 /* Used by the C-common bits. */
3210 build_function_call (location_t loc ATTRIBUTE_UNUSED
,
3211 tree function
, tree params
)
3213 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3216 /* Used by the C-common bits. */
3218 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED
,
3219 tree function
, VEC(tree
,gc
) *params
,
3220 VEC(tree
,gc
) *origtypes ATTRIBUTE_UNUSED
)
3222 VEC(tree
,gc
) *orig_params
= params
;
3223 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3224 tf_warning_or_error
);
3226 /* cp_build_function_call_vec can reallocate PARAMS by adding
3227 default arguments. That should never happen here. Verify
3229 gcc_assert (params
== orig_params
);
3234 /* Build a function call using a tree list of arguments. */
3237 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3242 vec
= make_tree_vector ();
3243 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3244 VEC_safe_push (tree
, gc
, vec
, TREE_VALUE (params
));
3245 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3246 release_tree_vector (vec
);
3250 /* Build a function call using varargs. */
3253 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3259 vec
= make_tree_vector ();
3260 va_start (args
, complain
);
3261 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3262 VEC_safe_push (tree
, gc
, vec
, t
);
3264 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3265 release_tree_vector (vec
);
3269 /* Build a function call using a vector of arguments. PARAMS may be
3270 NULL if there are no parameters. This changes the contents of
3274 cp_build_function_call_vec (tree function
, VEC(tree
,gc
) **params
,
3275 tsubst_flags_t complain
)
3277 tree fntype
, fndecl
;
3279 tree original
= function
;
3283 VEC(tree
,gc
) *allocated
= NULL
;
3286 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3287 expressions, like those used for ObjC messenger dispatches. */
3288 if (params
!= NULL
&& !VEC_empty (tree
, *params
))
3289 function
= objc_rewrite_function_call (function
,
3290 VEC_index (tree
, *params
, 0));
3292 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3293 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3294 if (TREE_CODE (function
) == NOP_EXPR
3295 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3296 function
= TREE_OPERAND (function
, 0);
3298 if (TREE_CODE (function
) == FUNCTION_DECL
)
3300 mark_used (function
);
3303 /* Convert anything with function type to a pointer-to-function. */
3304 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
3305 pedwarn (input_location
, OPT_pedantic
,
3306 "ISO C++ forbids calling %<::main%> from within program");
3308 function
= build_addr_func (function
);
3314 function
= build_addr_func (function
);
3317 if (function
== error_mark_node
)
3318 return error_mark_node
;
3320 fntype
= TREE_TYPE (function
);
3322 if (TYPE_PTRMEMFUNC_P (fntype
))
3324 if (complain
& tf_error
)
3325 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3326 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3327 original
, original
);
3328 return error_mark_node
;
3331 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
3332 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3334 if (!((TREE_CODE (fntype
) == POINTER_TYPE
3335 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
3337 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3339 if (complain
& tf_error
)
3340 error ("%qE cannot be used as a function", original
);
3341 return error_mark_node
;
3344 /* fntype now gets the type of function pointed to. */
3345 fntype
= TREE_TYPE (fntype
);
3346 parm_types
= TYPE_ARG_TYPES (fntype
);
3350 allocated
= make_tree_vector ();
3351 params
= &allocated
;
3354 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3357 return error_mark_node
;
3359 argarray
= VEC_address (tree
, *params
);
3361 /* Check for errors in format strings and inappropriately
3363 check_function_arguments (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
,
3366 ret
= build_cxx_call (function
, nargs
, argarray
);
3368 if (allocated
!= NULL
)
3369 release_tree_vector (allocated
);
3374 /* Subroutine of convert_arguments.
3375 Warn about wrong number of args are genereted. */
3378 warn_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3382 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3384 if (DECL_NAME (fndecl
) == NULL_TREE
3385 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3388 ? G_("too many arguments to constructor %q#D")
3389 : G_("too few arguments to constructor %q#D"),
3394 ? G_("too many arguments to member function %q#D")
3395 : G_("too few arguments to member function %q#D"),
3401 ? G_("too many arguments to function %q#D")
3402 : G_("too few arguments to function %q#D"),
3404 inform (DECL_SOURCE_LOCATION (fndecl
),
3408 error_at (loc
, too_many_p
? G_("too many arguments to function")
3409 : G_("too few arguments to function"));
3412 /* Convert the actual parameter expressions in the list VALUES to the
3413 types in the list TYPELIST. The converted expressions are stored
3414 back in the VALUES vector.
3415 If parmdecls is exhausted, or when an element has NULL as its type,
3416 perform the default conversions.
3418 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3420 This is also where warnings about wrong number of args are generated.
3422 Returns the actual number of arguments processed (which might be less
3423 than the length of the vector), or -1 on error.
3425 In C++, unspecified trailing parameters can be filled in with their
3426 default arguments, if such were specified. Do so here. */
3429 convert_arguments (tree typelist
, VEC(tree
,gc
) **values
, tree fndecl
,
3430 int flags
, tsubst_flags_t complain
)
3435 /* Argument passing is always copy-initialization. */
3436 flags
|= LOOKUP_ONLYCONVERTING
;
3438 for (i
= 0, typetail
= typelist
;
3439 i
< VEC_length (tree
, *values
);
3442 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3443 tree val
= VEC_index (tree
, *values
, i
);
3445 if (val
== error_mark_node
|| type
== error_mark_node
)
3448 if (type
== void_type_node
)
3450 if (complain
& tf_error
)
3452 warn_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3459 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3460 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3461 if (TREE_CODE (val
) == NOP_EXPR
3462 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3463 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3464 val
= TREE_OPERAND (val
, 0);
3466 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3468 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3469 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3470 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3471 val
= decay_conversion (val
);
3474 if (val
== error_mark_node
)
3479 /* Formal parm type is specified by a function prototype. */
3482 if (!COMPLETE_TYPE_P (complete_type (type
)))
3484 if (complain
& tf_error
)
3487 error ("parameter %P of %qD has incomplete type %qT",
3490 error ("parameter %P has incomplete type %qT", i
, type
);
3492 parmval
= error_mark_node
;
3496 parmval
= convert_for_initialization
3497 (NULL_TREE
, type
, val
, flags
,
3498 ICR_ARGPASS
, fndecl
, i
, complain
);
3499 parmval
= convert_for_arg_passing (type
, parmval
);
3502 if (parmval
== error_mark_node
)
3505 VEC_replace (tree
, *values
, i
, parmval
);
3509 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3510 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3511 /* Don't do ellipsis conversion for __built_in_constant_p
3512 as this will result in spurious errors for non-trivial
3514 val
= require_complete_type (val
);
3516 val
= convert_arg_to_ellipsis (val
);
3518 VEC_replace (tree
, *values
, i
, val
);
3522 typetail
= TREE_CHAIN (typetail
);
3525 if (typetail
!= 0 && typetail
!= void_list_node
)
3527 /* See if there are default arguments that can be used. Because
3528 we hold default arguments in the FUNCTION_TYPE (which is so
3529 wrong), we can see default parameters here from deduced
3530 contexts (and via typeof) for indirect function calls.
3531 Fortunately we know whether we have a function decl to
3532 provide default arguments in a language conformant
3534 if (fndecl
&& TREE_PURPOSE (typetail
)
3535 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3537 for (; typetail
!= void_list_node
; ++i
)
3540 = convert_default_arg (TREE_VALUE (typetail
),
3541 TREE_PURPOSE (typetail
),
3544 if (parmval
== error_mark_node
)
3547 VEC_safe_push (tree
, gc
, *values
, parmval
);
3548 typetail
= TREE_CHAIN (typetail
);
3549 /* ends with `...'. */
3550 if (typetail
== NULL_TREE
)
3556 if (complain
& tf_error
)
3557 warn_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3565 /* Build a binary-operation expression, after performing default
3566 conversions on the operands. CODE is the kind of expression to
3567 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3568 are the tree codes which correspond to ARG1 and ARG2 when issuing
3569 warnings about possibly misplaced parentheses. They may differ
3570 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3571 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3572 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3573 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3574 ARG2_CODE as ERROR_MARK. */
3577 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3578 tree arg2
, enum tree_code arg2_code
, bool *overloaded_p
,
3579 tsubst_flags_t complain
)
3588 if (processing_template_decl
)
3590 if (type_dependent_expression_p (arg1
)
3591 || type_dependent_expression_p (arg2
))
3592 return build_min_nt (code
, arg1
, arg2
);
3593 arg1
= build_non_dependent_expr (arg1
);
3594 arg2
= build_non_dependent_expr (arg2
);
3597 if (code
== DOTSTAR_EXPR
)
3598 expr
= build_m_component_ref (arg1
, arg2
);
3600 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3601 overloaded_p
, complain
);
3603 /* Check for cases such as x+y<<z which users are likely to
3604 misinterpret. But don't warn about obj << x + y, since that is a
3605 common idiom for I/O. */
3606 if (warn_parentheses
3607 && (complain
& tf_warning
)
3608 && !processing_template_decl
3609 && !error_operand_p (arg1
)
3610 && !error_operand_p (arg2
)
3611 && (code
!= LSHIFT_EXPR
3612 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3613 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3615 if (processing_template_decl
&& expr
!= error_mark_node
)
3616 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3621 /* Build and return an ARRAY_REF expression. */
3624 build_x_array_ref (tree arg1
, tree arg2
, tsubst_flags_t complain
)
3626 tree orig_arg1
= arg1
;
3627 tree orig_arg2
= arg2
;
3630 if (processing_template_decl
)
3632 if (type_dependent_expression_p (arg1
)
3633 || type_dependent_expression_p (arg2
))
3634 return build_min_nt (ARRAY_REF
, arg1
, arg2
,
3635 NULL_TREE
, NULL_TREE
);
3636 arg1
= build_non_dependent_expr (arg1
);
3637 arg2
= build_non_dependent_expr (arg2
);
3640 expr
= build_new_op (ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3641 /*overloaded_p=*/NULL
, complain
);
3643 if (processing_template_decl
&& expr
!= error_mark_node
)
3644 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3645 NULL_TREE
, NULL_TREE
);
3649 /* For the c-common bits. */
3651 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3652 int convert_p ATTRIBUTE_UNUSED
)
3654 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3658 /* Build a binary-operation expression without default conversions.
3659 CODE is the kind of expression to build.
3660 LOCATION is the location_t of the operator in the source code.
3661 This function differs from `build' in several ways:
3662 the data type of the result is computed and recorded in it,
3663 warnings are generated if arg data types are invalid,
3664 special handling for addition and subtraction of pointers is known,
3665 and some optimization is done (operations on narrow ints
3666 are done in the narrower type when that gives the same result).
3667 Constant folding is also done before the result is returned.
3669 Note that the operands will never have enumeral types
3670 because either they have just had the default conversions performed
3671 or they have both just been converted to some other type in which
3672 the arithmetic is to be done.
3674 C++: must do special pointer arithmetic when implementing
3675 multiple inheritance, and deal with pointer to member functions. */
3678 cp_build_binary_op (location_t location
,
3679 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3680 tsubst_flags_t complain
)
3683 enum tree_code code0
, code1
;
3685 const char *invalid_op_diag
;
3687 /* Expression code to give to the expression when it is built.
3688 Normally this is CODE, which is what the caller asked for,
3689 but in some special cases we change it. */
3690 enum tree_code resultcode
= code
;
3692 /* Data type in which the computation is to be performed.
3693 In the simplest cases this is the common type of the arguments. */
3694 tree result_type
= NULL
;
3696 /* Nonzero means operands have already been type-converted
3697 in whatever way is necessary.
3698 Zero means they need to be converted to RESULT_TYPE. */
3701 /* Nonzero means create the expression with this type, rather than
3703 tree build_type
= 0;
3705 /* Nonzero means after finally constructing the expression
3706 convert it to this type. */
3707 tree final_type
= 0;
3711 /* Nonzero if this is an operation like MIN or MAX which can
3712 safely be computed in short if both args are promoted shorts.
3713 Also implies COMMON.
3714 -1 indicates a bitwise operation; this makes a difference
3715 in the exact conditions for when it is safe to do the operation
3716 in a narrower mode. */
3719 /* Nonzero if this is a comparison operation;
3720 if both args are promoted shorts, compare the original shorts.
3721 Also implies COMMON. */
3722 int short_compare
= 0;
3724 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3727 /* True if both operands have arithmetic type. */
3728 bool arithmetic_types_p
;
3730 /* Apply default conversions. */
3734 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3735 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3736 || code
== TRUTH_XOR_EXPR
)
3738 if (!really_overloaded_fn (op0
))
3739 op0
= decay_conversion (op0
);
3740 if (!really_overloaded_fn (op1
))
3741 op1
= decay_conversion (op1
);
3745 if (!really_overloaded_fn (op0
))
3746 op0
= default_conversion (op0
);
3747 if (!really_overloaded_fn (op1
))
3748 op1
= default_conversion (op1
);
3751 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3752 STRIP_TYPE_NOPS (op0
);
3753 STRIP_TYPE_NOPS (op1
);
3755 /* DTRT if one side is an overloaded function, but complain about it. */
3756 if (type_unknown_p (op0
))
3758 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3759 if (t
!= error_mark_node
)
3761 if (complain
& tf_error
)
3762 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3767 if (type_unknown_p (op1
))
3769 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3770 if (t
!= error_mark_node
)
3772 if (complain
& tf_error
)
3773 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3779 type0
= TREE_TYPE (op0
);
3780 type1
= TREE_TYPE (op1
);
3782 /* The expression codes of the data types of the arguments tell us
3783 whether the arguments are integers, floating, pointers, etc. */
3784 code0
= TREE_CODE (type0
);
3785 code1
= TREE_CODE (type1
);
3787 /* If an error was already reported for one of the arguments,
3788 avoid reporting another error. */
3789 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3790 return error_mark_node
;
3792 if ((invalid_op_diag
3793 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3795 error (invalid_op_diag
);
3796 return error_mark_node
;
3799 /* Issue warnings about peculiar, but valid, uses of NULL. */
3800 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3801 /* It's reasonable to use pointer values as operands of &&
3802 and ||, so NULL is no exception. */
3803 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3804 && ( /* Both are NULL (or 0) and the operation was not a
3805 comparison or a pointer subtraction. */
3806 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3807 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
3808 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3809 || (!null_ptr_cst_p (orig_op0
)
3810 && !TYPE_PTR_P (type0
) && !TYPE_PTR_TO_MEMBER_P (type0
))
3811 || (!null_ptr_cst_p (orig_op1
)
3812 && !TYPE_PTR_P (type1
) && !TYPE_PTR_TO_MEMBER_P (type1
)))
3813 && (complain
& tf_warning
))
3814 /* Some sort of arithmetic operation involving NULL was
3816 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3821 /* Subtraction of two similar pointers.
3822 We must subtract them as integers, then divide by object size. */
3823 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3824 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3826 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3827 /* In all other cases except pointer - int, the usual arithmetic
3829 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3834 /* The pointer - int case is just like pointer + int; fall
3837 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3838 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3842 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3843 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3844 if (processing_template_decl
)
3846 result_type
= TREE_TYPE (ptr_operand
);
3849 return cp_pointer_int_sum (code
,
3860 case TRUNC_DIV_EXPR
:
3862 case FLOOR_DIV_EXPR
:
3863 case ROUND_DIV_EXPR
:
3864 case EXACT_DIV_EXPR
:
3865 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3866 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3867 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3868 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3870 enum tree_code tcode0
= code0
, tcode1
= code1
;
3872 warn_for_div_by_zero (location
, op1
);
3874 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3875 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3876 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3877 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3879 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3880 resultcode
= RDIV_EXPR
;
3882 /* When dividing two signed integers, we have to promote to int.
3883 unless we divide by a constant != -1. Note that default
3884 conversion will have been performed on the operands at this
3885 point, so we have to dig out the original type to find out if
3887 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3888 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3889 || (TREE_CODE (op1
) == INTEGER_CST
3890 && ! integer_all_onesp (op1
)));
3899 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3900 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3901 && !VECTOR_FLOAT_TYPE_P (type0
)
3902 && !VECTOR_FLOAT_TYPE_P (type1
)))
3906 case TRUNC_MOD_EXPR
:
3907 case FLOOR_MOD_EXPR
:
3908 warn_for_div_by_zero (location
, op1
);
3910 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3911 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
3912 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
3914 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3916 /* Although it would be tempting to shorten always here, that loses
3917 on some targets, since the modulo instruction is undefined if the
3918 quotient can't be represented in the computation mode. We shorten
3919 only if unsigned or if dividing by something we know != -1. */
3920 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3921 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3922 || (TREE_CODE (op1
) == INTEGER_CST
3923 && ! integer_all_onesp (op1
)));
3928 case TRUTH_ANDIF_EXPR
:
3929 case TRUTH_ORIF_EXPR
:
3930 case TRUTH_AND_EXPR
:
3932 result_type
= boolean_type_node
;
3935 /* Shift operations: result has same type as first operand;
3936 always convert second operand to int.
3937 Also set SHORT_SHIFT if shifting rightward. */
3940 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3942 result_type
= type0
;
3943 if (TREE_CODE (op1
) == INTEGER_CST
)
3945 if (tree_int_cst_lt (op1
, integer_zero_node
))
3947 if ((complain
& tf_warning
)
3948 && c_inhibit_evaluation_warnings
== 0)
3949 warning (0, "right shift count is negative");
3953 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3954 && (complain
& tf_warning
)
3955 && c_inhibit_evaluation_warnings
== 0)
3956 warning (0, "right shift count >= width of type");
3959 /* Convert the shift-count to an integer, regardless of
3960 size of value being shifted. */
3961 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3962 op1
= cp_convert (integer_type_node
, op1
);
3963 /* Avoid converting op1 to result_type later. */
3969 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3971 result_type
= type0
;
3972 if (TREE_CODE (op1
) == INTEGER_CST
)
3974 if (tree_int_cst_lt (op1
, integer_zero_node
))
3976 if ((complain
& tf_warning
)
3977 && c_inhibit_evaluation_warnings
== 0)
3978 warning (0, "left shift count is negative");
3980 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3982 if ((complain
& tf_warning
)
3983 && c_inhibit_evaluation_warnings
== 0)
3984 warning (0, "left shift count >= width of type");
3987 /* Convert the shift-count to an integer, regardless of
3988 size of value being shifted. */
3989 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3990 op1
= cp_convert (integer_type_node
, op1
);
3991 /* Avoid converting op1 to result_type later. */
3998 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4000 result_type
= type0
;
4001 if (TREE_CODE (op1
) == INTEGER_CST
)
4003 if (tree_int_cst_lt (op1
, integer_zero_node
))
4005 if (complain
& tf_warning
)
4006 warning (0, (code
== LROTATE_EXPR
)
4007 ? G_("left rotate count is negative")
4008 : G_("right rotate count is negative"));
4010 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
4012 if (complain
& tf_warning
)
4013 warning (0, (code
== LROTATE_EXPR
)
4014 ? G_("left rotate count >= width of type")
4015 : G_("right rotate count >= width of type"));
4018 /* Convert the shift-count to an integer, regardless of
4019 size of value being shifted. */
4020 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
4021 op1
= cp_convert (integer_type_node
, op1
);
4027 if ((complain
& tf_warning
)
4028 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
4029 warning (OPT_Wfloat_equal
,
4030 "comparing floating point with == or != is unsafe");
4031 if ((complain
& tf_warning
)
4032 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
4033 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
4034 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4036 build_type
= boolean_type_node
;
4037 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4038 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
4039 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4040 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
4042 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4043 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
4044 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4045 CPO_COMPARISON
, complain
);
4046 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
4047 && null_ptr_cst_p (op1
))
4049 if (TREE_CODE (op0
) == ADDR_EXPR
4050 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
4052 if (complain
& tf_warning
)
4053 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4054 TREE_OPERAND (op0
, 0));
4056 result_type
= type0
;
4058 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
4059 && null_ptr_cst_p (op0
))
4061 if (TREE_CODE (op1
) == ADDR_EXPR
4062 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
4064 if (complain
& tf_warning
)
4065 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4066 TREE_OPERAND (op1
, 0));
4068 result_type
= type1
;
4070 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4071 /* One of the operands must be of nullptr_t type. */
4072 result_type
= TREE_TYPE (nullptr_node
);
4073 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4075 result_type
= type0
;
4076 if (complain
& tf_error
)
4077 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4079 return error_mark_node
;
4081 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4083 result_type
= type1
;
4084 if (complain
& tf_error
)
4085 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4087 return error_mark_node
;
4089 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
4091 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4092 == ptrmemfunc_vbit_in_delta
)
4094 tree pfn0
= pfn_from_ptrmemfunc (op0
);
4095 tree delta0
= delta_from_ptrmemfunc (op0
);
4096 tree e1
= cp_build_binary_op (location
,
4099 fold_convert (TREE_TYPE (pfn0
),
4102 tree e2
= cp_build_binary_op (location
,
4107 e2
= cp_build_binary_op (location
,
4108 EQ_EXPR
, e2
, integer_zero_node
,
4110 op0
= cp_build_binary_op (location
,
4111 TRUTH_ANDIF_EXPR
, e1
, e2
,
4113 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
4117 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4118 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
4120 result_type
= TREE_TYPE (op0
);
4122 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4123 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4124 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4127 /* E will be the final comparison. */
4129 /* E1 and E2 are for scratch. */
4137 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4138 CPO_COMPARISON
, complain
);
4140 if (!same_type_p (TREE_TYPE (op0
), type
))
4141 op0
= cp_convert_and_check (type
, op0
);
4142 if (!same_type_p (TREE_TYPE (op1
), type
))
4143 op1
= cp_convert_and_check (type
, op1
);
4145 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4146 return error_mark_node
;
4148 if (TREE_SIDE_EFFECTS (op0
))
4149 op0
= save_expr (op0
);
4150 if (TREE_SIDE_EFFECTS (op1
))
4151 op1
= save_expr (op1
);
4153 pfn0
= pfn_from_ptrmemfunc (op0
);
4154 pfn1
= pfn_from_ptrmemfunc (op1
);
4155 delta0
= delta_from_ptrmemfunc (op0
);
4156 delta1
= delta_from_ptrmemfunc (op1
);
4157 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4158 == ptrmemfunc_vbit_in_delta
)
4163 && ((op0.delta == op1.delta)
4164 || (!op0.pfn && op0.delta & 1 == 0
4165 && op1.delta & 1 == 0))
4167 The reason for the `!op0.pfn' bit is that a NULL
4168 pointer-to-member is any member with a zero PFN and
4169 LSB of the DELTA field is 0. */
4171 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4175 e1
= cp_build_binary_op (location
,
4176 EQ_EXPR
, e1
, integer_zero_node
,
4178 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4182 e2
= cp_build_binary_op (location
,
4183 EQ_EXPR
, e2
, integer_zero_node
,
4185 e1
= cp_build_binary_op (location
,
4186 TRUTH_ANDIF_EXPR
, e2
, e1
,
4188 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4190 fold_convert (TREE_TYPE (pfn0
),
4193 e2
= cp_build_binary_op (location
,
4194 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4195 e1
= cp_build_binary_op (location
,
4196 EQ_EXPR
, delta0
, delta1
, complain
);
4197 e1
= cp_build_binary_op (location
,
4198 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4205 && (!op0.pfn || op0.delta == op1.delta))
4207 The reason for the `!op0.pfn' bit is that a NULL
4208 pointer-to-member is any member with a zero PFN; the
4209 DELTA field is unspecified. */
4211 e1
= cp_build_binary_op (location
,
4212 EQ_EXPR
, delta0
, delta1
, complain
);
4213 e2
= cp_build_binary_op (location
,
4216 fold_convert (TREE_TYPE (pfn0
),
4219 e1
= cp_build_binary_op (location
,
4220 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4222 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4223 e
= cp_build_binary_op (location
,
4224 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4225 if (code
== EQ_EXPR
)
4227 return cp_build_binary_op (location
,
4228 EQ_EXPR
, e
, integer_zero_node
, complain
);
4232 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4233 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4235 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4236 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4244 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4245 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4247 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4248 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4249 CPO_COMPARISON
, complain
);
4256 if (TREE_CODE (orig_op0
) == STRING_CST
4257 || TREE_CODE (orig_op1
) == STRING_CST
)
4259 if (complain
& tf_warning
)
4260 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4263 build_type
= boolean_type_node
;
4264 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4265 || code0
== ENUMERAL_TYPE
)
4266 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4267 || code1
== ENUMERAL_TYPE
))
4269 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4270 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4271 CPO_COMPARISON
, complain
);
4272 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4273 result_type
= type0
;
4274 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4275 result_type
= type1
;
4276 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4277 /* One of the operands must be of nullptr_t type. */
4278 result_type
= TREE_TYPE (nullptr_node
);
4279 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4281 result_type
= type0
;
4282 if (complain
& tf_error
)
4283 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4285 return error_mark_node
;
4287 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4289 result_type
= type1
;
4290 if (complain
& tf_error
)
4291 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4293 return error_mark_node
;
4297 case UNORDERED_EXPR
:
4304 build_type
= integer_type_node
;
4305 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4307 if (complain
& tf_error
)
4308 error ("unordered comparison on non-floating point argument");
4309 return error_mark_node
;
4318 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4319 || code0
== ENUMERAL_TYPE
)
4320 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4321 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4322 arithmetic_types_p
= 1;
4325 arithmetic_types_p
= 0;
4326 /* Vector arithmetic is only allowed when both sides are vectors. */
4327 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4329 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4330 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4333 binary_op_error (location
, code
, type0
, type1
);
4334 return error_mark_node
;
4336 arithmetic_types_p
= 1;
4339 /* Determine the RESULT_TYPE, if it is not already known. */
4341 && arithmetic_types_p
4342 && (shorten
|| common
|| short_compare
))
4343 result_type
= cp_common_type (type0
, type1
);
4347 if (complain
& tf_error
)
4348 error ("invalid operands of types %qT and %qT to binary %qO",
4349 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4350 return error_mark_node
;
4353 /* If we're in a template, the only thing we need to know is the
4355 if (processing_template_decl
)
4357 /* Since the middle-end checks the type when doing a build2, we
4358 need to build the tree in pieces. This built tree will never
4359 get out of the front-end as we replace it when instantiating
4361 tree tmp
= build2 (resultcode
,
4362 build_type
? build_type
: result_type
,
4364 TREE_OPERAND (tmp
, 0) = op0
;
4368 if (arithmetic_types_p
)
4370 bool first_complex
= (code0
== COMPLEX_TYPE
);
4371 bool second_complex
= (code1
== COMPLEX_TYPE
);
4372 int none_complex
= (!first_complex
&& !second_complex
);
4374 /* Adapted from patch for c/24581. */
4375 if (first_complex
!= second_complex
4376 && (code
== PLUS_EXPR
4377 || code
== MINUS_EXPR
4378 || code
== MULT_EXPR
4379 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4380 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4381 && flag_signed_zeros
)
4383 /* An operation on mixed real/complex operands must be
4384 handled specially, but the language-independent code can
4385 more easily optimize the plain complex arithmetic if
4386 -fno-signed-zeros. */
4387 tree real_type
= TREE_TYPE (result_type
);
4391 if (TREE_TYPE (op0
) != result_type
)
4392 op0
= cp_convert_and_check (result_type
, op0
);
4393 if (TREE_TYPE (op1
) != real_type
)
4394 op1
= cp_convert_and_check (real_type
, op1
);
4398 if (TREE_TYPE (op0
) != real_type
)
4399 op0
= cp_convert_and_check (real_type
, op0
);
4400 if (TREE_TYPE (op1
) != result_type
)
4401 op1
= cp_convert_and_check (result_type
, op1
);
4403 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4404 return error_mark_node
;
4407 op0
= save_expr (op0
);
4408 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4409 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4413 case TRUNC_DIV_EXPR
:
4414 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4418 real
= build2 (resultcode
, real_type
, real
, op1
);
4426 op1
= save_expr (op1
);
4427 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4428 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4432 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4435 real
= build2 (resultcode
, real_type
, op0
, real
);
4438 real
= build2 (resultcode
, real_type
, op0
, real
);
4439 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4445 return build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4448 /* For certain operations (which identify themselves by shorten != 0)
4449 if both args were extended from the same smaller type,
4450 do the arithmetic in that type and then extend.
4452 shorten !=0 and !=1 indicates a bitwise operation.
4453 For them, this optimization is safe only if
4454 both args are zero-extended or both are sign-extended.
4455 Otherwise, we might change the result.
4456 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4457 but calculated in (unsigned short) it would be (unsigned short)-1. */
4459 if (shorten
&& none_complex
)
4461 final_type
= result_type
;
4462 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4466 /* Comparison operations are shortened too but differently.
4467 They identify themselves by setting short_compare = 1. */
4471 /* Don't write &op0, etc., because that would prevent op0
4472 from being kept in a register.
4473 Instead, make copies of the our local variables and
4474 pass the copies by reference, then copy them back afterward. */
4475 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4476 enum tree_code xresultcode
= resultcode
;
4478 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4480 return cp_convert (boolean_type_node
, val
);
4481 op0
= xop0
, op1
= xop1
;
4483 resultcode
= xresultcode
;
4486 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4487 && warn_sign_compare
4488 && !TREE_NO_WARNING (orig_op0
)
4489 && !TREE_NO_WARNING (orig_op1
)
4490 /* Do not warn until the template is instantiated; we cannot
4491 bound the ranges of the arguments until that point. */
4492 && !processing_template_decl
4493 && (complain
& tf_warning
)
4494 && c_inhibit_evaluation_warnings
== 0)
4496 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4497 result_type
, resultcode
);
4501 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4502 Then the expression will be built.
4503 It will be given type FINAL_TYPE if that is nonzero;
4504 otherwise, it will be given type RESULT_TYPE. */
4507 if (TREE_TYPE (op0
) != result_type
)
4508 op0
= cp_convert_and_check (result_type
, op0
);
4509 if (TREE_TYPE (op1
) != result_type
)
4510 op1
= cp_convert_and_check (result_type
, op1
);
4512 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4513 return error_mark_node
;
4516 if (build_type
== NULL_TREE
)
4517 build_type
= result_type
;
4519 result
= build2 (resultcode
, build_type
, op0
, op1
);
4520 result
= fold_if_not_in_template (result
);
4521 if (final_type
!= 0)
4522 result
= cp_convert (final_type
, result
);
4524 if (TREE_OVERFLOW_P (result
)
4525 && !TREE_OVERFLOW_P (op0
)
4526 && !TREE_OVERFLOW_P (op1
))
4527 overflow_warning (location
, result
);
4532 /* Return a tree for the sum or difference (RESULTCODE says which)
4533 of pointer PTROP and integer INTOP. */
4536 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4538 tree res_type
= TREE_TYPE (ptrop
);
4540 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4541 in certain circumstance (when it's valid to do so). So we need
4542 to make sure it's complete. We don't need to check here, if we
4543 can actually complete it at all, as those checks will be done in
4544 pointer_int_sum() anyway. */
4545 complete_type (TREE_TYPE (res_type
));
4547 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4548 fold_if_not_in_template (intop
));
4551 /* Return a tree for the difference of pointers OP0 and OP1.
4552 The resulting tree has type int. */
4555 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4558 tree restype
= ptrdiff_type_node
;
4559 tree target_type
= TREE_TYPE (ptrtype
);
4561 if (!complete_type_or_else (target_type
, NULL_TREE
))
4562 return error_mark_node
;
4564 if (TREE_CODE (target_type
) == VOID_TYPE
)
4565 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4566 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4567 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4568 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4569 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4571 /* First do the subtraction as integers;
4572 then drop through to build the divide operator. */
4574 op0
= cp_build_binary_op (input_location
,
4576 cp_convert (restype
, op0
),
4577 cp_convert (restype
, op1
),
4578 tf_warning_or_error
);
4580 /* This generates an error if op1 is a pointer to an incomplete type. */
4581 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4582 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4584 op1
= (TYPE_PTROB_P (ptrtype
)
4585 ? size_in_bytes (target_type
)
4586 : integer_one_node
);
4588 /* Do the division. */
4590 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4591 return fold_if_not_in_template (result
);
4594 /* Construct and perhaps optimize a tree representation
4595 for a unary operation. CODE, a tree_code, specifies the operation
4596 and XARG is the operand. */
4599 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4601 tree orig_expr
= xarg
;
4605 if (processing_template_decl
)
4607 if (type_dependent_expression_p (xarg
))
4608 return build_min_nt (code
, xarg
, NULL_TREE
);
4610 xarg
= build_non_dependent_expr (xarg
);
4615 /* [expr.unary.op] says:
4617 The address of an object of incomplete type can be taken.
4619 (And is just the ordinary address operator, not an overloaded
4620 "operator &".) However, if the type is a template
4621 specialization, we must complete the type at this point so that
4622 an overloaded "operator &" will be available if required. */
4623 if (code
== ADDR_EXPR
4624 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4625 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4626 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4627 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4628 /* Don't look for a function. */;
4630 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4631 /*overloaded_p=*/NULL
, complain
);
4632 if (!exp
&& code
== ADDR_EXPR
)
4634 if (is_overloaded_fn (xarg
))
4636 tree fn
= get_first_fn (xarg
);
4637 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4639 error (DECL_CONSTRUCTOR_P (fn
)
4640 ? G_("taking address of constructor %qE")
4641 : G_("taking address of destructor %qE"),
4643 return error_mark_node
;
4647 /* A pointer to member-function can be formed only by saying
4649 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4650 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4652 if (TREE_CODE (xarg
) != OFFSET_REF
4653 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4655 error ("invalid use of %qE to form a pointer-to-member-function",
4657 if (TREE_CODE (xarg
) != OFFSET_REF
)
4658 inform (input_location
, " a qualified-id is required");
4659 return error_mark_node
;
4663 error ("parentheses around %qE cannot be used to form a"
4664 " pointer-to-member-function",
4666 PTRMEM_OK_P (xarg
) = 1;
4670 if (TREE_CODE (xarg
) == OFFSET_REF
)
4672 ptrmem
= PTRMEM_OK_P (xarg
);
4674 if (!ptrmem
&& !flag_ms_extensions
4675 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4677 /* A single non-static member, make sure we don't allow a
4678 pointer-to-member. */
4679 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4680 TREE_OPERAND (xarg
, 0),
4681 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4682 PTRMEM_OK_P (xarg
) = ptrmem
;
4685 else if (TREE_CODE (xarg
) == TARGET_EXPR
&& (complain
& tf_warning
))
4686 warning (0, "taking address of temporary");
4687 exp
= cp_build_unary_op (ADDR_EXPR
, xarg
, 0, complain
);
4690 if (processing_template_decl
&& exp
!= error_mark_node
)
4691 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4692 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4693 if (TREE_CODE (exp
) == ADDR_EXPR
)
4694 PTRMEM_OK_P (exp
) = ptrmem
;
4698 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4699 constants, where a null value is represented by an INTEGER_CST of
4703 cp_truthvalue_conversion (tree expr
)
4705 tree type
= TREE_TYPE (expr
);
4706 if (TYPE_PTRMEM_P (type
))
4707 return build_binary_op (EXPR_LOCATION (expr
),
4708 NE_EXPR
, expr
, integer_zero_node
, 1);
4710 return c_common_truthvalue_conversion (input_location
, expr
);
4713 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4716 condition_conversion (tree expr
)
4719 if (processing_template_decl
)
4721 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4722 tf_warning_or_error
, LOOKUP_NORMAL
);
4723 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4727 /* Returns the address of T. This function will fold away
4728 ADDR_EXPR of INDIRECT_REF. */
4731 build_address (tree t
)
4733 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4734 return error_mark_node
;
4735 t
= build_fold_addr_expr (t
);
4736 if (TREE_CODE (t
) != ADDR_EXPR
)
4741 /* Returns the address of T with type TYPE. */
4744 build_typed_address (tree t
, tree type
)
4746 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4747 return error_mark_node
;
4748 t
= build_fold_addr_expr_with_type (t
, type
);
4749 if (TREE_CODE (t
) != ADDR_EXPR
)
4754 /* Return a NOP_EXPR converting EXPR to TYPE. */
4757 build_nop (tree type
, tree expr
)
4759 if (type
== error_mark_node
|| error_operand_p (expr
))
4761 return build1 (NOP_EXPR
, type
, expr
);
4764 /* C++: Must handle pointers to members.
4766 Perhaps type instantiation should be extended to handle conversion
4767 from aggregates to types we don't yet know we want? (Or are those
4768 cases typically errors which should be reported?)
4770 NOCONVERT nonzero suppresses the default promotions
4771 (such as from short to int). */
4774 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
4775 tsubst_flags_t complain
)
4777 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4780 const char *errstring
= NULL
;
4782 const char *invalid_op_diag
;
4784 if (!arg
|| error_operand_p (arg
))
4785 return error_mark_node
;
4787 if ((invalid_op_diag
4788 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
4793 error (invalid_op_diag
);
4794 return error_mark_node
;
4799 case UNARY_PLUS_EXPR
:
4802 int flags
= WANT_ARITH
| WANT_ENUM
;
4803 /* Unary plus (but not unary minus) is allowed on pointers. */
4804 if (code
== UNARY_PLUS_EXPR
)
4805 flags
|= WANT_POINTER
;
4806 arg
= build_expr_type_conversion (flags
, arg
, true);
4808 errstring
= (code
== NEGATE_EXPR
4809 ? _("wrong type argument to unary minus")
4810 : _("wrong type argument to unary plus"));
4813 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4814 arg
= perform_integral_promotions (arg
);
4816 /* Make sure the result is not an lvalue: a unary plus or minus
4817 expression is always a rvalue. */
4824 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4828 arg
= default_conversion (arg
);
4830 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
4831 | WANT_VECTOR_OR_COMPLEX
,
4833 errstring
= _("wrong type argument to bit-complement");
4834 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4835 arg
= perform_integral_promotions (arg
);
4839 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4840 errstring
= _("wrong type argument to abs");
4841 else if (!noconvert
)
4842 arg
= default_conversion (arg
);
4846 /* Conjugating a real value is a no-op, but allow it anyway. */
4847 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4848 errstring
= _("wrong type argument to conjugation");
4849 else if (!noconvert
)
4850 arg
= default_conversion (arg
);
4853 case TRUTH_NOT_EXPR
:
4854 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
4856 val
= invert_truthvalue_loc (input_location
, arg
);
4857 if (arg
!= error_mark_node
)
4859 errstring
= _("in argument to unary !");
4866 if (TREE_CODE (arg
) == COMPLEX_CST
)
4867 return TREE_REALPART (arg
);
4868 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4870 arg
= build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4871 return fold_if_not_in_template (arg
);
4877 if (TREE_CODE (arg
) == COMPLEX_CST
)
4878 return TREE_IMAGPART (arg
);
4879 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4881 arg
= build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4882 return fold_if_not_in_template (arg
);
4885 return cp_convert (TREE_TYPE (arg
), integer_zero_node
);
4887 case PREINCREMENT_EXPR
:
4888 case POSTINCREMENT_EXPR
:
4889 case PREDECREMENT_EXPR
:
4890 case POSTDECREMENT_EXPR
:
4891 /* Handle complex lvalues (when permitted)
4892 by reduction to simpler cases. */
4894 val
= unary_complex_lvalue (code
, arg
);
4898 arg
= mark_lvalue_use (arg
);
4900 /* Increment or decrement the real part of the value,
4901 and don't change the imaginary part. */
4902 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4906 arg
= stabilize_reference (arg
);
4907 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
4908 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
4909 real
= cp_build_unary_op (code
, real
, 1, complain
);
4910 if (real
== error_mark_node
|| imag
== error_mark_node
)
4911 return error_mark_node
;
4912 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
4916 /* Report invalid types. */
4918 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
4921 if (code
== PREINCREMENT_EXPR
)
4922 errstring
= _("no pre-increment operator for type");
4923 else if (code
== POSTINCREMENT_EXPR
)
4924 errstring
= _("no post-increment operator for type");
4925 else if (code
== PREDECREMENT_EXPR
)
4926 errstring
= _("no pre-decrement operator for type");
4928 errstring
= _("no post-decrement operator for type");
4931 else if (arg
== error_mark_node
)
4932 return error_mark_node
;
4934 /* Report something read-only. */
4936 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
4937 || TREE_READONLY (arg
))
4939 if (complain
& tf_error
)
4940 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
4941 || code
== POSTINCREMENT_EXPR
)
4942 ? REK_INCREMENT
: REK_DECREMENT
));
4944 return error_mark_node
;
4949 tree declared_type
= unlowered_expr_type (arg
);
4951 argtype
= TREE_TYPE (arg
);
4953 /* ARM $5.2.5 last annotation says this should be forbidden. */
4954 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
4956 if (complain
& tf_error
)
4957 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
4958 ? G_("ISO C++ forbids incrementing an enum")
4959 : G_("ISO C++ forbids decrementing an enum"));
4961 return error_mark_node
;
4964 /* Compute the increment. */
4966 if (TREE_CODE (argtype
) == POINTER_TYPE
)
4968 tree type
= complete_type (TREE_TYPE (argtype
));
4970 if (!COMPLETE_OR_VOID_TYPE_P (type
))
4972 if (complain
& tf_error
)
4973 error (((code
== PREINCREMENT_EXPR
4974 || code
== POSTINCREMENT_EXPR
))
4975 ? G_("cannot increment a pointer to incomplete type %qT")
4976 : G_("cannot decrement a pointer to incomplete type %qT"),
4977 TREE_TYPE (argtype
));
4979 return error_mark_node
;
4981 else if ((pedantic
|| warn_pointer_arith
)
4982 && !TYPE_PTROB_P (argtype
))
4984 if (complain
& tf_error
)
4985 permerror (input_location
, (code
== PREINCREMENT_EXPR
4986 || code
== POSTINCREMENT_EXPR
)
4987 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
4988 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
4991 return error_mark_node
;
4994 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
4997 inc
= integer_one_node
;
4999 inc
= cp_convert (argtype
, inc
);
5001 /* Complain about anything else that is not a true lvalue. */
5002 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
5003 || code
== POSTINCREMENT_EXPR
)
5004 ? lv_increment
: lv_decrement
),
5006 return error_mark_node
;
5008 /* Forbid using -- on `bool'. */
5009 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
5011 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
5013 if (complain
& tf_error
)
5014 error ("invalid use of Boolean expression as operand "
5015 "to %<operator--%>");
5016 return error_mark_node
;
5018 val
= boolean_increment (code
, arg
);
5021 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
5023 TREE_SIDE_EFFECTS (val
) = 1;
5028 /* Note that this operation never does default_conversion
5029 regardless of NOCONVERT. */
5031 argtype
= lvalue_type (arg
);
5033 arg
= mark_lvalue_use (arg
);
5035 if (TREE_CODE (arg
) == OFFSET_REF
)
5038 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
5040 tree type
= build_pointer_type (TREE_TYPE (argtype
));
5041 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5044 else if (pedantic
&& DECL_MAIN_P (arg
))
5047 /* Apparently a lot of autoconf scripts for C++ packages do this,
5048 so only complain if -pedantic. */
5049 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
5050 pedwarn (input_location
, OPT_pedantic
,
5051 "ISO C++ forbids taking address of function %<::main%>");
5052 else if (flag_pedantic_errors
)
5053 return error_mark_node
;
5056 /* Let &* cancel out to simplify resulting code. */
5057 if (TREE_CODE (arg
) == INDIRECT_REF
)
5059 /* We don't need to have `current_class_ptr' wrapped in a
5060 NON_LVALUE_EXPR node. */
5061 if (arg
== current_class_ref
)
5062 return current_class_ptr
;
5064 arg
= TREE_OPERAND (arg
, 0);
5065 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
5067 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
5068 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5071 /* Don't let this be an lvalue. */
5076 /* ??? Cope with user tricks that amount to offsetof. */
5077 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5078 && TREE_CODE (argtype
) != METHOD_TYPE
5079 && argtype
!= unknown_type_node
5080 && (val
= get_base_address (arg
))
5081 && TREE_CODE (val
) == INDIRECT_REF
5082 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
5084 tree type
= build_pointer_type (argtype
);
5085 tree op0
= fold_convert (type
, TREE_OPERAND (val
, 0));
5086 tree op1
= fold_convert (sizetype
, fold_offsetof (arg
, val
));
5087 return fold_build2 (POINTER_PLUS_EXPR
, type
, op0
, op1
);
5090 /* Uninstantiated types are all functions. Taking the
5091 address of a function is a no-op, so just return the
5094 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
5095 || !IDENTIFIER_OPNAME_P (arg
));
5097 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
5098 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
5100 /* They're trying to take the address of a unique non-static
5101 member function. This is ill-formed (except in MS-land),
5102 but let's try to DTRT.
5103 Note: We only handle unique functions here because we don't
5104 want to complain if there's a static overload; non-unique
5105 cases will be handled by instantiate_type. But we need to
5106 handle this case here to allow casts on the resulting PMF.
5107 We could defer this in non-MS mode, but it's easier to give
5108 a useful error here. */
5110 /* Inside constant member functions, the `this' pointer
5111 contains an extra const qualifier. TYPE_MAIN_VARIANT
5112 is used here to remove this const from the diagnostics
5113 and the created OFFSET_REF. */
5114 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
5115 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
5118 if (! flag_ms_extensions
)
5120 tree name
= DECL_NAME (fn
);
5121 if (!(complain
& tf_error
))
5122 return error_mark_node
;
5123 else if (current_class_type
5124 && TREE_OPERAND (arg
, 0) == current_class_ref
)
5125 /* An expression like &memfn. */
5126 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
5127 " or parenthesized non-static member function to form"
5128 " a pointer to member function. Say %<&%T::%D%>",
5131 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
5132 " function to form a pointer to member function."
5136 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
5140 if (type_unknown_p (arg
))
5141 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
5143 /* Handle complex lvalues (when permitted)
5144 by reduction to simpler cases. */
5145 val
= unary_complex_lvalue (code
, arg
);
5149 switch (TREE_CODE (arg
))
5153 case FIX_TRUNC_EXPR
:
5154 /* Even if we're not being pedantic, we cannot allow this
5155 extension when we're instantiating in a SFINAE
5157 if (! lvalue_p (arg
) && complain
== tf_none
)
5159 if (complain
& tf_error
)
5160 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
5162 return error_mark_node
;
5167 arg
= BASELINK_FUNCTIONS (arg
);
5171 arg
= OVL_CURRENT (arg
);
5175 /* Turn a reference to a non-static data member into a
5176 pointer-to-member. */
5181 if (!PTRMEM_OK_P (arg
))
5182 return cp_build_unary_op (code
, arg
, 0, complain
);
5184 t
= TREE_OPERAND (arg
, 1);
5185 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
5187 if (complain
& tf_error
)
5188 error ("cannot create pointer to reference member %qD", t
);
5189 return error_mark_node
;
5192 type
= build_ptrmem_type (context_for_name_lookup (t
),
5194 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
5202 /* Anything not already handled and not a true memory reference
5204 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5205 && TREE_CODE (argtype
) != METHOD_TYPE
5206 && TREE_CODE (arg
) != OFFSET_REF
5207 && !lvalue_or_else (arg
, lv_addressof
, complain
))
5208 return error_mark_node
;
5210 if (argtype
!= error_mark_node
)
5211 argtype
= build_pointer_type (argtype
);
5213 /* In a template, we are processing a non-dependent expression
5214 so we can just form an ADDR_EXPR with the correct type. */
5215 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
5217 val
= build_address (arg
);
5218 if (TREE_CODE (arg
) == OFFSET_REF
)
5219 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
5221 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
5223 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
5225 /* We can only get here with a single static member
5227 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
5228 && DECL_STATIC_FUNCTION_P (fn
));
5230 val
= build_address (fn
);
5231 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
5232 /* Do not lose object's side effects. */
5233 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
5234 TREE_OPERAND (arg
, 0), val
);
5236 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
5238 if (complain
& tf_error
)
5239 error ("attempt to take address of bit-field structure member %qD",
5240 TREE_OPERAND (arg
, 1));
5241 return error_mark_node
;
5245 tree object
= TREE_OPERAND (arg
, 0);
5246 tree field
= TREE_OPERAND (arg
, 1);
5247 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5248 (TREE_TYPE (object
), decl_type_context (field
)));
5249 val
= build_address (arg
);
5252 if (TREE_CODE (argtype
) == POINTER_TYPE
5253 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
5255 build_ptrmemfunc_type (argtype
);
5256 val
= build_ptrmemfunc (argtype
, val
, 0,
5257 /*c_cast_p=*/false);
5269 argtype
= TREE_TYPE (arg
);
5270 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5273 if (complain
& tf_error
)
5274 error ("%s", errstring
);
5275 return error_mark_node
;
5278 /* Hook for the c-common bits that build a unary op. */
5280 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5281 enum tree_code code
, tree xarg
, int noconvert
)
5283 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5286 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5287 for certain kinds of expressions which are not really lvalues
5288 but which we can accept as lvalues.
5290 If ARG is not a kind of expression we can handle, return
5294 unary_complex_lvalue (enum tree_code code
, tree arg
)
5296 /* Inside a template, making these kinds of adjustments is
5297 pointless; we are only concerned with the type of the
5299 if (processing_template_decl
)
5302 /* Handle (a, b) used as an "lvalue". */
5303 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5305 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5306 tf_warning_or_error
);
5307 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5308 TREE_OPERAND (arg
, 0), real_result
);
5311 /* Handle (a ? b : c) used as an "lvalue". */
5312 if (TREE_CODE (arg
) == COND_EXPR
5313 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5314 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5316 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5317 if (TREE_CODE (arg
) == MODIFY_EXPR
5318 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5319 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5321 tree lvalue
= TREE_OPERAND (arg
, 0);
5322 if (TREE_SIDE_EFFECTS (lvalue
))
5324 lvalue
= stabilize_reference (lvalue
);
5325 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5326 lvalue
, TREE_OPERAND (arg
, 1));
5328 return unary_complex_lvalue
5329 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5332 if (code
!= ADDR_EXPR
)
5335 /* Handle (a = b) used as an "lvalue" for `&'. */
5336 if (TREE_CODE (arg
) == MODIFY_EXPR
5337 || TREE_CODE (arg
) == INIT_EXPR
)
5339 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5340 tf_warning_or_error
);
5341 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5343 TREE_NO_WARNING (arg
) = 1;
5347 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5348 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5349 || TREE_CODE (arg
) == OFFSET_REF
)
5352 /* We permit compiler to make function calls returning
5353 objects of aggregate type look like lvalues. */
5357 if (TREE_CODE (targ
) == SAVE_EXPR
)
5358 targ
= TREE_OPERAND (targ
, 0);
5360 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5362 if (TREE_CODE (arg
) == SAVE_EXPR
)
5365 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
5366 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5369 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5370 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5371 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5374 /* Don't let anything else be handled specially. */
5378 /* Mark EXP saying that we need to be able to take the
5379 address of it; it should not be allocated in a register.
5380 Value is true if successful.
5382 C++: we do not allow `current_class_ptr' to be addressable. */
5385 cxx_mark_addressable (tree exp
)
5390 switch (TREE_CODE (x
))
5397 x
= TREE_OPERAND (x
, 0);
5401 if (x
== current_class_ptr
)
5403 error ("cannot take the address of %<this%>, which is an rvalue expression");
5404 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5410 /* Caller should not be trying to mark initialized
5411 constant fields addressable. */
5412 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5413 || DECL_IN_AGGR_P (x
) == 0
5415 || DECL_EXTERNAL (x
));
5420 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5421 && !DECL_ARTIFICIAL (x
))
5423 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5426 ("address of explicit register variable %qD requested", x
);
5429 else if (extra_warnings
)
5431 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5433 TREE_ADDRESSABLE (x
) = 1;
5437 TREE_ADDRESSABLE (x
) = 1;
5441 TREE_ADDRESSABLE (x
) = 1;
5445 TREE_ADDRESSABLE (x
) = 1;
5446 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5454 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5457 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5458 tsubst_flags_t complain
)
5460 tree orig_ifexp
= ifexp
;
5461 tree orig_op1
= op1
;
5462 tree orig_op2
= op2
;
5465 if (processing_template_decl
)
5467 /* The standard says that the expression is type-dependent if
5468 IFEXP is type-dependent, even though the eventual type of the
5469 expression doesn't dependent on IFEXP. */
5470 if (type_dependent_expression_p (ifexp
)
5471 /* As a GNU extension, the middle operand may be omitted. */
5472 || (op1
&& type_dependent_expression_p (op1
))
5473 || type_dependent_expression_p (op2
))
5474 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5475 ifexp
= build_non_dependent_expr (ifexp
);
5477 op1
= build_non_dependent_expr (op1
);
5478 op2
= build_non_dependent_expr (op2
);
5481 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5482 if (processing_template_decl
&& expr
!= error_mark_node
)
5483 return build_min_non_dep (COND_EXPR
, expr
,
5484 orig_ifexp
, orig_op1
, orig_op2
);
5488 /* Given a list of expressions, return a compound expression
5489 that performs them all and returns the value of the last of them. */
5492 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
)
5494 tree expr
= TREE_VALUE (list
);
5496 if (TREE_CHAIN (list
))
5501 permerror (input_location
, "expression list treated as compound "
5502 "expression in initializer");
5505 permerror (input_location
, "expression list treated as compound "
5506 "expression in mem-initializer");
5509 permerror (input_location
, "expression list treated as compound "
5510 "expression in functional cast");
5516 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5517 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5518 tf_warning_or_error
);
5524 /* Like build_x_compound_expr_from_list, but using a VEC. */
5527 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5529 if (VEC_empty (tree
, vec
))
5531 else if (VEC_length (tree
, vec
) == 1)
5532 return VEC_index (tree
, vec
, 0);
5540 permerror (input_location
,
5541 "%s expression list treated as compound expression",
5544 expr
= VEC_index (tree
, vec
, 0);
5545 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5546 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5552 /* Handle overloading of the ',' operator when needed. */
5555 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5558 tree orig_op1
= op1
;
5559 tree orig_op2
= op2
;
5561 if (processing_template_decl
)
5563 if (type_dependent_expression_p (op1
)
5564 || type_dependent_expression_p (op2
))
5565 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5566 op1
= build_non_dependent_expr (op1
);
5567 op2
= build_non_dependent_expr (op2
);
5570 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5571 /*overloaded_p=*/NULL
, complain
);
5573 result
= cp_build_compound_expr (op1
, op2
, complain
);
5575 if (processing_template_decl
&& result
!= error_mark_node
)
5576 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5581 /* Like cp_build_compound_expr, but for the c-common bits. */
5584 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5586 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5589 /* Build a compound expression. */
5592 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5594 lhs
= convert_to_void (lhs
, "left-hand operand of comma", complain
);
5596 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5597 return error_mark_node
;
5599 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5601 /* If the rhs is a TARGET_EXPR, then build the compound
5602 expression inside the target_expr's initializer. This
5603 helps the compiler to eliminate unnecessary temporaries. */
5604 tree init
= TREE_OPERAND (rhs
, 1);
5606 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5607 TREE_OPERAND (rhs
, 1) = init
;
5612 if (type_unknown_p (rhs
))
5614 error ("no context to resolve type of %qE", rhs
);
5615 return error_mark_node
;
5618 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5621 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5622 casts away constness. CAST gives the type of cast.
5624 ??? This function warns for casting away any qualifier not just
5625 const. We would like to specify exactly what qualifiers are casted
5630 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5631 enum tree_code cast
)
5633 /* C-style casts are allowed to cast away constness. With
5634 WARN_CAST_QUAL, we still want to issue a warning. */
5635 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5638 if (!casts_away_constness (src_type
, dest_type
))
5644 warning (OPT_Wcast_qual
,
5645 "cast from type %qT to type %qT casts away qualifiers",
5646 src_type
, dest_type
);
5649 case STATIC_CAST_EXPR
:
5650 error ("static_cast from type %qT to type %qT casts away qualifiers",
5651 src_type
, dest_type
);
5654 case REINTERPRET_CAST_EXPR
:
5655 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5656 src_type
, dest_type
);
5663 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5664 (another pointer-to-member type in the same hierarchy) and return
5665 the converted expression. If ALLOW_INVERSE_P is permitted, a
5666 pointer-to-derived may be converted to pointer-to-base; otherwise,
5667 only the other direction is permitted. If C_CAST_P is true, this
5668 conversion is taking place as part of a C-style cast. */
5671 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5674 if (TYPE_PTRMEM_P (type
))
5678 if (TREE_CODE (expr
) == PTRMEM_CST
)
5679 expr
= cplus_expand_constant (expr
);
5680 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5681 TYPE_PTRMEM_CLASS_TYPE (type
),
5684 if (!integer_zerop (delta
))
5686 tree cond
, op1
, op2
;
5688 cond
= cp_build_binary_op (input_location
,
5691 build_int_cst (TREE_TYPE (expr
), -1),
5692 tf_warning_or_error
);
5693 op1
= build_nop (ptrdiff_type_node
, expr
);
5694 op2
= cp_build_binary_op (input_location
,
5695 PLUS_EXPR
, op1
, delta
,
5696 tf_warning_or_error
);
5698 expr
= fold_build3_loc (input_location
,
5699 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5703 return build_nop (type
, expr
);
5706 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5707 allow_inverse_p
, c_cast_p
);
5710 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
5711 a version of EXPR that has TREE_OVERFLOW set if it is set in ORIG.
5712 Otherwise, return EXPR unchanged. */
5715 ignore_overflows (tree expr
, tree orig
)
5717 if (TREE_CODE (expr
) == INTEGER_CST
5718 && CONSTANT_CLASS_P (orig
)
5719 && TREE_CODE (orig
) != STRING_CST
5720 && TREE_OVERFLOW (expr
) != TREE_OVERFLOW (orig
))
5722 if (!TREE_OVERFLOW (orig
))
5723 /* Ensure constant sharing. */
5724 expr
= build_int_cst_wide (TREE_TYPE (expr
),
5725 TREE_INT_CST_LOW (expr
),
5726 TREE_INT_CST_HIGH (expr
));
5729 /* Avoid clobbering a shared constant. */
5730 expr
= copy_node (expr
);
5731 TREE_OVERFLOW (expr
) = TREE_OVERFLOW (orig
);
5737 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5738 this static_cast is being attempted as one of the possible casts
5739 allowed by a C-style cast. (In that case, accessibility of base
5740 classes is not considered, and it is OK to cast away
5741 constness.) Return the result of the cast. *VALID_P is set to
5742 indicate whether or not the cast was valid. */
5745 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5746 bool *valid_p
, tsubst_flags_t complain
)
5752 /* Assume the cast is valid. */
5755 intype
= TREE_TYPE (expr
);
5757 /* Save casted types in the function's used types hash table. */
5758 used_types_insert (type
);
5760 /* [expr.static.cast]
5762 An lvalue of type "cv1 B", where B is a class type, can be cast
5763 to type "reference to cv2 D", where D is a class derived (clause
5764 _class.derived_) from B, if a valid standard conversion from
5765 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5766 same cv-qualification as, or greater cv-qualification than, cv1,
5767 and B is not a virtual base class of D. */
5768 /* We check this case before checking the validity of "TYPE t =
5769 EXPR;" below because for this case:
5772 struct D : public B { D(const B&); };
5774 void f() { static_cast<const D&>(b); }
5776 we want to avoid constructing a new D. The standard is not
5777 completely clear about this issue, but our interpretation is
5778 consistent with other compilers. */
5779 if (TREE_CODE (type
) == REFERENCE_TYPE
5780 && CLASS_TYPE_P (TREE_TYPE (type
))
5781 && CLASS_TYPE_P (intype
)
5782 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5783 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5784 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5785 build_pointer_type (TYPE_MAIN_VARIANT
5786 (TREE_TYPE (type
))))
5788 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5792 /* There is a standard conversion from "D*" to "B*" even if "B"
5793 is ambiguous or inaccessible. If this is really a
5794 static_cast, then we check both for inaccessibility and
5795 ambiguity. However, if this is a static_cast being performed
5796 because the user wrote a C-style cast, then accessibility is
5798 base
= lookup_base (TREE_TYPE (type
), intype
,
5799 c_cast_p
? ba_unique
: ba_check
,
5802 /* Convert from "B*" to "D*". This function will check that "B"
5803 is not a virtual base of "D". */
5804 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5805 base
, /*nonnull=*/false);
5806 /* Convert the pointer to a reference -- but then remember that
5807 there are no expressions with reference type in C++. */
5808 return convert_from_reference (cp_fold_convert (type
, expr
));
5811 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5812 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5813 if (TREE_CODE (type
) == REFERENCE_TYPE
5814 && TYPE_REF_IS_RVALUE (type
)
5815 && real_lvalue_p (expr
)
5816 && reference_related_p (TREE_TYPE (type
), intype
)
5817 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5819 expr
= build_typed_address (expr
, type
);
5820 return convert_from_reference (expr
);
5825 /* Resolve overloaded address here rather than once in
5826 implicit_conversion and again in the inverse code below. */
5827 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5829 expr
= instantiate_type (type
, expr
, complain
);
5830 intype
= TREE_TYPE (expr
);
5833 /* [expr.static.cast]
5835 An expression e can be explicitly converted to a type T using a
5836 static_cast of the form static_cast<T>(e) if the declaration T
5837 t(e);" is well-formed, for some invented temporary variable
5839 result
= perform_direct_initialization_if_possible (type
, expr
,
5840 c_cast_p
, complain
);
5843 result
= convert_from_reference (result
);
5845 /* Ignore any integer overflow caused by the cast. */
5846 result
= ignore_overflows (result
, orig
);
5848 /* [expr.static.cast]
5850 If T is a reference type, the result is an lvalue; otherwise,
5851 the result is an rvalue. */
5852 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5853 result
= rvalue (result
);
5857 /* [expr.static.cast]
5859 Any expression can be explicitly converted to type cv void. */
5860 if (TREE_CODE (type
) == VOID_TYPE
)
5861 return convert_to_void (expr
, /*implicit=*/NULL
, complain
);
5863 /* [expr.static.cast]
5865 The inverse of any standard conversion sequence (clause _conv_),
5866 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5867 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5868 (_conv.bool_) conversions, can be performed explicitly using
5869 static_cast subject to the restriction that the explicit
5870 conversion does not cast away constness (_expr.const.cast_), and
5871 the following additional rules for specific cases: */
5872 /* For reference, the conversions not excluded are: integral
5873 promotions, floating point promotion, integral conversions,
5874 floating point conversions, floating-integral conversions,
5875 pointer conversions, and pointer to member conversions. */
5878 A value of integral _or enumeration_ type can be explicitly
5879 converted to an enumeration type. */
5880 /* The effect of all that is that any conversion between any two
5881 types which are integral, floating, or enumeration types can be
5883 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5884 || SCALAR_FLOAT_TYPE_P (type
))
5885 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5886 || SCALAR_FLOAT_TYPE_P (intype
)))
5888 expr
= ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5890 /* Ignore any integer overflow caused by the cast. */
5891 expr
= ignore_overflows (expr
, orig
);
5895 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5896 && CLASS_TYPE_P (TREE_TYPE (type
))
5897 && CLASS_TYPE_P (TREE_TYPE (intype
))
5898 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5899 (TREE_TYPE (intype
))),
5900 build_pointer_type (TYPE_MAIN_VARIANT
5901 (TREE_TYPE (type
)))))
5906 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5907 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
5908 c_cast_p
? ba_unique
: ba_check
,
5910 return build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
5913 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5914 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5921 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
5922 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
5924 if (TYPE_PTRMEM_P (type
))
5926 t1
= (build_ptrmem_type
5928 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
5929 t2
= (build_ptrmem_type
5931 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
5938 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
5941 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5942 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
5947 /* [expr.static.cast]
5949 An rvalue of type "pointer to cv void" can be explicitly
5950 converted to a pointer to object type. A value of type pointer
5951 to object converted to "pointer to cv void" and back to the
5952 original pointer type will have its original value. */
5953 if (TREE_CODE (intype
) == POINTER_TYPE
5954 && VOID_TYPE_P (TREE_TYPE (intype
))
5955 && TYPE_PTROB_P (type
))
5958 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5959 return build_nop (type
, expr
);
5963 return error_mark_node
;
5966 /* Return an expression representing static_cast<TYPE>(EXPR). */
5969 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5974 if (type
== error_mark_node
|| expr
== error_mark_node
)
5975 return error_mark_node
;
5977 if (processing_template_decl
)
5979 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
5980 /* We don't know if it will or will not have side effects. */
5981 TREE_SIDE_EFFECTS (expr
) = 1;
5982 return convert_from_reference (expr
);
5985 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5986 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5987 if (TREE_CODE (type
) != REFERENCE_TYPE
5988 && TREE_CODE (expr
) == NOP_EXPR
5989 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5990 expr
= TREE_OPERAND (expr
, 0);
5992 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
5997 if (complain
& tf_error
)
5998 error ("invalid static_cast from type %qT to type %qT",
5999 TREE_TYPE (expr
), type
);
6000 return error_mark_node
;
6003 /* EXPR is an expression with member function or pointer-to-member
6004 function type. TYPE is a pointer type. Converting EXPR to TYPE is
6005 not permitted by ISO C++, but we accept it in some modes. If we
6006 are not in one of those modes, issue a diagnostic. Return the
6007 converted expression. */
6010 convert_member_func_to_ptr (tree type
, tree expr
)
6015 intype
= TREE_TYPE (expr
);
6016 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
6017 || TREE_CODE (intype
) == METHOD_TYPE
);
6019 if (pedantic
|| warn_pmf2ptr
)
6020 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
6021 "converting from %qT to %qT", intype
, type
);
6023 if (TREE_CODE (intype
) == METHOD_TYPE
)
6024 expr
= build_addr_func (expr
);
6025 else if (TREE_CODE (expr
) == PTRMEM_CST
)
6026 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
6029 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
6030 decl
= build_address (decl
);
6031 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
6034 return build_nop (type
, expr
);
6037 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
6038 If C_CAST_P is true, this reinterpret cast is being done as part of
6039 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
6040 indicate whether or not reinterpret_cast was valid. */
6043 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6044 bool *valid_p
, tsubst_flags_t complain
)
6048 /* Assume the cast is invalid. */
6052 if (type
== error_mark_node
|| error_operand_p (expr
))
6053 return error_mark_node
;
6055 intype
= TREE_TYPE (expr
);
6057 /* Save casted types in the function's used types hash table. */
6058 used_types_insert (type
);
6060 /* [expr.reinterpret.cast]
6061 An lvalue expression of type T1 can be cast to the type
6062 "reference to T2" if an expression of type "pointer to T1" can be
6063 explicitly converted to the type "pointer to T2" using a
6064 reinterpret_cast. */
6065 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6067 if (! real_lvalue_p (expr
))
6069 if (complain
& tf_error
)
6070 error ("invalid cast of an rvalue expression of type "
6073 return error_mark_node
;
6076 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6077 "B" are related class types; the reinterpret_cast does not
6078 adjust the pointer. */
6079 if (TYPE_PTR_P (intype
)
6080 && (complain
& tf_warning
)
6081 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
6082 COMPARE_BASE
| COMPARE_DERIVED
)))
6083 warning (0, "casting %qT to %qT does not dereference pointer",
6086 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0, complain
);
6088 if (warn_strict_aliasing
> 2)
6089 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
6091 if (expr
!= error_mark_node
)
6092 expr
= build_reinterpret_cast_1
6093 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
6095 if (expr
!= error_mark_node
)
6096 /* cp_build_indirect_ref isn't right for rvalue refs. */
6097 expr
= convert_from_reference (fold_convert (type
, expr
));
6101 /* As a G++ extension, we consider conversions from member
6102 functions, and pointers to member functions to
6103 pointer-to-function and pointer-to-void types. If
6104 -Wno-pmf-conversions has not been specified,
6105 convert_member_func_to_ptr will issue an error message. */
6106 if ((TYPE_PTRMEMFUNC_P (intype
)
6107 || TREE_CODE (intype
) == METHOD_TYPE
)
6108 && TYPE_PTR_P (type
)
6109 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6110 || VOID_TYPE_P (TREE_TYPE (type
))))
6111 return convert_member_func_to_ptr (type
, expr
);
6113 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6114 array-to-pointer, and function-to-pointer conversions are
6116 expr
= decay_conversion (expr
);
6118 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6119 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6120 if (TREE_CODE (expr
) == NOP_EXPR
6121 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6122 expr
= TREE_OPERAND (expr
, 0);
6124 if (error_operand_p (expr
))
6125 return error_mark_node
;
6127 intype
= TREE_TYPE (expr
);
6129 /* [expr.reinterpret.cast]
6130 A pointer can be converted to any integral type large enough to
6131 hold it. ... A value of type std::nullptr_t can be converted to
6132 an integral type; the conversion has the same meaning and
6133 validity as a conversion of (void*)0 to the integral type. */
6134 if (CP_INTEGRAL_TYPE_P (type
)
6135 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
6137 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
6139 if (complain
& tf_error
)
6140 permerror (input_location
, "cast from %qT to %qT loses precision",
6143 return error_mark_node
;
6145 if (NULLPTR_TYPE_P (intype
))
6146 return build_int_cst (type
, 0);
6148 /* [expr.reinterpret.cast]
6149 A value of integral or enumeration type can be explicitly
6150 converted to a pointer. */
6151 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6154 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6155 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6156 return fold_if_not_in_template (build_nop (type
, expr
));
6157 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6158 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6163 check_for_casting_away_constness (intype
, type
, REINTERPRET_CAST_EXPR
);
6164 /* Warn about possible alignment problems. */
6165 if (STRICT_ALIGNMENT
&& warn_cast_align
6166 && (complain
& tf_warning
)
6167 && !VOID_TYPE_P (type
)
6168 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6169 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6170 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6171 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6172 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6173 "increases required alignment of target type", intype
, type
);
6175 /* We need to strip nops here, because the front end likes to
6176 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6178 if (warn_strict_aliasing
<= 2)
6179 strict_aliasing_warning (intype
, type
, sexpr
);
6181 return fold_if_not_in_template (build_nop (type
, expr
));
6183 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6184 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6186 if (pedantic
&& (complain
& tf_warning
))
6187 /* Only issue a warning, as we have always supported this
6188 where possible, and it is necessary in some cases. DR 195
6189 addresses this issue, but as of 2004/10/26 is still in
6191 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6192 return fold_if_not_in_template (build_nop (type
, expr
));
6194 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6195 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6196 else if (TREE_CODE (intype
) == VECTOR_TYPE
6197 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6198 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6203 if (complain
& tf_error
)
6204 error ("invalid cast from type %qT to type %qT", intype
, type
);
6205 return error_mark_node
;
6208 return cp_convert (type
, expr
);
6212 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6214 if (type
== error_mark_node
|| expr
== error_mark_node
)
6215 return error_mark_node
;
6217 if (processing_template_decl
)
6219 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6221 if (!TREE_SIDE_EFFECTS (t
)
6222 && type_dependent_expression_p (expr
))
6223 /* There might turn out to be side effects inside expr. */
6224 TREE_SIDE_EFFECTS (t
) = 1;
6225 return convert_from_reference (t
);
6228 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6229 /*valid_p=*/NULL
, complain
);
6232 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6233 return an appropriate expression. Otherwise, return
6234 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6235 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6236 performing a C-style cast, its value upon return will indicate
6237 whether or not the conversion succeeded. */
6240 build_const_cast_1 (tree dst_type
, tree expr
, bool complain
,
6244 tree reference_type
;
6246 /* Callers are responsible for handling error_mark_node as a
6247 destination type. */
6248 gcc_assert (dst_type
!= error_mark_node
);
6249 /* In a template, callers should be building syntactic
6250 representations of casts, not using this machinery. */
6251 gcc_assert (!processing_template_decl
);
6253 /* Assume the conversion is invalid. */
6257 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6260 error ("invalid use of const_cast with type %qT, "
6261 "which is not a pointer, "
6262 "reference, nor a pointer-to-data-member type", dst_type
);
6263 return error_mark_node
;
6266 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6269 error ("invalid use of const_cast with type %qT, which is a pointer "
6270 "or reference to a function type", dst_type
);
6271 return error_mark_node
;
6274 /* Save casted types in the function's used types hash table. */
6275 used_types_insert (dst_type
);
6277 src_type
= TREE_TYPE (expr
);
6278 /* Expressions do not really have reference types. */
6279 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6280 src_type
= TREE_TYPE (src_type
);
6282 /* [expr.const.cast]
6284 An lvalue of type T1 can be explicitly converted to an lvalue of
6285 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6286 types) if a pointer to T1 can be explicitly converted to the type
6287 pointer to T2 using a const_cast. */
6288 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6290 reference_type
= dst_type
;
6291 if (! real_lvalue_p (expr
))
6294 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6295 src_type
, dst_type
);
6296 return error_mark_node
;
6298 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6299 src_type
= build_pointer_type (src_type
);
6303 reference_type
= NULL_TREE
;
6304 /* If the destination type is not a reference type, the
6305 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6306 conversions are performed. */
6307 src_type
= type_decays_to (src_type
);
6308 if (src_type
== error_mark_node
)
6309 return error_mark_node
;
6312 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6313 && comp_ptr_ttypes_const (dst_type
, src_type
))
6318 /* This cast is actually a C-style cast. Issue a warning if
6319 the user is making a potentially unsafe cast. */
6320 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
);
6324 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0,
6325 complain
? tf_warning_or_error
: tf_none
);
6326 expr
= build_nop (reference_type
, expr
);
6327 return convert_from_reference (expr
);
6331 expr
= decay_conversion (expr
);
6332 /* build_c_cast puts on a NOP_EXPR to make the result not an
6333 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6334 non-lvalue context. */
6335 if (TREE_CODE (expr
) == NOP_EXPR
6336 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6337 expr
= TREE_OPERAND (expr
, 0);
6338 return build_nop (dst_type
, expr
);
6343 error ("invalid const_cast from type %qT to type %qT",
6344 src_type
, dst_type
);
6345 return error_mark_node
;
6349 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6351 if (type
== error_mark_node
|| error_operand_p (expr
))
6352 return error_mark_node
;
6354 if (processing_template_decl
)
6356 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6358 if (!TREE_SIDE_EFFECTS (t
)
6359 && type_dependent_expression_p (expr
))
6360 /* There might turn out to be side effects inside expr. */
6361 TREE_SIDE_EFFECTS (t
) = 1;
6362 return convert_from_reference (t
);
6365 return build_const_cast_1 (type
, expr
, complain
& tf_error
,
6369 /* Like cp_build_c_cast, but for the c-common bits. */
6372 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6374 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6377 /* Build an expression representing an explicit C-style cast to type
6378 TYPE of expression EXPR. */
6381 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6387 if (type
== error_mark_node
|| error_operand_p (expr
))
6388 return error_mark_node
;
6390 if (processing_template_decl
)
6392 tree t
= build_min (CAST_EXPR
, type
,
6393 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6394 /* We don't know if it will or will not have side effects. */
6395 TREE_SIDE_EFFECTS (t
) = 1;
6396 return convert_from_reference (t
);
6399 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6400 'Class') should always be retained, because this information aids
6401 in method lookup. */
6402 if (objc_is_object_ptr (type
)
6403 && objc_is_object_ptr (TREE_TYPE (expr
)))
6404 return build_nop (type
, expr
);
6406 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6407 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6408 if (TREE_CODE (type
) != REFERENCE_TYPE
6409 && TREE_CODE (value
) == NOP_EXPR
6410 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6411 value
= TREE_OPERAND (value
, 0);
6413 if (TREE_CODE (type
) == ARRAY_TYPE
)
6415 /* Allow casting from T1* to T2[] because Cfront allows it.
6416 NIHCL uses it. It is not valid ISO C++ however. */
6417 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6419 if (complain
& tf_error
)
6420 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6422 return error_mark_node
;
6423 type
= build_pointer_type (TREE_TYPE (type
));
6427 if (complain
& tf_error
)
6428 error ("ISO C++ forbids casting to an array type %qT", type
);
6429 return error_mark_node
;
6433 if (TREE_CODE (type
) == FUNCTION_TYPE
6434 || TREE_CODE (type
) == METHOD_TYPE
)
6436 if (complain
& tf_error
)
6437 error ("invalid cast to function type %qT", type
);
6438 return error_mark_node
;
6441 if (TREE_CODE (type
) == POINTER_TYPE
6442 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
6443 /* Casting to an integer of smaller size is an error detected elsewhere. */
6444 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
6445 /* Don't warn about converting any constant. */
6446 && !TREE_CONSTANT (value
))
6447 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
6448 "cast to pointer from integer of different size");
6450 /* A C-style cast can be a const_cast. */
6451 result
= build_const_cast_1 (type
, value
, /*complain=*/false,
6456 /* Or a static cast. */
6457 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6458 &valid_p
, complain
);
6459 /* Or a reinterpret_cast. */
6461 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6462 &valid_p
, complain
);
6463 /* The static_cast or reinterpret_cast may be followed by a
6466 /* A valid cast may result in errors if, for example, a
6467 conversion to am ambiguous base class is required. */
6468 && !error_operand_p (result
))
6472 /* Non-class rvalues always have cv-unqualified type. */
6473 if (!CLASS_TYPE_P (type
))
6474 type
= TYPE_MAIN_VARIANT (type
);
6475 result_type
= TREE_TYPE (result
);
6476 if (!CLASS_TYPE_P (result_type
))
6477 result_type
= TYPE_MAIN_VARIANT (result_type
);
6478 /* If the type of RESULT does not match TYPE, perform a
6479 const_cast to make it match. If the static_cast or
6480 reinterpret_cast succeeded, we will differ by at most
6481 cv-qualification, so the follow-on const_cast is guaranteed
6483 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6485 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6486 gcc_assert (valid_p
);
6491 return error_mark_node
;
6494 /* For use from the C common bits. */
6496 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6497 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6498 enum tree_code modifycode
,
6499 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6500 tree rhs_origtype ATTRIBUTE_UNUSED
)
6502 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6505 /* Build an assignment expression of lvalue LHS from value RHS.
6506 MODIFYCODE is the code for a binary operator that we use
6507 to combine the old value of LHS with RHS to get the new value.
6508 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6510 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6513 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6514 tsubst_flags_t complain
)
6518 tree lhstype
= TREE_TYPE (lhs
);
6519 tree olhstype
= lhstype
;
6520 bool plain_assign
= (modifycode
== NOP_EXPR
);
6522 /* Avoid duplicate error messages from operands that had errors. */
6523 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6524 return error_mark_node
;
6526 /* Handle control structure constructs used as "lvalues". */
6527 switch (TREE_CODE (lhs
))
6529 /* Handle --foo = 5; as these are valid constructs in C++. */
6530 case PREDECREMENT_EXPR
:
6531 case PREINCREMENT_EXPR
:
6532 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6533 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6534 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6535 TREE_OPERAND (lhs
, 1));
6536 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6537 modifycode
, rhs
, complain
);
6538 if (newrhs
== error_mark_node
)
6539 return error_mark_node
;
6540 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6542 /* Handle (a, b) used as an "lvalue". */
6544 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6545 modifycode
, rhs
, complain
);
6546 if (newrhs
== error_mark_node
)
6547 return error_mark_node
;
6548 return build2 (COMPOUND_EXPR
, lhstype
,
6549 TREE_OPERAND (lhs
, 0), newrhs
);
6552 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6553 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6554 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6555 TREE_OPERAND (lhs
, 1));
6556 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6558 if (newrhs
== error_mark_node
)
6559 return error_mark_node
;
6560 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6564 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6565 when neither operand has side-effects. */
6566 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6567 return error_mark_node
;
6569 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6570 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6572 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6573 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6575 TREE_OPERAND (lhs
, 0),
6576 TREE_OPERAND (lhs
, 1)),
6577 TREE_OPERAND (lhs
, 0),
6578 TREE_OPERAND (lhs
, 1));
6581 /* Handle (a ? b : c) used as an "lvalue". */
6584 /* Produce (a ? (b = rhs) : (c = rhs))
6585 except that the RHS goes through a save-expr
6586 so the code to compute it is only emitted once. */
6588 tree preeval
= NULL_TREE
;
6590 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6592 if (complain
& tf_error
)
6593 error ("void value not ignored as it ought to be");
6594 return error_mark_node
;
6597 rhs
= stabilize_expr (rhs
, &preeval
);
6599 /* Check this here to avoid odd errors when trying to convert
6600 a throw to the type of the COND_EXPR. */
6601 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6602 return error_mark_node
;
6604 cond
= build_conditional_expr
6605 (TREE_OPERAND (lhs
, 0),
6606 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6607 modifycode
, rhs
, complain
),
6608 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6609 modifycode
, rhs
, complain
),
6612 if (cond
== error_mark_node
)
6614 /* Make sure the code to compute the rhs comes out
6615 before the split. */
6617 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6625 if (modifycode
== INIT_EXPR
)
6627 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6628 /* Do the default thing. */;
6629 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6631 /* Compound literal. */
6632 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6633 /* Call convert to generate an error; see PR 11063. */
6634 rhs
= convert (lhstype
, rhs
);
6635 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6636 TREE_SIDE_EFFECTS (result
) = 1;
6639 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6640 /* Do the default thing. */;
6643 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6644 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6645 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6647 release_tree_vector (rhs_vec
);
6648 if (result
== NULL_TREE
)
6649 return error_mark_node
;
6655 lhs
= require_complete_type (lhs
);
6656 if (lhs
== error_mark_node
)
6657 return error_mark_node
;
6659 if (modifycode
== NOP_EXPR
)
6661 /* `operator=' is not an inheritable operator. */
6662 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6663 /* Do the default thing. */;
6666 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6667 lhs
, rhs
, make_node (NOP_EXPR
),
6668 /*overloaded_p=*/NULL
,
6670 if (result
== NULL_TREE
)
6671 return error_mark_node
;
6678 /* A binary op has been requested. Combine the old LHS
6679 value with the RHS producing the value we should actually
6680 store into the LHS. */
6681 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6682 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6683 || MAYBE_CLASS_TYPE_P (lhstype
)));
6685 lhs
= stabilize_reference (lhs
);
6686 newrhs
= cp_build_binary_op (input_location
,
6687 modifycode
, lhs
, rhs
,
6689 if (newrhs
== error_mark_node
)
6691 if (complain
& tf_error
)
6692 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6693 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6694 return error_mark_node
;
6697 /* Now it looks like a plain assignment. */
6698 modifycode
= NOP_EXPR
;
6700 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6701 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6704 /* The left-hand side must be an lvalue. */
6705 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6706 return error_mark_node
;
6708 /* Warn about modifying something that is `const'. Don't warn if
6709 this is initialization. */
6710 if (modifycode
!= INIT_EXPR
6711 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6712 /* Functions are not modifiable, even though they are
6714 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6715 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6716 /* If it's an aggregate and any field is const, then it is
6717 effectively const. */
6718 || (CLASS_TYPE_P (lhstype
)
6719 && C_TYPE_FIELDS_READONLY (lhstype
))))
6721 if (complain
& tf_error
)
6722 readonly_error (lhs
, REK_ASSIGNMENT
);
6724 return error_mark_node
;
6727 /* If storing into a structure or union member, it may have been given a
6728 lowered bitfield type. We need to convert to the declared type first,
6729 so retrieve it now. */
6731 olhstype
= unlowered_expr_type (lhs
);
6733 /* Convert new value to destination type. */
6735 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6739 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6741 if (modifycode
!= INIT_EXPR
)
6743 if (complain
& tf_error
)
6744 error ("assigning to an array from an initializer list");
6745 return error_mark_node
;
6747 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6748 return error_mark_node
;
6749 newrhs
= digest_init (lhstype
, newrhs
);
6752 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6753 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6755 if (complain
& tf_error
)
6756 error ("incompatible types in assignment of %qT to %qT",
6757 TREE_TYPE (rhs
), lhstype
);
6758 return error_mark_node
;
6761 /* Allow array assignment in compiler-generated code. */
6762 else if (!current_function_decl
6763 || !DECL_ARTIFICIAL (current_function_decl
))
6765 /* This routine is used for both initialization and assignment.
6766 Make sure the diagnostic message differentiates the context. */
6767 if (complain
& tf_error
)
6769 if (modifycode
== INIT_EXPR
)
6770 error ("array used as initializer");
6772 error ("invalid array assignment");
6774 return error_mark_node
;
6777 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6778 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6779 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6780 /*explicit_value_init_p=*/false,
6781 from_array
, complain
);
6784 if (modifycode
== INIT_EXPR
)
6785 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6786 LOOKUP_ONLYCONVERTING. */
6787 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6788 ICR_INIT
, NULL_TREE
, 0,
6791 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
6792 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6794 if (!same_type_p (lhstype
, olhstype
))
6795 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6797 if (modifycode
!= INIT_EXPR
)
6799 if (TREE_CODE (newrhs
) == CALL_EXPR
6800 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6801 newrhs
= build_cplus_new (lhstype
, newrhs
);
6803 /* Can't initialize directly from a TARGET_EXPR, since that would
6804 cause the lhs to be constructed twice, and possibly result in
6805 accidental self-initialization. So we force the TARGET_EXPR to be
6806 expanded without a target. */
6807 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6808 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6809 TREE_OPERAND (newrhs
, 0));
6812 if (newrhs
== error_mark_node
)
6813 return error_mark_node
;
6815 if (c_dialect_objc () && flag_objc_gc
)
6817 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6823 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6824 lhstype
, lhs
, newrhs
);
6826 TREE_SIDE_EFFECTS (result
) = 1;
6828 TREE_NO_WARNING (result
) = 1;
6834 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6835 tsubst_flags_t complain
)
6837 if (processing_template_decl
)
6838 return build_min_nt (MODOP_EXPR
, lhs
,
6839 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6841 if (modifycode
!= NOP_EXPR
)
6843 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6844 make_node (modifycode
),
6845 /*overloaded_p=*/NULL
,
6849 TREE_NO_WARNING (rval
) = 1;
6853 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6856 /* Helper function for get_delta_difference which assumes FROM is a base
6857 class of TO. Returns a delta for the conversion of pointer-to-member
6858 of FROM to pointer-to-member of TO. If the conversion is invalid,
6859 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6860 If C_CAST_P is true, this conversion is taking place as part of a C-style
6864 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
)
6869 binfo
= lookup_base (to
, from
, c_cast_p
? ba_unique
: ba_check
, &kind
);
6870 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6872 error (" in pointer to member function conversion");
6873 return size_zero_node
;
6877 if (kind
!= bk_via_virtual
)
6878 return BINFO_OFFSET (binfo
);
6880 /* FROM is a virtual base class of TO. Issue an error or warning
6881 depending on whether or not this is a reinterpret cast. */
6883 error ("pointer to member conversion via virtual base %qT",
6884 BINFO_TYPE (binfo_from_vbase (binfo
)));
6886 return size_zero_node
;
6893 /* Get difference in deltas for different pointer to member function
6894 types. Returns an integer constant of type PTRDIFF_TYPE_NODE. If
6895 the conversion is invalid, the constant is zero. If
6896 ALLOW_INVERSE_P is true, then allow reverse conversions as well.
6897 If C_CAST_P is true this conversion is taking place as part of a
6900 Note that the naming of FROM and TO is kind of backwards; the return
6901 value is what we add to a TO in order to get a FROM. They are named
6902 this way because we call this function to find out how to convert from
6903 a pointer to member of FROM to a pointer to member of TO. */
6906 get_delta_difference (tree from
, tree to
,
6907 bool allow_inverse_p
,
6912 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
6913 /* Pointer to member of incomplete class is permitted*/
6914 result
= size_zero_node
;
6916 result
= get_delta_difference_1 (from
, to
, c_cast_p
);
6920 if (!allow_inverse_p
)
6922 error_not_base_type (from
, to
);
6923 error (" in pointer to member conversion");
6924 result
= size_zero_node
;
6928 result
= get_delta_difference_1 (to
, from
, c_cast_p
);
6931 result
= size_diffop_loc (input_location
,
6932 size_zero_node
, result
);
6935 error_not_base_type (from
, to
);
6936 error (" in pointer to member conversion");
6937 result
= size_zero_node
;
6942 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
6946 /* Return a constructor for the pointer-to-member-function TYPE using
6947 the other components as specified. */
6950 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
6955 VEC(constructor_elt
, gc
) *v
;
6957 /* Pull the FIELD_DECLs out of the type. */
6958 pfn_field
= TYPE_FIELDS (type
);
6959 delta_field
= TREE_CHAIN (pfn_field
);
6961 /* Make sure DELTA has the type we want. */
6962 delta
= convert_and_check (delta_type_node
, delta
);
6964 /* Convert to the correct target type if necessary. */
6965 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
6967 /* Finish creating the initializer. */
6968 v
= VEC_alloc(constructor_elt
, gc
, 2);
6969 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
6970 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
6971 u
= build_constructor (type
, v
);
6972 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
6973 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
6974 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
6976 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
6981 /* Build a constructor for a pointer to member function. It can be
6982 used to initialize global variables, local variable, or used
6983 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6986 If FORCE is nonzero, then force this conversion, even if
6987 we would rather not do it. Usually set when using an explicit
6988 cast. A C-style cast is being processed iff C_CAST_P is true.
6990 Return error_mark_node, if something goes wrong. */
6993 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
)
6999 if (error_operand_p (pfn
))
7000 return error_mark_node
;
7002 pfn_type
= TREE_TYPE (pfn
);
7003 to_type
= build_ptrmemfunc_type (type
);
7005 /* Handle multiple conversions of pointer to member functions. */
7006 if (TYPE_PTRMEMFUNC_P (pfn_type
))
7008 tree delta
= NULL_TREE
;
7009 tree npfn
= NULL_TREE
;
7013 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
7014 error ("invalid conversion to type %qT from type %qT",
7017 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
7018 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
7022 /* We don't have to do any conversion to convert a
7023 pointer-to-member to its own type. But, we don't want to
7024 just return a PTRMEM_CST if there's an explicit cast; that
7025 cast should make the expression an invalid template argument. */
7026 if (TREE_CODE (pfn
) != PTRMEM_CST
)
7028 if (same_type_p (to_type
, pfn_type
))
7030 else if (integer_zerop (n
))
7031 return build_reinterpret_cast (to_type
, pfn
,
7032 tf_warning_or_error
);
7035 if (TREE_SIDE_EFFECTS (pfn
))
7036 pfn
= save_expr (pfn
);
7038 /* Obtain the function pointer and the current DELTA. */
7039 if (TREE_CODE (pfn
) == PTRMEM_CST
)
7040 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
7043 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
7044 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
7047 /* Just adjust the DELTA field. */
7048 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7049 (TREE_TYPE (delta
), ptrdiff_type_node
));
7050 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
7051 n
= cp_build_binary_op (input_location
,
7052 LSHIFT_EXPR
, n
, integer_one_node
,
7053 tf_warning_or_error
);
7054 delta
= cp_build_binary_op (input_location
,
7055 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
7056 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
7059 /* Handle null pointer to member function conversions. */
7060 if (null_ptr_cst_p (pfn
))
7062 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
7063 return build_ptrmemfunc1 (to_type
,
7068 if (type_unknown_p (pfn
))
7069 return instantiate_type (type
, pfn
, tf_warning_or_error
);
7071 fn
= TREE_OPERAND (pfn
, 0);
7072 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7073 /* In a template, we will have preserved the
7075 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
7076 return make_ptrmem_cst (to_type
, fn
);
7079 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7082 ??? There is no consistency as to the types returned for the above
7083 values. Some code acts as if it were a sizetype and some as if it were
7084 integer_type_node. */
7087 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
7089 tree type
= TREE_TYPE (cst
);
7090 tree fn
= PTRMEM_CST_MEMBER (cst
);
7091 tree ptr_class
, fn_class
;
7093 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7095 /* The class that the function belongs to. */
7096 fn_class
= DECL_CONTEXT (fn
);
7098 /* The class that we're creating a pointer to member of. */
7099 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
7101 /* First, calculate the adjustment to the function's class. */
7102 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
7105 if (!DECL_VIRTUAL_P (fn
))
7106 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
7109 /* If we're dealing with a virtual function, we have to adjust 'this'
7110 again, to point to the base which provides the vtable entry for
7111 fn; the call will do the opposite adjustment. */
7112 tree orig_class
= DECL_CONTEXT (fn
);
7113 tree binfo
= binfo_or_else (orig_class
, fn_class
);
7114 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7115 *delta
, BINFO_OFFSET (binfo
));
7116 *delta
= fold_if_not_in_template (*delta
);
7118 /* We set PFN to the vtable offset at which the function can be
7119 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7120 case delta is shifted left, and then incremented). */
7121 *pfn
= DECL_VINDEX (fn
);
7122 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
7123 TYPE_SIZE_UNIT (vtable_entry_type
));
7124 *pfn
= fold_if_not_in_template (*pfn
);
7126 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
7128 case ptrmemfunc_vbit_in_pfn
:
7129 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
7131 *pfn
= fold_if_not_in_template (*pfn
);
7134 case ptrmemfunc_vbit_in_delta
:
7135 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
7136 *delta
, integer_one_node
);
7137 *delta
= fold_if_not_in_template (*delta
);
7138 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7139 *delta
, integer_one_node
);
7140 *delta
= fold_if_not_in_template (*delta
);
7147 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
7148 *pfn
= fold_if_not_in_template (*pfn
);
7152 /* Return an expression for PFN from the pointer-to-member function
7156 pfn_from_ptrmemfunc (tree t
)
7158 if (TREE_CODE (t
) == PTRMEM_CST
)
7163 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7168 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
7171 /* Return an expression for DELTA from the pointer-to-member function
7175 delta_from_ptrmemfunc (tree t
)
7177 if (TREE_CODE (t
) == PTRMEM_CST
)
7182 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7187 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7190 /* Convert value RHS to type TYPE as preparation for an assignment to
7191 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
7192 implicit conversion is. If FNDECL is non-NULL, we are doing the
7193 conversion in order to pass the PARMNUMth argument of FNDECL.
7194 If FNDECL is NULL, we are doing the conversion in function pointer
7195 argument passing, conversion in initialization, etc. */
7198 convert_for_assignment (tree type
, tree rhs
,
7199 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7200 tsubst_flags_t complain
, int flags
)
7203 enum tree_code coder
;
7205 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7206 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7207 rhs
= TREE_OPERAND (rhs
, 0);
7209 rhstype
= TREE_TYPE (rhs
);
7210 coder
= TREE_CODE (rhstype
);
7212 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7213 && vector_types_convertible_p (type
, rhstype
, true))
7214 return convert (type
, rhs
);
7216 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7217 return error_mark_node
;
7218 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7219 return error_mark_node
;
7221 /* The RHS of an assignment cannot have void type. */
7222 if (coder
== VOID_TYPE
)
7224 if (complain
& tf_error
)
7225 error ("void value not ignored as it ought to be");
7226 return error_mark_node
;
7229 /* Simplify the RHS if possible. */
7230 if (TREE_CODE (rhs
) == CONST_DECL
)
7231 rhs
= DECL_INITIAL (rhs
);
7233 if (c_dialect_objc ())
7237 tree rname
= fndecl
;
7248 selector
= objc_message_selector ();
7250 if (selector
&& parmno
> 1)
7257 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7258 return convert (type
, rhs
);
7263 The expression is implicitly converted (clause _conv_) to the
7264 cv-unqualified type of the left operand.
7266 We allow bad conversions here because by the time we get to this point
7267 we are committed to doing the conversion. If we end up doing a bad
7268 conversion, convert_like will complain. */
7269 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7271 /* When -Wno-pmf-conversions is use, we just silently allow
7272 conversions from pointers-to-members to plain pointers. If
7273 the conversion doesn't work, cp_convert will complain. */
7275 && TYPE_PTR_P (type
)
7276 && TYPE_PTRMEMFUNC_P (rhstype
))
7277 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7280 if (complain
& tf_error
)
7282 /* If the right-hand side has unknown type, then it is an
7283 overloaded function. Call instantiate_type to get error
7285 if (rhstype
== unknown_type_node
)
7286 instantiate_type (type
, rhs
, tf_warning_or_error
);
7288 error ("cannot convert %qT to %qT for argument %qP to %qD",
7289 rhstype
, type
, parmnum
, fndecl
);
7293 case ICR_DEFAULT_ARGUMENT
:
7294 error ("cannot convert %qT to %qT in default argument",
7298 error ("cannot convert %qT to %qT in argument passing",
7301 case ICR_CONVERTING
:
7302 error ("cannot convert %qT to %qT",
7306 error ("cannot convert %qT to %qT in initialization",
7310 error ("cannot convert %qT to %qT in return",
7314 error ("cannot convert %qT to %qT in assignment",
7321 return error_mark_node
;
7324 if (warn_missing_format_attribute
)
7326 const enum tree_code codel
= TREE_CODE (type
);
7327 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7329 && check_missing_format_attribute (type
, rhstype
)
7330 && (complain
& tf_warning
))
7334 case ICR_DEFAULT_ARGUMENT
:
7336 warning (OPT_Wmissing_format_attribute
,
7337 "parameter %qP of %qD might be a candidate "
7338 "for a format attribute", parmnum
, fndecl
);
7340 warning (OPT_Wmissing_format_attribute
,
7341 "parameter might be a candidate "
7342 "for a format attribute");
7344 case ICR_CONVERTING
:
7345 warning (OPT_Wmissing_format_attribute
,
7346 "target of conversion might be might be a candidate "
7347 "for a format attribute");
7350 warning (OPT_Wmissing_format_attribute
,
7351 "target of initialization might be a candidate "
7352 "for a format attribute");
7355 warning (OPT_Wmissing_format_attribute
,
7356 "return type might be a candidate "
7357 "for a format attribute");
7360 warning (OPT_Wmissing_format_attribute
,
7361 "left-hand side of assignment might be a candidate "
7362 "for a format attribute");
7369 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7371 if (warn_parentheses
7372 && TREE_CODE (type
) == BOOLEAN_TYPE
7373 && TREE_CODE (rhs
) == MODIFY_EXPR
7374 && !TREE_NO_WARNING (rhs
)
7375 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7376 && (complain
& tf_warning
))
7378 location_t loc
= EXPR_HAS_LOCATION (rhs
)
7379 ? EXPR_LOCATION (rhs
) : input_location
;
7381 warning_at (loc
, OPT_Wparentheses
,
7382 "suggest parentheses around assignment used as truth value");
7383 TREE_NO_WARNING (rhs
) = 1;
7386 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7390 /* Convert RHS to be of type TYPE.
7391 If EXP is nonzero, it is the target of the initialization.
7392 ERRTYPE indicates what kind of error the implicit conversion is.
7394 Two major differences between the behavior of
7395 `convert_for_assignment' and `convert_for_initialization'
7396 are that references are bashed in the former, while
7397 copied in the latter, and aggregates are assigned in
7398 the former (operator=) while initialized in the
7401 If using constructor make sure no conversion operator exists, if one does
7402 exist, an ambiguity exists.
7404 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7407 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7408 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7409 tsubst_flags_t complain
)
7411 enum tree_code codel
= TREE_CODE (type
);
7413 enum tree_code coder
;
7415 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7416 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7417 if (TREE_CODE (rhs
) == NOP_EXPR
7418 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7419 && codel
!= REFERENCE_TYPE
)
7420 rhs
= TREE_OPERAND (rhs
, 0);
7422 if (type
== error_mark_node
7423 || rhs
== error_mark_node
7424 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7425 return error_mark_node
;
7427 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7428 && TREE_CODE (type
) != ARRAY_TYPE
7429 && (TREE_CODE (type
) != REFERENCE_TYPE
7430 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7431 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7432 && (TREE_CODE (type
) != REFERENCE_TYPE
7433 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7434 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7435 rhs
= decay_conversion (rhs
);
7437 rhstype
= TREE_TYPE (rhs
);
7438 coder
= TREE_CODE (rhstype
);
7440 if (coder
== ERROR_MARK
)
7441 return error_mark_node
;
7443 /* We accept references to incomplete types, so we can
7444 return here before checking if RHS is of complete type. */
7446 if (codel
== REFERENCE_TYPE
)
7448 /* This should eventually happen in convert_arguments. */
7449 int savew
= 0, savee
= 0;
7452 savew
= warningcount
, savee
= errorcount
;
7453 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7454 /*cleanup=*/NULL
, complain
);
7457 if (warningcount
> savew
)
7458 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7459 else if (errorcount
> savee
)
7460 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7466 exp
= require_complete_type (exp
);
7467 if (exp
== error_mark_node
)
7468 return error_mark_node
;
7470 rhstype
= non_reference (rhstype
);
7472 type
= complete_type (type
);
7474 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7475 /* Don't try to do copy-initialization if we already have
7476 direct-initialization. */
7479 if (MAYBE_CLASS_TYPE_P (type
))
7480 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
7482 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7486 /* If RETVAL is the address of, or a reference to, a local variable or
7487 temporary give an appropriate warning. */
7490 maybe_warn_about_returning_address_of_local (tree retval
)
7492 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7493 tree whats_returned
= retval
;
7497 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7498 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7499 else if (CONVERT_EXPR_P (whats_returned
)
7500 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7501 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7506 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7508 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7510 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7512 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7513 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7515 warning (0, "returning reference to temporary");
7518 if (TREE_CODE (whats_returned
) == VAR_DECL
7519 && DECL_NAME (whats_returned
)
7520 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7522 warning (0, "reference to non-lvalue returned");
7527 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7528 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7529 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7531 if (DECL_P (whats_returned
)
7532 && DECL_NAME (whats_returned
)
7533 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7534 && !(TREE_STATIC (whats_returned
)
7535 || TREE_PUBLIC (whats_returned
)))
7537 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7538 warning (0, "reference to local variable %q+D returned",
7541 warning (0, "address of local variable %q+D returned",
7547 /* Check that returning RETVAL from the current function is valid.
7548 Return an expression explicitly showing all conversions required to
7549 change RETVAL into the function return type, and to assign it to
7550 the DECL_RESULT for the function. Set *NO_WARNING to true if
7551 code reaches end of non-void function warning shouldn't be issued
7552 on this RETURN_EXPR. */
7555 check_return_expr (tree retval
, bool *no_warning
)
7558 /* The type actually returned by the function, after any
7561 int fn_returns_value_p
;
7562 bool named_return_value_okay_p
;
7564 *no_warning
= false;
7566 /* A `volatile' function is one that isn't supposed to return, ever.
7567 (This is a G++ extension, used to get better code for functions
7568 that call the `volatile' function.) */
7569 if (TREE_THIS_VOLATILE (current_function_decl
))
7570 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7572 /* Check for various simple errors. */
7573 if (DECL_DESTRUCTOR_P (current_function_decl
))
7576 error ("returning a value from a destructor");
7579 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7581 if (in_function_try_handler
)
7582 /* If a return statement appears in a handler of the
7583 function-try-block of a constructor, the program is ill-formed. */
7584 error ("cannot return from a handler of a function-try-block of a constructor");
7586 /* You can't return a value from a constructor. */
7587 error ("returning a value from a constructor");
7591 /* As an extension, deduce lambda return type from a return statement
7592 anywhere in the body. */
7593 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7595 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7596 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7598 tree type
= lambda_return_type (retval
);
7599 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7601 if (VOID_TYPE_P (type
))
7603 else if (oldtype
== NULL_TREE
)
7605 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7606 "can only be deduced when the return statement is "
7607 "the only statement in the function body");
7608 apply_lambda_return_type (lambda
, type
);
7610 else if (!same_type_p (type
, oldtype
))
7611 error ("inconsistent types %qT and %qT deduced for "
7612 "lambda return type", type
, oldtype
);
7616 if (processing_template_decl
)
7618 current_function_returns_value
= 1;
7619 if (check_for_bare_parameter_packs (retval
))
7620 retval
= error_mark_node
;
7624 /* When no explicit return-value is given in a function with a named
7625 return value, the named return value is used. */
7626 result
= DECL_RESULT (current_function_decl
);
7627 valtype
= TREE_TYPE (result
);
7628 gcc_assert (valtype
!= NULL_TREE
);
7629 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7630 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7633 /* Check for a return statement with no return value in a function
7634 that's supposed to return a value. */
7635 if (!retval
&& fn_returns_value_p
)
7637 permerror (input_location
, "return-statement with no value, in function returning %qT",
7639 /* Clear this, so finish_function won't say that we reach the
7640 end of a non-void function (which we don't, we gave a
7642 current_function_returns_null
= 0;
7643 /* And signal caller that TREE_NO_WARNING should be set on the
7644 RETURN_EXPR to avoid control reaches end of non-void function
7645 warnings in tree-cfg.c. */
7648 /* Check for a return statement with a value in a function that
7649 isn't supposed to return a value. */
7650 else if (retval
&& !fn_returns_value_p
)
7652 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7653 /* You can return a `void' value from a function of `void'
7654 type. In that case, we have to evaluate the expression for
7655 its side-effects. */
7656 finish_expr_stmt (retval
);
7658 permerror (input_location
, "return-statement with a value, in function "
7659 "returning 'void'");
7660 current_function_returns_null
= 1;
7662 /* There's really no value to return, after all. */
7666 /* Remember that this function can sometimes return without a
7668 current_function_returns_null
= 1;
7670 /* Remember that this function did return a value. */
7671 current_function_returns_value
= 1;
7673 /* Check for erroneous operands -- but after giving ourselves a
7674 chance to provide an error about returning a value from a void
7676 if (error_operand_p (retval
))
7678 current_function_return_value
= error_mark_node
;
7679 return error_mark_node
;
7682 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7683 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7684 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7685 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7687 && retval
&& null_ptr_cst_p (retval
))
7688 warning (0, "%<operator new%> must not return NULL unless it is "
7689 "declared %<throw()%> (or -fcheck-new is in effect)");
7691 /* Effective C++ rule 15. See also start_function. */
7693 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7697 /* The function return type must be a reference to the current
7699 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7700 && same_type_ignoring_top_level_qualifiers_p
7701 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7703 /* Returning '*this' is obviously OK. */
7704 if (retval
== current_class_ref
)
7706 /* If we are calling a function whose return type is the same of
7707 the current class reference, it is ok. */
7708 else if (TREE_CODE (retval
) == INDIRECT_REF
7709 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7714 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7717 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7719 [...] For a function with a class return type, if the expression
7720 in the return statement is the name of a local object, and the cv-
7721 unqualified type of the local object is the same as the function
7722 return type, an implementation is permitted to omit creating the tem-
7723 porary object to hold the function return value [...]
7725 So, if this is a value-returning function that always returns the same
7726 local variable, remember it.
7728 It might be nice to be more flexible, and choose the first suitable
7729 variable even if the function sometimes returns something else, but
7730 then we run the risk of clobbering the variable we chose if the other
7731 returned expression uses the chosen variable somehow. And people expect
7732 this restriction, anyway. (jason 2000-11-19)
7734 See finish_function and finalize_nrv for the rest of this optimization. */
7736 named_return_value_okay_p
=
7737 (retval
!= NULL_TREE
7738 /* Must be a local, automatic variable. */
7739 && TREE_CODE (retval
) == VAR_DECL
7740 && DECL_CONTEXT (retval
) == current_function_decl
7741 && ! TREE_STATIC (retval
)
7742 && ! DECL_ANON_UNION_VAR_P (retval
)
7743 && (DECL_ALIGN (retval
)
7744 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7745 /* The cv-unqualified type of the returned value must be the
7746 same as the cv-unqualified return type of the
7748 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7750 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7751 /* And the returned value must be non-volatile. */
7752 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7754 if (fn_returns_value_p
&& flag_elide_constructors
)
7756 if (named_return_value_okay_p
7757 && (current_function_return_value
== NULL_TREE
7758 || current_function_return_value
== retval
))
7759 current_function_return_value
= retval
;
7761 current_function_return_value
= error_mark_node
;
7764 /* We don't need to do any conversions when there's nothing being
7769 /* Do any required conversions. */
7770 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7771 /* No conversions are required. */
7775 /* The type the function is declared to return. */
7776 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7777 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7779 /* The functype's return type will have been set to void, if it
7780 was an incomplete type. Just treat this as 'return;' */
7781 if (VOID_TYPE_P (functype
))
7782 return error_mark_node
;
7784 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7785 treated as an rvalue for the purposes of overload resolution to
7786 favor move constructors over copy constructors. */
7787 if ((cxx_dialect
!= cxx98
)
7788 && named_return_value_okay_p
7789 /* The variable must not have the `volatile' qualifier. */
7790 && !CP_TYPE_VOLATILE_P (TREE_TYPE (retval
))
7791 /* The return type must be a class type. */
7792 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7793 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7795 /* First convert the value to the function's return type, then
7796 to the type of return value's location to handle the
7797 case that functype is smaller than the valtype. */
7798 retval
= convert_for_initialization
7799 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
7800 tf_warning_or_error
);
7801 retval
= convert (valtype
, retval
);
7803 /* If the conversion failed, treat this just like `return;'. */
7804 if (retval
== error_mark_node
)
7806 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7807 else if (! cfun
->returns_struct
7808 && TREE_CODE (retval
) == TARGET_EXPR
7809 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7810 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7811 TREE_OPERAND (retval
, 0));
7813 maybe_warn_about_returning_address_of_local (retval
);
7816 /* Actually copy the value returned into the appropriate location. */
7817 if (retval
&& retval
!= result
)
7818 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7824 /* Returns nonzero if the pointer-type FROM can be converted to the
7825 pointer-type TO via a qualification conversion. If CONSTP is -1,
7826 then we return nonzero if the pointers are similar, and the
7827 cv-qualification signature of FROM is a proper subset of that of TO.
7829 If CONSTP is positive, then all outer pointers have been
7833 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7835 bool to_more_cv_qualified
= false;
7836 bool is_opaque_pointer
= false;
7838 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7840 if (TREE_CODE (to
) != TREE_CODE (from
))
7843 if (TREE_CODE (from
) == OFFSET_TYPE
7844 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7845 TYPE_OFFSET_BASETYPE (to
)))
7848 /* Const and volatile mean something different for function types,
7849 so the usual checks are not appropriate. */
7850 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7852 /* In Objective-C++, some types may have been 'volatilized' by
7853 the compiler for EH; when comparing them here, the volatile
7854 qualification must be ignored. */
7855 bool objc_quals_match
= objc_type_quals_match (to
, from
);
7857 if (!at_least_as_qualified_p (to
, from
) && !objc_quals_match
)
7860 if (!at_least_as_qualified_p (from
, to
) && !objc_quals_match
)
7864 to_more_cv_qualified
= true;
7868 constp
&= TYPE_READONLY (to
);
7871 if (TREE_CODE (to
) == VECTOR_TYPE
)
7872 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7874 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
7875 return ((constp
>= 0 || to_more_cv_qualified
)
7876 && (is_opaque_pointer
7877 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
7881 /* When comparing, say, char ** to char const **, this function takes
7882 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7883 types to this function. */
7886 comp_ptr_ttypes (tree to
, tree from
)
7888 return comp_ptr_ttypes_real (to
, from
, 1);
7891 /* Returns true iff FNTYPE is a non-class type that involves
7892 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7893 if a parameter type is ill-formed. */
7896 error_type_p (const_tree type
)
7900 switch (TREE_CODE (type
))
7906 case REFERENCE_TYPE
:
7908 return error_type_p (TREE_TYPE (type
));
7912 if (error_type_p (TREE_TYPE (type
)))
7914 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7915 if (error_type_p (TREE_VALUE (t
)))
7920 if (TYPE_PTRMEMFUNC_P (type
))
7921 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
7929 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7930 type or inheritance-related types, regardless of cv-quals. */
7933 ptr_reasonably_similar (const_tree to
, const_tree from
)
7935 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7937 /* Any target type is similar enough to void. */
7938 if (TREE_CODE (to
) == VOID_TYPE
)
7939 return !error_type_p (from
);
7940 if (TREE_CODE (from
) == VOID_TYPE
)
7941 return !error_type_p (to
);
7943 if (TREE_CODE (to
) != TREE_CODE (from
))
7946 if (TREE_CODE (from
) == OFFSET_TYPE
7947 && comptypes (TYPE_OFFSET_BASETYPE (to
),
7948 TYPE_OFFSET_BASETYPE (from
),
7949 COMPARE_BASE
| COMPARE_DERIVED
))
7952 if (TREE_CODE (to
) == VECTOR_TYPE
7953 && vector_types_convertible_p (to
, from
, false))
7956 if (TREE_CODE (to
) == INTEGER_TYPE
7957 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
7960 if (TREE_CODE (to
) == FUNCTION_TYPE
)
7961 return !error_type_p (to
) && !error_type_p (from
);
7963 if (TREE_CODE (to
) != POINTER_TYPE
)
7965 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
7966 COMPARE_BASE
| COMPARE_DERIVED
);
7970 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
7971 pointer-to-member types) are the same, ignoring cv-qualification at
7975 comp_ptr_ttypes_const (tree to
, tree from
)
7977 bool is_opaque_pointer
= false;
7979 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7981 if (TREE_CODE (to
) != TREE_CODE (from
))
7984 if (TREE_CODE (from
) == OFFSET_TYPE
7985 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
7986 TYPE_OFFSET_BASETYPE (to
)))
7989 if (TREE_CODE (to
) == VECTOR_TYPE
)
7990 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7992 if (TREE_CODE (to
) != POINTER_TYPE
)
7993 return (is_opaque_pointer
7994 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
7998 /* Returns the type qualifiers for this type, including the qualifiers on the
7999 elements for an array type. */
8002 cp_type_quals (const_tree type
)
8005 /* This CONST_CAST is okay because strip_array_types returns its
8006 argument unmodified and we assign it to a const_tree. */
8007 type
= strip_array_types (CONST_CAST_TREE (type
));
8008 if (type
== error_mark_node
8009 /* Quals on a FUNCTION_TYPE are memfn quals. */
8010 || TREE_CODE (type
) == FUNCTION_TYPE
)
8011 return TYPE_UNQUALIFIED
;
8012 quals
= TYPE_QUALS (type
);
8013 /* METHOD and REFERENCE_TYPEs should never have quals. */
8014 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
8015 && TREE_CODE (type
) != REFERENCE_TYPE
)
8016 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
8017 == TYPE_UNQUALIFIED
));
8021 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
8025 type_memfn_quals (const_tree type
)
8027 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8028 return TYPE_QUALS (type
);
8029 else if (TREE_CODE (type
) == METHOD_TYPE
)
8030 return cp_type_quals (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))));
8035 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
8039 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
)
8041 /* Could handle METHOD_TYPE here if necessary. */
8042 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8043 if (TYPE_QUALS (type
) == memfn_quals
)
8045 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
8047 return build_qualified_type (type
, memfn_quals
);
8050 /* Returns nonzero if TYPE is const or volatile. */
8053 cv_qualified_p (const_tree type
)
8055 int quals
= cp_type_quals (type
);
8056 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
8059 /* Returns nonzero if the TYPE contains a mutable member. */
8062 cp_has_mutable_p (const_tree type
)
8064 /* This CONST_CAST is okay because strip_array_types returns its
8065 argument unmodified and we assign it to a const_tree. */
8066 type
= strip_array_types (CONST_CAST_TREE(type
));
8068 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
8071 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
8072 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
8073 approximation. In particular, consider:
8076 struct S { int i; };
8077 const S s = { f(); }
8079 Here, we will make "s" as TREE_READONLY (because it is declared
8080 "const") -- only to reverse ourselves upon seeing that the
8081 initializer is non-constant. */
8084 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
8086 tree type
= TREE_TYPE (decl
);
8088 if (type
== error_mark_node
)
8091 if (TREE_CODE (decl
) == TYPE_DECL
)
8094 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
8095 && type_quals
!= TYPE_UNQUALIFIED
));
8097 /* Avoid setting TREE_READONLY incorrectly. */
8098 if (/* If the object has a constructor, the constructor may modify
8100 TYPE_NEEDS_CONSTRUCTING (type
)
8101 /* If the type isn't complete, we don't know yet if it will need
8103 || !COMPLETE_TYPE_P (type
)
8104 /* If the type has a mutable component, that component might be
8106 || TYPE_HAS_MUTABLE_P (type
))
8107 type_quals
&= ~TYPE_QUAL_CONST
;
8109 c_apply_type_quals_to_decl (type_quals
, decl
);
8112 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8113 exemplar types such that casting T1 to T2 is casting away constness
8114 if and only if there is no implicit conversion from T1 to T2. */
8117 casts_away_constness_r (tree
*t1
, tree
*t2
)
8122 /* [expr.const.cast]
8124 For multi-level pointer to members and multi-level mixed pointers
8125 and pointers to members (conv.qual), the "member" aspect of a
8126 pointer to member level is ignored when determining if a const
8127 cv-qualifier has been cast away. */
8128 /* [expr.const.cast]
8130 For two pointer types:
8132 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8133 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8136 casting from X1 to X2 casts away constness if, for a non-pointer
8137 type T there does not exist an implicit conversion (clause
8140 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8144 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8145 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
8146 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
8148 *t1
= cp_build_qualified_type (void_type_node
,
8149 cp_type_quals (*t1
));
8150 *t2
= cp_build_qualified_type (void_type_node
,
8151 cp_type_quals (*t2
));
8155 quals1
= cp_type_quals (*t1
);
8156 quals2
= cp_type_quals (*t2
);
8158 if (TYPE_PTRMEM_P (*t1
))
8159 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
8161 *t1
= TREE_TYPE (*t1
);
8162 if (TYPE_PTRMEM_P (*t2
))
8163 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
8165 *t2
= TREE_TYPE (*t2
);
8167 casts_away_constness_r (t1
, t2
);
8168 *t1
= build_pointer_type (*t1
);
8169 *t2
= build_pointer_type (*t2
);
8170 *t1
= cp_build_qualified_type (*t1
, quals1
);
8171 *t2
= cp_build_qualified_type (*t2
, quals2
);
8174 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8177 ??? This function returns non-zero if casting away qualifiers not
8178 just const. We would like to return to the caller exactly which
8179 qualifiers are casted away to give more accurate diagnostics.
8183 casts_away_constness (tree t1
, tree t2
)
8185 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
8187 /* [expr.const.cast]
8189 Casting from an lvalue of type T1 to an lvalue of type T2
8190 using a reference cast casts away constness if a cast from an
8191 rvalue of type "pointer to T1" to the type "pointer to T2"
8192 casts away constness. */
8193 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
8194 return casts_away_constness (build_pointer_type (t1
),
8195 build_pointer_type (TREE_TYPE (t2
)));
8198 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
8199 /* [expr.const.cast]
8201 Casting from an rvalue of type "pointer to data member of X
8202 of type T1" to the type "pointer to data member of Y of type
8203 T2" casts away constness if a cast from an rvalue of type
8204 "pointer to T1" to the type "pointer to T2" casts away
8206 return casts_away_constness
8207 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
8208 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
8210 /* Casting away constness is only something that makes sense for
8211 pointer or reference types. */
8212 if (TREE_CODE (t1
) != POINTER_TYPE
8213 || TREE_CODE (t2
) != POINTER_TYPE
)
8216 /* Top-level qualifiers don't matter. */
8217 t1
= TYPE_MAIN_VARIANT (t1
);
8218 t2
= TYPE_MAIN_VARIANT (t2
);
8219 casts_away_constness_r (&t1
, &t2
);
8220 if (!can_convert (t2
, t1
))
8226 /* If T is a REFERENCE_TYPE return the type to which T refers.
8227 Otherwise, return T itself. */
8230 non_reference (tree t
)
8232 if (TREE_CODE (t
) == REFERENCE_TYPE
)
8238 /* Return nonzero if REF is an lvalue valid for this language;
8239 otherwise, print an error message and return zero. USE says
8240 how the lvalue is being used and so selects the error message. */
8243 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
8245 int win
= lvalue_p (ref
);
8247 if (!win
&& (complain
& tf_error
))