1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
5 Hacked by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
24 /* This file is part of the C++ front end.
25 It contains routines to build C++ expressions given their operands,
26 including computing the types of the result, C and C++ specific error
27 checks, and some optimization. */
31 #include "coretypes.h"
37 #include "diagnostic.h"
41 #include "c-family/c-common.h"
42 #include "c-family/c-objc.h"
45 static tree
pfn_from_ptrmemfunc (tree
);
46 static tree
delta_from_ptrmemfunc (tree
);
47 static tree
convert_for_assignment (tree
, tree
, impl_conv_rhs
, tree
, int,
49 static tree
cp_pointer_int_sum (enum tree_code
, tree
, tree
);
50 static tree
rationalize_conditional_expr (enum tree_code
, tree
,
52 static int comp_ptr_ttypes_real (tree
, tree
, int);
53 static bool comp_except_types (tree
, tree
, bool);
54 static bool comp_array_types (const_tree
, const_tree
, bool);
55 static tree
pointer_diff (tree
, tree
, tree
);
56 static tree
get_delta_difference (tree
, tree
, bool, bool, tsubst_flags_t
);
57 static void casts_away_constness_r (tree
*, tree
*);
58 static bool casts_away_constness (tree
, tree
);
59 static void maybe_warn_about_returning_address_of_local (tree
);
60 static tree
lookup_destructor (tree
, tree
, tree
);
61 static void warn_args_num (location_t
, tree
, bool);
62 static int convert_arguments (tree
, VEC(tree
,gc
) **, tree
, int,
65 /* Do `exp = require_complete_type (exp);' to make sure exp
66 does not have an incomplete type. (That includes void types.)
67 Returns error_mark_node if the VALUE does not have
68 complete type when this function returns. */
71 require_complete_type_sfinae (tree value
, tsubst_flags_t complain
)
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_maybe_complain (type
, value
, complain
))
93 return error_mark_node
;
97 require_complete_type (tree value
)
99 return require_complete_type_sfinae (value
, tf_warning_or_error
);
102 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
103 a template instantiation, do the instantiation. Returns TYPE,
104 whether or not it could be completed, unless something goes
105 horribly wrong, in which case the error_mark_node is returned. */
108 complete_type (tree type
)
110 if (type
== NULL_TREE
)
111 /* Rather than crash, we return something sure to cause an error
113 return error_mark_node
;
115 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
117 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
119 tree t
= complete_type (TREE_TYPE (type
));
120 unsigned int needs_constructing
, has_nontrivial_dtor
;
121 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
124 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
126 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
127 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
129 TYPE_NEEDS_CONSTRUCTING (t
) = needs_constructing
;
130 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = has_nontrivial_dtor
;
133 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
134 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
139 /* Like complete_type, but issue an error if the TYPE cannot be completed.
140 VALUE is used for informative diagnostics.
141 Returns NULL_TREE if the type cannot be made complete. */
144 complete_type_or_maybe_complain (tree type
, tree value
, tsubst_flags_t complain
)
146 type
= complete_type (type
);
147 if (type
== error_mark_node
)
148 /* We already issued an error. */
150 else if (!COMPLETE_TYPE_P (type
))
152 if (complain
& tf_error
)
153 cxx_incomplete_type_diagnostic (value
, type
, DK_ERROR
);
161 complete_type_or_else (tree type
, tree value
)
163 return complete_type_or_maybe_complain (type
, value
, tf_warning_or_error
);
166 /* Return truthvalue of whether type of EXP is instantiated. */
169 type_unknown_p (const_tree exp
)
171 return (TREE_CODE (exp
) == TREE_LIST
172 || TREE_TYPE (exp
) == unknown_type_node
);
176 /* Return the common type of two parameter lists.
177 We assume that comptypes has already been done and returned 1;
178 if that isn't so, this may crash.
180 As an optimization, free the space we allocate if the parameter
181 lists are already common. */
184 commonparms (tree p1
, tree p2
)
186 tree oldargs
= p1
, newargs
, n
;
190 len
= list_length (p1
);
191 newargs
= tree_last (p1
);
193 if (newargs
== void_list_node
)
202 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
207 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
209 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
211 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
214 else if (! TREE_PURPOSE (p1
))
216 if (TREE_PURPOSE (p2
))
218 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
224 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
226 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
228 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
231 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
234 TREE_VALUE (n
) = TREE_VALUE (p1
);
242 /* Given a type, perhaps copied for a typedef,
243 find the "original" version of it. */
245 original_type (tree t
)
247 int quals
= cp_type_quals (t
);
248 while (t
!= error_mark_node
249 && TYPE_NAME (t
) != NULL_TREE
)
251 tree x
= TYPE_NAME (t
);
252 if (TREE_CODE (x
) != TYPE_DECL
)
254 x
= DECL_ORIGINAL_TYPE (x
);
259 return cp_build_qualified_type (t
, quals
);
262 /* Return the common type for two arithmetic types T1 and T2 under the
263 usual arithmetic conversions. The default conversions have already
264 been applied, and enumerated types converted to their compatible
268 cp_common_type (tree t1
, tree t2
)
270 enum tree_code code1
= TREE_CODE (t1
);
271 enum tree_code code2
= TREE_CODE (t2
);
275 /* In what follows, we slightly generalize the rules given in [expr] so
276 as to deal with `long long' and `complex'. First, merge the
278 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
280 if (SCOPED_ENUM_P (t1
) || SCOPED_ENUM_P (t2
))
282 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
283 return build_type_attribute_variant (t1
, attributes
);
288 /* FIXME: Attributes. */
289 gcc_assert (ARITHMETIC_TYPE_P (t1
)
290 || TREE_CODE (t1
) == VECTOR_TYPE
291 || UNSCOPED_ENUM_P (t1
));
292 gcc_assert (ARITHMETIC_TYPE_P (t2
)
293 || TREE_CODE (t2
) == VECTOR_TYPE
294 || UNSCOPED_ENUM_P (t2
));
296 /* If one type is complex, form the common type of the non-complex
297 components, then make that complex. Use T1 or T2 if it is the
299 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
301 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
302 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
304 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
306 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
307 return build_type_attribute_variant (t1
, attributes
);
308 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
309 return build_type_attribute_variant (t2
, attributes
);
311 return build_type_attribute_variant (build_complex_type (subtype
),
315 if (code1
== VECTOR_TYPE
)
317 /* When we get here we should have two vectors of the same size.
318 Just prefer the unsigned one if present. */
319 if (TYPE_UNSIGNED (t1
))
320 return build_type_attribute_variant (t1
, attributes
);
322 return build_type_attribute_variant (t2
, attributes
);
325 /* If only one is real, use it as the result. */
326 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
327 return build_type_attribute_variant (t1
, attributes
);
328 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
329 return build_type_attribute_variant (t2
, attributes
);
331 /* Both real or both integers; use the one with greater precision. */
332 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
333 return build_type_attribute_variant (t1
, attributes
);
334 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
335 return build_type_attribute_variant (t2
, attributes
);
337 /* The types are the same; no need to do anything fancy. */
338 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
339 return build_type_attribute_variant (t1
, attributes
);
341 if (code1
!= REAL_TYPE
)
343 /* If one is unsigned long long, then convert the other to unsigned
345 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
346 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
347 return build_type_attribute_variant (long_long_unsigned_type_node
,
349 /* If one is a long long, and the other is an unsigned long, and
350 long long can represent all the values of an unsigned long, then
351 convert to a long long. Otherwise, convert to an unsigned long
352 long. Otherwise, if either operand is long long, convert the
355 Since we're here, we know the TYPE_PRECISION is the same;
356 therefore converting to long long cannot represent all the values
357 of an unsigned long, so we choose unsigned long long in that
359 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
360 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
362 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
363 ? long_long_unsigned_type_node
364 : long_long_integer_type_node
);
365 return build_type_attribute_variant (t
, attributes
);
367 if (int128_integer_type_node
!= NULL_TREE
368 && (same_type_p (TYPE_MAIN_VARIANT (t1
),
369 int128_integer_type_node
)
370 || same_type_p (TYPE_MAIN_VARIANT (t2
),
371 int128_integer_type_node
)))
373 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
374 ? int128_unsigned_type_node
375 : int128_integer_type_node
);
376 return build_type_attribute_variant (t
, attributes
);
379 /* Go through the same procedure, but for longs. */
380 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
381 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
382 return build_type_attribute_variant (long_unsigned_type_node
,
384 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
385 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
387 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
388 ? long_unsigned_type_node
: long_integer_type_node
);
389 return build_type_attribute_variant (t
, attributes
);
391 /* Otherwise prefer the unsigned one. */
392 if (TYPE_UNSIGNED (t1
))
393 return build_type_attribute_variant (t1
, attributes
);
395 return build_type_attribute_variant (t2
, attributes
);
399 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
400 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
401 return build_type_attribute_variant (long_double_type_node
,
403 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
404 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
405 return build_type_attribute_variant (double_type_node
,
407 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
408 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
409 return build_type_attribute_variant (float_type_node
,
412 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
413 the standard C++ floating-point types. Logic earlier in this
414 function has already eliminated the possibility that
415 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
416 compelling reason to choose one or the other. */
417 return build_type_attribute_variant (t1
, attributes
);
421 /* T1 and T2 are arithmetic or enumeration types. Return the type
422 that will result from the "usual arithmetic conversions" on T1 and
423 T2 as described in [expr]. */
426 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
428 gcc_assert (ARITHMETIC_TYPE_P (t1
)
429 || TREE_CODE (t1
) == VECTOR_TYPE
430 || UNSCOPED_ENUM_P (t1
));
431 gcc_assert (ARITHMETIC_TYPE_P (t2
)
432 || TREE_CODE (t2
) == VECTOR_TYPE
433 || UNSCOPED_ENUM_P (t2
));
435 /* Perform the integral promotions. We do not promote real types here. */
436 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1
)
437 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2
))
439 t1
= type_promotes_to (t1
);
440 t2
= type_promotes_to (t2
);
443 return cp_common_type (t1
, t2
);
447 composite_pointer_error (diagnostic_t kind
, tree t1
, tree t2
,
448 composite_pointer_operation operation
)
453 emit_diagnostic (kind
, input_location
, 0,
454 "comparison between "
455 "distinct pointer types %qT and %qT lacks a cast",
459 emit_diagnostic (kind
, input_location
, 0,
460 "conversion between "
461 "distinct pointer types %qT and %qT lacks a cast",
464 case CPO_CONDITIONAL_EXPR
:
465 emit_diagnostic (kind
, input_location
, 0,
466 "conditional expression between "
467 "distinct pointer types %qT and %qT lacks a cast",
475 /* Subroutine of composite_pointer_type to implement the recursive
476 case. See that function for documentation of the parameters. */
479 composite_pointer_type_r (tree t1
, tree t2
,
480 composite_pointer_operation operation
,
481 tsubst_flags_t complain
)
488 /* Determine the types pointed to by T1 and T2. */
489 if (TREE_CODE (t1
) == POINTER_TYPE
)
491 pointee1
= TREE_TYPE (t1
);
492 pointee2
= TREE_TYPE (t2
);
496 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
497 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
502 Otherwise, the composite pointer type is a pointer type
503 similar (_conv.qual_) to the type of one of the operands,
504 with a cv-qualification signature (_conv.qual_) that is the
505 union of the cv-qualification signatures of the operand
507 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
508 result_type
= pointee1
;
509 else if ((TREE_CODE (pointee1
) == POINTER_TYPE
510 && TREE_CODE (pointee2
) == POINTER_TYPE
)
511 || (TYPE_PTR_TO_MEMBER_P (pointee1
)
512 && TYPE_PTR_TO_MEMBER_P (pointee2
)))
513 result_type
= composite_pointer_type_r (pointee1
, pointee2
, operation
,
517 if (complain
& tf_error
)
518 composite_pointer_error (DK_PERMERROR
, t1
, t2
, operation
);
520 result_type
= void_type_node
;
522 result_type
= cp_build_qualified_type (result_type
,
523 (cp_type_quals (pointee1
)
524 | cp_type_quals (pointee2
)));
525 /* If the original types were pointers to members, so is the
527 if (TYPE_PTR_TO_MEMBER_P (t1
))
529 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
530 TYPE_PTRMEM_CLASS_TYPE (t2
))
531 && (complain
& tf_error
))
532 composite_pointer_error (DK_PERMERROR
, t1
, t2
, operation
);
533 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
537 result_type
= build_pointer_type (result_type
);
539 /* Merge the attributes. */
540 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
541 return build_type_attribute_variant (result_type
, attributes
);
544 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
545 ARG1 and ARG2 are the values with those types. The OPERATION is to
546 describe the operation between the pointer types,
547 in case an error occurs.
549 This routine also implements the computation of a common type for
550 pointers-to-members as per [expr.eq]. */
553 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
554 composite_pointer_operation operation
,
555 tsubst_flags_t complain
)
562 If one operand is a null pointer constant, the composite pointer
563 type is the type of the other operand. */
564 if (null_ptr_cst_p (arg1
))
566 if (null_ptr_cst_p (arg2
))
573 If one of the operands has type "pointer to cv1 void*", then
574 the other has type "pointer to cv2T", and the composite pointer
575 type is "pointer to cv12 void", where cv12 is the union of cv1
578 If either type is a pointer to void, make sure it is T1. */
579 if (TREE_CODE (t2
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t2
)))
587 /* Now, if T1 is a pointer to void, merge the qualifiers. */
588 if (TREE_CODE (t1
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t1
)))
593 if (TYPE_PTRFN_P (t2
) && (complain
& tf_error
))
598 pedwarn (input_location
, OPT_pedantic
,
599 "ISO C++ forbids comparison between "
600 "pointer of type %<void *%> and pointer-to-function");
603 pedwarn (input_location
, OPT_pedantic
,
604 "ISO C++ forbids conversion between "
605 "pointer of type %<void *%> and pointer-to-function");
607 case CPO_CONDITIONAL_EXPR
:
608 pedwarn (input_location
, OPT_pedantic
,
609 "ISO C++ forbids conditional expression between "
610 "pointer of type %<void *%> and pointer-to-function");
617 = cp_build_qualified_type (void_type_node
,
618 (cp_type_quals (TREE_TYPE (t1
))
619 | cp_type_quals (TREE_TYPE (t2
))));
620 result_type
= build_pointer_type (result_type
);
621 /* Merge the attributes. */
622 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
623 return build_type_attribute_variant (result_type
, attributes
);
626 if (c_dialect_objc () && TREE_CODE (t1
) == POINTER_TYPE
627 && TREE_CODE (t2
) == POINTER_TYPE
)
629 if (objc_have_common_type (t1
, t2
, -3, NULL_TREE
))
630 return objc_common_type (t1
, t2
);
633 /* [expr.eq] permits the application of a pointer conversion to
634 bring the pointers to a common type. */
635 if (TREE_CODE (t1
) == POINTER_TYPE
&& TREE_CODE (t2
) == POINTER_TYPE
636 && CLASS_TYPE_P (TREE_TYPE (t1
))
637 && CLASS_TYPE_P (TREE_TYPE (t2
))
638 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
641 class1
= TREE_TYPE (t1
);
642 class2
= TREE_TYPE (t2
);
644 if (DERIVED_FROM_P (class1
, class2
))
645 t2
= (build_pointer_type
646 (cp_build_qualified_type (class1
, cp_type_quals (class2
))));
647 else if (DERIVED_FROM_P (class2
, class1
))
648 t1
= (build_pointer_type
649 (cp_build_qualified_type (class2
, cp_type_quals (class1
))));
652 if (complain
& tf_error
)
653 composite_pointer_error (DK_ERROR
, t1
, t2
, operation
);
654 return error_mark_node
;
657 /* [expr.eq] permits the application of a pointer-to-member
658 conversion to change the class type of one of the types. */
659 else if (TYPE_PTR_TO_MEMBER_P (t1
)
660 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
661 TYPE_PTRMEM_CLASS_TYPE (t2
)))
663 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
664 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
666 if (DERIVED_FROM_P (class1
, class2
))
667 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
668 else if (DERIVED_FROM_P (class2
, class1
))
669 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
672 if (complain
& tf_error
)
676 error ("comparison between distinct "
677 "pointer-to-member types %qT and %qT lacks a cast",
681 error ("conversion between distinct "
682 "pointer-to-member types %qT and %qT lacks a cast",
685 case CPO_CONDITIONAL_EXPR
:
686 error ("conditional expression between distinct "
687 "pointer-to-member types %qT and %qT lacks a cast",
693 return error_mark_node
;
697 return composite_pointer_type_r (t1
, t2
, operation
, complain
);
700 /* Return the merged type of two types.
701 We assume that comptypes has already been done and returned 1;
702 if that isn't so, this may crash.
704 This just combines attributes and default arguments; any other
705 differences would cause the two types to compare unalike. */
708 merge_types (tree t1
, tree t2
)
710 enum tree_code code1
;
711 enum tree_code code2
;
714 /* Save time if the two types are the same. */
717 if (original_type (t1
) == original_type (t2
))
720 /* If one type is nonsense, use the other. */
721 if (t1
== error_mark_node
)
723 if (t2
== error_mark_node
)
726 /* Merge the attributes. */
727 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
729 if (TYPE_PTRMEMFUNC_P (t1
))
730 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
731 if (TYPE_PTRMEMFUNC_P (t2
))
732 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
734 code1
= TREE_CODE (t1
);
735 code2
= TREE_CODE (t2
);
738 gcc_assert (code1
== TYPENAME_TYPE
|| code2
== TYPENAME_TYPE
);
739 if (code1
== TYPENAME_TYPE
)
741 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
742 code1
= TREE_CODE (t1
);
746 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
747 code2
= TREE_CODE (t2
);
755 /* For two pointers, do this recursively on the target type. */
757 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
758 int quals
= cp_type_quals (t1
);
760 if (code1
== POINTER_TYPE
)
761 t1
= build_pointer_type (target
);
763 t1
= cp_build_reference_type (target
, TYPE_REF_IS_RVALUE (t1
));
764 t1
= build_type_attribute_variant (t1
, attributes
);
765 t1
= cp_build_qualified_type (t1
, quals
);
767 if (TREE_CODE (target
) == METHOD_TYPE
)
768 t1
= build_ptrmemfunc_type (t1
);
777 quals
= cp_type_quals (t1
);
778 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
779 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
780 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
782 t1
= cp_build_qualified_type (t1
, quals
);
788 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
789 /* Save space: see if the result is identical to one of the args. */
790 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
791 return build_type_attribute_variant (t1
, attributes
);
792 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
793 return build_type_attribute_variant (t2
, attributes
);
794 /* Merge the element types, and have a size if either arg has one. */
795 t1
= build_cplus_array_type
796 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
801 /* Function types: prefer the one that specified arg types.
802 If both do, merge the arg types. Also merge the return types. */
804 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
805 tree p1
= TYPE_ARG_TYPES (t1
);
806 tree p2
= TYPE_ARG_TYPES (t2
);
810 /* Save space: see if the result is identical to one of the args. */
811 if (valtype
== TREE_TYPE (t1
) && ! p2
)
812 return cp_build_type_attribute_variant (t1
, attributes
);
813 if (valtype
== TREE_TYPE (t2
) && ! p1
)
814 return cp_build_type_attribute_variant (t2
, attributes
);
816 /* Simple way if one arg fails to specify argument types. */
817 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
819 else if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
822 parms
= commonparms (p1
, p2
);
824 rval
= build_function_type (valtype
, parms
);
825 gcc_assert (type_memfn_quals (t1
) == type_memfn_quals (t2
));
826 rval
= apply_memfn_quals (rval
, type_memfn_quals (t1
));
827 raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
828 TYPE_RAISES_EXCEPTIONS (t2
));
829 t1
= build_exception_variant (rval
, raises
);
835 /* Get this value the long way, since TYPE_METHOD_BASETYPE
836 is just the main variant of this. */
837 tree basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2
)));
838 tree raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
839 TYPE_RAISES_EXCEPTIONS (t2
));
842 /* If this was a member function type, get back to the
843 original type of type member function (i.e., without
844 the class instance variable up front. */
845 t1
= build_function_type (TREE_TYPE (t1
),
846 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
847 t2
= build_function_type (TREE_TYPE (t2
),
848 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
849 t3
= merge_types (t1
, t2
);
850 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
851 TYPE_ARG_TYPES (t3
));
852 t1
= build_exception_variant (t3
, raises
);
857 /* There is no need to merge attributes into a TYPENAME_TYPE.
858 When the type is instantiated it will have whatever
859 attributes result from the instantiation. */
865 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
867 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
870 return cp_build_type_attribute_variant (t1
, attributes
);
873 /* Return the ARRAY_TYPE type without its domain. */
876 strip_array_domain (tree type
)
879 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
880 if (TYPE_DOMAIN (type
) == NULL_TREE
)
882 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
883 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
886 /* Wrapper around cp_common_type that is used by c-common.c and other
887 front end optimizations that remove promotions.
889 Return the common type for two arithmetic types T1 and T2 under the
890 usual arithmetic conversions. The default conversions have already
891 been applied, and enumerated types converted to their compatible
895 common_type (tree t1
, tree t2
)
897 /* If one type is nonsense, use the other */
898 if (t1
== error_mark_node
)
900 if (t2
== error_mark_node
)
903 return cp_common_type (t1
, t2
);
906 /* Return the common type of two pointer types T1 and T2. This is the
907 type for the result of most arithmetic operations if the operands
908 have the given two types.
910 We assume that comp_target_types has already been done and returned
911 nonzero; if that isn't so, this may crash. */
914 common_pointer_type (tree t1
, tree t2
)
916 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
917 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
918 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
920 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
921 CPO_CONVERSION
, tf_warning_or_error
);
924 /* Compare two exception specifier types for exactness or subsetness, if
925 allowed. Returns false for mismatch, true for match (same, or
928 [except.spec] "If a class X ... objects of class X or any class publicly
929 and unambiguously derived from X. Similarly, if a pointer type Y * ...
930 exceptions of type Y * or that are pointers to any type publicly and
931 unambiguously derived from Y. Otherwise a function only allows exceptions
932 that have the same type ..."
933 This does not mention cv qualifiers and is different to what throw
934 [except.throw] and catch [except.catch] will do. They will ignore the
935 top level cv qualifiers, and allow qualifiers in the pointer to class
938 We implement the letter of the standard. */
941 comp_except_types (tree a
, tree b
, bool exact
)
943 if (same_type_p (a
, b
))
947 if (cp_type_quals (a
) || cp_type_quals (b
))
950 if (TREE_CODE (a
) == POINTER_TYPE
951 && TREE_CODE (b
) == POINTER_TYPE
)
955 if (cp_type_quals (a
) || cp_type_quals (b
))
959 if (TREE_CODE (a
) != RECORD_TYPE
960 || TREE_CODE (b
) != RECORD_TYPE
)
963 if (PUBLICLY_UNIQUELY_DERIVED_P (a
, b
))
969 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
970 If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
971 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
972 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
973 are unordered, but we've already filtered out duplicates. Most lists will
974 be in order, we should try to make use of that. */
977 comp_except_specs (const_tree t1
, const_tree t2
, int exact
)
986 /* First handle noexcept. */
987 if (exact
< ce_exact
)
989 /* noexcept(false) is compatible with any throwing dynamic-exc-spec
990 and stricter than any spec. */
991 if (t1
== noexcept_false_spec
)
992 return !nothrow_spec_p (t2
) || exact
== ce_derived
;
993 /* Even a derived noexcept(false) is compatible with a throwing
995 if (t2
== noexcept_false_spec
)
996 return !nothrow_spec_p (t1
);
998 /* Otherwise, if we aren't looking for an exact match, noexcept is
999 equivalent to throw(). */
1000 if (t1
== noexcept_true_spec
)
1001 t1
= empty_except_spec
;
1002 if (t2
== noexcept_true_spec
)
1003 t2
= empty_except_spec
;
1006 /* If any noexcept is left, it is only comparable to itself;
1007 either we're looking for an exact match or we're redeclaring a
1008 template with dependent noexcept. */
1009 if ((t1
&& TREE_PURPOSE (t1
))
1010 || (t2
&& TREE_PURPOSE (t2
)))
1012 && cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)));
1014 if (t1
== NULL_TREE
) /* T1 is ... */
1015 return t2
== NULL_TREE
|| exact
== ce_derived
;
1016 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1017 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1018 if (t2
== NULL_TREE
) /* T2 is ... */
1020 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1021 return exact
== ce_derived
;
1023 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1024 Count how many we find, to determine exactness. For exact matching and
1025 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1027 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1029 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1031 tree a
= TREE_VALUE (probe
);
1032 tree b
= TREE_VALUE (t2
);
1034 if (comp_except_types (a
, b
, exact
))
1036 if (probe
== base
&& exact
> ce_derived
)
1037 base
= TREE_CHAIN (probe
);
1042 if (probe
== NULL_TREE
)
1045 return exact
== ce_derived
|| base
== NULL_TREE
|| length
== list_length (t1
);
1048 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1049 [] can match [size]. */
1052 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1061 /* The type of the array elements must be the same. */
1062 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1065 d1
= TYPE_DOMAIN (t1
);
1066 d2
= TYPE_DOMAIN (t2
);
1071 /* If one of the arrays is dimensionless, and the other has a
1072 dimension, they are of different types. However, it is valid to
1080 declarations for an array object can specify
1081 array types that differ by the presence or absence of a major
1082 array bound (_dcl.array_). */
1084 return allow_redeclaration
;
1086 /* Check that the dimensions are the same. */
1088 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1090 max1
= TYPE_MAX_VALUE (d1
);
1091 max2
= TYPE_MAX_VALUE (d2
);
1092 if (processing_template_decl
&& !abi_version_at_least (2)
1093 && !value_dependent_expression_p (max1
)
1094 && !value_dependent_expression_p (max2
))
1096 /* With abi-1 we do not fold non-dependent array bounds, (and
1097 consequently mangle them incorrectly). We must therefore
1098 fold them here, to verify the domains have the same
1104 if (!cp_tree_equal (max1
, max2
))
1110 /* Compare the relative position of T1 and T2 into their respective
1111 template parameter list.
1112 T1 and T2 must be template parameter types.
1113 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1116 comp_template_parms_position (tree t1
, tree t2
)
1118 tree index1
, index2
;
1119 gcc_assert (t1
&& t2
1120 && TREE_CODE (t1
) == TREE_CODE (t2
)
1121 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1122 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1123 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1125 index1
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t1
));
1126 index2
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t2
));
1128 /* If T1 and T2 belong to template parm lists of different size,
1129 let's assume they are different. */
1130 if (TEMPLATE_PARM_NUM_SIBLINGS (index1
)
1131 != TEMPLATE_PARM_NUM_SIBLINGS (index2
))
1134 /* Then compare their relative position. */
1135 if (TEMPLATE_PARM_IDX (index1
) != TEMPLATE_PARM_IDX (index2
)
1136 || TEMPLATE_PARM_LEVEL (index1
) != TEMPLATE_PARM_LEVEL (index2
)
1137 || (TEMPLATE_PARM_PARAMETER_PACK (index1
)
1138 != TEMPLATE_PARM_PARAMETER_PACK (index2
)))
1144 /* Subroutine in comptypes. */
1147 structural_comptypes (tree t1
, tree t2
, int strict
)
1152 /* Suppress errors caused by previously reported errors. */
1153 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1156 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1158 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1159 current instantiation. */
1160 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1161 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1163 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1164 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1166 if (TYPE_PTRMEMFUNC_P (t1
))
1167 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1168 if (TYPE_PTRMEMFUNC_P (t2
))
1169 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1171 /* Different classes of types can't be compatible. */
1172 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1175 /* Qualifiers must match. For array types, we will check when we
1176 recur on the array element types. */
1177 if (TREE_CODE (t1
) != ARRAY_TYPE
1178 && cp_type_quals (t1
) != cp_type_quals (t2
))
1180 if (TREE_CODE (t1
) == FUNCTION_TYPE
1181 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1183 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1186 /* Allow for two different type nodes which have essentially the same
1187 definition. Note that we already checked for equality of the type
1188 qualifiers (just above). */
1190 if (TREE_CODE (t1
) != ARRAY_TYPE
1191 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1195 /* Compare the types. Break out if they could be the same. */
1196 switch (TREE_CODE (t1
))
1200 /* All void and bool types are the same. */
1204 case FIXED_POINT_TYPE
:
1206 /* With these nodes, we can't determine type equivalence by
1207 looking at what is stored in the nodes themselves, because
1208 two nodes might have different TYPE_MAIN_VARIANTs but still
1209 represent the same type. For example, wchar_t and int could
1210 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1211 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1212 and are distinct types. On the other hand, int and the
1215 typedef int INT __attribute((may_alias));
1217 have identical properties, different TYPE_MAIN_VARIANTs, but
1218 represent the same type. The canonical type system keeps
1219 track of equivalence in this case, so we fall back on it. */
1220 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1222 case TEMPLATE_TEMPLATE_PARM
:
1223 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1224 if (!comp_template_parms_position (t1
, t2
))
1226 if (!comp_template_parms
1227 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1228 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1230 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1232 /* Don't check inheritance. */
1233 strict
= COMPARE_STRICT
;
1238 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1239 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1240 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1241 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1244 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1246 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1252 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1253 strict
& ~COMPARE_REDECLARATION
))
1255 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1259 case REFERENCE_TYPE
:
1260 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1262 /* fall through to checks for pointer types */
1265 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1266 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
)
1267 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1273 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1275 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1280 /* Target types must match incl. qualifiers. */
1281 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1285 case TEMPLATE_TYPE_PARM
:
1286 /* If T1 and T2 don't have the same relative position in their
1287 template parameters set, they can't be equal. */
1288 if (!comp_template_parms_position (t1
, t2
))
1293 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1294 TYPENAME_TYPE_FULLNAME (t2
)))
1296 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1300 case UNBOUND_CLASS_TEMPLATE
:
1301 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1303 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1308 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1313 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1314 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1318 case TYPE_PACK_EXPANSION
:
1319 return same_type_p (PACK_EXPANSION_PATTERN (t1
),
1320 PACK_EXPANSION_PATTERN (t2
));
1323 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1324 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1325 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1326 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1327 || (DECLTYPE_FOR_LAMBDA_RETURN (t1
)
1328 != DECLTYPE_FOR_LAMBDA_RETURN (t2
))
1329 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1330 DECLTYPE_TYPE_EXPR (t2
)))
1338 /* If we get here, we know that from a target independent POV the
1339 types are the same. Make sure the target attributes are also
1341 return targetm
.comp_type_attributes (t1
, t2
);
1344 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1345 is a bitwise-or of the COMPARE_* flags. */
1348 comptypes (tree t1
, tree t2
, int strict
)
1350 if (strict
== COMPARE_STRICT
)
1355 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1358 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1359 /* At least one of the types requires structural equality, so
1360 perform a deep check. */
1361 return structural_comptypes (t1
, t2
, strict
);
1363 #ifdef ENABLE_CHECKING
1364 if (USE_CANONICAL_TYPES
)
1366 bool result
= structural_comptypes (t1
, t2
, strict
);
1368 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1369 /* The two types are structurally equivalent, but their
1370 canonical types were different. This is a failure of the
1371 canonical type propagation code.*/
1373 ("canonical types differ for identical types %T and %T",
1375 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1376 /* Two types are structurally different, but the canonical
1377 types are the same. This means we were over-eager in
1378 assigning canonical types. */
1380 ("same canonical type node for different types %T and %T",
1386 if (USE_CANONICAL_TYPES
)
1387 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1390 return structural_comptypes (t1
, t2
, strict
);
1392 else if (strict
== COMPARE_STRUCTURAL
)
1393 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1395 return structural_comptypes (t1
, t2
, strict
);
1398 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1399 top-level qualifiers. */
1402 same_type_ignoring_top_level_qualifiers_p (tree type1
, tree type2
)
1404 if (type1
== error_mark_node
|| type2
== error_mark_node
)
1407 return same_type_p (TYPE_MAIN_VARIANT (type1
), TYPE_MAIN_VARIANT (type2
));
1410 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1413 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1415 int q1
= cp_type_quals (type1
);
1416 int q2
= cp_type_quals (type2
);
1418 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1419 return (q1
& q2
) == q2
;
1422 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1423 more cv-qualified that TYPE1, and 0 otherwise. */
1426 comp_cv_qualification (const_tree type1
, const_tree type2
)
1428 int q1
= cp_type_quals (type1
);
1429 int q2
= cp_type_quals (type2
);
1434 if ((q1
& q2
) == q2
)
1436 else if ((q1
& q2
) == q1
)
1442 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1443 subset of the cv-qualification signature of TYPE2, and the types
1444 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1447 comp_cv_qual_signature (tree type1
, tree type2
)
1449 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1451 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1457 /* Subroutines of `comptypes'. */
1459 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1460 equivalent in the sense that functions with those parameter types
1461 can have equivalent types. The two lists must be equivalent,
1462 element by element. */
1465 compparms (const_tree parms1
, const_tree parms2
)
1469 /* An unspecified parmlist matches any specified parmlist
1470 whose argument types don't need default promotions. */
1472 for (t1
= parms1
, t2
= parms2
;
1474 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1476 /* If one parmlist is shorter than the other,
1477 they fail to match. */
1480 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1487 /* Process a sizeof or alignof expression where the operand is a
1491 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1496 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1497 if (type
== error_mark_node
)
1498 return error_mark_node
;
1500 type
= non_reference (type
);
1501 if (TREE_CODE (type
) == METHOD_TYPE
)
1504 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
1505 "invalid application of %qs to a member function",
1506 operator_name_info
[(int) op
].name
);
1507 value
= size_one_node
;
1510 dependent_p
= dependent_type_p (type
);
1512 complete_type (type
);
1514 /* VLA types will have a non-constant size. In the body of an
1515 uninstantiated template, we don't need to try to compute the
1516 value, because the sizeof expression is not an integral
1517 constant expression in that case. And, if we do try to
1518 compute the value, we'll likely end up with SAVE_EXPRs, which
1519 the template substitution machinery does not expect to see. */
1520 || (processing_template_decl
1521 && COMPLETE_TYPE_P (type
)
1522 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1524 value
= build_min (op
, size_type_node
, type
);
1525 TREE_READONLY (value
) = 1;
1529 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1534 /* Return the size of the type, without producing any warnings for
1535 types whose size cannot be taken. This routine should be used only
1536 in some other routine that has already produced a diagnostic about
1537 using the size of such a type. */
1539 cxx_sizeof_nowarn (tree type
)
1541 if (TREE_CODE (type
) == FUNCTION_TYPE
1542 || TREE_CODE (type
) == VOID_TYPE
1543 || TREE_CODE (type
) == ERROR_MARK
)
1544 return size_one_node
;
1545 else if (!COMPLETE_TYPE_P (type
))
1546 return size_zero_node
;
1548 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1551 /* Process a sizeof expression where the operand is an expression. */
1554 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1556 if (e
== error_mark_node
)
1557 return error_mark_node
;
1559 if (processing_template_decl
)
1561 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1562 TREE_SIDE_EFFECTS (e
) = 0;
1563 TREE_READONLY (e
) = 1;
1568 /* To get the size of a static data member declared as an array of
1569 unknown bound, we need to instantiate it. */
1570 if (TREE_CODE (e
) == VAR_DECL
1571 && VAR_HAD_UNKNOWN_BOUND (e
)
1572 && DECL_TEMPLATE_INSTANTIATION (e
))
1573 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1575 e
= mark_type_use (e
);
1577 if (TREE_CODE (e
) == COMPONENT_REF
1578 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1579 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1581 if (complain
& tf_error
)
1582 error ("invalid application of %<sizeof%> to a bit-field");
1584 return error_mark_node
;
1587 else if (is_overloaded_fn (e
))
1589 if (complain
& tf_error
)
1590 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1593 return error_mark_node
;
1596 else if (type_unknown_p (e
))
1598 if (complain
& tf_error
)
1599 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1601 return error_mark_node
;
1607 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1610 /* Implement the __alignof keyword: Return the minimum required
1611 alignment of E, measured in bytes. For VAR_DECL's and
1612 FIELD_DECL's return DECL_ALIGN (which can be set from an
1613 "aligned" __attribute__ specification). */
1616 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1620 if (e
== error_mark_node
)
1621 return error_mark_node
;
1623 if (processing_template_decl
)
1625 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1626 TREE_SIDE_EFFECTS (e
) = 0;
1627 TREE_READONLY (e
) = 1;
1632 e
= mark_type_use (e
);
1634 if (TREE_CODE (e
) == VAR_DECL
)
1635 t
= size_int (DECL_ALIGN_UNIT (e
));
1636 else if (TREE_CODE (e
) == COMPONENT_REF
1637 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1638 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1640 if (complain
& tf_error
)
1641 error ("invalid application of %<__alignof%> to a bit-field");
1643 return error_mark_node
;
1646 else if (TREE_CODE (e
) == COMPONENT_REF
1647 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1648 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1649 else if (is_overloaded_fn (e
))
1651 if (complain
& tf_error
)
1652 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1655 return error_mark_node
;
1656 if (TREE_CODE (e
) == FUNCTION_DECL
)
1657 t
= size_int (DECL_ALIGN_UNIT (e
));
1661 else if (type_unknown_p (e
))
1663 if (complain
& tf_error
)
1664 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1666 return error_mark_node
;
1670 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1671 complain
& tf_error
);
1673 return fold_convert (size_type_node
, t
);
1676 /* Process a sizeof or alignof expression E with code OP where the operand
1677 is an expression. */
1680 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1682 if (op
== SIZEOF_EXPR
)
1683 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1685 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1688 /* EXPR is being used in a context that is not a function call.
1693 The expression can be used only as the left-hand operand of a
1694 member function call.
1696 [expr.mptr.operator]
1698 If the result of .* or ->* is a function, then that result can be
1699 used only as the operand for the function call operator ().
1701 by issuing an error message if appropriate. Returns true iff EXPR
1702 violates these rules. */
1705 invalid_nonstatic_memfn_p (const_tree expr
, tsubst_flags_t complain
)
1707 if (expr
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1709 if (complain
& tf_error
)
1710 error ("invalid use of non-static member function");
1716 /* If EXP is a reference to a bitfield, and the type of EXP does not
1717 match the declared type of the bitfield, return the declared type
1718 of the bitfield. Otherwise, return NULL_TREE. */
1721 is_bitfield_expr_with_lowered_type (const_tree exp
)
1723 switch (TREE_CODE (exp
))
1726 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1727 ? TREE_OPERAND (exp
, 1)
1728 : TREE_OPERAND (exp
, 0)))
1730 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1733 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1737 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1743 field
= TREE_OPERAND (exp
, 1);
1744 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1746 if (same_type_ignoring_top_level_qualifiers_p
1747 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1749 return DECL_BIT_FIELD_TYPE (field
);
1753 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1754 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1755 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1763 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1764 bitfield with a lowered type, the type of EXP is returned, rather
1768 unlowered_expr_type (const_tree exp
)
1772 type
= is_bitfield_expr_with_lowered_type (exp
);
1774 type
= TREE_TYPE (exp
);
1779 /* Perform the conversions in [expr] that apply when an lvalue appears
1780 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1781 function-to-pointer conversions. In addition, manifest constants
1782 are replaced by their values, and bitfield references are converted
1783 to their declared types. Note that this function does not perform the
1784 lvalue-to-rvalue conversion for class types. If you need that conversion
1785 to for class types, then you probably need to use force_rvalue.
1787 Although the returned value is being used as an rvalue, this
1788 function does not wrap the returned expression in a
1789 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1790 that the return value is no longer an lvalue. */
1793 decay_conversion (tree exp
)
1796 enum tree_code code
;
1798 type
= TREE_TYPE (exp
);
1799 if (type
== error_mark_node
)
1800 return error_mark_node
;
1802 exp
= mark_rvalue_use (exp
);
1804 exp
= resolve_nondeduced_context (exp
);
1805 if (type_unknown_p (exp
))
1807 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1808 return error_mark_node
;
1811 /* FIXME remove? at least need to remember that this isn't really a
1812 constant expression if EXP isn't decl_constant_var_p, like with
1813 C_MAYBE_CONST_EXPR. */
1814 exp
= decl_constant_value (exp
);
1815 if (error_operand_p (exp
))
1816 return error_mark_node
;
1818 if (NULLPTR_TYPE_P (type
))
1819 return nullptr_node
;
1821 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1822 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1823 code
= TREE_CODE (type
);
1824 if (code
== VOID_TYPE
)
1826 error ("void value not ignored as it ought to be");
1827 return error_mark_node
;
1829 if (invalid_nonstatic_memfn_p (exp
, tf_warning_or_error
))
1830 return error_mark_node
;
1831 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1832 return cp_build_addr_expr (exp
, tf_warning_or_error
);
1833 if (code
== ARRAY_TYPE
)
1838 if (TREE_CODE (exp
) == INDIRECT_REF
)
1839 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1840 TREE_OPERAND (exp
, 0));
1842 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1844 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1845 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1846 TREE_OPERAND (exp
, 0), op1
);
1850 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1852 error ("invalid use of non-lvalue array");
1853 return error_mark_node
;
1856 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1858 if (TREE_CODE (exp
) == VAR_DECL
)
1860 if (!cxx_mark_addressable (exp
))
1861 return error_mark_node
;
1862 adr
= build_nop (ptrtype
, build_address (exp
));
1865 /* This way is better for a COMPONENT_REF since it can
1866 simplify the offset for a component. */
1867 adr
= cp_build_addr_expr (exp
, tf_warning_or_error
);
1868 return cp_convert (ptrtype
, adr
);
1871 /* If a bitfield is used in a context where integral promotion
1872 applies, then the caller is expected to have used
1873 default_conversion. That function promotes bitfields correctly
1874 before calling this function. At this point, if we have a
1875 bitfield referenced, we may assume that is not subject to
1876 promotion, and that, therefore, the type of the resulting rvalue
1877 is the declared type of the bitfield. */
1878 exp
= convert_bitfield_to_declared_type (exp
);
1880 /* We do not call rvalue() here because we do not want to wrap EXP
1881 in a NON_LVALUE_EXPR. */
1885 Non-class rvalues always have cv-unqualified types. */
1886 type
= TREE_TYPE (exp
);
1887 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
1888 exp
= build_nop (cv_unqualified (type
), exp
);
1893 /* Perform preparatory conversions, as part of the "usual arithmetic
1894 conversions". In particular, as per [expr]:
1896 Whenever an lvalue expression appears as an operand of an
1897 operator that expects the rvalue for that operand, the
1898 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1899 standard conversions are applied to convert the expression to an
1902 In addition, we perform integral promotions here, as those are
1903 applied to both operands to a binary operator before determining
1904 what additional conversions should apply. */
1907 default_conversion (tree exp
)
1909 /* Check for target-specific promotions. */
1910 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
1912 exp
= cp_convert (promoted_type
, exp
);
1913 /* Perform the integral promotions first so that bitfield
1914 expressions (which may promote to "int", even if the bitfield is
1915 declared "unsigned") are promoted correctly. */
1916 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
1917 exp
= perform_integral_promotions (exp
);
1918 /* Perform the other conversions. */
1919 exp
= decay_conversion (exp
);
1924 /* EXPR is an expression with an integral or enumeration type.
1925 Perform the integral promotions in [conv.prom], and return the
1929 perform_integral_promotions (tree expr
)
1934 expr
= mark_rvalue_use (expr
);
1938 If the bitfield has an enumerated type, it is treated as any
1939 other value of that type for promotion purposes. */
1940 type
= is_bitfield_expr_with_lowered_type (expr
);
1941 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
1942 type
= TREE_TYPE (expr
);
1943 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
1944 promoted_type
= type_promotes_to (type
);
1945 if (type
!= promoted_type
)
1946 expr
= cp_convert (promoted_type
, expr
);
1950 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1951 decay_conversion to one. */
1954 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
1958 if (TREE_CODE (totype
) != POINTER_TYPE
)
1961 t
= TREE_TYPE (totype
);
1962 if (!same_type_p (t
, char_type_node
)
1963 && !same_type_p (t
, char16_type_node
)
1964 && !same_type_p (t
, char32_type_node
)
1965 && !same_type_p (t
, wchar_type_node
))
1968 if (TREE_CODE (exp
) == STRING_CST
)
1970 /* Make sure that we don't try to convert between char and wide chars. */
1971 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
1976 /* Is this a string constant which has decayed to 'const char *'? */
1977 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
1978 if (!same_type_p (TREE_TYPE (exp
), t
))
1981 if (TREE_CODE (exp
) != ADDR_EXPR
1982 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
1986 /* This warning is not very useful, as it complains about printf. */
1988 warning (OPT_Wwrite_strings
,
1989 "deprecated conversion from string constant to %qT",
1995 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
1996 can, for example, use as an lvalue. This code used to be in
1997 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
1998 expressions, where we're dealing with aggregates. But now it's again only
1999 called from unary_complex_lvalue. The case (in particular) that led to
2000 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2004 rationalize_conditional_expr (enum tree_code code
, tree t
,
2005 tsubst_flags_t complain
)
2007 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2008 the first operand is always the one to be used if both operands
2009 are equal, so we know what conditional expression this used to be. */
2010 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2012 tree op0
= TREE_OPERAND (t
, 0);
2013 tree op1
= TREE_OPERAND (t
, 1);
2015 /* The following code is incorrect if either operand side-effects. */
2016 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2017 && !TREE_SIDE_EFFECTS (op1
));
2019 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
2020 ? LE_EXPR
: GE_EXPR
),
2021 op0
, TREE_CODE (op0
),
2022 op1
, TREE_CODE (op1
),
2023 /*overloaded_p=*/NULL
,
2025 cp_build_unary_op (code
, op0
, 0, complain
),
2026 cp_build_unary_op (code
, op1
, 0, complain
),
2031 build_conditional_expr (TREE_OPERAND (t
, 0),
2032 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2034 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2039 /* Given the TYPE of an anonymous union field inside T, return the
2040 FIELD_DECL for the field. If not found return NULL_TREE. Because
2041 anonymous unions can nest, we must also search all anonymous unions
2042 that are directly reachable. */
2045 lookup_anon_field (tree t
, tree type
)
2049 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2051 if (TREE_STATIC (field
))
2053 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2056 /* If we find it directly, return the field. */
2057 if (DECL_NAME (field
) == NULL_TREE
2058 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2063 /* Otherwise, it could be nested, search harder. */
2064 if (DECL_NAME (field
) == NULL_TREE
2065 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2067 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2075 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2076 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2077 non-NULL, it indicates the path to the base used to name MEMBER.
2078 If PRESERVE_REFERENCE is true, the expression returned will have
2079 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2080 returned will have the type referred to by the reference.
2082 This function does not perform access control; that is either done
2083 earlier by the parser when the name of MEMBER is resolved to MEMBER
2084 itself, or later when overload resolution selects one of the
2085 functions indicated by MEMBER. */
2088 build_class_member_access_expr (tree object
, tree member
,
2089 tree access_path
, bool preserve_reference
,
2090 tsubst_flags_t complain
)
2094 tree result
= NULL_TREE
;
2096 if (error_operand_p (object
) || error_operand_p (member
))
2097 return error_mark_node
;
2099 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2103 The type of the first expression shall be "class object" (of a
2105 object_type
= TREE_TYPE (object
);
2106 if (!currently_open_class (object_type
)
2107 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2108 return error_mark_node
;
2109 if (!CLASS_TYPE_P (object_type
))
2111 if (complain
& tf_error
)
2112 error ("request for member %qD in %qE, which is of non-class type %qT",
2113 member
, object
, object_type
);
2114 return error_mark_node
;
2117 /* The standard does not seem to actually say that MEMBER must be a
2118 member of OBJECT_TYPE. However, that is clearly what is
2120 if (DECL_P (member
))
2122 member_scope
= DECL_CLASS_CONTEXT (member
);
2124 if (TREE_DEPRECATED (member
))
2125 warn_deprecated_use (member
, NULL_TREE
);
2128 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2129 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2130 presently be the anonymous union. Go outwards until we find a
2131 type related to OBJECT_TYPE. */
2132 while (ANON_AGGR_TYPE_P (member_scope
)
2133 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2135 member_scope
= TYPE_CONTEXT (member_scope
);
2136 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2138 if (complain
& tf_error
)
2140 if (TREE_CODE (member
) == FIELD_DECL
)
2141 error ("invalid use of nonstatic data member %qE", member
);
2143 error ("%qD is not a member of %qT", member
, object_type
);
2145 return error_mark_node
;
2148 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2149 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2150 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2152 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2154 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2157 /* In [expr.ref], there is an explicit list of the valid choices for
2158 MEMBER. We check for each of those cases here. */
2159 if (TREE_CODE (member
) == VAR_DECL
)
2161 /* A static data member. */
2163 mark_exp_read (object
);
2164 /* If OBJECT has side-effects, they are supposed to occur. */
2165 if (TREE_SIDE_EFFECTS (object
))
2166 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2168 else if (TREE_CODE (member
) == FIELD_DECL
)
2170 /* A non-static data member. */
2175 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
2176 && integer_zerop (TREE_OPERAND (object
, 0)));
2178 /* Convert OBJECT to the type of MEMBER. */
2179 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2180 TYPE_MAIN_VARIANT (member_scope
)))
2185 binfo
= lookup_base (access_path
? access_path
: object_type
,
2186 member_scope
, ba_unique
, &kind
);
2187 if (binfo
== error_mark_node
)
2188 return error_mark_node
;
2190 /* It is invalid to try to get to a virtual base of a
2191 NULL object. The most common cause is invalid use of
2193 if (null_object_p
&& kind
== bk_via_virtual
)
2195 if (complain
& tf_error
)
2197 error ("invalid access to non-static data member %qD of "
2200 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2202 return error_mark_node
;
2205 /* Convert to the base. */
2206 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2208 /* If we found the base successfully then we should be able
2209 to convert to it successfully. */
2210 gcc_assert (object
!= error_mark_node
);
2213 /* Complain about other invalid uses of offsetof, even though they will
2214 give the right answer. Note that we complain whether or not they
2215 actually used the offsetof macro, since there's no way to know at this
2216 point. So we just give a warning, instead of a pedwarn. */
2217 /* Do not produce this warning for base class field references, because
2218 we know for a fact that didn't come from offsetof. This does occur
2219 in various testsuite cases where a null object is passed where a
2220 vtable access is required. */
2221 if (null_object_p
&& warn_invalid_offsetof
2222 && CLASSTYPE_NON_STD_LAYOUT (object_type
)
2223 && !DECL_FIELD_IS_BASE (member
)
2224 && cp_unevaluated_operand
== 0
2225 && (complain
& tf_warning
))
2227 warning (OPT_Winvalid_offsetof
,
2228 "invalid access to non-static data member %qD "
2229 " of NULL object", member
);
2230 warning (OPT_Winvalid_offsetof
,
2231 "(perhaps the %<offsetof%> macro was used incorrectly)");
2234 /* If MEMBER is from an anonymous aggregate, we have converted
2235 OBJECT so that it refers to the class containing the
2236 anonymous union. Generate a reference to the anonymous union
2237 itself, and recur to find MEMBER. */
2238 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2239 /* When this code is called from build_field_call, the
2240 object already has the type of the anonymous union.
2241 That is because the COMPONENT_REF was already
2242 constructed, and was then disassembled before calling
2243 build_field_call. After the function-call code is
2244 cleaned up, this waste can be eliminated. */
2245 && (!same_type_ignoring_top_level_qualifiers_p
2246 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2248 tree anonymous_union
;
2250 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2251 DECL_CONTEXT (member
));
2252 object
= build_class_member_access_expr (object
,
2254 /*access_path=*/NULL_TREE
,
2259 /* Compute the type of the field, as described in [expr.ref]. */
2260 type_quals
= TYPE_UNQUALIFIED
;
2261 member_type
= TREE_TYPE (member
);
2262 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2264 type_quals
= (cp_type_quals (member_type
)
2265 | cp_type_quals (object_type
));
2267 /* A field is const (volatile) if the enclosing object, or the
2268 field itself, is const (volatile). But, a mutable field is
2269 not const, even within a const object. */
2270 if (DECL_MUTABLE_P (member
))
2271 type_quals
&= ~TYPE_QUAL_CONST
;
2272 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2275 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
2277 result
= fold_if_not_in_template (result
);
2279 /* Mark the expression const or volatile, as appropriate. Even
2280 though we've dealt with the type above, we still have to mark the
2281 expression itself. */
2282 if (type_quals
& TYPE_QUAL_CONST
)
2283 TREE_READONLY (result
) = 1;
2284 if (type_quals
& TYPE_QUAL_VOLATILE
)
2285 TREE_THIS_VOLATILE (result
) = 1;
2287 else if (BASELINK_P (member
))
2289 /* The member is a (possibly overloaded) member function. */
2293 /* If the MEMBER is exactly one static member function, then we
2294 know the type of the expression. Otherwise, we must wait
2295 until overload resolution has been performed. */
2296 functions
= BASELINK_FUNCTIONS (member
);
2297 if (TREE_CODE (functions
) == FUNCTION_DECL
2298 && DECL_STATIC_FUNCTION_P (functions
))
2299 type
= TREE_TYPE (functions
);
2301 type
= unknown_type_node
;
2302 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2303 base. That will happen when the function is called. */
2304 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2306 else if (TREE_CODE (member
) == CONST_DECL
)
2308 /* The member is an enumerator. */
2310 /* If OBJECT has side-effects, they are supposed to occur. */
2311 if (TREE_SIDE_EFFECTS (object
))
2312 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2317 if (complain
& tf_error
)
2318 error ("invalid use of %qD", member
);
2319 return error_mark_node
;
2322 if (!preserve_reference
)
2325 If E2 is declared to have type "reference to T", then ... the
2326 type of E1.E2 is T. */
2327 result
= convert_from_reference (result
);
2332 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2333 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2336 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2338 tree object_type
= TREE_TYPE (object
);
2339 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2342 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2344 error ("qualified type %qT does not match destructor name ~%qT",
2346 return error_mark_node
;
2348 if (TREE_CODE (dtor_type
) == IDENTIFIER_NODE
)
2350 /* In a template, names we can't find a match for are still accepted
2351 destructor names, and we check them here. */
2352 if (check_dtor_name (object_type
, dtor_type
))
2353 dtor_type
= object_type
;
2356 error ("object type %qT does not match destructor name ~%qT",
2357 object_type
, dtor_type
);
2358 return error_mark_node
;
2362 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2364 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2365 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2366 return error_mark_node
;
2368 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2369 /*protect=*/1, /*want_type=*/false);
2370 expr
= (adjust_result_of_qualified_name_lookup
2371 (expr
, dtor_type
, object_type
));
2375 /* An expression of the form "A::template B" has been resolved to
2376 DECL. Issue a diagnostic if B is not a template or template
2380 check_template_keyword (tree decl
)
2382 /* The standard says:
2386 If a name prefixed by the keyword template is not a member
2387 template, the program is ill-formed.
2389 DR 228 removed the restriction that the template be a member
2392 DR 96, if accepted would add the further restriction that explicit
2393 template arguments must be provided if the template keyword is
2394 used, but, as of 2005-10-16, that DR is still in "drafting". If
2395 this DR is accepted, then the semantic checks here can be
2396 simplified, as the entity named must in fact be a template
2397 specialization, rather than, as at present, a set of overloaded
2398 functions containing at least one template function. */
2399 if (TREE_CODE (decl
) != TEMPLATE_DECL
2400 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2402 if (!is_overloaded_fn (decl
))
2403 permerror (input_location
, "%qD is not a template", decl
);
2408 if (BASELINK_P (fns
))
2409 fns
= BASELINK_FUNCTIONS (fns
);
2412 tree fn
= OVL_CURRENT (fns
);
2413 if (TREE_CODE (fn
) == TEMPLATE_DECL
2414 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2416 if (TREE_CODE (fn
) == FUNCTION_DECL
2417 && DECL_USE_TEMPLATE (fn
)
2418 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2420 fns
= OVL_NEXT (fns
);
2423 permerror (input_location
, "%qD is not a template", decl
);
2428 /* This function is called by the parser to process a class member
2429 access expression of the form OBJECT.NAME. NAME is a node used by
2430 the parser to represent a name; it is not yet a DECL. It may,
2431 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2432 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2433 there is no reason to do the lookup twice, so the parser keeps the
2434 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2435 be a template via the use of the "A::template B" syntax. */
2438 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2439 tsubst_flags_t complain
)
2444 tree access_path
= NULL_TREE
;
2445 tree orig_object
= object
;
2446 tree orig_name
= name
;
2448 if (object
== error_mark_node
|| name
== error_mark_node
)
2449 return error_mark_node
;
2451 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2452 if (!objc_is_public (object
, name
))
2453 return error_mark_node
;
2455 object_type
= TREE_TYPE (object
);
2457 if (processing_template_decl
)
2459 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2460 dependent_type_p (object_type
)
2461 /* If NAME is just an IDENTIFIER_NODE, then the expression
2463 || TREE_CODE (object
) == IDENTIFIER_NODE
2464 /* If NAME is "f<args>", where either 'f' or 'args' is
2465 dependent, then the expression is dependent. */
2466 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2467 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2468 TREE_OPERAND (name
, 1)))
2469 /* If NAME is "T::X" where "T" is dependent, then the
2470 expression is dependent. */
2471 || (TREE_CODE (name
) == SCOPE_REF
2472 && TYPE_P (TREE_OPERAND (name
, 0))
2473 && dependent_type_p (TREE_OPERAND (name
, 0))))
2474 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2475 object
= build_non_dependent_expr (object
);
2477 else if (c_dialect_objc ()
2478 && TREE_CODE (name
) == IDENTIFIER_NODE
2479 && (expr
= objc_maybe_build_component_ref (object
, name
)))
2484 The type of the first expression shall be "class object" (of a
2486 if (!currently_open_class (object_type
)
2487 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2488 return error_mark_node
;
2489 if (!CLASS_TYPE_P (object_type
))
2491 if (complain
& tf_error
)
2492 error ("request for member %qD in %qE, which is of non-class type %qT",
2493 name
, object
, object_type
);
2494 return error_mark_node
;
2497 if (BASELINK_P (name
))
2498 /* A member function that has already been looked up. */
2502 bool is_template_id
= false;
2503 tree template_args
= NULL_TREE
;
2506 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2508 is_template_id
= true;
2509 template_args
= TREE_OPERAND (name
, 1);
2510 name
= TREE_OPERAND (name
, 0);
2512 if (TREE_CODE (name
) == OVERLOAD
)
2513 name
= DECL_NAME (get_first_fn (name
));
2514 else if (DECL_P (name
))
2515 name
= DECL_NAME (name
);
2518 if (TREE_CODE (name
) == SCOPE_REF
)
2520 /* A qualified name. The qualifying class or namespace `S'
2521 has already been looked up; it is either a TYPE or a
2523 scope
= TREE_OPERAND (name
, 0);
2524 name
= TREE_OPERAND (name
, 1);
2526 /* If SCOPE is a namespace, then the qualified name does not
2527 name a member of OBJECT_TYPE. */
2528 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2530 if (complain
& tf_error
)
2531 error ("%<%D::%D%> is not a member of %qT",
2532 scope
, name
, object_type
);
2533 return error_mark_node
;
2536 gcc_assert (CLASS_TYPE_P (scope
));
2537 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2538 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2540 if (constructor_name_p (name
, scope
))
2542 if (complain
& tf_error
)
2543 error ("cannot call constructor %<%T::%D%> directly",
2545 return error_mark_node
;
2548 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2549 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2550 if (access_path
== error_mark_node
)
2551 return error_mark_node
;
2554 if (complain
& tf_error
)
2555 error ("%qT is not a base of %qT", scope
, object_type
);
2556 return error_mark_node
;
2562 access_path
= object_type
;
2565 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2566 member
= lookup_destructor (object
, scope
, name
);
2569 /* Look up the member. */
2570 member
= lookup_member (access_path
, name
, /*protect=*/1,
2571 /*want_type=*/false);
2572 if (member
== NULL_TREE
)
2574 if (complain
& tf_error
)
2575 error ("%qD has no member named %qE", object_type
, name
);
2576 return error_mark_node
;
2578 if (member
== error_mark_node
)
2579 return error_mark_node
;
2584 tree templ
= member
;
2586 if (BASELINK_P (templ
))
2587 templ
= lookup_template_function (templ
, template_args
);
2590 if (complain
& tf_error
)
2591 error ("%qD is not a member template function", name
);
2592 return error_mark_node
;
2597 if (TREE_DEPRECATED (member
))
2598 warn_deprecated_use (member
, NULL_TREE
);
2601 check_template_keyword (member
);
2603 expr
= build_class_member_access_expr (object
, member
, access_path
,
2604 /*preserve_reference=*/false,
2606 if (processing_template_decl
&& expr
!= error_mark_node
)
2608 if (BASELINK_P (member
))
2610 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2611 BASELINK_QUALIFIED_P (member
) = 1;
2614 return build_min_non_dep (COMPONENT_REF
, expr
,
2615 orig_object
, orig_name
,
2622 /* Return an expression for the MEMBER_NAME field in the internal
2623 representation of PTRMEM, a pointer-to-member function. (Each
2624 pointer-to-member function type gets its own RECORD_TYPE so it is
2625 more convenient to access the fields by name than by FIELD_DECL.)
2626 This routine converts the NAME to a FIELD_DECL and then creates the
2627 node for the complete expression. */
2630 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2636 /* This code is a stripped down version of
2637 build_class_member_access_expr. It does not work to use that
2638 routine directly because it expects the object to be of class
2640 ptrmem_type
= TREE_TYPE (ptrmem
);
2641 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2642 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2643 /*want_type=*/false);
2644 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2645 cp_type_quals (ptrmem_type
));
2646 return fold_build3_loc (input_location
,
2647 COMPONENT_REF
, member_type
,
2648 ptrmem
, member
, NULL_TREE
);
2651 /* Given an expression PTR for a pointer, return an expression
2652 for the value pointed to.
2653 ERRORSTRING is the name of the operator to appear in error messages.
2655 This function may need to overload OPERATOR_FNNAME.
2656 Must also handle REFERENCE_TYPEs for C++. */
2659 build_x_indirect_ref (tree expr
, ref_operator errorstring
,
2660 tsubst_flags_t complain
)
2662 tree orig_expr
= expr
;
2665 if (processing_template_decl
)
2667 /* Retain the type if we know the operand is a pointer so that
2668 describable_type doesn't make auto deduction break. */
2669 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2670 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2671 if (type_dependent_expression_p (expr
))
2672 return build_min_nt (INDIRECT_REF
, expr
);
2673 expr
= build_non_dependent_expr (expr
);
2676 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2677 NULL_TREE
, /*overloaded_p=*/NULL
, complain
);
2679 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2681 if (processing_template_decl
&& rval
!= error_mark_node
)
2682 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2687 /* Helper function called from c-common. */
2689 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2690 tree ptr
, ref_operator errorstring
)
2692 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2696 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2697 tsubst_flags_t complain
)
2701 if (ptr
== error_mark_node
)
2702 return error_mark_node
;
2704 if (ptr
== current_class_ptr
)
2705 return current_class_ref
;
2707 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2708 ? ptr
: decay_conversion (ptr
));
2709 type
= TREE_TYPE (pointer
);
2711 if (POINTER_TYPE_P (type
))
2715 If the type of the expression is "pointer to T," the type
2716 of the result is "T." */
2717 tree t
= TREE_TYPE (type
);
2719 if (CONVERT_EXPR_P (ptr
)
2720 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2722 /* If a warning is issued, mark it to avoid duplicates from
2723 the backend. This only needs to be done at
2724 warn_strict_aliasing > 2. */
2725 if (warn_strict_aliasing
> 2)
2726 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2727 type
, TREE_OPERAND (ptr
, 0)))
2728 TREE_NO_WARNING (ptr
) = 1;
2731 if (VOID_TYPE_P (t
))
2733 /* A pointer to incomplete type (other than cv void) can be
2734 dereferenced [expr.unary.op]/1 */
2735 if (complain
& tf_error
)
2736 error ("%qT is not a pointer-to-object type", type
);
2737 return error_mark_node
;
2739 else if (TREE_CODE (pointer
) == ADDR_EXPR
2740 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2741 /* The POINTER was something like `&x'. We simplify `*&x' to
2743 return TREE_OPERAND (pointer
, 0);
2746 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2748 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2749 so that we get the proper error message if the result is used
2750 to assign to. Also, &* is supposed to be a no-op. */
2751 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2752 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2753 TREE_SIDE_EFFECTS (ref
)
2754 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2758 else if (!(complain
& tf_error
))
2759 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2761 /* `pointer' won't be an error_mark_node if we were given a
2762 pointer to member, so it's cool to check for this here. */
2763 else if (TYPE_PTR_TO_MEMBER_P (type
))
2764 switch (errorstring
)
2766 case RO_ARRAY_INDEXING
:
2767 error ("invalid use of array indexing on pointer to member");
2770 error ("invalid use of unary %<*%> on pointer to member");
2772 case RO_IMPLICIT_CONVERSION
:
2773 error ("invalid use of implicit conversion on pointer to member");
2778 else if (pointer
!= error_mark_node
)
2779 switch (errorstring
)
2782 error ("invalid type argument");
2784 case RO_ARRAY_INDEXING
:
2785 error ("invalid type argument of array indexing");
2788 error ("invalid type argument of unary %<*%>");
2790 case RO_IMPLICIT_CONVERSION
:
2791 error ("invalid type argument of implicit conversion");
2796 return error_mark_node
;
2799 /* This handles expressions of the form "a[i]", which denotes
2802 This is logically equivalent in C to *(a+i), but we may do it differently.
2803 If A is a variable or a member, we generate a primitive ARRAY_REF.
2804 This avoids forcing the array out of registers, and can work on
2805 arrays that are not lvalues (for example, members of structures returned
2808 If INDEX is of some user-defined type, it must be converted to
2809 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2810 will inherit the type of the array, which will be some pointer type.
2812 LOC is the location to use in building the array reference. */
2815 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
2816 tsubst_flags_t complain
)
2822 if (complain
& tf_error
)
2823 error_at (loc
, "subscript missing in array reference");
2824 return error_mark_node
;
2827 if (TREE_TYPE (array
) == error_mark_node
2828 || TREE_TYPE (idx
) == error_mark_node
)
2829 return error_mark_node
;
2831 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2833 switch (TREE_CODE (array
))
2837 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2839 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2840 TREE_OPERAND (array
, 0), value
);
2841 SET_EXPR_LOCATION (ret
, loc
);
2846 ret
= build_conditional_expr
2847 (TREE_OPERAND (array
, 0),
2848 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2850 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
2852 tf_warning_or_error
);
2853 protected_set_expr_location (ret
, loc
);
2860 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2864 warn_array_subscript_with_type_char (idx
);
2866 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2868 if (complain
& tf_error
)
2869 error_at (loc
, "array subscript is not an integer");
2870 return error_mark_node
;
2873 /* Apply integral promotions *after* noticing character types.
2874 (It is unclear why we do these promotions -- the standard
2875 does not say that we should. In fact, the natural thing would
2876 seem to be to convert IDX to ptrdiff_t; we're performing
2877 pointer arithmetic.) */
2878 idx
= perform_integral_promotions (idx
);
2880 /* An array that is indexed by a non-constant
2881 cannot be stored in a register; we must be able to do
2882 address arithmetic on its address.
2883 Likewise an array of elements of variable size. */
2884 if (TREE_CODE (idx
) != INTEGER_CST
2885 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2886 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2889 if (!cxx_mark_addressable (array
))
2890 return error_mark_node
;
2893 /* An array that is indexed by a constant value which is not within
2894 the array bounds cannot be stored in a register either; because we
2895 would get a crash in store_bit_field/extract_bit_field when trying
2896 to access a non-existent part of the register. */
2897 if (TREE_CODE (idx
) == INTEGER_CST
2898 && TYPE_DOMAIN (TREE_TYPE (array
))
2899 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
2901 if (!cxx_mark_addressable (array
))
2902 return error_mark_node
;
2905 if (!lvalue_p (array
) && (complain
& tf_error
))
2906 pedwarn (loc
, OPT_pedantic
,
2907 "ISO C++ forbids subscripting non-lvalue array");
2909 /* Note in C++ it is valid to subscript a `register' array, since
2910 it is valid to take the address of something with that
2911 storage specification. */
2915 while (TREE_CODE (foo
) == COMPONENT_REF
)
2916 foo
= TREE_OPERAND (foo
, 0);
2917 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
)
2918 && (complain
& tf_warning
))
2919 warning_at (loc
, OPT_Wextra
,
2920 "subscripting array declared %<register%>");
2923 type
= TREE_TYPE (TREE_TYPE (array
));
2924 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
2925 /* Array ref is const/volatile if the array elements are
2926 or if the array is.. */
2927 TREE_READONLY (rval
)
2928 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
2929 TREE_SIDE_EFFECTS (rval
)
2930 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
2931 TREE_THIS_VOLATILE (rval
)
2932 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
2933 ret
= require_complete_type_sfinae (fold_if_not_in_template (rval
),
2935 protected_set_expr_location (ret
, loc
);
2940 tree ar
= default_conversion (array
);
2941 tree ind
= default_conversion (idx
);
2943 /* Put the integer in IND to simplify error checking. */
2944 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
2951 if (ar
== error_mark_node
)
2954 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
2956 if (complain
& tf_error
)
2957 error_at (loc
, "subscripted value is neither array nor pointer");
2958 return error_mark_node
;
2960 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
2962 if (complain
& tf_error
)
2963 error_at (loc
, "array subscript is not an integer");
2964 return error_mark_node
;
2967 warn_array_subscript_with_type_char (idx
);
2969 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
2974 protected_set_expr_location (ret
, loc
);
2979 /* Entry point for Obj-C++. */
2982 build_array_ref (location_t loc
, tree array
, tree idx
)
2984 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
2987 /* Resolve a pointer to member function. INSTANCE is the object
2988 instance to use, if the member points to a virtual member.
2990 This used to avoid checking for virtual functions if basetype
2991 has no virtual functions, according to an earlier ANSI draft.
2992 With the final ISO C++ rules, such an optimization is
2993 incorrect: A pointer to a derived member can be static_cast
2994 to pointer-to-base-member, as long as the dynamic object
2995 later has the right member. */
2998 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
3000 if (TREE_CODE (function
) == OFFSET_REF
)
3001 function
= TREE_OPERAND (function
, 1);
3003 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3005 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
3006 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3008 tree instance_ptr
= *instance_ptrptr
;
3009 tree instance_save_expr
= 0;
3010 if (instance_ptr
== error_mark_node
)
3012 if (TREE_CODE (function
) == PTRMEM_CST
)
3014 /* Extracting the function address from a pmf is only
3015 allowed with -Wno-pmf-conversions. It only works for
3017 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
3018 e1
= convert (fntype
, e1
);
3023 error ("object missing in use of %qE", function
);
3024 return error_mark_node
;
3028 if (TREE_SIDE_EFFECTS (instance_ptr
))
3029 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3031 if (TREE_SIDE_EFFECTS (function
))
3032 function
= save_expr (function
);
3034 /* Start by extracting all the information from the PMF itself. */
3035 e3
= pfn_from_ptrmemfunc (function
);
3036 delta
= delta_from_ptrmemfunc (function
);
3037 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3038 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3040 case ptrmemfunc_vbit_in_pfn
:
3041 e1
= cp_build_binary_op (input_location
,
3042 BIT_AND_EXPR
, idx
, integer_one_node
,
3043 tf_warning_or_error
);
3044 idx
= cp_build_binary_op (input_location
,
3045 MINUS_EXPR
, idx
, integer_one_node
,
3046 tf_warning_or_error
);
3049 case ptrmemfunc_vbit_in_delta
:
3050 e1
= cp_build_binary_op (input_location
,
3051 BIT_AND_EXPR
, delta
, integer_one_node
,
3052 tf_warning_or_error
);
3053 delta
= cp_build_binary_op (input_location
,
3054 RSHIFT_EXPR
, delta
, integer_one_node
,
3055 tf_warning_or_error
);
3062 /* Convert down to the right base before using the instance. A
3063 special case is that in a pointer to member of class C, C may
3064 be incomplete. In that case, the function will of course be
3065 a member of C, and no conversion is required. In fact,
3066 lookup_base will fail in that case, because incomplete
3067 classes do not have BINFOs. */
3068 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3069 if (!same_type_ignoring_top_level_qualifiers_p
3070 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3072 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3073 basetype
, ba_check
, NULL
);
3074 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3076 if (instance_ptr
== error_mark_node
)
3077 return error_mark_node
;
3079 /* ...and then the delta in the PMF. */
3080 instance_ptr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (instance_ptr
),
3081 instance_ptr
, fold_convert (sizetype
, delta
));
3083 /* Hand back the adjusted 'this' argument to our caller. */
3084 *instance_ptrptr
= instance_ptr
;
3086 /* Next extract the vtable pointer from the object. */
3087 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3089 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, tf_warning_or_error
);
3090 /* If the object is not dynamic the access invokes undefined
3091 behavior. As it is not executed in this case silence the
3092 spurious warnings it may provoke. */
3093 TREE_NO_WARNING (vtbl
) = 1;
3095 /* Finally, extract the function pointer from the vtable. */
3096 e2
= fold_build2_loc (input_location
,
3097 POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
,
3098 fold_convert (sizetype
, idx
));
3099 e2
= cp_build_indirect_ref (e2
, RO_NULL
, tf_warning_or_error
);
3100 TREE_CONSTANT (e2
) = 1;
3102 /* When using function descriptors, the address of the
3103 vtable entry is treated as a function pointer. */
3104 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3105 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3106 cp_build_addr_expr (e2
, tf_warning_or_error
));
3108 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3109 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
3111 /* Make sure this doesn't get evaluated first inside one of the
3112 branches of the COND_EXPR. */
3113 if (instance_save_expr
)
3114 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3115 instance_save_expr
, e1
);
3122 /* Used by the C-common bits. */
3124 build_function_call (location_t loc ATTRIBUTE_UNUSED
,
3125 tree function
, tree params
)
3127 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3130 /* Used by the C-common bits. */
3132 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED
,
3133 tree function
, VEC(tree
,gc
) *params
,
3134 VEC(tree
,gc
) *origtypes ATTRIBUTE_UNUSED
)
3136 VEC(tree
,gc
) *orig_params
= params
;
3137 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3138 tf_warning_or_error
);
3140 /* cp_build_function_call_vec can reallocate PARAMS by adding
3141 default arguments. That should never happen here. Verify
3143 gcc_assert (params
== orig_params
);
3148 /* Build a function call using a tree list of arguments. */
3151 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3156 vec
= make_tree_vector ();
3157 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3158 VEC_safe_push (tree
, gc
, vec
, TREE_VALUE (params
));
3159 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3160 release_tree_vector (vec
);
3164 /* Build a function call using varargs. */
3167 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3173 vec
= make_tree_vector ();
3174 va_start (args
, complain
);
3175 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3176 VEC_safe_push (tree
, gc
, vec
, t
);
3178 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3179 release_tree_vector (vec
);
3183 /* Build a function call using a vector of arguments. PARAMS may be
3184 NULL if there are no parameters. This changes the contents of
3188 cp_build_function_call_vec (tree function
, VEC(tree
,gc
) **params
,
3189 tsubst_flags_t complain
)
3191 tree fntype
, fndecl
;
3193 tree original
= function
;
3197 VEC(tree
,gc
) *allocated
= NULL
;
3200 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3201 expressions, like those used for ObjC messenger dispatches. */
3202 if (params
!= NULL
&& !VEC_empty (tree
, *params
))
3203 function
= objc_rewrite_function_call (function
,
3204 VEC_index (tree
, *params
, 0));
3206 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3207 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3208 if (TREE_CODE (function
) == NOP_EXPR
3209 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3210 function
= TREE_OPERAND (function
, 0);
3212 if (TREE_CODE (function
) == FUNCTION_DECL
)
3214 mark_used (function
);
3217 /* Convert anything with function type to a pointer-to-function. */
3218 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
3219 pedwarn (input_location
, OPT_pedantic
,
3220 "ISO C++ forbids calling %<::main%> from within program");
3222 function
= build_addr_func (function
);
3228 function
= build_addr_func (function
);
3231 if (function
== error_mark_node
)
3232 return error_mark_node
;
3234 fntype
= TREE_TYPE (function
);
3236 if (TYPE_PTRMEMFUNC_P (fntype
))
3238 if (complain
& tf_error
)
3239 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3240 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3241 original
, original
);
3242 return error_mark_node
;
3245 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
3246 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3248 if (!((TREE_CODE (fntype
) == POINTER_TYPE
3249 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
3251 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3253 if (complain
& tf_error
)
3254 error ("%qE cannot be used as a function", original
);
3255 return error_mark_node
;
3258 /* fntype now gets the type of function pointed to. */
3259 fntype
= TREE_TYPE (fntype
);
3260 parm_types
= TYPE_ARG_TYPES (fntype
);
3264 allocated
= make_tree_vector ();
3265 params
= &allocated
;
3268 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3271 return error_mark_node
;
3273 argarray
= VEC_address (tree
, *params
);
3275 /* Check for errors in format strings and inappropriately
3277 check_function_arguments (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
,
3280 ret
= build_cxx_call (function
, nargs
, argarray
);
3282 if (allocated
!= NULL
)
3283 release_tree_vector (allocated
);
3288 /* Subroutine of convert_arguments.
3289 Warn about wrong number of args are genereted. */
3292 warn_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3296 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3298 if (DECL_NAME (fndecl
) == NULL_TREE
3299 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3302 ? G_("too many arguments to constructor %q#D")
3303 : G_("too few arguments to constructor %q#D"),
3308 ? G_("too many arguments to member function %q#D")
3309 : G_("too few arguments to member function %q#D"),
3315 ? G_("too many arguments to function %q#D")
3316 : G_("too few arguments to function %q#D"),
3318 inform (DECL_SOURCE_LOCATION (fndecl
),
3323 if (c_dialect_objc () && objc_message_selector ())
3326 ? G_("too many arguments to method %q#D")
3327 : G_("too few arguments to method %q#D"),
3328 objc_message_selector ());
3330 error_at (loc
, too_many_p
? G_("too many arguments to function")
3331 : G_("too few arguments to function"));
3335 /* Convert the actual parameter expressions in the list VALUES to the
3336 types in the list TYPELIST. The converted expressions are stored
3337 back in the VALUES vector.
3338 If parmdecls is exhausted, or when an element has NULL as its type,
3339 perform the default conversions.
3341 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3343 This is also where warnings about wrong number of args are generated.
3345 Returns the actual number of arguments processed (which might be less
3346 than the length of the vector), or -1 on error.
3348 In C++, unspecified trailing parameters can be filled in with their
3349 default arguments, if such were specified. Do so here. */
3352 convert_arguments (tree typelist
, VEC(tree
,gc
) **values
, tree fndecl
,
3353 int flags
, tsubst_flags_t complain
)
3358 /* Argument passing is always copy-initialization. */
3359 flags
|= LOOKUP_ONLYCONVERTING
;
3361 for (i
= 0, typetail
= typelist
;
3362 i
< VEC_length (tree
, *values
);
3365 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3366 tree val
= VEC_index (tree
, *values
, i
);
3368 if (val
== error_mark_node
|| type
== error_mark_node
)
3371 if (type
== void_type_node
)
3373 if (complain
& tf_error
)
3375 warn_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3382 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3383 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3384 if (TREE_CODE (val
) == NOP_EXPR
3385 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3386 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3387 val
= TREE_OPERAND (val
, 0);
3389 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3391 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3392 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3393 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3394 val
= decay_conversion (val
);
3397 if (val
== error_mark_node
)
3402 /* Formal parm type is specified by a function prototype. */
3405 if (!COMPLETE_TYPE_P (complete_type (type
)))
3407 if (complain
& tf_error
)
3410 error ("parameter %P of %qD has incomplete type %qT",
3413 error ("parameter %P has incomplete type %qT", i
, type
);
3415 parmval
= error_mark_node
;
3419 parmval
= convert_for_initialization
3420 (NULL_TREE
, type
, val
, flags
,
3421 ICR_ARGPASS
, fndecl
, i
, complain
);
3422 parmval
= convert_for_arg_passing (type
, parmval
);
3425 if (parmval
== error_mark_node
)
3428 VEC_replace (tree
, *values
, i
, parmval
);
3432 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3433 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3434 /* Don't do ellipsis conversion for __built_in_constant_p
3435 as this will result in spurious errors for non-trivial
3437 val
= require_complete_type_sfinae (val
, complain
);
3439 val
= convert_arg_to_ellipsis (val
);
3441 VEC_replace (tree
, *values
, i
, val
);
3445 typetail
= TREE_CHAIN (typetail
);
3448 if (typetail
!= 0 && typetail
!= void_list_node
)
3450 /* See if there are default arguments that can be used. Because
3451 we hold default arguments in the FUNCTION_TYPE (which is so
3452 wrong), we can see default parameters here from deduced
3453 contexts (and via typeof) for indirect function calls.
3454 Fortunately we know whether we have a function decl to
3455 provide default arguments in a language conformant
3457 if (fndecl
&& TREE_PURPOSE (typetail
)
3458 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3460 for (; typetail
!= void_list_node
; ++i
)
3463 = convert_default_arg (TREE_VALUE (typetail
),
3464 TREE_PURPOSE (typetail
),
3467 if (parmval
== error_mark_node
)
3470 VEC_safe_push (tree
, gc
, *values
, parmval
);
3471 typetail
= TREE_CHAIN (typetail
);
3472 /* ends with `...'. */
3473 if (typetail
== NULL_TREE
)
3479 if (complain
& tf_error
)
3480 warn_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3488 /* Build a binary-operation expression, after performing default
3489 conversions on the operands. CODE is the kind of expression to
3490 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3491 are the tree codes which correspond to ARG1 and ARG2 when issuing
3492 warnings about possibly misplaced parentheses. They may differ
3493 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3494 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3495 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3496 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3497 ARG2_CODE as ERROR_MARK. */
3500 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3501 tree arg2
, enum tree_code arg2_code
, bool *overloaded_p
,
3502 tsubst_flags_t complain
)
3511 if (processing_template_decl
)
3513 if (type_dependent_expression_p (arg1
)
3514 || type_dependent_expression_p (arg2
))
3515 return build_min_nt (code
, arg1
, arg2
);
3516 arg1
= build_non_dependent_expr (arg1
);
3517 arg2
= build_non_dependent_expr (arg2
);
3520 if (code
== DOTSTAR_EXPR
)
3521 expr
= build_m_component_ref (arg1
, arg2
);
3523 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3524 overloaded_p
, complain
);
3526 /* Check for cases such as x+y<<z which users are likely to
3527 misinterpret. But don't warn about obj << x + y, since that is a
3528 common idiom for I/O. */
3529 if (warn_parentheses
3530 && (complain
& tf_warning
)
3531 && !processing_template_decl
3532 && !error_operand_p (arg1
)
3533 && !error_operand_p (arg2
)
3534 && (code
!= LSHIFT_EXPR
3535 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3536 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3538 if (processing_template_decl
&& expr
!= error_mark_node
)
3539 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3544 /* Build and return an ARRAY_REF expression. */
3547 build_x_array_ref (tree arg1
, tree arg2
, tsubst_flags_t complain
)
3549 tree orig_arg1
= arg1
;
3550 tree orig_arg2
= arg2
;
3553 if (processing_template_decl
)
3555 if (type_dependent_expression_p (arg1
)
3556 || type_dependent_expression_p (arg2
))
3557 return build_min_nt (ARRAY_REF
, arg1
, arg2
,
3558 NULL_TREE
, NULL_TREE
);
3559 arg1
= build_non_dependent_expr (arg1
);
3560 arg2
= build_non_dependent_expr (arg2
);
3563 expr
= build_new_op (ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3564 /*overloaded_p=*/NULL
, complain
);
3566 if (processing_template_decl
&& expr
!= error_mark_node
)
3567 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3568 NULL_TREE
, NULL_TREE
);
3572 /* For the c-common bits. */
3574 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3575 int convert_p ATTRIBUTE_UNUSED
)
3577 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3581 /* Build a binary-operation expression without default conversions.
3582 CODE is the kind of expression to build.
3583 LOCATION is the location_t of the operator in the source code.
3584 This function differs from `build' in several ways:
3585 the data type of the result is computed and recorded in it,
3586 warnings are generated if arg data types are invalid,
3587 special handling for addition and subtraction of pointers is known,
3588 and some optimization is done (operations on narrow ints
3589 are done in the narrower type when that gives the same result).
3590 Constant folding is also done before the result is returned.
3592 Note that the operands will never have enumeral types
3593 because either they have just had the default conversions performed
3594 or they have both just been converted to some other type in which
3595 the arithmetic is to be done.
3597 C++: must do special pointer arithmetic when implementing
3598 multiple inheritance, and deal with pointer to member functions. */
3601 cp_build_binary_op (location_t location
,
3602 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3603 tsubst_flags_t complain
)
3606 enum tree_code code0
, code1
;
3608 const char *invalid_op_diag
;
3610 /* Expression code to give to the expression when it is built.
3611 Normally this is CODE, which is what the caller asked for,
3612 but in some special cases we change it. */
3613 enum tree_code resultcode
= code
;
3615 /* Data type in which the computation is to be performed.
3616 In the simplest cases this is the common type of the arguments. */
3617 tree result_type
= NULL
;
3619 /* Nonzero means operands have already been type-converted
3620 in whatever way is necessary.
3621 Zero means they need to be converted to RESULT_TYPE. */
3624 /* Nonzero means create the expression with this type, rather than
3626 tree build_type
= 0;
3628 /* Nonzero means after finally constructing the expression
3629 convert it to this type. */
3630 tree final_type
= 0;
3634 /* Nonzero if this is an operation like MIN or MAX which can
3635 safely be computed in short if both args are promoted shorts.
3636 Also implies COMMON.
3637 -1 indicates a bitwise operation; this makes a difference
3638 in the exact conditions for when it is safe to do the operation
3639 in a narrower mode. */
3642 /* Nonzero if this is a comparison operation;
3643 if both args are promoted shorts, compare the original shorts.
3644 Also implies COMMON. */
3645 int short_compare
= 0;
3647 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3650 /* True if both operands have arithmetic type. */
3651 bool arithmetic_types_p
;
3653 /* Apply default conversions. */
3657 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3658 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3659 || code
== TRUTH_XOR_EXPR
)
3661 if (!really_overloaded_fn (op0
))
3662 op0
= decay_conversion (op0
);
3663 if (!really_overloaded_fn (op1
))
3664 op1
= decay_conversion (op1
);
3668 if (!really_overloaded_fn (op0
))
3669 op0
= default_conversion (op0
);
3670 if (!really_overloaded_fn (op1
))
3671 op1
= default_conversion (op1
);
3674 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3675 STRIP_TYPE_NOPS (op0
);
3676 STRIP_TYPE_NOPS (op1
);
3678 /* DTRT if one side is an overloaded function, but complain about it. */
3679 if (type_unknown_p (op0
))
3681 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3682 if (t
!= error_mark_node
)
3684 if (complain
& tf_error
)
3685 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3690 if (type_unknown_p (op1
))
3692 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3693 if (t
!= error_mark_node
)
3695 if (complain
& tf_error
)
3696 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3702 type0
= TREE_TYPE (op0
);
3703 type1
= TREE_TYPE (op1
);
3705 /* The expression codes of the data types of the arguments tell us
3706 whether the arguments are integers, floating, pointers, etc. */
3707 code0
= TREE_CODE (type0
);
3708 code1
= TREE_CODE (type1
);
3710 /* If an error was already reported for one of the arguments,
3711 avoid reporting another error. */
3712 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3713 return error_mark_node
;
3715 if ((invalid_op_diag
3716 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3718 error (invalid_op_diag
);
3719 return error_mark_node
;
3722 /* Issue warnings about peculiar, but valid, uses of NULL. */
3723 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3724 /* It's reasonable to use pointer values as operands of &&
3725 and ||, so NULL is no exception. */
3726 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3727 && ( /* Both are NULL (or 0) and the operation was not a
3728 comparison or a pointer subtraction. */
3729 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3730 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
3731 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3732 || (!null_ptr_cst_p (orig_op0
)
3733 && !TYPE_PTR_P (type0
) && !TYPE_PTR_TO_MEMBER_P (type0
))
3734 || (!null_ptr_cst_p (orig_op1
)
3735 && !TYPE_PTR_P (type1
) && !TYPE_PTR_TO_MEMBER_P (type1
)))
3736 && (complain
& tf_warning
))
3737 /* Some sort of arithmetic operation involving NULL was
3739 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3744 /* Subtraction of two similar pointers.
3745 We must subtract them as integers, then divide by object size. */
3746 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3747 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3749 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3750 /* In all other cases except pointer - int, the usual arithmetic
3752 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3757 /* The pointer - int case is just like pointer + int; fall
3760 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3761 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3765 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3766 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3767 if (processing_template_decl
)
3769 result_type
= TREE_TYPE (ptr_operand
);
3772 return cp_pointer_int_sum (code
,
3783 case TRUNC_DIV_EXPR
:
3785 case FLOOR_DIV_EXPR
:
3786 case ROUND_DIV_EXPR
:
3787 case EXACT_DIV_EXPR
:
3788 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3789 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3790 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3791 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3793 enum tree_code tcode0
= code0
, tcode1
= code1
;
3795 warn_for_div_by_zero (location
, op1
);
3797 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3798 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3799 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3800 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3802 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3803 resultcode
= RDIV_EXPR
;
3805 /* When dividing two signed integers, we have to promote to int.
3806 unless we divide by a constant != -1. Note that default
3807 conversion will have been performed on the operands at this
3808 point, so we have to dig out the original type to find out if
3810 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3811 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3812 || (TREE_CODE (op1
) == INTEGER_CST
3813 && ! integer_all_onesp (op1
)));
3822 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3823 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3824 && !VECTOR_FLOAT_TYPE_P (type0
)
3825 && !VECTOR_FLOAT_TYPE_P (type1
)))
3829 case TRUNC_MOD_EXPR
:
3830 case FLOOR_MOD_EXPR
:
3831 warn_for_div_by_zero (location
, op1
);
3833 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3834 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
3835 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
3837 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3839 /* Although it would be tempting to shorten always here, that loses
3840 on some targets, since the modulo instruction is undefined if the
3841 quotient can't be represented in the computation mode. We shorten
3842 only if unsigned or if dividing by something we know != -1. */
3843 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3844 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3845 || (TREE_CODE (op1
) == INTEGER_CST
3846 && ! integer_all_onesp (op1
)));
3851 case TRUTH_ANDIF_EXPR
:
3852 case TRUTH_ORIF_EXPR
:
3853 case TRUTH_AND_EXPR
:
3855 result_type
= boolean_type_node
;
3858 /* Shift operations: result has same type as first operand;
3859 always convert second operand to int.
3860 Also set SHORT_SHIFT if shifting rightward. */
3863 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3865 result_type
= type0
;
3866 if (TREE_CODE (op1
) == INTEGER_CST
)
3868 if (tree_int_cst_lt (op1
, integer_zero_node
))
3870 if ((complain
& tf_warning
)
3871 && c_inhibit_evaluation_warnings
== 0)
3872 warning (0, "right shift count is negative");
3876 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3877 && (complain
& tf_warning
)
3878 && c_inhibit_evaluation_warnings
== 0)
3879 warning (0, "right shift count >= width of type");
3882 /* Convert the shift-count to an integer, regardless of
3883 size of value being shifted. */
3884 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3885 op1
= cp_convert (integer_type_node
, op1
);
3886 /* Avoid converting op1 to result_type later. */
3892 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3894 result_type
= type0
;
3895 if (TREE_CODE (op1
) == INTEGER_CST
)
3897 if (tree_int_cst_lt (op1
, integer_zero_node
))
3899 if ((complain
& tf_warning
)
3900 && c_inhibit_evaluation_warnings
== 0)
3901 warning (0, "left shift count is negative");
3903 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3905 if ((complain
& tf_warning
)
3906 && c_inhibit_evaluation_warnings
== 0)
3907 warning (0, "left shift count >= width of type");
3910 /* Convert the shift-count to an integer, regardless of
3911 size of value being shifted. */
3912 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3913 op1
= cp_convert (integer_type_node
, op1
);
3914 /* Avoid converting op1 to result_type later. */
3921 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3923 result_type
= type0
;
3924 if (TREE_CODE (op1
) == INTEGER_CST
)
3926 if (tree_int_cst_lt (op1
, integer_zero_node
))
3928 if (complain
& tf_warning
)
3929 warning (0, (code
== LROTATE_EXPR
)
3930 ? G_("left rotate count is negative")
3931 : G_("right rotate count is negative"));
3933 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3935 if (complain
& tf_warning
)
3936 warning (0, (code
== LROTATE_EXPR
)
3937 ? G_("left rotate count >= width of type")
3938 : G_("right rotate count >= width of type"));
3941 /* Convert the shift-count to an integer, regardless of
3942 size of value being shifted. */
3943 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3944 op1
= cp_convert (integer_type_node
, op1
);
3950 if ((complain
& tf_warning
)
3951 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
3952 warning (OPT_Wfloat_equal
,
3953 "comparing floating point with == or != is unsafe");
3954 if ((complain
& tf_warning
)
3955 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
3956 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
3957 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
3959 build_type
= boolean_type_node
;
3960 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3961 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
3962 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3963 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
3965 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3966 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
3967 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3968 CPO_COMPARISON
, complain
);
3969 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
3970 && null_ptr_cst_p (op1
))
3972 if (TREE_CODE (op0
) == ADDR_EXPR
3973 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
3975 if (complain
& tf_warning
)
3976 warning (OPT_Waddress
, "the address of %qD will never be NULL",
3977 TREE_OPERAND (op0
, 0));
3979 result_type
= type0
;
3981 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
3982 && null_ptr_cst_p (op0
))
3984 if (TREE_CODE (op1
) == ADDR_EXPR
3985 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
3987 if (complain
& tf_warning
)
3988 warning (OPT_Waddress
, "the address of %qD will never be NULL",
3989 TREE_OPERAND (op1
, 0));
3991 result_type
= type1
;
3993 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
3994 /* One of the operands must be of nullptr_t type. */
3995 result_type
= TREE_TYPE (nullptr_node
);
3996 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3998 result_type
= type0
;
3999 if (complain
& tf_error
)
4000 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4002 return error_mark_node
;
4004 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4006 result_type
= type1
;
4007 if (complain
& tf_error
)
4008 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4010 return error_mark_node
;
4012 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
4014 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4015 == ptrmemfunc_vbit_in_delta
)
4017 tree pfn0
= pfn_from_ptrmemfunc (op0
);
4018 tree delta0
= delta_from_ptrmemfunc (op0
);
4019 tree e1
= cp_build_binary_op (location
,
4022 build_zero_cst (TREE_TYPE (pfn0
)),
4024 tree e2
= cp_build_binary_op (location
,
4029 e2
= cp_build_binary_op (location
,
4030 EQ_EXPR
, e2
, integer_zero_node
,
4032 op0
= cp_build_binary_op (location
,
4033 TRUTH_ANDIF_EXPR
, e1
, e2
,
4035 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
4039 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4040 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
4042 result_type
= TREE_TYPE (op0
);
4044 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4045 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4046 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4049 /* E will be the final comparison. */
4051 /* E1 and E2 are for scratch. */
4059 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4060 CPO_COMPARISON
, complain
);
4062 if (!same_type_p (TREE_TYPE (op0
), type
))
4063 op0
= cp_convert_and_check (type
, op0
);
4064 if (!same_type_p (TREE_TYPE (op1
), type
))
4065 op1
= cp_convert_and_check (type
, op1
);
4067 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4068 return error_mark_node
;
4070 if (TREE_SIDE_EFFECTS (op0
))
4071 op0
= save_expr (op0
);
4072 if (TREE_SIDE_EFFECTS (op1
))
4073 op1
= save_expr (op1
);
4075 pfn0
= pfn_from_ptrmemfunc (op0
);
4076 pfn1
= pfn_from_ptrmemfunc (op1
);
4077 delta0
= delta_from_ptrmemfunc (op0
);
4078 delta1
= delta_from_ptrmemfunc (op1
);
4079 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4080 == ptrmemfunc_vbit_in_delta
)
4085 && ((op0.delta == op1.delta)
4086 || (!op0.pfn && op0.delta & 1 == 0
4087 && op1.delta & 1 == 0))
4089 The reason for the `!op0.pfn' bit is that a NULL
4090 pointer-to-member is any member with a zero PFN and
4091 LSB of the DELTA field is 0. */
4093 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4097 e1
= cp_build_binary_op (location
,
4098 EQ_EXPR
, e1
, integer_zero_node
,
4100 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4104 e2
= cp_build_binary_op (location
,
4105 EQ_EXPR
, e2
, integer_zero_node
,
4107 e1
= cp_build_binary_op (location
,
4108 TRUTH_ANDIF_EXPR
, e2
, e1
,
4110 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4112 build_zero_cst (TREE_TYPE (pfn0
)),
4114 e2
= cp_build_binary_op (location
,
4115 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4116 e1
= cp_build_binary_op (location
,
4117 EQ_EXPR
, delta0
, delta1
, complain
);
4118 e1
= cp_build_binary_op (location
,
4119 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4126 && (!op0.pfn || op0.delta == op1.delta))
4128 The reason for the `!op0.pfn' bit is that a NULL
4129 pointer-to-member is any member with a zero PFN; the
4130 DELTA field is unspecified. */
4132 e1
= cp_build_binary_op (location
,
4133 EQ_EXPR
, delta0
, delta1
, complain
);
4134 e2
= cp_build_binary_op (location
,
4137 build_zero_cst (TREE_TYPE (pfn0
)),
4139 e1
= cp_build_binary_op (location
,
4140 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4142 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4143 e
= cp_build_binary_op (location
,
4144 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4145 if (code
== EQ_EXPR
)
4147 return cp_build_binary_op (location
,
4148 EQ_EXPR
, e
, integer_zero_node
, complain
);
4152 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4153 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4155 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4156 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4164 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4165 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4167 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4168 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4169 CPO_COMPARISON
, complain
);
4176 if (TREE_CODE (orig_op0
) == STRING_CST
4177 || TREE_CODE (orig_op1
) == STRING_CST
)
4179 if (complain
& tf_warning
)
4180 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4183 build_type
= boolean_type_node
;
4184 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4185 || code0
== ENUMERAL_TYPE
)
4186 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4187 || code1
== ENUMERAL_TYPE
))
4189 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4190 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4191 CPO_COMPARISON
, complain
);
4192 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4193 result_type
= type0
;
4194 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4195 result_type
= type1
;
4196 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4197 /* One of the operands must be of nullptr_t type. */
4198 result_type
= TREE_TYPE (nullptr_node
);
4199 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4201 result_type
= type0
;
4202 if (complain
& tf_error
)
4203 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4205 return error_mark_node
;
4207 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4209 result_type
= type1
;
4210 if (complain
& tf_error
)
4211 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4213 return error_mark_node
;
4217 case UNORDERED_EXPR
:
4224 build_type
= integer_type_node
;
4225 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4227 if (complain
& tf_error
)
4228 error ("unordered comparison on non-floating point argument");
4229 return error_mark_node
;
4238 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4239 || code0
== ENUMERAL_TYPE
)
4240 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4241 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4242 arithmetic_types_p
= 1;
4245 arithmetic_types_p
= 0;
4246 /* Vector arithmetic is only allowed when both sides are vectors. */
4247 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4249 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4250 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4253 binary_op_error (location
, code
, type0
, type1
);
4254 return error_mark_node
;
4256 arithmetic_types_p
= 1;
4259 /* Determine the RESULT_TYPE, if it is not already known. */
4261 && arithmetic_types_p
4262 && (shorten
|| common
|| short_compare
))
4264 result_type
= cp_common_type (type0
, type1
);
4265 do_warn_double_promotion (result_type
, type0
, type1
,
4266 "implicit conversion from %qT to %qT "
4267 "to match other operand of binary "
4274 if (complain
& tf_error
)
4275 error ("invalid operands of types %qT and %qT to binary %qO",
4276 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4277 return error_mark_node
;
4280 /* If we're in a template, the only thing we need to know is the
4282 if (processing_template_decl
)
4284 /* Since the middle-end checks the type when doing a build2, we
4285 need to build the tree in pieces. This built tree will never
4286 get out of the front-end as we replace it when instantiating
4288 tree tmp
= build2 (resultcode
,
4289 build_type
? build_type
: result_type
,
4291 TREE_OPERAND (tmp
, 0) = op0
;
4295 if (arithmetic_types_p
)
4297 bool first_complex
= (code0
== COMPLEX_TYPE
);
4298 bool second_complex
= (code1
== COMPLEX_TYPE
);
4299 int none_complex
= (!first_complex
&& !second_complex
);
4301 /* Adapted from patch for c/24581. */
4302 if (first_complex
!= second_complex
4303 && (code
== PLUS_EXPR
4304 || code
== MINUS_EXPR
4305 || code
== MULT_EXPR
4306 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4307 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4308 && flag_signed_zeros
)
4310 /* An operation on mixed real/complex operands must be
4311 handled specially, but the language-independent code can
4312 more easily optimize the plain complex arithmetic if
4313 -fno-signed-zeros. */
4314 tree real_type
= TREE_TYPE (result_type
);
4318 if (TREE_TYPE (op0
) != result_type
)
4319 op0
= cp_convert_and_check (result_type
, op0
);
4320 if (TREE_TYPE (op1
) != real_type
)
4321 op1
= cp_convert_and_check (real_type
, op1
);
4325 if (TREE_TYPE (op0
) != real_type
)
4326 op0
= cp_convert_and_check (real_type
, op0
);
4327 if (TREE_TYPE (op1
) != result_type
)
4328 op1
= cp_convert_and_check (result_type
, op1
);
4330 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4331 return error_mark_node
;
4334 op0
= save_expr (op0
);
4335 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4336 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4340 case TRUNC_DIV_EXPR
:
4341 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4345 real
= build2 (resultcode
, real_type
, real
, op1
);
4353 op1
= save_expr (op1
);
4354 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4355 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4359 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4362 real
= build2 (resultcode
, real_type
, op0
, real
);
4365 real
= build2 (resultcode
, real_type
, op0
, real
);
4366 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4372 return build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4375 /* For certain operations (which identify themselves by shorten != 0)
4376 if both args were extended from the same smaller type,
4377 do the arithmetic in that type and then extend.
4379 shorten !=0 and !=1 indicates a bitwise operation.
4380 For them, this optimization is safe only if
4381 both args are zero-extended or both are sign-extended.
4382 Otherwise, we might change the result.
4383 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4384 but calculated in (unsigned short) it would be (unsigned short)-1. */
4386 if (shorten
&& none_complex
)
4388 final_type
= result_type
;
4389 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4393 /* Comparison operations are shortened too but differently.
4394 They identify themselves by setting short_compare = 1. */
4398 /* Don't write &op0, etc., because that would prevent op0
4399 from being kept in a register.
4400 Instead, make copies of the our local variables and
4401 pass the copies by reference, then copy them back afterward. */
4402 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4403 enum tree_code xresultcode
= resultcode
;
4405 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4407 return cp_convert (boolean_type_node
, val
);
4408 op0
= xop0
, op1
= xop1
;
4410 resultcode
= xresultcode
;
4413 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4414 && warn_sign_compare
4415 && !TREE_NO_WARNING (orig_op0
)
4416 && !TREE_NO_WARNING (orig_op1
)
4417 /* Do not warn until the template is instantiated; we cannot
4418 bound the ranges of the arguments until that point. */
4419 && !processing_template_decl
4420 && (complain
& tf_warning
)
4421 && c_inhibit_evaluation_warnings
== 0)
4423 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4424 result_type
, resultcode
);
4428 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4429 Then the expression will be built.
4430 It will be given type FINAL_TYPE if that is nonzero;
4431 otherwise, it will be given type RESULT_TYPE. */
4434 if (TREE_TYPE (op0
) != result_type
)
4435 op0
= cp_convert_and_check (result_type
, op0
);
4436 if (TREE_TYPE (op1
) != result_type
)
4437 op1
= cp_convert_and_check (result_type
, op1
);
4439 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4440 return error_mark_node
;
4443 if (build_type
== NULL_TREE
)
4444 build_type
= result_type
;
4446 result
= build2 (resultcode
, build_type
, op0
, op1
);
4447 result
= fold_if_not_in_template (result
);
4448 if (final_type
!= 0)
4449 result
= cp_convert (final_type
, result
);
4451 if (TREE_OVERFLOW_P (result
)
4452 && !TREE_OVERFLOW_P (op0
)
4453 && !TREE_OVERFLOW_P (op1
))
4454 overflow_warning (location
, result
);
4459 /* Return a tree for the sum or difference (RESULTCODE says which)
4460 of pointer PTROP and integer INTOP. */
4463 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4465 tree res_type
= TREE_TYPE (ptrop
);
4467 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4468 in certain circumstance (when it's valid to do so). So we need
4469 to make sure it's complete. We don't need to check here, if we
4470 can actually complete it at all, as those checks will be done in
4471 pointer_int_sum() anyway. */
4472 complete_type (TREE_TYPE (res_type
));
4474 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4475 fold_if_not_in_template (intop
));
4478 /* Return a tree for the difference of pointers OP0 and OP1.
4479 The resulting tree has type int. */
4482 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4485 tree restype
= ptrdiff_type_node
;
4486 tree target_type
= TREE_TYPE (ptrtype
);
4488 if (!complete_type_or_else (target_type
, NULL_TREE
))
4489 return error_mark_node
;
4491 if (TREE_CODE (target_type
) == VOID_TYPE
)
4492 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4493 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4494 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4495 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4496 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4498 /* First do the subtraction as integers;
4499 then drop through to build the divide operator. */
4501 op0
= cp_build_binary_op (input_location
,
4503 cp_convert (restype
, op0
),
4504 cp_convert (restype
, op1
),
4505 tf_warning_or_error
);
4507 /* This generates an error if op1 is a pointer to an incomplete type. */
4508 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4509 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4511 op1
= (TYPE_PTROB_P (ptrtype
)
4512 ? size_in_bytes (target_type
)
4513 : integer_one_node
);
4515 /* Do the division. */
4517 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4518 return fold_if_not_in_template (result
);
4521 /* Construct and perhaps optimize a tree representation
4522 for a unary operation. CODE, a tree_code, specifies the operation
4523 and XARG is the operand. */
4526 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4528 tree orig_expr
= xarg
;
4532 if (processing_template_decl
)
4534 if (type_dependent_expression_p (xarg
))
4535 return build_min_nt (code
, xarg
, NULL_TREE
);
4537 xarg
= build_non_dependent_expr (xarg
);
4542 /* [expr.unary.op] says:
4544 The address of an object of incomplete type can be taken.
4546 (And is just the ordinary address operator, not an overloaded
4547 "operator &".) However, if the type is a template
4548 specialization, we must complete the type at this point so that
4549 an overloaded "operator &" will be available if required. */
4550 if (code
== ADDR_EXPR
4551 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4552 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4553 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4554 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4555 /* Don't look for a function. */;
4557 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4558 /*overloaded_p=*/NULL
, complain
);
4559 if (!exp
&& code
== ADDR_EXPR
)
4561 if (is_overloaded_fn (xarg
))
4563 tree fn
= get_first_fn (xarg
);
4564 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4566 error (DECL_CONSTRUCTOR_P (fn
)
4567 ? G_("taking address of constructor %qE")
4568 : G_("taking address of destructor %qE"),
4570 return error_mark_node
;
4574 /* A pointer to member-function can be formed only by saying
4576 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4577 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4579 if (TREE_CODE (xarg
) != OFFSET_REF
4580 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4582 error ("invalid use of %qE to form a pointer-to-member-function",
4584 if (TREE_CODE (xarg
) != OFFSET_REF
)
4585 inform (input_location
, " a qualified-id is required");
4586 return error_mark_node
;
4590 error ("parentheses around %qE cannot be used to form a"
4591 " pointer-to-member-function",
4593 PTRMEM_OK_P (xarg
) = 1;
4597 if (TREE_CODE (xarg
) == OFFSET_REF
)
4599 ptrmem
= PTRMEM_OK_P (xarg
);
4601 if (!ptrmem
&& !flag_ms_extensions
4602 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4604 /* A single non-static member, make sure we don't allow a
4605 pointer-to-member. */
4606 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4607 TREE_OPERAND (xarg
, 0),
4608 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4609 PTRMEM_OK_P (xarg
) = ptrmem
;
4613 exp
= cp_build_addr_expr_strict (xarg
, complain
);
4616 if (processing_template_decl
&& exp
!= error_mark_node
)
4617 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4618 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4619 if (TREE_CODE (exp
) == ADDR_EXPR
)
4620 PTRMEM_OK_P (exp
) = ptrmem
;
4624 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4625 constants, where a null value is represented by an INTEGER_CST of
4629 cp_truthvalue_conversion (tree expr
)
4631 tree type
= TREE_TYPE (expr
);
4632 if (TYPE_PTRMEM_P (type
))
4633 return build_binary_op (EXPR_LOCATION (expr
),
4634 NE_EXPR
, expr
, integer_zero_node
, 1);
4636 return c_common_truthvalue_conversion (input_location
, expr
);
4639 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4642 condition_conversion (tree expr
)
4645 if (processing_template_decl
)
4647 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4648 tf_warning_or_error
, LOOKUP_NORMAL
);
4649 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4653 /* Returns the address of T. This function will fold away
4654 ADDR_EXPR of INDIRECT_REF. */
4657 build_address (tree t
)
4659 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4660 return error_mark_node
;
4661 t
= build_fold_addr_expr (t
);
4662 if (TREE_CODE (t
) != ADDR_EXPR
)
4667 /* Returns the address of T with type TYPE. */
4670 build_typed_address (tree t
, tree type
)
4672 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4673 return error_mark_node
;
4674 t
= build_fold_addr_expr_with_type (t
, type
);
4675 if (TREE_CODE (t
) != ADDR_EXPR
)
4680 /* Return a NOP_EXPR converting EXPR to TYPE. */
4683 build_nop (tree type
, tree expr
)
4685 if (type
== error_mark_node
|| error_operand_p (expr
))
4687 return build1 (NOP_EXPR
, type
, expr
);
4690 /* Take the address of ARG, whatever that means under C++ semantics.
4691 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
4692 and class rvalues as well.
4694 Nothing should call this function directly; instead, callers should use
4695 cp_build_addr_expr or cp_build_addr_expr_strict. */
4698 cp_build_addr_expr_1 (tree arg
, bool strict_lvalue
, tsubst_flags_t complain
)
4703 if (!arg
|| error_operand_p (arg
))
4704 return error_mark_node
;
4706 arg
= mark_lvalue_use (arg
);
4707 argtype
= lvalue_type (arg
);
4709 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
4710 || !IDENTIFIER_OPNAME_P (arg
));
4712 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
4713 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
4715 /* They're trying to take the address of a unique non-static
4716 member function. This is ill-formed (except in MS-land),
4717 but let's try to DTRT.
4718 Note: We only handle unique functions here because we don't
4719 want to complain if there's a static overload; non-unique
4720 cases will be handled by instantiate_type. But we need to
4721 handle this case here to allow casts on the resulting PMF.
4722 We could defer this in non-MS mode, but it's easier to give
4723 a useful error here. */
4725 /* Inside constant member functions, the `this' pointer
4726 contains an extra const qualifier. TYPE_MAIN_VARIANT
4727 is used here to remove this const from the diagnostics
4728 and the created OFFSET_REF. */
4729 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
4730 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
4733 if (! flag_ms_extensions
)
4735 tree name
= DECL_NAME (fn
);
4736 if (!(complain
& tf_error
))
4737 return error_mark_node
;
4738 else if (current_class_type
4739 && TREE_OPERAND (arg
, 0) == current_class_ref
)
4740 /* An expression like &memfn. */
4741 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
4742 " or parenthesized non-static member function to form"
4743 " a pointer to member function. Say %<&%T::%D%>",
4746 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
4747 " function to form a pointer to member function."
4751 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
4754 /* Uninstantiated types are all functions. Taking the
4755 address of a function is a no-op, so just return the
4757 if (type_unknown_p (arg
))
4758 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4760 if (TREE_CODE (arg
) == OFFSET_REF
)
4761 /* We want a pointer to member; bypass all the code for actually taking
4762 the address of something. */
4765 /* Anything not already handled and not a true memory reference
4767 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4768 && TREE_CODE (argtype
) != METHOD_TYPE
)
4770 cp_lvalue_kind kind
= lvalue_kind (arg
);
4771 if (kind
== clk_none
)
4773 if (complain
& tf_error
)
4774 lvalue_error (lv_addressof
);
4775 return error_mark_node
;
4777 if (strict_lvalue
&& (kind
& (clk_rvalueref
|clk_class
)))
4779 if (!(complain
& tf_error
))
4780 return error_mark_node
;
4781 if (kind
& clk_class
)
4782 /* Make this a permerror because we used to accept it. */
4783 permerror (input_location
, "taking address of temporary");
4785 error ("taking address of xvalue (rvalue reference)");
4789 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4791 tree type
= build_pointer_type (TREE_TYPE (argtype
));
4792 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4795 else if (pedantic
&& DECL_MAIN_P (arg
))
4798 /* Apparently a lot of autoconf scripts for C++ packages do this,
4799 so only complain if -pedantic. */
4800 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
4801 pedwarn (input_location
, OPT_pedantic
,
4802 "ISO C++ forbids taking address of function %<::main%>");
4803 else if (flag_pedantic_errors
)
4804 return error_mark_node
;
4807 /* Let &* cancel out to simplify resulting code. */
4808 if (TREE_CODE (arg
) == INDIRECT_REF
)
4810 /* We don't need to have `current_class_ptr' wrapped in a
4811 NON_LVALUE_EXPR node. */
4812 if (arg
== current_class_ref
)
4813 return current_class_ptr
;
4815 arg
= TREE_OPERAND (arg
, 0);
4816 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
4818 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
4819 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4822 /* Don't let this be an lvalue. */
4827 /* ??? Cope with user tricks that amount to offsetof. */
4828 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4829 && TREE_CODE (argtype
) != METHOD_TYPE
4830 && argtype
!= unknown_type_node
4831 && (val
= get_base_address (arg
))
4832 && COMPLETE_TYPE_P (TREE_TYPE (val
))
4833 && TREE_CODE (val
) == INDIRECT_REF
4834 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
4836 tree type
= build_pointer_type (argtype
);
4837 tree op0
= fold_convert (type
, TREE_OPERAND (val
, 0));
4838 tree op1
= fold_convert (sizetype
, fold_offsetof (arg
, val
));
4839 return fold_build2 (POINTER_PLUS_EXPR
, type
, op0
, op1
);
4842 /* Handle complex lvalues (when permitted)
4843 by reduction to simpler cases. */
4844 val
= unary_complex_lvalue (ADDR_EXPR
, arg
);
4848 switch (TREE_CODE (arg
))
4852 case FIX_TRUNC_EXPR
:
4853 /* Even if we're not being pedantic, we cannot allow this
4854 extension when we're instantiating in a SFINAE
4856 if (! lvalue_p (arg
) && complain
== tf_none
)
4858 if (complain
& tf_error
)
4859 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4861 return error_mark_node
;
4866 arg
= BASELINK_FUNCTIONS (arg
);
4870 arg
= OVL_CURRENT (arg
);
4875 /* Turn a reference to a non-static data member into a
4876 pointer-to-member. */
4881 gcc_assert (PTRMEM_OK_P (arg
));
4883 t
= TREE_OPERAND (arg
, 1);
4884 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
4886 if (complain
& tf_error
)
4887 error ("cannot create pointer to reference member %qD", t
);
4888 return error_mark_node
;
4891 type
= build_ptrmem_type (context_for_name_lookup (t
),
4893 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
4901 if (argtype
!= error_mark_node
)
4902 argtype
= build_pointer_type (argtype
);
4904 /* In a template, we are processing a non-dependent expression
4905 so we can just form an ADDR_EXPR with the correct type. */
4906 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
4908 val
= build_address (arg
);
4909 if (TREE_CODE (arg
) == OFFSET_REF
)
4910 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
4912 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
4914 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
4916 /* We can only get here with a single static member
4918 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4919 && DECL_STATIC_FUNCTION_P (fn
));
4921 val
= build_address (fn
);
4922 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
4923 /* Do not lose object's side effects. */
4924 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
4925 TREE_OPERAND (arg
, 0), val
);
4927 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
4929 if (complain
& tf_error
)
4930 error ("attempt to take address of bit-field structure member %qD",
4931 TREE_OPERAND (arg
, 1));
4932 return error_mark_node
;
4936 tree object
= TREE_OPERAND (arg
, 0);
4937 tree field
= TREE_OPERAND (arg
, 1);
4938 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4939 (TREE_TYPE (object
), decl_type_context (field
)));
4940 val
= build_address (arg
);
4943 if (TREE_CODE (argtype
) == POINTER_TYPE
4944 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
4946 build_ptrmemfunc_type (argtype
);
4947 val
= build_ptrmemfunc (argtype
, val
, 0,
4949 tf_warning_or_error
);
4955 /* Take the address of ARG if it has one, even if it's an rvalue. */
4958 cp_build_addr_expr (tree arg
, tsubst_flags_t complain
)
4960 return cp_build_addr_expr_1 (arg
, 0, complain
);
4963 /* Take the address of ARG, but only if it's an lvalue. */
4966 cp_build_addr_expr_strict (tree arg
, tsubst_flags_t complain
)
4968 return cp_build_addr_expr_1 (arg
, 1, complain
);
4971 /* C++: Must handle pointers to members.
4973 Perhaps type instantiation should be extended to handle conversion
4974 from aggregates to types we don't yet know we want? (Or are those
4975 cases typically errors which should be reported?)
4977 NOCONVERT nonzero suppresses the default promotions
4978 (such as from short to int). */
4981 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
4982 tsubst_flags_t complain
)
4984 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4987 const char *errstring
= NULL
;
4989 const char *invalid_op_diag
;
4991 if (!arg
|| error_operand_p (arg
))
4992 return error_mark_node
;
4994 if ((invalid_op_diag
4995 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
5000 error (invalid_op_diag
);
5001 return error_mark_node
;
5006 case UNARY_PLUS_EXPR
:
5009 int flags
= WANT_ARITH
| WANT_ENUM
;
5010 /* Unary plus (but not unary minus) is allowed on pointers. */
5011 if (code
== UNARY_PLUS_EXPR
)
5012 flags
|= WANT_POINTER
;
5013 arg
= build_expr_type_conversion (flags
, arg
, true);
5015 errstring
= (code
== NEGATE_EXPR
5016 ? _("wrong type argument to unary minus")
5017 : _("wrong type argument to unary plus"));
5020 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5021 arg
= perform_integral_promotions (arg
);
5023 /* Make sure the result is not an lvalue: a unary plus or minus
5024 expression is always a rvalue. */
5031 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5035 arg
= default_conversion (arg
);
5037 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
5038 | WANT_VECTOR_OR_COMPLEX
,
5040 errstring
= _("wrong type argument to bit-complement");
5041 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5042 arg
= perform_integral_promotions (arg
);
5046 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5047 errstring
= _("wrong type argument to abs");
5048 else if (!noconvert
)
5049 arg
= default_conversion (arg
);
5053 /* Conjugating a real value is a no-op, but allow it anyway. */
5054 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5055 errstring
= _("wrong type argument to conjugation");
5056 else if (!noconvert
)
5057 arg
= default_conversion (arg
);
5060 case TRUTH_NOT_EXPR
:
5061 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
5063 val
= invert_truthvalue_loc (input_location
, arg
);
5064 if (arg
!= error_mark_node
)
5066 errstring
= _("in argument to unary !");
5074 arg
= build_real_imag_expr (input_location
, code
, arg
);
5075 if (arg
== error_mark_node
)
5078 return fold_if_not_in_template (arg
);
5080 case PREINCREMENT_EXPR
:
5081 case POSTINCREMENT_EXPR
:
5082 case PREDECREMENT_EXPR
:
5083 case POSTDECREMENT_EXPR
:
5084 /* Handle complex lvalues (when permitted)
5085 by reduction to simpler cases. */
5087 val
= unary_complex_lvalue (code
, arg
);
5091 arg
= mark_lvalue_use (arg
);
5093 /* Increment or decrement the real part of the value,
5094 and don't change the imaginary part. */
5095 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5099 arg
= stabilize_reference (arg
);
5100 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
5101 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
5102 real
= cp_build_unary_op (code
, real
, 1, complain
);
5103 if (real
== error_mark_node
|| imag
== error_mark_node
)
5104 return error_mark_node
;
5105 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
5109 /* Report invalid types. */
5111 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
5114 if (code
== PREINCREMENT_EXPR
)
5115 errstring
= _("no pre-increment operator for type");
5116 else if (code
== POSTINCREMENT_EXPR
)
5117 errstring
= _("no post-increment operator for type");
5118 else if (code
== PREDECREMENT_EXPR
)
5119 errstring
= _("no pre-decrement operator for type");
5121 errstring
= _("no post-decrement operator for type");
5124 else if (arg
== error_mark_node
)
5125 return error_mark_node
;
5127 /* Report something read-only. */
5129 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
5130 || TREE_READONLY (arg
))
5132 if (complain
& tf_error
)
5133 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
5134 || code
== POSTINCREMENT_EXPR
)
5135 ? REK_INCREMENT
: REK_DECREMENT
));
5137 return error_mark_node
;
5142 tree declared_type
= unlowered_expr_type (arg
);
5144 argtype
= TREE_TYPE (arg
);
5146 /* ARM $5.2.5 last annotation says this should be forbidden. */
5147 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
5149 if (complain
& tf_error
)
5150 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
5151 ? G_("ISO C++ forbids incrementing an enum")
5152 : G_("ISO C++ forbids decrementing an enum"));
5154 return error_mark_node
;
5157 /* Compute the increment. */
5159 if (TREE_CODE (argtype
) == POINTER_TYPE
)
5161 tree type
= complete_type (TREE_TYPE (argtype
));
5163 if (!COMPLETE_OR_VOID_TYPE_P (type
))
5165 if (complain
& tf_error
)
5166 error (((code
== PREINCREMENT_EXPR
5167 || code
== POSTINCREMENT_EXPR
))
5168 ? G_("cannot increment a pointer to incomplete type %qT")
5169 : G_("cannot decrement a pointer to incomplete type %qT"),
5170 TREE_TYPE (argtype
));
5172 return error_mark_node
;
5174 else if ((pedantic
|| warn_pointer_arith
)
5175 && !TYPE_PTROB_P (argtype
))
5177 if (complain
& tf_error
)
5178 permerror (input_location
, (code
== PREINCREMENT_EXPR
5179 || code
== POSTINCREMENT_EXPR
)
5180 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
5181 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
5184 return error_mark_node
;
5187 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
5190 inc
= integer_one_node
;
5192 inc
= cp_convert (argtype
, inc
);
5194 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
5195 need to ask Objective-C to build the increment or decrement
5196 expression for it. */
5197 if (objc_is_property_ref (arg
))
5198 return objc_build_incr_expr_for_property_ref (input_location
, code
,
5201 /* Complain about anything else that is not a true lvalue. */
5202 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
5203 || code
== POSTINCREMENT_EXPR
)
5204 ? lv_increment
: lv_decrement
),
5206 return error_mark_node
;
5208 /* Forbid using -- on `bool'. */
5209 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
5211 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
5213 if (complain
& tf_error
)
5214 error ("invalid use of Boolean expression as operand "
5215 "to %<operator--%>");
5216 return error_mark_node
;
5218 val
= boolean_increment (code
, arg
);
5221 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
5223 TREE_SIDE_EFFECTS (val
) = 1;
5228 /* Note that this operation never does default_conversion
5229 regardless of NOCONVERT. */
5230 return cp_build_addr_expr (arg
, complain
);
5239 argtype
= TREE_TYPE (arg
);
5240 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5243 if (complain
& tf_error
)
5244 error ("%s", errstring
);
5245 return error_mark_node
;
5248 /* Hook for the c-common bits that build a unary op. */
5250 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5251 enum tree_code code
, tree xarg
, int noconvert
)
5253 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5256 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5257 for certain kinds of expressions which are not really lvalues
5258 but which we can accept as lvalues.
5260 If ARG is not a kind of expression we can handle, return
5264 unary_complex_lvalue (enum tree_code code
, tree arg
)
5266 /* Inside a template, making these kinds of adjustments is
5267 pointless; we are only concerned with the type of the
5269 if (processing_template_decl
)
5272 /* Handle (a, b) used as an "lvalue". */
5273 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5275 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5276 tf_warning_or_error
);
5277 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5278 TREE_OPERAND (arg
, 0), real_result
);
5281 /* Handle (a ? b : c) used as an "lvalue". */
5282 if (TREE_CODE (arg
) == COND_EXPR
5283 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5284 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5286 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5287 if (TREE_CODE (arg
) == MODIFY_EXPR
5288 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5289 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5291 tree lvalue
= TREE_OPERAND (arg
, 0);
5292 if (TREE_SIDE_EFFECTS (lvalue
))
5294 lvalue
= stabilize_reference (lvalue
);
5295 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5296 lvalue
, TREE_OPERAND (arg
, 1));
5298 return unary_complex_lvalue
5299 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5302 if (code
!= ADDR_EXPR
)
5305 /* Handle (a = b) used as an "lvalue" for `&'. */
5306 if (TREE_CODE (arg
) == MODIFY_EXPR
5307 || TREE_CODE (arg
) == INIT_EXPR
)
5309 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5310 tf_warning_or_error
);
5311 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5313 TREE_NO_WARNING (arg
) = 1;
5317 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5318 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5319 || TREE_CODE (arg
) == OFFSET_REF
)
5322 /* We permit compiler to make function calls returning
5323 objects of aggregate type look like lvalues. */
5327 if (TREE_CODE (targ
) == SAVE_EXPR
)
5328 targ
= TREE_OPERAND (targ
, 0);
5330 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5332 if (TREE_CODE (arg
) == SAVE_EXPR
)
5335 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
5336 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5339 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5340 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5341 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5344 /* Don't let anything else be handled specially. */
5348 /* Mark EXP saying that we need to be able to take the
5349 address of it; it should not be allocated in a register.
5350 Value is true if successful.
5352 C++: we do not allow `current_class_ptr' to be addressable. */
5355 cxx_mark_addressable (tree exp
)
5360 switch (TREE_CODE (x
))
5367 x
= TREE_OPERAND (x
, 0);
5371 if (x
== current_class_ptr
)
5373 error ("cannot take the address of %<this%>, which is an rvalue expression");
5374 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5380 /* Caller should not be trying to mark initialized
5381 constant fields addressable. */
5382 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5383 || DECL_IN_AGGR_P (x
) == 0
5385 || DECL_EXTERNAL (x
));
5390 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5391 && !DECL_ARTIFICIAL (x
))
5393 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5396 ("address of explicit register variable %qD requested", x
);
5399 else if (extra_warnings
)
5401 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5403 TREE_ADDRESSABLE (x
) = 1;
5407 TREE_ADDRESSABLE (x
) = 1;
5411 TREE_ADDRESSABLE (x
) = 1;
5415 TREE_ADDRESSABLE (x
) = 1;
5416 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5424 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5427 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5428 tsubst_flags_t complain
)
5430 tree orig_ifexp
= ifexp
;
5431 tree orig_op1
= op1
;
5432 tree orig_op2
= op2
;
5435 if (processing_template_decl
)
5437 /* The standard says that the expression is type-dependent if
5438 IFEXP is type-dependent, even though the eventual type of the
5439 expression doesn't dependent on IFEXP. */
5440 if (type_dependent_expression_p (ifexp
)
5441 /* As a GNU extension, the middle operand may be omitted. */
5442 || (op1
&& type_dependent_expression_p (op1
))
5443 || type_dependent_expression_p (op2
))
5444 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5445 ifexp
= build_non_dependent_expr (ifexp
);
5447 op1
= build_non_dependent_expr (op1
);
5448 op2
= build_non_dependent_expr (op2
);
5451 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5452 if (processing_template_decl
&& expr
!= error_mark_node
)
5453 return build_min_non_dep (COND_EXPR
, expr
,
5454 orig_ifexp
, orig_op1
, orig_op2
);
5458 /* Given a list of expressions, return a compound expression
5459 that performs them all and returns the value of the last of them. */
5462 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
,
5463 tsubst_flags_t complain
)
5465 tree expr
= TREE_VALUE (list
);
5467 if (TREE_CHAIN (list
))
5469 if (complain
& tf_error
)
5473 permerror (input_location
, "expression list treated as compound "
5474 "expression in initializer");
5477 permerror (input_location
, "expression list treated as compound "
5478 "expression in mem-initializer");
5481 permerror (input_location
, "expression list treated as compound "
5482 "expression in functional cast");
5488 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5489 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5496 /* Like build_x_compound_expr_from_list, but using a VEC. */
5499 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5501 if (VEC_empty (tree
, vec
))
5503 else if (VEC_length (tree
, vec
) == 1)
5504 return VEC_index (tree
, vec
, 0);
5512 permerror (input_location
,
5513 "%s expression list treated as compound expression",
5516 expr
= VEC_index (tree
, vec
, 0);
5517 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5518 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5524 /* Handle overloading of the ',' operator when needed. */
5527 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5530 tree orig_op1
= op1
;
5531 tree orig_op2
= op2
;
5533 if (processing_template_decl
)
5535 if (type_dependent_expression_p (op1
)
5536 || type_dependent_expression_p (op2
))
5537 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5538 op1
= build_non_dependent_expr (op1
);
5539 op2
= build_non_dependent_expr (op2
);
5542 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5543 /*overloaded_p=*/NULL
, complain
);
5545 result
= cp_build_compound_expr (op1
, op2
, complain
);
5547 if (processing_template_decl
&& result
!= error_mark_node
)
5548 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5553 /* Like cp_build_compound_expr, but for the c-common bits. */
5556 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5558 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5561 /* Build a compound expression. */
5564 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5566 lhs
= convert_to_void (lhs
, ICV_LEFT_OF_COMMA
, complain
);
5568 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5569 return error_mark_node
;
5571 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5573 /* If the rhs is a TARGET_EXPR, then build the compound
5574 expression inside the target_expr's initializer. This
5575 helps the compiler to eliminate unnecessary temporaries. */
5576 tree init
= TREE_OPERAND (rhs
, 1);
5578 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5579 TREE_OPERAND (rhs
, 1) = init
;
5584 if (type_unknown_p (rhs
))
5586 error ("no context to resolve type of %qE", rhs
);
5587 return error_mark_node
;
5590 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5593 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5594 casts away constness. CAST gives the type of cast.
5596 ??? This function warns for casting away any qualifier not just
5597 const. We would like to specify exactly what qualifiers are casted
5602 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5603 enum tree_code cast
)
5605 /* C-style casts are allowed to cast away constness. With
5606 WARN_CAST_QUAL, we still want to issue a warning. */
5607 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5610 if (!casts_away_constness (src_type
, dest_type
))
5616 warning (OPT_Wcast_qual
,
5617 "cast from type %qT to type %qT casts away qualifiers",
5618 src_type
, dest_type
);
5621 case STATIC_CAST_EXPR
:
5622 error ("static_cast from type %qT to type %qT casts away qualifiers",
5623 src_type
, dest_type
);
5626 case REINTERPRET_CAST_EXPR
:
5627 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5628 src_type
, dest_type
);
5635 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5636 (another pointer-to-member type in the same hierarchy) and return
5637 the converted expression. If ALLOW_INVERSE_P is permitted, a
5638 pointer-to-derived may be converted to pointer-to-base; otherwise,
5639 only the other direction is permitted. If C_CAST_P is true, this
5640 conversion is taking place as part of a C-style cast. */
5643 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5644 bool c_cast_p
, tsubst_flags_t complain
)
5646 if (TYPE_PTRMEM_P (type
))
5650 if (TREE_CODE (expr
) == PTRMEM_CST
)
5651 expr
= cplus_expand_constant (expr
);
5652 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5653 TYPE_PTRMEM_CLASS_TYPE (type
),
5655 c_cast_p
, complain
);
5656 if (delta
== error_mark_node
)
5657 return error_mark_node
;
5659 if (!integer_zerop (delta
))
5661 tree cond
, op1
, op2
;
5663 cond
= cp_build_binary_op (input_location
,
5666 build_int_cst (TREE_TYPE (expr
), -1),
5667 tf_warning_or_error
);
5668 op1
= build_nop (ptrdiff_type_node
, expr
);
5669 op2
= cp_build_binary_op (input_location
,
5670 PLUS_EXPR
, op1
, delta
,
5671 tf_warning_or_error
);
5673 expr
= fold_build3_loc (input_location
,
5674 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5678 return build_nop (type
, expr
);
5681 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5682 allow_inverse_p
, c_cast_p
, complain
);
5685 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5686 this static_cast is being attempted as one of the possible casts
5687 allowed by a C-style cast. (In that case, accessibility of base
5688 classes is not considered, and it is OK to cast away
5689 constness.) Return the result of the cast. *VALID_P is set to
5690 indicate whether or not the cast was valid. */
5693 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5694 bool *valid_p
, tsubst_flags_t complain
)
5699 /* Assume the cast is valid. */
5702 intype
= TREE_TYPE (expr
);
5704 /* Save casted types in the function's used types hash table. */
5705 used_types_insert (type
);
5707 /* [expr.static.cast]
5709 An lvalue of type "cv1 B", where B is a class type, can be cast
5710 to type "reference to cv2 D", where D is a class derived (clause
5711 _class.derived_) from B, if a valid standard conversion from
5712 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5713 same cv-qualification as, or greater cv-qualification than, cv1,
5714 and B is not a virtual base class of D. */
5715 /* We check this case before checking the validity of "TYPE t =
5716 EXPR;" below because for this case:
5719 struct D : public B { D(const B&); };
5721 void f() { static_cast<const D&>(b); }
5723 we want to avoid constructing a new D. The standard is not
5724 completely clear about this issue, but our interpretation is
5725 consistent with other compilers. */
5726 if (TREE_CODE (type
) == REFERENCE_TYPE
5727 && CLASS_TYPE_P (TREE_TYPE (type
))
5728 && CLASS_TYPE_P (intype
)
5729 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5730 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5731 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5732 build_pointer_type (TYPE_MAIN_VARIANT
5733 (TREE_TYPE (type
))))
5735 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5739 /* There is a standard conversion from "D*" to "B*" even if "B"
5740 is ambiguous or inaccessible. If this is really a
5741 static_cast, then we check both for inaccessibility and
5742 ambiguity. However, if this is a static_cast being performed
5743 because the user wrote a C-style cast, then accessibility is
5745 base
= lookup_base (TREE_TYPE (type
), intype
,
5746 c_cast_p
? ba_unique
: ba_check
,
5749 /* Convert from "B*" to "D*". This function will check that "B"
5750 is not a virtual base of "D". */
5751 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5752 base
, /*nonnull=*/false);
5753 /* Convert the pointer to a reference -- but then remember that
5754 there are no expressions with reference type in C++.
5756 We call rvalue so that there's an actual tree code
5757 (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
5758 is a variable with the same type, the conversion would get folded
5759 away, leaving just the variable and causing lvalue_kind to give
5760 the wrong answer. */
5761 return convert_from_reference (rvalue (cp_fold_convert (type
, expr
)));
5764 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5765 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5766 if (TREE_CODE (type
) == REFERENCE_TYPE
5767 && TYPE_REF_IS_RVALUE (type
)
5768 && real_lvalue_p (expr
)
5769 && reference_related_p (TREE_TYPE (type
), intype
)
5770 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5772 expr
= build_typed_address (expr
, type
);
5773 return convert_from_reference (expr
);
5776 /* Resolve overloaded address here rather than once in
5777 implicit_conversion and again in the inverse code below. */
5778 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5780 expr
= instantiate_type (type
, expr
, complain
);
5781 intype
= TREE_TYPE (expr
);
5784 /* [expr.static.cast]
5786 An expression e can be explicitly converted to a type T using a
5787 static_cast of the form static_cast<T>(e) if the declaration T
5788 t(e);" is well-formed, for some invented temporary variable
5790 result
= perform_direct_initialization_if_possible (type
, expr
,
5791 c_cast_p
, complain
);
5794 result
= convert_from_reference (result
);
5796 /* [expr.static.cast]
5798 If T is a reference type, the result is an lvalue; otherwise,
5799 the result is an rvalue. */
5800 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5801 result
= rvalue (result
);
5805 /* [expr.static.cast]
5807 Any expression can be explicitly converted to type cv void. */
5808 if (TREE_CODE (type
) == VOID_TYPE
)
5809 return convert_to_void (expr
, ICV_CAST
, complain
);
5811 /* [expr.static.cast]
5813 The inverse of any standard conversion sequence (clause _conv_),
5814 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5815 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5816 (_conv.bool_) conversions, can be performed explicitly using
5817 static_cast subject to the restriction that the explicit
5818 conversion does not cast away constness (_expr.const.cast_), and
5819 the following additional rules for specific cases: */
5820 /* For reference, the conversions not excluded are: integral
5821 promotions, floating point promotion, integral conversions,
5822 floating point conversions, floating-integral conversions,
5823 pointer conversions, and pointer to member conversions. */
5826 A value of integral _or enumeration_ type can be explicitly
5827 converted to an enumeration type. */
5828 /* The effect of all that is that any conversion between any two
5829 types which are integral, floating, or enumeration types can be
5831 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5832 || SCALAR_FLOAT_TYPE_P (type
))
5833 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5834 || SCALAR_FLOAT_TYPE_P (intype
)))
5835 return ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5837 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5838 && CLASS_TYPE_P (TREE_TYPE (type
))
5839 && CLASS_TYPE_P (TREE_TYPE (intype
))
5840 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5841 (TREE_TYPE (intype
))),
5842 build_pointer_type (TYPE_MAIN_VARIANT
5843 (TREE_TYPE (type
)))))
5848 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5849 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
5850 c_cast_p
? ba_unique
: ba_check
,
5852 expr
= build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
5853 return cp_fold_convert(type
, expr
);
5856 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5857 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5864 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
5865 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
5867 if (TYPE_PTRMEM_P (type
))
5869 t1
= (build_ptrmem_type
5871 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
5872 t2
= (build_ptrmem_type
5874 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
5881 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
5884 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5885 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
5886 c_cast_p
, tf_warning_or_error
);
5890 /* [expr.static.cast]
5892 An rvalue of type "pointer to cv void" can be explicitly
5893 converted to a pointer to object type. A value of type pointer
5894 to object converted to "pointer to cv void" and back to the
5895 original pointer type will have its original value. */
5896 if (TREE_CODE (intype
) == POINTER_TYPE
5897 && VOID_TYPE_P (TREE_TYPE (intype
))
5898 && TYPE_PTROB_P (type
))
5901 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5902 return build_nop (type
, expr
);
5906 return error_mark_node
;
5909 /* Return an expression representing static_cast<TYPE>(EXPR). */
5912 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5917 if (type
== error_mark_node
|| expr
== error_mark_node
)
5918 return error_mark_node
;
5920 if (processing_template_decl
)
5922 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
5923 /* We don't know if it will or will not have side effects. */
5924 TREE_SIDE_EFFECTS (expr
) = 1;
5925 return convert_from_reference (expr
);
5928 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5929 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5930 if (TREE_CODE (type
) != REFERENCE_TYPE
5931 && TREE_CODE (expr
) == NOP_EXPR
5932 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5933 expr
= TREE_OPERAND (expr
, 0);
5935 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
5940 if (complain
& tf_error
)
5941 error ("invalid static_cast from type %qT to type %qT",
5942 TREE_TYPE (expr
), type
);
5943 return error_mark_node
;
5946 /* EXPR is an expression with member function or pointer-to-member
5947 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5948 not permitted by ISO C++, but we accept it in some modes. If we
5949 are not in one of those modes, issue a diagnostic. Return the
5950 converted expression. */
5953 convert_member_func_to_ptr (tree type
, tree expr
)
5958 intype
= TREE_TYPE (expr
);
5959 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
5960 || TREE_CODE (intype
) == METHOD_TYPE
);
5962 if (pedantic
|| warn_pmf2ptr
)
5963 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
5964 "converting from %qT to %qT", intype
, type
);
5966 if (TREE_CODE (intype
) == METHOD_TYPE
)
5967 expr
= build_addr_func (expr
);
5968 else if (TREE_CODE (expr
) == PTRMEM_CST
)
5969 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
5972 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
5973 decl
= build_address (decl
);
5974 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
5977 return build_nop (type
, expr
);
5980 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
5981 If C_CAST_P is true, this reinterpret cast is being done as part of
5982 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
5983 indicate whether or not reinterpret_cast was valid. */
5986 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5987 bool *valid_p
, tsubst_flags_t complain
)
5991 /* Assume the cast is invalid. */
5995 if (type
== error_mark_node
|| error_operand_p (expr
))
5996 return error_mark_node
;
5998 intype
= TREE_TYPE (expr
);
6000 /* Save casted types in the function's used types hash table. */
6001 used_types_insert (type
);
6003 /* [expr.reinterpret.cast]
6004 An lvalue expression of type T1 can be cast to the type
6005 "reference to T2" if an expression of type "pointer to T1" can be
6006 explicitly converted to the type "pointer to T2" using a
6007 reinterpret_cast. */
6008 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6010 if (! real_lvalue_p (expr
))
6012 if (complain
& tf_error
)
6013 error ("invalid cast of an rvalue expression of type "
6016 return error_mark_node
;
6019 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6020 "B" are related class types; the reinterpret_cast does not
6021 adjust the pointer. */
6022 if (TYPE_PTR_P (intype
)
6023 && (complain
& tf_warning
)
6024 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
6025 COMPARE_BASE
| COMPARE_DERIVED
)))
6026 warning (0, "casting %qT to %qT does not dereference pointer",
6029 expr
= cp_build_addr_expr (expr
, complain
);
6031 if (warn_strict_aliasing
> 2)
6032 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
6034 if (expr
!= error_mark_node
)
6035 expr
= build_reinterpret_cast_1
6036 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
6038 if (expr
!= error_mark_node
)
6039 /* cp_build_indirect_ref isn't right for rvalue refs. */
6040 expr
= convert_from_reference (fold_convert (type
, expr
));
6044 /* As a G++ extension, we consider conversions from member
6045 functions, and pointers to member functions to
6046 pointer-to-function and pointer-to-void types. If
6047 -Wno-pmf-conversions has not been specified,
6048 convert_member_func_to_ptr will issue an error message. */
6049 if ((TYPE_PTRMEMFUNC_P (intype
)
6050 || TREE_CODE (intype
) == METHOD_TYPE
)
6051 && TYPE_PTR_P (type
)
6052 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6053 || VOID_TYPE_P (TREE_TYPE (type
))))
6054 return convert_member_func_to_ptr (type
, expr
);
6056 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6057 array-to-pointer, and function-to-pointer conversions are
6059 expr
= decay_conversion (expr
);
6061 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6062 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6063 if (TREE_CODE (expr
) == NOP_EXPR
6064 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6065 expr
= TREE_OPERAND (expr
, 0);
6067 if (error_operand_p (expr
))
6068 return error_mark_node
;
6070 intype
= TREE_TYPE (expr
);
6072 /* [expr.reinterpret.cast]
6073 A pointer can be converted to any integral type large enough to
6074 hold it. ... A value of type std::nullptr_t can be converted to
6075 an integral type; the conversion has the same meaning and
6076 validity as a conversion of (void*)0 to the integral type. */
6077 if (CP_INTEGRAL_TYPE_P (type
)
6078 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
6080 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
6082 if (complain
& tf_error
)
6083 permerror (input_location
, "cast from %qT to %qT loses precision",
6086 return error_mark_node
;
6088 if (NULLPTR_TYPE_P (intype
))
6089 return build_int_cst (type
, 0);
6091 /* [expr.reinterpret.cast]
6092 A value of integral or enumeration type can be explicitly
6093 converted to a pointer. */
6094 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6097 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6098 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6099 return fold_if_not_in_template (build_nop (type
, expr
));
6100 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6101 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6106 check_for_casting_away_constness (intype
, type
, REINTERPRET_CAST_EXPR
);
6107 /* Warn about possible alignment problems. */
6108 if (STRICT_ALIGNMENT
&& warn_cast_align
6109 && (complain
& tf_warning
)
6110 && !VOID_TYPE_P (type
)
6111 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6112 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6113 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6114 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6115 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6116 "increases required alignment of target type", intype
, type
);
6118 /* We need to strip nops here, because the front end likes to
6119 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6121 if (warn_strict_aliasing
<= 2)
6122 strict_aliasing_warning (intype
, type
, sexpr
);
6124 return fold_if_not_in_template (build_nop (type
, expr
));
6126 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6127 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6129 if (pedantic
&& (complain
& tf_warning
))
6130 /* Only issue a warning, as we have always supported this
6131 where possible, and it is necessary in some cases. DR 195
6132 addresses this issue, but as of 2004/10/26 is still in
6134 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6135 return fold_if_not_in_template (build_nop (type
, expr
));
6137 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6138 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6139 else if (TREE_CODE (intype
) == VECTOR_TYPE
6140 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6141 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6146 if (complain
& tf_error
)
6147 error ("invalid cast from type %qT to type %qT", intype
, type
);
6148 return error_mark_node
;
6151 return cp_convert (type
, expr
);
6155 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6157 if (type
== error_mark_node
|| expr
== error_mark_node
)
6158 return error_mark_node
;
6160 if (processing_template_decl
)
6162 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6164 if (!TREE_SIDE_EFFECTS (t
)
6165 && type_dependent_expression_p (expr
))
6166 /* There might turn out to be side effects inside expr. */
6167 TREE_SIDE_EFFECTS (t
) = 1;
6168 return convert_from_reference (t
);
6171 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6172 /*valid_p=*/NULL
, complain
);
6175 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6176 return an appropriate expression. Otherwise, return
6177 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6178 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6179 performing a C-style cast, its value upon return will indicate
6180 whether or not the conversion succeeded. */
6183 build_const_cast_1 (tree dst_type
, tree expr
, bool complain
,
6187 tree reference_type
;
6189 /* Callers are responsible for handling error_mark_node as a
6190 destination type. */
6191 gcc_assert (dst_type
!= error_mark_node
);
6192 /* In a template, callers should be building syntactic
6193 representations of casts, not using this machinery. */
6194 gcc_assert (!processing_template_decl
);
6196 /* Assume the conversion is invalid. */
6200 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6203 error ("invalid use of const_cast with type %qT, "
6204 "which is not a pointer, "
6205 "reference, nor a pointer-to-data-member type", dst_type
);
6206 return error_mark_node
;
6209 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6212 error ("invalid use of const_cast with type %qT, which is a pointer "
6213 "or reference to a function type", dst_type
);
6214 return error_mark_node
;
6217 /* Save casted types in the function's used types hash table. */
6218 used_types_insert (dst_type
);
6220 src_type
= TREE_TYPE (expr
);
6221 /* Expressions do not really have reference types. */
6222 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6223 src_type
= TREE_TYPE (src_type
);
6225 /* [expr.const.cast]
6227 An lvalue of type T1 can be explicitly converted to an lvalue of
6228 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6229 types) if a pointer to T1 can be explicitly converted to the type
6230 pointer to T2 using a const_cast. */
6231 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6233 reference_type
= dst_type
;
6234 if (! real_lvalue_p (expr
))
6237 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6238 src_type
, dst_type
);
6239 return error_mark_node
;
6241 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6242 src_type
= build_pointer_type (src_type
);
6246 reference_type
= NULL_TREE
;
6247 /* If the destination type is not a reference type, the
6248 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6249 conversions are performed. */
6250 src_type
= type_decays_to (src_type
);
6251 if (src_type
== error_mark_node
)
6252 return error_mark_node
;
6255 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6256 && comp_ptr_ttypes_const (dst_type
, src_type
))
6261 /* This cast is actually a C-style cast. Issue a warning if
6262 the user is making a potentially unsafe cast. */
6263 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
);
6267 expr
= cp_build_addr_expr (expr
,
6268 complain
? tf_warning_or_error
: tf_none
);
6269 expr
= build_nop (reference_type
, expr
);
6270 return convert_from_reference (expr
);
6274 expr
= decay_conversion (expr
);
6275 /* build_c_cast puts on a NOP_EXPR to make the result not an
6276 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6277 non-lvalue context. */
6278 if (TREE_CODE (expr
) == NOP_EXPR
6279 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6280 expr
= TREE_OPERAND (expr
, 0);
6281 return build_nop (dst_type
, expr
);
6286 error ("invalid const_cast from type %qT to type %qT",
6287 src_type
, dst_type
);
6288 return error_mark_node
;
6292 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6294 if (type
== error_mark_node
|| error_operand_p (expr
))
6295 return error_mark_node
;
6297 if (processing_template_decl
)
6299 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6301 if (!TREE_SIDE_EFFECTS (t
)
6302 && type_dependent_expression_p (expr
))
6303 /* There might turn out to be side effects inside expr. */
6304 TREE_SIDE_EFFECTS (t
) = 1;
6305 return convert_from_reference (t
);
6308 return build_const_cast_1 (type
, expr
, complain
& tf_error
,
6312 /* Like cp_build_c_cast, but for the c-common bits. */
6315 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6317 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6320 /* Build an expression representing an explicit C-style cast to type
6321 TYPE of expression EXPR. */
6324 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6330 if (type
== error_mark_node
|| error_operand_p (expr
))
6331 return error_mark_node
;
6333 if (processing_template_decl
)
6335 tree t
= build_min (CAST_EXPR
, type
,
6336 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6337 /* We don't know if it will or will not have side effects. */
6338 TREE_SIDE_EFFECTS (t
) = 1;
6339 return convert_from_reference (t
);
6342 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6343 'Class') should always be retained, because this information aids
6344 in method lookup. */
6345 if (objc_is_object_ptr (type
)
6346 && objc_is_object_ptr (TREE_TYPE (expr
)))
6347 return build_nop (type
, expr
);
6349 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6350 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6351 if (TREE_CODE (type
) != REFERENCE_TYPE
6352 && TREE_CODE (value
) == NOP_EXPR
6353 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6354 value
= TREE_OPERAND (value
, 0);
6356 if (TREE_CODE (type
) == ARRAY_TYPE
)
6358 /* Allow casting from T1* to T2[] because Cfront allows it.
6359 NIHCL uses it. It is not valid ISO C++ however. */
6360 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6362 if (complain
& tf_error
)
6363 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6365 return error_mark_node
;
6366 type
= build_pointer_type (TREE_TYPE (type
));
6370 if (complain
& tf_error
)
6371 error ("ISO C++ forbids casting to an array type %qT", type
);
6372 return error_mark_node
;
6376 if (TREE_CODE (type
) == FUNCTION_TYPE
6377 || TREE_CODE (type
) == METHOD_TYPE
)
6379 if (complain
& tf_error
)
6380 error ("invalid cast to function type %qT", type
);
6381 return error_mark_node
;
6384 if (TREE_CODE (type
) == POINTER_TYPE
6385 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
6386 /* Casting to an integer of smaller size is an error detected elsewhere. */
6387 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
6388 /* Don't warn about converting any constant. */
6389 && !TREE_CONSTANT (value
))
6390 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
6391 "cast to pointer from integer of different size");
6393 /* A C-style cast can be a const_cast. */
6394 result
= build_const_cast_1 (type
, value
, /*complain=*/false,
6399 /* Or a static cast. */
6400 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6401 &valid_p
, complain
);
6402 /* Or a reinterpret_cast. */
6404 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6405 &valid_p
, complain
);
6406 /* The static_cast or reinterpret_cast may be followed by a
6409 /* A valid cast may result in errors if, for example, a
6410 conversion to am ambiguous base class is required. */
6411 && !error_operand_p (result
))
6415 /* Non-class rvalues always have cv-unqualified type. */
6416 if (!CLASS_TYPE_P (type
))
6417 type
= TYPE_MAIN_VARIANT (type
);
6418 result_type
= TREE_TYPE (result
);
6419 if (!CLASS_TYPE_P (result_type
))
6420 result_type
= TYPE_MAIN_VARIANT (result_type
);
6421 /* If the type of RESULT does not match TYPE, perform a
6422 const_cast to make it match. If the static_cast or
6423 reinterpret_cast succeeded, we will differ by at most
6424 cv-qualification, so the follow-on const_cast is guaranteed
6426 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6428 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6429 gcc_assert (valid_p
);
6434 return error_mark_node
;
6437 /* For use from the C common bits. */
6439 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6440 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6441 enum tree_code modifycode
,
6442 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6443 tree rhs_origtype ATTRIBUTE_UNUSED
)
6445 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6448 /* Build an assignment expression of lvalue LHS from value RHS.
6449 MODIFYCODE is the code for a binary operator that we use
6450 to combine the old value of LHS with RHS to get the new value.
6451 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6453 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6456 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6457 tsubst_flags_t complain
)
6461 tree lhstype
= TREE_TYPE (lhs
);
6462 tree olhstype
= lhstype
;
6463 bool plain_assign
= (modifycode
== NOP_EXPR
);
6465 /* Avoid duplicate error messages from operands that had errors. */
6466 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6467 return error_mark_node
;
6469 /* Handle control structure constructs used as "lvalues". */
6470 switch (TREE_CODE (lhs
))
6472 /* Handle --foo = 5; as these are valid constructs in C++. */
6473 case PREDECREMENT_EXPR
:
6474 case PREINCREMENT_EXPR
:
6475 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6476 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6477 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6478 TREE_OPERAND (lhs
, 1));
6479 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6480 modifycode
, rhs
, complain
);
6481 if (newrhs
== error_mark_node
)
6482 return error_mark_node
;
6483 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6485 /* Handle (a, b) used as an "lvalue". */
6487 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6488 modifycode
, rhs
, complain
);
6489 if (newrhs
== error_mark_node
)
6490 return error_mark_node
;
6491 return build2 (COMPOUND_EXPR
, lhstype
,
6492 TREE_OPERAND (lhs
, 0), newrhs
);
6495 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6496 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6497 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6498 TREE_OPERAND (lhs
, 1));
6499 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6501 if (newrhs
== error_mark_node
)
6502 return error_mark_node
;
6503 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6507 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6508 when neither operand has side-effects. */
6509 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6510 return error_mark_node
;
6512 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6513 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6515 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6516 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6518 TREE_OPERAND (lhs
, 0),
6519 TREE_OPERAND (lhs
, 1)),
6520 TREE_OPERAND (lhs
, 0),
6521 TREE_OPERAND (lhs
, 1));
6524 /* Handle (a ? b : c) used as an "lvalue". */
6527 /* Produce (a ? (b = rhs) : (c = rhs))
6528 except that the RHS goes through a save-expr
6529 so the code to compute it is only emitted once. */
6531 tree preeval
= NULL_TREE
;
6533 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6535 if (complain
& tf_error
)
6536 error ("void value not ignored as it ought to be");
6537 return error_mark_node
;
6540 rhs
= stabilize_expr (rhs
, &preeval
);
6542 /* Check this here to avoid odd errors when trying to convert
6543 a throw to the type of the COND_EXPR. */
6544 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6545 return error_mark_node
;
6547 cond
= build_conditional_expr
6548 (TREE_OPERAND (lhs
, 0),
6549 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6550 modifycode
, rhs
, complain
),
6551 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6552 modifycode
, rhs
, complain
),
6555 if (cond
== error_mark_node
)
6557 /* Make sure the code to compute the rhs comes out
6558 before the split. */
6560 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6568 if (modifycode
== INIT_EXPR
)
6570 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6571 /* Do the default thing. */;
6572 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6574 /* Compound literal. */
6575 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6576 /* Call convert to generate an error; see PR 11063. */
6577 rhs
= convert (lhstype
, rhs
);
6578 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6579 TREE_SIDE_EFFECTS (result
) = 1;
6582 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6583 /* Do the default thing. */;
6586 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6587 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6588 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6590 release_tree_vector (rhs_vec
);
6591 if (result
== NULL_TREE
)
6592 return error_mark_node
;
6598 lhs
= require_complete_type_sfinae (lhs
, complain
);
6599 if (lhs
== error_mark_node
)
6600 return error_mark_node
;
6602 if (modifycode
== NOP_EXPR
)
6604 if (c_dialect_objc ())
6606 result
= objc_maybe_build_modify_expr (lhs
, rhs
);
6611 /* `operator=' is not an inheritable operator. */
6612 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6613 /* Do the default thing. */;
6616 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6617 lhs
, rhs
, make_node (NOP_EXPR
),
6618 /*overloaded_p=*/NULL
,
6620 if (result
== NULL_TREE
)
6621 return error_mark_node
;
6628 /* A binary op has been requested. Combine the old LHS
6629 value with the RHS producing the value we should actually
6630 store into the LHS. */
6631 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6632 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6633 || MAYBE_CLASS_TYPE_P (lhstype
)));
6635 lhs
= stabilize_reference (lhs
);
6636 newrhs
= cp_build_binary_op (input_location
,
6637 modifycode
, lhs
, rhs
,
6639 if (newrhs
== error_mark_node
)
6641 if (complain
& tf_error
)
6642 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6643 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6644 return error_mark_node
;
6647 /* Now it looks like a plain assignment. */
6648 modifycode
= NOP_EXPR
;
6649 if (c_dialect_objc ())
6651 result
= objc_maybe_build_modify_expr (lhs
, newrhs
);
6656 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6657 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6660 /* The left-hand side must be an lvalue. */
6661 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6662 return error_mark_node
;
6664 /* Warn about modifying something that is `const'. Don't warn if
6665 this is initialization. */
6666 if (modifycode
!= INIT_EXPR
6667 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6668 /* Functions are not modifiable, even though they are
6670 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6671 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6672 /* If it's an aggregate and any field is const, then it is
6673 effectively const. */
6674 || (CLASS_TYPE_P (lhstype
)
6675 && C_TYPE_FIELDS_READONLY (lhstype
))))
6677 if (complain
& tf_error
)
6678 readonly_error (lhs
, REK_ASSIGNMENT
);
6680 return error_mark_node
;
6683 /* If storing into a structure or union member, it may have been given a
6684 lowered bitfield type. We need to convert to the declared type first,
6685 so retrieve it now. */
6687 olhstype
= unlowered_expr_type (lhs
);
6689 /* Convert new value to destination type. */
6691 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6695 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6697 if (modifycode
!= INIT_EXPR
)
6699 if (complain
& tf_error
)
6700 error ("assigning to an array from an initializer list");
6701 return error_mark_node
;
6703 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6704 return error_mark_node
;
6705 newrhs
= digest_init (lhstype
, newrhs
);
6708 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6709 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6711 if (complain
& tf_error
)
6712 error ("incompatible types in assignment of %qT to %qT",
6713 TREE_TYPE (rhs
), lhstype
);
6714 return error_mark_node
;
6717 /* Allow array assignment in compiler-generated code. */
6718 else if (!current_function_decl
6719 || !DECL_ARTIFICIAL (current_function_decl
))
6721 /* This routine is used for both initialization and assignment.
6722 Make sure the diagnostic message differentiates the context. */
6723 if (complain
& tf_error
)
6725 if (modifycode
== INIT_EXPR
)
6726 error ("array used as initializer");
6728 error ("invalid array assignment");
6730 return error_mark_node
;
6733 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6734 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6735 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6736 /*explicit_value_init_p=*/false,
6737 from_array
, complain
);
6740 if (modifycode
== INIT_EXPR
)
6741 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6742 LOOKUP_ONLYCONVERTING. */
6743 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6744 ICR_INIT
, NULL_TREE
, 0,
6747 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
6748 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6750 if (!same_type_p (lhstype
, olhstype
))
6751 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6753 if (modifycode
!= INIT_EXPR
)
6755 if (TREE_CODE (newrhs
) == CALL_EXPR
6756 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6757 newrhs
= build_cplus_new (lhstype
, newrhs
);
6759 /* Can't initialize directly from a TARGET_EXPR, since that would
6760 cause the lhs to be constructed twice, and possibly result in
6761 accidental self-initialization. So we force the TARGET_EXPR to be
6762 expanded without a target. */
6763 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6764 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6765 TREE_OPERAND (newrhs
, 0));
6768 if (newrhs
== error_mark_node
)
6769 return error_mark_node
;
6771 if (c_dialect_objc () && flag_objc_gc
)
6773 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6779 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6780 lhstype
, lhs
, newrhs
);
6782 TREE_SIDE_EFFECTS (result
) = 1;
6784 TREE_NO_WARNING (result
) = 1;
6790 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6791 tsubst_flags_t complain
)
6793 if (processing_template_decl
)
6794 return build_min_nt (MODOP_EXPR
, lhs
,
6795 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6797 if (modifycode
!= NOP_EXPR
)
6799 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6800 make_node (modifycode
),
6801 /*overloaded_p=*/NULL
,
6805 TREE_NO_WARNING (rval
) = 1;
6809 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6812 /* Helper function for get_delta_difference which assumes FROM is a base
6813 class of TO. Returns a delta for the conversion of pointer-to-member
6814 of FROM to pointer-to-member of TO. If the conversion is invalid and
6815 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
6816 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6817 If C_CAST_P is true, this conversion is taking place as part of a
6821 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
,
6822 tsubst_flags_t complain
)
6826 base_access access
= c_cast_p
? ba_unique
: ba_check
;
6828 /* Note: ba_quiet does not distinguish between access control and
6830 if (!(complain
& tf_error
))
6833 binfo
= lookup_base (to
, from
, access
, &kind
);
6835 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6837 if (!(complain
& tf_error
))
6838 return error_mark_node
;
6840 error (" in pointer to member function conversion");
6841 return size_zero_node
;
6845 if (kind
!= bk_via_virtual
)
6846 return BINFO_OFFSET (binfo
);
6848 /* FROM is a virtual base class of TO. Issue an error or warning
6849 depending on whether or not this is a reinterpret cast. */
6851 if (!(complain
& tf_error
))
6852 return error_mark_node
;
6854 error ("pointer to member conversion via virtual base %qT",
6855 BINFO_TYPE (binfo_from_vbase (binfo
)));
6857 return size_zero_node
;
6864 /* Get difference in deltas for different pointer to member function
6865 types. If the conversion is invalid and tf_error is not set in
6866 COMPLAIN, returns error_mark_node, otherwise returns an integer
6867 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
6868 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
6869 conversions as well. If C_CAST_P is true this conversion is taking
6870 place as part of a C-style cast.
6872 Note that the naming of FROM and TO is kind of backwards; the return
6873 value is what we add to a TO in order to get a FROM. They are named
6874 this way because we call this function to find out how to convert from
6875 a pointer to member of FROM to a pointer to member of TO. */
6878 get_delta_difference (tree from
, tree to
,
6879 bool allow_inverse_p
,
6880 bool c_cast_p
, tsubst_flags_t complain
)
6884 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
6885 /* Pointer to member of incomplete class is permitted*/
6886 result
= size_zero_node
;
6888 result
= get_delta_difference_1 (from
, to
, c_cast_p
, complain
);
6890 if (result
== error_mark_node
)
6891 return error_mark_node
;
6895 if (!allow_inverse_p
)
6897 if (!(complain
& tf_error
))
6898 return error_mark_node
;
6900 error_not_base_type (from
, to
);
6901 error (" in pointer to member conversion");
6902 result
= size_zero_node
;
6906 result
= get_delta_difference_1 (to
, from
, c_cast_p
, complain
);
6908 if (result
== error_mark_node
)
6909 return error_mark_node
;
6912 result
= size_diffop_loc (input_location
,
6913 size_zero_node
, result
);
6916 if (!(complain
& tf_error
))
6917 return error_mark_node
;
6919 error_not_base_type (from
, to
);
6920 error (" in pointer to member conversion");
6921 result
= size_zero_node
;
6926 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
6930 /* Return a constructor for the pointer-to-member-function TYPE using
6931 the other components as specified. */
6934 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
6939 VEC(constructor_elt
, gc
) *v
;
6941 /* Pull the FIELD_DECLs out of the type. */
6942 pfn_field
= TYPE_FIELDS (type
);
6943 delta_field
= DECL_CHAIN (pfn_field
);
6945 /* Make sure DELTA has the type we want. */
6946 delta
= convert_and_check (delta_type_node
, delta
);
6948 /* Convert to the correct target type if necessary. */
6949 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
6951 /* Finish creating the initializer. */
6952 v
= VEC_alloc(constructor_elt
, gc
, 2);
6953 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
6954 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
6955 u
= build_constructor (type
, v
);
6956 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
6957 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
6958 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
6960 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
6965 /* Build a constructor for a pointer to member function. It can be
6966 used to initialize global variables, local variable, or used
6967 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6970 If FORCE is nonzero, then force this conversion, even if
6971 we would rather not do it. Usually set when using an explicit
6972 cast. A C-style cast is being processed iff C_CAST_P is true.
6974 Return error_mark_node, if something goes wrong. */
6977 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
,
6978 tsubst_flags_t complain
)
6984 if (error_operand_p (pfn
))
6985 return error_mark_node
;
6987 pfn_type
= TREE_TYPE (pfn
);
6988 to_type
= build_ptrmemfunc_type (type
);
6990 /* Handle multiple conversions of pointer to member functions. */
6991 if (TYPE_PTRMEMFUNC_P (pfn_type
))
6993 tree delta
= NULL_TREE
;
6994 tree npfn
= NULL_TREE
;
6998 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
6999 error ("invalid conversion to type %qT from type %qT",
7002 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
7003 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
7005 c_cast_p
, complain
);
7006 if (n
== error_mark_node
)
7007 return error_mark_node
;
7009 /* We don't have to do any conversion to convert a
7010 pointer-to-member to its own type. But, we don't want to
7011 just return a PTRMEM_CST if there's an explicit cast; that
7012 cast should make the expression an invalid template argument. */
7013 if (TREE_CODE (pfn
) != PTRMEM_CST
)
7015 if (same_type_p (to_type
, pfn_type
))
7017 else if (integer_zerop (n
))
7018 return build_reinterpret_cast (to_type
, pfn
,
7019 tf_warning_or_error
);
7022 if (TREE_SIDE_EFFECTS (pfn
))
7023 pfn
= save_expr (pfn
);
7025 /* Obtain the function pointer and the current DELTA. */
7026 if (TREE_CODE (pfn
) == PTRMEM_CST
)
7027 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
7030 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
7031 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
7034 /* Just adjust the DELTA field. */
7035 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7036 (TREE_TYPE (delta
), ptrdiff_type_node
));
7037 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
7038 n
= cp_build_binary_op (input_location
,
7039 LSHIFT_EXPR
, n
, integer_one_node
,
7040 tf_warning_or_error
);
7041 delta
= cp_build_binary_op (input_location
,
7042 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
7043 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
7046 /* Handle null pointer to member function conversions. */
7047 if (null_ptr_cst_p (pfn
))
7049 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
7050 return build_ptrmemfunc1 (to_type
,
7055 if (type_unknown_p (pfn
))
7056 return instantiate_type (type
, pfn
, tf_warning_or_error
);
7058 fn
= TREE_OPERAND (pfn
, 0);
7059 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7060 /* In a template, we will have preserved the
7062 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
7063 return make_ptrmem_cst (to_type
, fn
);
7066 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7069 ??? There is no consistency as to the types returned for the above
7070 values. Some code acts as if it were a sizetype and some as if it were
7071 integer_type_node. */
7074 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
7076 tree type
= TREE_TYPE (cst
);
7077 tree fn
= PTRMEM_CST_MEMBER (cst
);
7078 tree ptr_class
, fn_class
;
7080 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7082 /* The class that the function belongs to. */
7083 fn_class
= DECL_CONTEXT (fn
);
7085 /* The class that we're creating a pointer to member of. */
7086 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
7088 /* First, calculate the adjustment to the function's class. */
7089 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
7090 /*c_cast_p=*/0, tf_warning_or_error
);
7092 if (!DECL_VIRTUAL_P (fn
))
7093 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
7096 /* If we're dealing with a virtual function, we have to adjust 'this'
7097 again, to point to the base which provides the vtable entry for
7098 fn; the call will do the opposite adjustment. */
7099 tree orig_class
= DECL_CONTEXT (fn
);
7100 tree binfo
= binfo_or_else (orig_class
, fn_class
);
7101 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7102 *delta
, BINFO_OFFSET (binfo
));
7103 *delta
= fold_if_not_in_template (*delta
);
7105 /* We set PFN to the vtable offset at which the function can be
7106 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7107 case delta is shifted left, and then incremented). */
7108 *pfn
= DECL_VINDEX (fn
);
7109 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
7110 TYPE_SIZE_UNIT (vtable_entry_type
));
7111 *pfn
= fold_if_not_in_template (*pfn
);
7113 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
7115 case ptrmemfunc_vbit_in_pfn
:
7116 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
7118 *pfn
= fold_if_not_in_template (*pfn
);
7121 case ptrmemfunc_vbit_in_delta
:
7122 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
7123 *delta
, integer_one_node
);
7124 *delta
= fold_if_not_in_template (*delta
);
7125 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7126 *delta
, integer_one_node
);
7127 *delta
= fold_if_not_in_template (*delta
);
7134 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
7135 *pfn
= fold_if_not_in_template (*pfn
);
7139 /* Return an expression for PFN from the pointer-to-member function
7143 pfn_from_ptrmemfunc (tree t
)
7145 if (TREE_CODE (t
) == PTRMEM_CST
)
7150 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7155 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
7158 /* Return an expression for DELTA from the pointer-to-member function
7162 delta_from_ptrmemfunc (tree t
)
7164 if (TREE_CODE (t
) == PTRMEM_CST
)
7169 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7174 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7177 /* Convert value RHS to type TYPE as preparation for an assignment to
7178 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
7179 implicit conversion is. If FNDECL is non-NULL, we are doing the
7180 conversion in order to pass the PARMNUMth argument of FNDECL.
7181 If FNDECL is NULL, we are doing the conversion in function pointer
7182 argument passing, conversion in initialization, etc. */
7185 convert_for_assignment (tree type
, tree rhs
,
7186 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7187 tsubst_flags_t complain
, int flags
)
7190 enum tree_code coder
;
7192 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7193 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7194 rhs
= TREE_OPERAND (rhs
, 0);
7196 rhstype
= TREE_TYPE (rhs
);
7197 coder
= TREE_CODE (rhstype
);
7199 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7200 && vector_types_convertible_p (type
, rhstype
, true))
7202 rhs
= mark_rvalue_use (rhs
);
7203 return convert (type
, rhs
);
7206 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7207 return error_mark_node
;
7208 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7209 return error_mark_node
;
7211 /* The RHS of an assignment cannot have void type. */
7212 if (coder
== VOID_TYPE
)
7214 if (complain
& tf_error
)
7215 error ("void value not ignored as it ought to be");
7216 return error_mark_node
;
7219 /* Simplify the RHS if possible. */
7220 if (TREE_CODE (rhs
) == CONST_DECL
)
7221 rhs
= DECL_INITIAL (rhs
);
7223 if (c_dialect_objc ())
7227 tree rname
= fndecl
;
7238 selector
= objc_message_selector ();
7240 if (selector
&& parmno
> 1)
7247 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7249 rhs
= mark_rvalue_use (rhs
);
7250 return convert (type
, rhs
);
7256 The expression is implicitly converted (clause _conv_) to the
7257 cv-unqualified type of the left operand.
7259 We allow bad conversions here because by the time we get to this point
7260 we are committed to doing the conversion. If we end up doing a bad
7261 conversion, convert_like will complain. */
7262 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7264 /* When -Wno-pmf-conversions is use, we just silently allow
7265 conversions from pointers-to-members to plain pointers. If
7266 the conversion doesn't work, cp_convert will complain. */
7268 && TYPE_PTR_P (type
)
7269 && TYPE_PTRMEMFUNC_P (rhstype
))
7270 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7273 if (complain
& tf_error
)
7275 /* If the right-hand side has unknown type, then it is an
7276 overloaded function. Call instantiate_type to get error
7278 if (rhstype
== unknown_type_node
)
7279 instantiate_type (type
, rhs
, tf_warning_or_error
);
7281 error ("cannot convert %qT to %qT for argument %qP to %qD",
7282 rhstype
, type
, parmnum
, fndecl
);
7286 case ICR_DEFAULT_ARGUMENT
:
7287 error ("cannot convert %qT to %qT in default argument",
7291 error ("cannot convert %qT to %qT in argument passing",
7294 case ICR_CONVERTING
:
7295 error ("cannot convert %qT to %qT",
7299 error ("cannot convert %qT to %qT in initialization",
7303 error ("cannot convert %qT to %qT in return",
7307 error ("cannot convert %qT to %qT in assignment",
7314 return error_mark_node
;
7317 if (warn_missing_format_attribute
)
7319 const enum tree_code codel
= TREE_CODE (type
);
7320 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7322 && check_missing_format_attribute (type
, rhstype
)
7323 && (complain
& tf_warning
))
7327 case ICR_DEFAULT_ARGUMENT
:
7329 warning (OPT_Wmissing_format_attribute
,
7330 "parameter %qP of %qD might be a candidate "
7331 "for a format attribute", parmnum
, fndecl
);
7333 warning (OPT_Wmissing_format_attribute
,
7334 "parameter might be a candidate "
7335 "for a format attribute");
7337 case ICR_CONVERTING
:
7338 warning (OPT_Wmissing_format_attribute
,
7339 "target of conversion might be might be a candidate "
7340 "for a format attribute");
7343 warning (OPT_Wmissing_format_attribute
,
7344 "target of initialization might be a candidate "
7345 "for a format attribute");
7348 warning (OPT_Wmissing_format_attribute
,
7349 "return type might be a candidate "
7350 "for a format attribute");
7353 warning (OPT_Wmissing_format_attribute
,
7354 "left-hand side of assignment might be a candidate "
7355 "for a format attribute");
7362 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7364 if (warn_parentheses
7365 && TREE_CODE (type
) == BOOLEAN_TYPE
7366 && TREE_CODE (rhs
) == MODIFY_EXPR
7367 && !TREE_NO_WARNING (rhs
)
7368 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7369 && (complain
& tf_warning
))
7371 location_t loc
= EXPR_LOC_OR_HERE (rhs
);
7373 warning_at (loc
, OPT_Wparentheses
,
7374 "suggest parentheses around assignment used as truth value");
7375 TREE_NO_WARNING (rhs
) = 1;
7378 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7382 /* Convert RHS to be of type TYPE.
7383 If EXP is nonzero, it is the target of the initialization.
7384 ERRTYPE indicates what kind of error the implicit conversion is.
7386 Two major differences between the behavior of
7387 `convert_for_assignment' and `convert_for_initialization'
7388 are that references are bashed in the former, while
7389 copied in the latter, and aggregates are assigned in
7390 the former (operator=) while initialized in the
7393 If using constructor make sure no conversion operator exists, if one does
7394 exist, an ambiguity exists.
7396 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7399 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7400 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7401 tsubst_flags_t complain
)
7403 enum tree_code codel
= TREE_CODE (type
);
7405 enum tree_code coder
;
7407 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7408 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7409 if (TREE_CODE (rhs
) == NOP_EXPR
7410 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7411 && codel
!= REFERENCE_TYPE
)
7412 rhs
= TREE_OPERAND (rhs
, 0);
7414 if (type
== error_mark_node
7415 || rhs
== error_mark_node
7416 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7417 return error_mark_node
;
7419 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7420 && TREE_CODE (type
) != ARRAY_TYPE
7421 && (TREE_CODE (type
) != REFERENCE_TYPE
7422 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7423 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7424 && (TREE_CODE (type
) != REFERENCE_TYPE
7425 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7426 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7427 rhs
= decay_conversion (rhs
);
7429 rhstype
= TREE_TYPE (rhs
);
7430 coder
= TREE_CODE (rhstype
);
7432 if (coder
== ERROR_MARK
)
7433 return error_mark_node
;
7435 /* We accept references to incomplete types, so we can
7436 return here before checking if RHS is of complete type. */
7438 if (codel
== REFERENCE_TYPE
)
7440 /* This should eventually happen in convert_arguments. */
7441 int savew
= 0, savee
= 0;
7444 savew
= warningcount
, savee
= errorcount
;
7445 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7446 /*cleanup=*/NULL
, complain
);
7449 if (warningcount
> savew
)
7450 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7451 else if (errorcount
> savee
)
7452 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7458 exp
= require_complete_type_sfinae (exp
, complain
);
7459 if (exp
== error_mark_node
)
7460 return error_mark_node
;
7462 rhstype
= non_reference (rhstype
);
7464 type
= complete_type (type
);
7466 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7467 /* Don't try to do copy-initialization if we already have
7468 direct-initialization. */
7471 if (MAYBE_CLASS_TYPE_P (type
))
7472 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
7474 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7478 /* If RETVAL is the address of, or a reference to, a local variable or
7479 temporary give an appropriate warning. */
7482 maybe_warn_about_returning_address_of_local (tree retval
)
7484 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7485 tree whats_returned
= retval
;
7489 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7490 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7491 else if (CONVERT_EXPR_P (whats_returned
)
7492 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7493 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7498 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7500 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7502 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7504 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7505 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7507 warning (0, "returning reference to temporary");
7510 if (TREE_CODE (whats_returned
) == VAR_DECL
7511 && DECL_NAME (whats_returned
)
7512 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7514 warning (0, "reference to non-lvalue returned");
7519 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7520 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7521 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7523 if (DECL_P (whats_returned
)
7524 && DECL_NAME (whats_returned
)
7525 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7526 && !(TREE_STATIC (whats_returned
)
7527 || TREE_PUBLIC (whats_returned
)))
7529 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7530 warning (0, "reference to local variable %q+D returned",
7533 warning (0, "address of local variable %q+D returned",
7539 /* Check that returning RETVAL from the current function is valid.
7540 Return an expression explicitly showing all conversions required to
7541 change RETVAL into the function return type, and to assign it to
7542 the DECL_RESULT for the function. Set *NO_WARNING to true if
7543 code reaches end of non-void function warning shouldn't be issued
7544 on this RETURN_EXPR. */
7547 check_return_expr (tree retval
, bool *no_warning
)
7550 /* The type actually returned by the function, after any
7553 int fn_returns_value_p
;
7554 bool named_return_value_okay_p
;
7556 *no_warning
= false;
7558 /* A `volatile' function is one that isn't supposed to return, ever.
7559 (This is a G++ extension, used to get better code for functions
7560 that call the `volatile' function.) */
7561 if (TREE_THIS_VOLATILE (current_function_decl
))
7562 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7564 /* Check for various simple errors. */
7565 if (DECL_DESTRUCTOR_P (current_function_decl
))
7568 error ("returning a value from a destructor");
7571 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7573 if (in_function_try_handler
)
7574 /* If a return statement appears in a handler of the
7575 function-try-block of a constructor, the program is ill-formed. */
7576 error ("cannot return from a handler of a function-try-block of a constructor");
7578 /* You can't return a value from a constructor. */
7579 error ("returning a value from a constructor");
7583 /* As an extension, deduce lambda return type from a return statement
7584 anywhere in the body. */
7585 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7587 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7588 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7590 tree type
= lambda_return_type (retval
);
7591 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7593 if (VOID_TYPE_P (type
))
7595 else if (oldtype
== NULL_TREE
)
7597 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7598 "can only be deduced when the return statement is "
7599 "the only statement in the function body");
7600 apply_lambda_return_type (lambda
, type
);
7602 else if (!same_type_p (type
, oldtype
))
7603 error ("inconsistent types %qT and %qT deduced for "
7604 "lambda return type", type
, oldtype
);
7608 if (processing_template_decl
)
7610 current_function_returns_value
= 1;
7611 if (check_for_bare_parameter_packs (retval
))
7612 retval
= error_mark_node
;
7616 /* When no explicit return-value is given in a function with a named
7617 return value, the named return value is used. */
7618 result
= DECL_RESULT (current_function_decl
);
7619 valtype
= TREE_TYPE (result
);
7620 gcc_assert (valtype
!= NULL_TREE
);
7621 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7622 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7625 /* Check for a return statement with no return value in a function
7626 that's supposed to return a value. */
7627 if (!retval
&& fn_returns_value_p
)
7629 permerror (input_location
, "return-statement with no value, in function returning %qT",
7631 /* Clear this, so finish_function won't say that we reach the
7632 end of a non-void function (which we don't, we gave a
7634 current_function_returns_null
= 0;
7635 /* And signal caller that TREE_NO_WARNING should be set on the
7636 RETURN_EXPR to avoid control reaches end of non-void function
7637 warnings in tree-cfg.c. */
7640 /* Check for a return statement with a value in a function that
7641 isn't supposed to return a value. */
7642 else if (retval
&& !fn_returns_value_p
)
7644 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7645 /* You can return a `void' value from a function of `void'
7646 type. In that case, we have to evaluate the expression for
7647 its side-effects. */
7648 finish_expr_stmt (retval
);
7650 permerror (input_location
, "return-statement with a value, in function "
7651 "returning 'void'");
7652 current_function_returns_null
= 1;
7654 /* There's really no value to return, after all. */
7658 /* Remember that this function can sometimes return without a
7660 current_function_returns_null
= 1;
7662 /* Remember that this function did return a value. */
7663 current_function_returns_value
= 1;
7665 /* Check for erroneous operands -- but after giving ourselves a
7666 chance to provide an error about returning a value from a void
7668 if (error_operand_p (retval
))
7670 current_function_return_value
= error_mark_node
;
7671 return error_mark_node
;
7674 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7675 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7676 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7677 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7679 && retval
&& null_ptr_cst_p (retval
))
7680 warning (0, "%<operator new%> must not return NULL unless it is "
7681 "declared %<throw()%> (or -fcheck-new is in effect)");
7683 /* Effective C++ rule 15. See also start_function. */
7685 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7689 /* The function return type must be a reference to the current
7691 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7692 && same_type_ignoring_top_level_qualifiers_p
7693 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7695 /* Returning '*this' is obviously OK. */
7696 if (retval
== current_class_ref
)
7698 /* If we are calling a function whose return type is the same of
7699 the current class reference, it is ok. */
7700 else if (TREE_CODE (retval
) == INDIRECT_REF
7701 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7706 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7709 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7711 [...] For a function with a class return type, if the expression
7712 in the return statement is the name of a local object, and the cv-
7713 unqualified type of the local object is the same as the function
7714 return type, an implementation is permitted to omit creating the tem-
7715 porary object to hold the function return value [...]
7717 So, if this is a value-returning function that always returns the same
7718 local variable, remember it.
7720 It might be nice to be more flexible, and choose the first suitable
7721 variable even if the function sometimes returns something else, but
7722 then we run the risk of clobbering the variable we chose if the other
7723 returned expression uses the chosen variable somehow. And people expect
7724 this restriction, anyway. (jason 2000-11-19)
7726 See finish_function and finalize_nrv for the rest of this optimization. */
7728 named_return_value_okay_p
=
7729 (retval
!= NULL_TREE
7730 /* Must be a local, automatic variable. */
7731 && TREE_CODE (retval
) == VAR_DECL
7732 && DECL_CONTEXT (retval
) == current_function_decl
7733 && ! TREE_STATIC (retval
)
7734 && ! DECL_ANON_UNION_VAR_P (retval
)
7735 && (DECL_ALIGN (retval
)
7736 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7737 /* The cv-unqualified type of the returned value must be the
7738 same as the cv-unqualified return type of the
7740 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7742 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7743 /* And the returned value must be non-volatile. */
7744 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7746 if (fn_returns_value_p
&& flag_elide_constructors
)
7748 if (named_return_value_okay_p
7749 && (current_function_return_value
== NULL_TREE
7750 || current_function_return_value
== retval
))
7751 current_function_return_value
= retval
;
7753 current_function_return_value
= error_mark_node
;
7756 /* We don't need to do any conversions when there's nothing being
7761 /* Do any required conversions. */
7762 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7763 /* No conversions are required. */
7767 /* The type the function is declared to return. */
7768 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7769 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7771 /* The functype's return type will have been set to void, if it
7772 was an incomplete type. Just treat this as 'return;' */
7773 if (VOID_TYPE_P (functype
))
7774 return error_mark_node
;
7776 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7777 treated as an rvalue for the purposes of overload resolution to
7778 favor move constructors over copy constructors. */
7779 if ((cxx_dialect
!= cxx98
)
7780 && named_return_value_okay_p
7781 /* The variable must not have the `volatile' qualifier. */
7782 && !CP_TYPE_VOLATILE_P (TREE_TYPE (retval
))
7783 /* The return type must be a class type. */
7784 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7785 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7787 /* First convert the value to the function's return type, then
7788 to the type of return value's location to handle the
7789 case that functype is smaller than the valtype. */
7790 retval
= convert_for_initialization
7791 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
7792 tf_warning_or_error
);
7793 retval
= convert (valtype
, retval
);
7795 /* If the conversion failed, treat this just like `return;'. */
7796 if (retval
== error_mark_node
)
7798 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7799 else if (! cfun
->returns_struct
7800 && TREE_CODE (retval
) == TARGET_EXPR
7801 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7802 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7803 TREE_OPERAND (retval
, 0));
7805 maybe_warn_about_returning_address_of_local (retval
);
7808 /* Actually copy the value returned into the appropriate location. */
7809 if (retval
&& retval
!= result
)
7810 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7816 /* Returns nonzero if the pointer-type FROM can be converted to the
7817 pointer-type TO via a qualification conversion. If CONSTP is -1,
7818 then we return nonzero if the pointers are similar, and the
7819 cv-qualification signature of FROM is a proper subset of that of TO.
7821 If CONSTP is positive, then all outer pointers have been
7825 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7827 bool to_more_cv_qualified
= false;
7828 bool is_opaque_pointer
= false;
7830 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7832 if (TREE_CODE (to
) != TREE_CODE (from
))
7835 if (TREE_CODE (from
) == OFFSET_TYPE
7836 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7837 TYPE_OFFSET_BASETYPE (to
)))
7840 /* Const and volatile mean something different for function types,
7841 so the usual checks are not appropriate. */
7842 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7844 if (!at_least_as_qualified_p (to
, from
))
7847 if (!at_least_as_qualified_p (from
, to
))
7851 to_more_cv_qualified
= true;
7855 constp
&= TYPE_READONLY (to
);
7858 if (TREE_CODE (to
) == VECTOR_TYPE
)
7859 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7861 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
7862 return ((constp
>= 0 || to_more_cv_qualified
)
7863 && (is_opaque_pointer
7864 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
7868 /* When comparing, say, char ** to char const **, this function takes
7869 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7870 types to this function. */
7873 comp_ptr_ttypes (tree to
, tree from
)
7875 return comp_ptr_ttypes_real (to
, from
, 1);
7878 /* Returns true iff FNTYPE is a non-class type that involves
7879 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7880 if a parameter type is ill-formed. */
7883 error_type_p (const_tree type
)
7887 switch (TREE_CODE (type
))
7893 case REFERENCE_TYPE
:
7895 return error_type_p (TREE_TYPE (type
));
7899 if (error_type_p (TREE_TYPE (type
)))
7901 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7902 if (error_type_p (TREE_VALUE (t
)))
7907 if (TYPE_PTRMEMFUNC_P (type
))
7908 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
7916 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7917 type or inheritance-related types, regardless of cv-quals. */
7920 ptr_reasonably_similar (const_tree to
, const_tree from
)
7922 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7924 /* Any target type is similar enough to void. */
7925 if (TREE_CODE (to
) == VOID_TYPE
)
7926 return !error_type_p (from
);
7927 if (TREE_CODE (from
) == VOID_TYPE
)
7928 return !error_type_p (to
);
7930 if (TREE_CODE (to
) != TREE_CODE (from
))
7933 if (TREE_CODE (from
) == OFFSET_TYPE
7934 && comptypes (TYPE_OFFSET_BASETYPE (to
),
7935 TYPE_OFFSET_BASETYPE (from
),
7936 COMPARE_BASE
| COMPARE_DERIVED
))
7939 if (TREE_CODE (to
) == VECTOR_TYPE
7940 && vector_types_convertible_p (to
, from
, false))
7943 if (TREE_CODE (to
) == INTEGER_TYPE
7944 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
7947 if (TREE_CODE (to
) == FUNCTION_TYPE
)
7948 return !error_type_p (to
) && !error_type_p (from
);
7950 if (TREE_CODE (to
) != POINTER_TYPE
)
7952 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
7953 COMPARE_BASE
| COMPARE_DERIVED
);
7957 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
7958 pointer-to-member types) are the same, ignoring cv-qualification at
7962 comp_ptr_ttypes_const (tree to
, tree from
)
7964 bool is_opaque_pointer
= false;
7966 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7968 if (TREE_CODE (to
) != TREE_CODE (from
))
7971 if (TREE_CODE (from
) == OFFSET_TYPE
7972 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
7973 TYPE_OFFSET_BASETYPE (to
)))
7976 if (TREE_CODE (to
) == VECTOR_TYPE
)
7977 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7979 if (TREE_CODE (to
) != POINTER_TYPE
)
7980 return (is_opaque_pointer
7981 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
7985 /* Returns the type qualifiers for this type, including the qualifiers on the
7986 elements for an array type. */
7989 cp_type_quals (const_tree type
)
7992 /* This CONST_CAST is okay because strip_array_types returns its
7993 argument unmodified and we assign it to a const_tree. */
7994 type
= strip_array_types (CONST_CAST_TREE (type
));
7995 if (type
== error_mark_node
7996 /* Quals on a FUNCTION_TYPE are memfn quals. */
7997 || TREE_CODE (type
) == FUNCTION_TYPE
)
7998 return TYPE_UNQUALIFIED
;
7999 quals
= TYPE_QUALS (type
);
8000 /* METHOD and REFERENCE_TYPEs should never have quals. */
8001 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
8002 && TREE_CODE (type
) != REFERENCE_TYPE
)
8003 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
8004 == TYPE_UNQUALIFIED
));
8008 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
8012 type_memfn_quals (const_tree type
)
8014 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8015 return TYPE_QUALS (type
);
8016 else if (TREE_CODE (type
) == METHOD_TYPE
)
8017 return cp_type_quals (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))));
8022 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
8026 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
)
8028 /* Could handle METHOD_TYPE here if necessary. */
8029 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8030 if (TYPE_QUALS (type
) == memfn_quals
)
8032 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
8034 return build_qualified_type (type
, memfn_quals
);
8037 /* Returns nonzero if TYPE is const or volatile. */
8040 cv_qualified_p (const_tree type
)
8042 int quals
= cp_type_quals (type
);
8043 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
8046 /* Returns nonzero if the TYPE contains a mutable member. */
8049 cp_has_mutable_p (const_tree type
)
8051 /* This CONST_CAST is okay because strip_array_types returns its
8052 argument unmodified and we assign it to a const_tree. */
8053 type
= strip_array_types (CONST_CAST_TREE(type
));
8055 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
8058 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
8059 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
8060 approximation. In particular, consider:
8063 struct S { int i; };
8064 const S s = { f(); }
8066 Here, we will make "s" as TREE_READONLY (because it is declared
8067 "const") -- only to reverse ourselves upon seeing that the
8068 initializer is non-constant. */
8071 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
8073 tree type
= TREE_TYPE (decl
);
8075 if (type
== error_mark_node
)
8078 if (TREE_CODE (decl
) == TYPE_DECL
)
8081 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
8082 && type_quals
!= TYPE_UNQUALIFIED
));
8084 /* Avoid setting TREE_READONLY incorrectly. */
8085 if (/* If the object has a constructor, the constructor may modify
8087 TYPE_NEEDS_CONSTRUCTING (type
)
8088 /* If the type isn't complete, we don't know yet if it will need
8090 || !COMPLETE_TYPE_P (type
)
8091 /* If the type has a mutable component, that component might be
8093 || TYPE_HAS_MUTABLE_P (type
))
8094 type_quals
&= ~TYPE_QUAL_CONST
;
8096 c_apply_type_quals_to_decl (type_quals
, decl
);
8099 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8100 exemplar types such that casting T1 to T2 is casting away constness
8101 if and only if there is no implicit conversion from T1 to T2. */
8104 casts_away_constness_r (tree
*t1
, tree
*t2
)
8109 /* [expr.const.cast]
8111 For multi-level pointer to members and multi-level mixed pointers
8112 and pointers to members (conv.qual), the "member" aspect of a
8113 pointer to member level is ignored when determining if a const
8114 cv-qualifier has been cast away. */
8115 /* [expr.const.cast]
8117 For two pointer types:
8119 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8120 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8123 casting from X1 to X2 casts away constness if, for a non-pointer
8124 type T there does not exist an implicit conversion (clause
8127 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8131 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8132 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
8133 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
8135 *t1
= cp_build_qualified_type (void_type_node
,
8136 cp_type_quals (*t1
));
8137 *t2
= cp_build_qualified_type (void_type_node
,
8138 cp_type_quals (*t2
));
8142 quals1
= cp_type_quals (*t1
);
8143 quals2
= cp_type_quals (*t2
);
8145 if (TYPE_PTRMEM_P (*t1
))
8146 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
8148 *t1
= TREE_TYPE (*t1
);
8149 if (TYPE_PTRMEM_P (*t2
))
8150 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
8152 *t2
= TREE_TYPE (*t2
);
8154 casts_away_constness_r (t1
, t2
);
8155 *t1
= build_pointer_type (*t1
);
8156 *t2
= build_pointer_type (*t2
);
8157 *t1
= cp_build_qualified_type (*t1
, quals1
);
8158 *t2
= cp_build_qualified_type (*t2
, quals2
);
8161 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8164 ??? This function returns non-zero if casting away qualifiers not
8165 just const. We would like to return to the caller exactly which
8166 qualifiers are casted away to give more accurate diagnostics.
8170 casts_away_constness (tree t1
, tree t2
)
8172 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
8174 /* [expr.const.cast]
8176 Casting from an lvalue of type T1 to an lvalue of type T2
8177 using a reference cast casts away constness if a cast from an
8178 rvalue of type "pointer to T1" to the type "pointer to T2"
8179 casts away constness. */
8180 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
8181 return casts_away_constness (build_pointer_type (t1
),
8182 build_pointer_type (TREE_TYPE (t2
)));
8185 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
8186 /* [expr.const.cast]
8188 Casting from an rvalue of type "pointer to data member of X
8189 of type T1" to the type "pointer to data member of Y of type
8190 T2" casts away constness if a cast from an rvalue of type
8191 "pointer to T1" to the type "pointer to T2" casts away
8193 return casts_away_constness
8194 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
8195 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
8197 /* Casting away constness is only something that makes sense for
8198 pointer or reference types. */
8199 if (TREE_CODE (t1
) != POINTER_TYPE
8200 || TREE_CODE (t2
) != POINTER_TYPE
)
8203 /* Top-level qualifiers don't matter. */
8204 t1
= TYPE_MAIN_VARIANT (t1
);
8205 t2
= TYPE_MAIN_VARIANT (t2
);
8206 casts_away_constness_r (&t1
, &t2
);
8207 if (!can_convert (t2
, t1
))
8213 /* If T is a REFERENCE_TYPE return the type to which T refers.
8214 Otherwise, return T itself. */
8217 non_reference (tree t
)
8219 if (TREE_CODE (t
) == REFERENCE_TYPE
)
8225 /* Return nonzero if REF is an lvalue valid for this language;
8226 otherwise, print an error message and return zero. USE says
8227 how the lvalue is being used and so selects the error message. */
8230 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
8232 cp_lvalue_kind kind
= lvalue_kind (ref
);
8234 if (kind
== clk_none
)
8236 if (complain
& tf_error
)
8240 else if (kind
& (clk_rvalueref
|clk_class
))
8242 if (!(complain
& tf_error
))
8244 if (kind
& clk_class
)
8245 /* Make this a permerror because we used to accept it. */
8246 permerror (input_location
, "using temporary as lvalue");
8248 error ("using xvalue (rvalue reference) as lvalue");